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.r400-tall-171690531700163.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 itstools
Input is StigmergyCommit-PT-06b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690531700163
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 11 17:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 191K Apr 11 17:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 17:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K 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 3.7M 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-06b-LTLCardinality-00
FORMULA_NAME StigmergyCommit-PT-06b-LTLCardinality-01
FORMULA_NAME StigmergyCommit-PT-06b-LTLCardinality-02
FORMULA_NAME StigmergyCommit-PT-06b-LTLCardinality-03
FORMULA_NAME StigmergyCommit-PT-06b-LTLCardinality-04
FORMULA_NAME StigmergyCommit-PT-06b-LTLCardinality-05
FORMULA_NAME StigmergyCommit-PT-06b-LTLCardinality-06
FORMULA_NAME StigmergyCommit-PT-06b-LTLCardinality-07
FORMULA_NAME StigmergyCommit-PT-06b-LTLCardinality-08
FORMULA_NAME StigmergyCommit-PT-06b-LTLCardinality-09
FORMULA_NAME StigmergyCommit-PT-06b-LTLCardinality-10
FORMULA_NAME StigmergyCommit-PT-06b-LTLCardinality-11
FORMULA_NAME StigmergyCommit-PT-06b-LTLCardinality-12
FORMULA_NAME StigmergyCommit-PT-06b-LTLCardinality-13
FORMULA_NAME StigmergyCommit-PT-06b-LTLCardinality-14
FORMULA_NAME StigmergyCommit-PT-06b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716988660149

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-29 13:17:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 13:17:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 13:17:41] [INFO ] Load time of PNML (sax parser for PT used): 352 ms
[2024-05-29 13:17:41] [INFO ] Transformed 2140 places.
[2024-05-29 13:17:41] [INFO ] Transformed 6760 transitions.
[2024-05-29 13:17:41] [INFO ] Found NUPN structural information;
[2024-05-29 13:17:41] [INFO ] Parsed PT model containing 2140 places and 6760 transitions and 67803 arcs in 510 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA StigmergyCommit-PT-06b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 2140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2140/2140 places, 6760/6760 transitions.
Discarding 166 places :
Symmetric choice reduction at 0 with 166 rule applications. Total rules 166 place count 1974 transition count 6594
Iterating global reduction 0 with 166 rules applied. Total rules applied 332 place count 1974 transition count 6594
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 432 place count 1874 transition count 6494
Iterating global reduction 0 with 100 rules applied. Total rules applied 532 place count 1874 transition count 6494
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 594 place count 1812 transition count 6432
Iterating global reduction 0 with 62 rules applied. Total rules applied 656 place count 1812 transition count 6432
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 711 place count 1757 transition count 6377
Iterating global reduction 0 with 55 rules applied. Total rules applied 766 place count 1757 transition count 6377
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 813 place count 1710 transition count 6330
Iterating global reduction 0 with 47 rules applied. Total rules applied 860 place count 1710 transition count 6330
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 907 place count 1663 transition count 6283
Iterating global reduction 0 with 47 rules applied. Total rules applied 954 place count 1663 transition count 6283
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 999 place count 1618 transition count 6238
Iterating global reduction 0 with 45 rules applied. Total rules applied 1044 place count 1618 transition count 6238
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 1089 place count 1573 transition count 6193
Iterating global reduction 0 with 45 rules applied. Total rules applied 1134 place count 1573 transition count 6193
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 1173 place count 1534 transition count 6154
Iterating global reduction 0 with 39 rules applied. Total rules applied 1212 place count 1534 transition count 6154
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1242 place count 1504 transition count 6124
Iterating global reduction 0 with 30 rules applied. Total rules applied 1272 place count 1504 transition count 6124
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 1276 place count 1504 transition count 6120
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 1290 place count 1490 transition count 6106
Iterating global reduction 1 with 14 rules applied. Total rules applied 1304 place count 1490 transition count 6106
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 1317 place count 1477 transition count 6093
Iterating global reduction 1 with 13 rules applied. Total rules applied 1330 place count 1477 transition count 6093
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1336 place count 1471 transition count 6087
Iterating global reduction 1 with 6 rules applied. Total rules applied 1342 place count 1471 transition count 6087
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1348 place count 1465 transition count 6081
Iterating global reduction 1 with 6 rules applied. Total rules applied 1354 place count 1465 transition count 6081
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1360 place count 1459 transition count 6075
Iterating global reduction 1 with 6 rules applied. Total rules applied 1366 place count 1459 transition count 6075
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1372 place count 1453 transition count 6069
Iterating global reduction 1 with 6 rules applied. Total rules applied 1378 place count 1453 transition count 6069
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1384 place count 1447 transition count 6063
Iterating global reduction 1 with 6 rules applied. Total rules applied 1390 place count 1447 transition count 6063
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1396 place count 1441 transition count 6057
Iterating global reduction 1 with 6 rules applied. Total rules applied 1402 place count 1441 transition count 6057
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1408 place count 1435 transition count 6051
Iterating global reduction 1 with 6 rules applied. Total rules applied 1414 place count 1435 transition count 6051
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1420 place count 1429 transition count 6045
Iterating global reduction 1 with 6 rules applied. Total rules applied 1426 place count 1429 transition count 6045
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1432 place count 1423 transition count 6039
Iterating global reduction 1 with 6 rules applied. Total rules applied 1438 place count 1423 transition count 6039
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1444 place count 1417 transition count 6033
Iterating global reduction 1 with 6 rules applied. Total rules applied 1450 place count 1417 transition count 6033
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 1456 place count 1417 transition count 6027
Applied a total of 1456 rules in 2549 ms. Remains 1417 /2140 variables (removed 723) and now considering 6027/6760 (removed 733) transitions.
// Phase 1: matrix 6027 rows 1417 cols
[2024-05-29 13:17:44] [INFO ] Computed 8 invariants in 144 ms
[2024-05-29 13:17:46] [INFO ] Implicit Places using invariants in 1823 ms returned []
[2024-05-29 13:17:46] [INFO ] Invariant cache hit.
[2024-05-29 13:17:50] [INFO ] Implicit Places using invariants and state equation in 3521 ms returned []
Implicit Place search using SMT with State Equation took 5380 ms to find 0 implicit places.
Running 6026 sub problems to find dead transitions.
[2024-05-29 13:17:50] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1416/7444 variables, and 0 constraints, problems are : Problem set: 0 solved, 6026 unsolved in 30137 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1417 constraints, PredecessorRefiner: 6026/1639 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6026 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1416/7444 variables, and 0 constraints, problems are : Problem set: 0 solved, 6026 unsolved in 30085 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1417 constraints, PredecessorRefiner: 4387/1639 constraints, Known Traps: 0/0 constraints]
After SMT, in 119708ms problems are : Problem set: 0 solved, 6026 unsolved
Search for dead transitions found 0 dead transitions in 119812ms
Starting structural reductions in LTL mode, iteration 1 : 1417/2140 places, 6027/6760 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127807 ms. Remains : 1417/2140 places, 6027/6760 transitions.
Support contains 31 out of 1417 places after structural reductions.
[2024-05-29 13:19:50] [INFO ] Flatten gal took : 592 ms
[2024-05-29 13:19:51] [INFO ] Flatten gal took : 381 ms
[2024-05-29 13:19:52] [INFO ] Input system was already deterministic with 6027 transitions.
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 40000 steps (304 resets) in 1930 ms. (20 steps per ms) remains 12/16 properties
BEST_FIRST walk for 40003 steps (46 resets) in 189 ms. (210 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (45 resets) in 167 ms. (238 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (46 resets) in 273 ms. (145 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (45 resets) in 303 ms. (131 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (44 resets) in 119 ms. (333 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (44 resets) in 124 ms. (320 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (46 resets) in 114 ms. (347 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (44 resets) in 115 ms. (344 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (46 resets) in 92 ms. (430 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (46 resets) in 92 ms. (430 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (45 resets) in 124 ms. (320 steps per ms) remains 11/11 properties
[2024-05-29 13:19:53] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1186/1209 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1209 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 208/1417 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1417 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 6027/7444 variables, 1417/1425 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7444 variables, 0/1425 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/7444 variables, 0/1425 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7444/7444 variables, and 1425 constraints, problems are : Problem set: 0 solved, 11 unsolved in 4156 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 1417/1417 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1186/1209 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 13:19:59] [INFO ] Deduced a trap composed of 303 places in 2000 ms of which 62 ms to minimize.
[2024-05-29 13:20:01] [INFO ] Deduced a trap composed of 403 places in 1860 ms of which 8 ms to minimize.
[2024-05-29 13:20:03] [INFO ] Deduced a trap composed of 305 places in 1824 ms of which 16 ms to minimize.
SMT process timed out in 10259ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 23 out of 1417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1417/1417 places, 6027/6027 transitions.
Graph (trivial) has 1375 edges and 1417 vertex of which 105 / 1417 are part of one of the 18 SCC in 9 ms
Free SCC test removed 87 places
Drop transitions (Empty/Sink Transition effects.) removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Graph (complete) has 2585 edges and 1330 vertex of which 1325 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.32 ms
Discarding 5 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 959 transitions
Trivial Post-agglo rules discarded 959 transitions
Performed 959 trivial Post agglomeration. Transition count delta: 959
Iterating post reduction 0 with 964 rules applied. Total rules applied 966 place count 1325 transition count 4947
Reduce places removed 959 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 981 rules applied. Total rules applied 1947 place count 366 transition count 4925
Reduce places removed 9 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 16 rules applied. Total rules applied 1963 place count 357 transition count 4918
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 1970 place count 350 transition count 4918
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 78 Pre rules applied. Total rules applied 1970 place count 350 transition count 4840
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 4 with 156 rules applied. Total rules applied 2126 place count 272 transition count 4840
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 2127 place count 272 transition count 4839
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2128 place count 271 transition count 4838
Iterating global reduction 5 with 1 rules applied. Total rules applied 2129 place count 271 transition count 4838
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 2 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 5 with 108 rules applied. Total rules applied 2237 place count 217 transition count 4784
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 2247 place count 217 transition count 4774
Discarding 36 places :
Symmetric choice reduction at 6 with 36 rule applications. Total rules 2283 place count 181 transition count 684
Iterating global reduction 6 with 36 rules applied. Total rules applied 2319 place count 181 transition count 684
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 2336 place count 181 transition count 667
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 2352 place count 165 transition count 651
Iterating global reduction 7 with 16 rules applied. Total rules applied 2368 place count 165 transition count 651
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 2380 place count 153 transition count 639
Iterating global reduction 7 with 12 rules applied. Total rules applied 2392 place count 153 transition count 639
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 2397 place count 153 transition count 634
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 2419 place count 142 transition count 623
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -8
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 2431 place count 136 transition count 631
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 2434 place count 136 transition count 628
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 2435 place count 136 transition count 627
Free-agglomeration rule applied 46 times.
Iterating global reduction 9 with 46 rules applied. Total rules applied 2481 place count 136 transition count 581
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 9 with 46 rules applied. Total rules applied 2527 place count 90 transition count 581
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 2534 place count 83 transition count 574
Iterating global reduction 10 with 7 rules applied. Total rules applied 2541 place count 83 transition count 574
Drop transitions (Redundant composition of simpler transitions.) removed 135 transitions
Redundant transition composition rules discarded 135 transitions
Iterating global reduction 10 with 135 rules applied. Total rules applied 2676 place count 83 transition count 439
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 2680 place count 81 transition count 454
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 10 with 3 rules applied. Total rules applied 2683 place count 81 transition count 451
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 2686 place count 78 transition count 451
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 11 with 7 rules applied. Total rules applied 2693 place count 78 transition count 451
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 2697 place count 78 transition count 447
Applied a total of 2697 rules in 918 ms. Remains 78 /1417 variables (removed 1339) and now considering 447/6027 (removed 5580) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 918 ms. Remains : 78/1417 places, 447/6027 transitions.
RANDOM walk for 40000 steps (1467 resets) in 1636 ms. (24 steps per ms) remains 4/11 properties
BEST_FIRST walk for 40004 steps (134 resets) in 68 ms. (579 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (259 resets) in 82 ms. (481 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (273 resets) in 89 ms. (444 steps per ms) remains 2/3 properties
// Phase 1: matrix 447 rows 78 cols
[2024-05-29 13:20:05] [INFO ] Computed 8 invariants in 2 ms
[2024-05-29 13:20:05] [INFO ] State equation strengthened by 368 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 35/78 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 447/525 variables, 78/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 368/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/525 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 454 constraints, problems are : Problem set: 0 solved, 2 unsolved in 222 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 78/78 constraints, ReadFeed: 368/368 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 35/78 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 447/525 variables, 78/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 368/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 2/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 13:20:05] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
[2024-05-29 13:20:05] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 2/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 13:20:06] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/525 variables, 1/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/525 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/525 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 525/525 variables, and 459 constraints, problems are : Problem set: 0 solved, 2 unsolved in 739 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 78/78 constraints, ReadFeed: 368/368 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 995ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 36 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=18 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 12 ms.
FORMULA StigmergyCommit-PT-06b-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 288 stabilizing places and 302 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X((G(p1)&&p0)))))))'
Support contains 4 out of 1417 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1417/1417 places, 6027/6027 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1402 transition count 6012
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1402 transition count 6012
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 39 place count 1393 transition count 6003
Iterating global reduction 0 with 9 rules applied. Total rules applied 48 place count 1393 transition count 6003
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 1389 transition count 5999
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 1389 transition count 5999
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 1385 transition count 5995
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 1385 transition count 5995
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 1385 transition count 5994
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 1383 transition count 5992
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 1383 transition count 5992
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 1381 transition count 5990
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 1381 transition count 5990
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 1379 transition count 5988
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 1379 transition count 5988
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 79 place count 1377 transition count 5986
Iterating global reduction 1 with 2 rules applied. Total rules applied 81 place count 1377 transition count 5986
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 1375 transition count 5984
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 1375 transition count 5984
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 86 place count 1375 transition count 5983
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 1374 transition count 5982
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 1374 transition count 5982
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 1373 transition count 5981
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 1373 transition count 5981
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 91 place count 1373 transition count 5980
Applied a total of 91 rules in 782 ms. Remains 1373 /1417 variables (removed 44) and now considering 5980/6027 (removed 47) transitions.
// Phase 1: matrix 5980 rows 1373 cols
[2024-05-29 13:20:07] [INFO ] Computed 8 invariants in 83 ms
[2024-05-29 13:20:08] [INFO ] Implicit Places using invariants in 1492 ms returned []
[2024-05-29 13:20:08] [INFO ] Invariant cache hit.
[2024-05-29 13:20:12] [INFO ] Implicit Places using invariants and state equation in 3294 ms returned []
Implicit Place search using SMT with State Equation took 4791 ms to find 0 implicit places.
Running 5979 sub problems to find dead transitions.
[2024-05-29 13:20:12] [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 1372/7353 variables, and 0 constraints, problems are : Problem set: 0 solved, 5979 unsolved in 30085 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1373 constraints, PredecessorRefiner: 5979/1591 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5979 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1372/7353 variables, and 0 constraints, problems are : Problem set: 0 solved, 5979 unsolved in 30087 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1373 constraints, PredecessorRefiner: 4388/1591 constraints, Known Traps: 0/0 constraints]
After SMT, in 121943ms problems are : Problem set: 0 solved, 5979 unsolved
Search for dead transitions found 0 dead transitions in 122009ms
Starting structural reductions in LTL mode, iteration 1 : 1373/1417 places, 5980/6027 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127609 ms. Remains : 1373/1417 places, 5980/6027 transitions.
Stuttering acceptance computed with spot in 453 ms :[true, (NOT p1), (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)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLCardinality-00
Product exploration explored 100000 steps with 770 reset in 461 ms.
Product exploration explored 100000 steps with 763 reset in 391 ms.
Computed a total of 287 stabilizing places and 301 stable transitions
Computed a total of 287 stabilizing places and 301 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[true, (NOT p1), (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)), (OR (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (309 resets) in 373 ms. (106 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (45 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
[2024-05-29 13:22:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 388/390 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 983/1373 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1373 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7353/7353 variables, and 1381 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1959 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 1373/1373 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 388/390 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 983/1373 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 13:22:20] [INFO ] Deduced a trap composed of 302 places in 2049 ms of which 7 ms to minimize.
[2024-05-29 13:22:22] [INFO ] Deduced a trap composed of 302 places in 1762 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1373 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1373 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 6992ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1373 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1373/1373 places, 5980/5980 transitions.
Graph (trivial) has 1369 edges and 1373 vertex of which 119 / 1373 are part of one of the 21 SCC in 4 ms
Free SCC test removed 98 places
Drop transitions (Empty/Sink Transition effects.) removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Graph (complete) has 2517 edges and 1275 vertex of which 1268 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.18 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 959 transitions
Trivial Post-agglo rules discarded 959 transitions
Performed 959 trivial Post agglomeration. Transition count delta: 959
Iterating post reduction 0 with 966 rules applied. Total rules applied 968 place count 1268 transition count 4881
Reduce places removed 959 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 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 980 rules applied. Total rules applied 1948 place count 309 transition count 4860
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 1956 place count 302 transition count 4859
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1957 place count 301 transition count 4859
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 78 Pre rules applied. Total rules applied 1957 place count 301 transition count 4781
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 4 with 156 rules applied. Total rules applied 2113 place count 223 transition count 4781
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 2114 place count 223 transition count 4780
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 5 with 100 rules applied. Total rules applied 2214 place count 173 transition count 4730
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 2228 place count 173 transition count 4716
Discarding 43 places :
Symmetric choice reduction at 6 with 43 rule applications. Total rules 2271 place count 130 transition count 556
Iterating global reduction 6 with 43 rules applied. Total rules applied 2314 place count 130 transition count 556
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 6 with 22 rules applied. Total rules applied 2336 place count 130 transition count 534
Discarding 21 places :
Symmetric choice reduction at 7 with 21 rule applications. Total rules 2357 place count 109 transition count 513
Iterating global reduction 7 with 21 rules applied. Total rules applied 2378 place count 109 transition count 513
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 2392 place count 95 transition count 499
Iterating global reduction 7 with 14 rules applied. Total rules applied 2406 place count 95 transition count 499
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 2413 place count 95 transition count 492
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 2427 place count 88 transition count 485
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 2433 place count 85 transition count 493
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 2434 place count 85 transition count 492
Free-agglomeration rule applied 35 times.
Iterating global reduction 8 with 35 rules applied. Total rules applied 2469 place count 85 transition count 457
Reduce places removed 35 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.
Iterating post reduction 8 with 100 rules applied. Total rules applied 2569 place count 50 transition count 392
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 2576 place count 43 transition count 385
Iterating global reduction 9 with 7 rules applied. Total rules applied 2583 place count 43 transition count 385
Drop transitions (Redundant composition of simpler transitions.) removed 132 transitions
Redundant transition composition rules discarded 132 transitions
Iterating global reduction 9 with 132 rules applied. Total rules applied 2715 place count 43 transition count 253
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 2719 place count 41 transition count 263
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 2722 place count 41 transition count 260
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 2725 place count 38 transition count 260
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 2732 place count 38 transition count 260
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 2737 place count 38 transition count 255
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 2739 place count 36 transition count 251
Iterating global reduction 10 with 2 rules applied. Total rules applied 2741 place count 36 transition count 251
Applied a total of 2741 rules in 457 ms. Remains 36 /1373 variables (removed 1337) and now considering 251/5980 (removed 5729) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 458 ms. Remains : 36/1373 places, 251/5980 transitions.
RANDOM walk for 1141 steps (0 resets) in 14 ms. (76 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 1 factoid took 167 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[true, (NOT p1), (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)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 258 ms :[true, (NOT p1), (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)), (OR (NOT p0) (NOT p1))]
Support contains 4 out of 1373 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1373/1373 places, 5980/5980 transitions.
Applied a total of 0 rules in 68 ms. Remains 1373 /1373 variables (removed 0) and now considering 5980/5980 (removed 0) transitions.
[2024-05-29 13:22:24] [INFO ] Invariant cache hit.
[2024-05-29 13:22:26] [INFO ] Implicit Places using invariants in 1466 ms returned []
[2024-05-29 13:22:26] [INFO ] Invariant cache hit.
[2024-05-29 13:22:29] [INFO ] Implicit Places using invariants and state equation in 3470 ms returned []
Implicit Place search using SMT with State Equation took 4943 ms to find 0 implicit places.
Running 5979 sub problems to find dead transitions.
[2024-05-29 13:22:29] [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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1372/7353 variables, and 0 constraints, problems are : Problem set: 0 solved, 5979 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1373 constraints, PredecessorRefiner: 5979/1591 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5979 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1372/7353 variables, and 0 constraints, problems are : Problem set: 0 solved, 5979 unsolved in 30097 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1373 constraints, PredecessorRefiner: 4388/1591 constraints, Known Traps: 0/0 constraints]
After SMT, in 126175ms problems are : Problem set: 0 solved, 5979 unsolved
Search for dead transitions found 0 dead transitions in 126236ms
Finished structural reductions in LTL mode , in 1 iterations and 131268 ms. Remains : 1373/1373 places, 5980/5980 transitions.
Computed a total of 287 stabilizing places and 301 stable transitions
Computed a total of 287 stabilizing places and 301 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 123 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[true, (NOT p1), (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)), (OR (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (305 resets) in 310 ms. (128 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (45 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
[2024-05-29 13:24:36] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 388/390 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 983/1373 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1373 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7353/7353 variables, and 1381 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1966 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 1373/1373 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 388/390 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 983/1373 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 13:24:40] [INFO ] Deduced a trap composed of 302 places in 1966 ms of which 6 ms to minimize.
[2024-05-29 13:24:42] [INFO ] Deduced a trap composed of 302 places in 1890 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1373 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1373 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 7015ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1373 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1373/1373 places, 5980/5980 transitions.
Graph (trivial) has 1369 edges and 1373 vertex of which 119 / 1373 are part of one of the 21 SCC in 2 ms
Free SCC test removed 98 places
Drop transitions (Empty/Sink Transition effects.) removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Graph (complete) has 2517 edges and 1275 vertex of which 1268 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.6 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 959 transitions
Trivial Post-agglo rules discarded 959 transitions
Performed 959 trivial Post agglomeration. Transition count delta: 959
Iterating post reduction 0 with 966 rules applied. Total rules applied 968 place count 1268 transition count 4881
Reduce places removed 959 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 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 980 rules applied. Total rules applied 1948 place count 309 transition count 4860
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 1956 place count 302 transition count 4859
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1957 place count 301 transition count 4859
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 78 Pre rules applied. Total rules applied 1957 place count 301 transition count 4781
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 4 with 156 rules applied. Total rules applied 2113 place count 223 transition count 4781
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 2114 place count 223 transition count 4780
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 5 with 100 rules applied. Total rules applied 2214 place count 173 transition count 4730
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 2228 place count 173 transition count 4716
Discarding 43 places :
Symmetric choice reduction at 6 with 43 rule applications. Total rules 2271 place count 130 transition count 556
Iterating global reduction 6 with 43 rules applied. Total rules applied 2314 place count 130 transition count 556
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 6 with 22 rules applied. Total rules applied 2336 place count 130 transition count 534
Discarding 21 places :
Symmetric choice reduction at 7 with 21 rule applications. Total rules 2357 place count 109 transition count 513
Iterating global reduction 7 with 21 rules applied. Total rules applied 2378 place count 109 transition count 513
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 2392 place count 95 transition count 499
Iterating global reduction 7 with 14 rules applied. Total rules applied 2406 place count 95 transition count 499
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 2413 place count 95 transition count 492
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 2427 place count 88 transition count 485
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 2433 place count 85 transition count 493
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 2434 place count 85 transition count 492
Free-agglomeration rule applied 35 times.
Iterating global reduction 8 with 35 rules applied. Total rules applied 2469 place count 85 transition count 457
Reduce places removed 35 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.
Iterating post reduction 8 with 100 rules applied. Total rules applied 2569 place count 50 transition count 392
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 2576 place count 43 transition count 385
Iterating global reduction 9 with 7 rules applied. Total rules applied 2583 place count 43 transition count 385
Drop transitions (Redundant composition of simpler transitions.) removed 132 transitions
Redundant transition composition rules discarded 132 transitions
Iterating global reduction 9 with 132 rules applied. Total rules applied 2715 place count 43 transition count 253
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 2719 place count 41 transition count 263
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 2722 place count 41 transition count 260
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 2725 place count 38 transition count 260
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 2732 place count 38 transition count 260
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 2737 place count 38 transition count 255
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 2739 place count 36 transition count 251
Iterating global reduction 10 with 2 rules applied. Total rules applied 2741 place count 36 transition count 251
Applied a total of 2741 rules in 413 ms. Remains 36 /1373 variables (removed 1337) and now considering 251/5980 (removed 5729) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 413 ms. Remains : 36/1373 places, 251/5980 transitions.
RANDOM walk for 4178 steps (0 resets) in 36 ms. (112 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 1 factoid took 142 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 289 ms :[true, (NOT p1), (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)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 308 ms :[true, (NOT p1), (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)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 304 ms :[true, (NOT p1), (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)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 767 reset in 474 ms.
Product exploration explored 100000 steps with 771 reset in 476 ms.
Applying partial POR strategy [true, true, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 282 ms :[true, (NOT p1), (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)), (OR (NOT p0) (NOT p1))]
Support contains 4 out of 1373 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1373/1373 places, 5980/5980 transitions.
Graph (trivial) has 1365 edges and 1373 vertex of which 119 / 1373 are part of one of the 21 SCC in 2 ms
Free SCC test removed 98 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Performed 942 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 942 rules applied. Total rules applied 943 place count 1275 transition count 5868
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 957 place count 1275 transition count 5854
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 957 place count 1275 transition count 5861
Deduced a syphon composed of 998 places in 3 ms
Iterating global reduction 2 with 56 rules applied. Total rules applied 1013 place count 1275 transition count 5861
Discarding 846 places :
Symmetric choice reduction at 2 with 846 rule applications. Total rules 1859 place count 429 transition count 5015
Deduced a syphon composed of 158 places in 2 ms
Iterating global reduction 2 with 846 rules applied. Total rules applied 2705 place count 429 transition count 5015
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 235 places in 1 ms
Iterating global reduction 2 with 77 rules applied. Total rules applied 2782 place count 429 transition count 5033
Discarding 128 places :
Symmetric choice reduction at 2 with 128 rule applications. Total rules 2910 place count 301 transition count 781
Deduced a syphon composed of 150 places in 1 ms
Iterating global reduction 2 with 128 rules applied. Total rules applied 3038 place count 301 transition count 781
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 3064 place count 301 transition count 755
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 3121 place count 244 transition count 691
Deduced a syphon composed of 114 places in 0 ms
Iterating global reduction 3 with 57 rules applied. Total rules applied 3178 place count 244 transition count 691
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 3199 place count 223 transition count 670
Deduced a syphon composed of 114 places in 0 ms
Iterating global reduction 3 with 21 rules applied. Total rules applied 3220 place count 223 transition count 670
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 3227 place count 223 transition count 663
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 3241 place count 209 transition count 649
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 4 with 14 rules applied. Total rules applied 3255 place count 209 transition count 649
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 110 places in 0 ms
Iterating global reduction 4 with 10 rules applied. Total rules applied 3265 place count 209 transition count 699
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 3282 place count 192 transition count 665
Deduced a syphon composed of 93 places in 1 ms
Iterating global reduction 4 with 17 rules applied. Total rules applied 3299 place count 192 transition count 665
Deduced a syphon composed of 93 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 3313 place count 192 transition count 651
Deduced a syphon composed of 93 places in 0 ms
Applied a total of 3313 rules in 879 ms. Remains 192 /1373 variables (removed 1181) and now considering 651/5980 (removed 5329) transitions.
[2024-05-29 13:24:47] [INFO ] Redundant transitions in 28 ms returned []
Running 643 sub problems to find dead transitions.
[2024-05-29 13:24:47] [INFO ] Flow matrix only has 643 transitions (discarded 8 similar events)
// Phase 1: matrix 643 rows 192 cols
[2024-05-29 13:24:47] [INFO ] Computed 2 invariants in 8 ms
[2024-05-29 13:24:47] [INFO ] State equation strengthened by 162 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (OVERLAPS) 1/192 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 643 unsolved
[2024-05-29 13:24:54] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 2 ms to minimize.
[2024-05-29 13:24:54] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 1 ms to minimize.
[2024-05-29 13:24:54] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 2 ms to minimize.
[2024-05-29 13:24:54] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 2 ms to minimize.
[2024-05-29 13:24:54] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 2 ms to minimize.
[2024-05-29 13:24:55] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 1 ms to minimize.
[2024-05-29 13:24:55] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 2 ms to minimize.
[2024-05-29 13:24:55] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 1 ms to minimize.
[2024-05-29 13:24:55] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 1 ms to minimize.
[2024-05-29 13:24:55] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 1 ms to minimize.
[2024-05-29 13:24:55] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 1 ms to minimize.
[2024-05-29 13:24:55] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 1 ms to minimize.
[2024-05-29 13:24:56] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 1 ms to minimize.
[2024-05-29 13:24:56] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 1 ms to minimize.
[2024-05-29 13:24:57] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 1 ms to minimize.
[2024-05-29 13:24:57] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 1 ms to minimize.
[2024-05-29 13:24:57] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 1 ms to minimize.
[2024-05-29 13:24:57] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 1 ms to minimize.
[2024-05-29 13:24:57] [INFO ] Deduced a trap composed of 22 places in 166 ms of which 1 ms to minimize.
[2024-05-29 13:24:57] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 20/22 constraints. Problems are: Problem set: 10 solved, 633 unsolved
[2024-05-29 13:24:58] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 1 ms to minimize.
[2024-05-29 13:24:58] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 1 ms to minimize.
[2024-05-29 13:24:58] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 1 ms to minimize.
[2024-05-29 13:24:58] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 2 ms to minimize.
[2024-05-29 13:24:59] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 5 ms to minimize.
[2024-05-29 13:24:59] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 2 ms to minimize.
[2024-05-29 13:25:02] [INFO ] Deduced a trap composed of 20 places in 181 ms of which 1 ms to minimize.
[2024-05-29 13:25:02] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 1 ms to minimize.
[2024-05-29 13:25:02] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 2 ms to minimize.
[2024-05-29 13:25:02] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 2 ms to minimize.
[2024-05-29 13:25:02] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 1 ms to minimize.
[2024-05-29 13:25:02] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 12/34 constraints. Problems are: Problem set: 10 solved, 633 unsolved
[2024-05-29 13:25:05] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 2 ms to minimize.
[2024-05-29 13:25:05] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 1 ms to minimize.
[2024-05-29 13:25:06] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 3/37 constraints. Problems are: Problem set: 10 solved, 633 unsolved
[2024-05-29 13:25:08] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 1 ms to minimize.
[2024-05-29 13:25:09] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 2/39 constraints. Problems are: Problem set: 10 solved, 633 unsolved
[2024-05-29 13:25:12] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 1/40 constraints. Problems are: Problem set: 10 solved, 633 unsolved
[2024-05-29 13:25:17] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 2 ms to minimize.
[2024-05-29 13:25:17] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 1 ms to minimize.
[2024-05-29 13:25:17] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 2 ms to minimize.
[2024-05-29 13:25:18] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 1 ms to minimize.
[2024-05-29 13:25:18] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 1 ms to minimize.
[2024-05-29 13:25:18] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 192/835 variables, and 46 constraints, problems are : Problem set: 10 solved, 633 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/192 constraints, ReadFeed: 0/162 constraints, PredecessorRefiner: 643/643 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 10 solved, 633 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 633 unsolved
At refinement iteration 1 (OVERLAPS) 4/192 variables, 2/2 constraints. Problems are: Problem set: 10 solved, 633 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 44/46 constraints. Problems are: Problem set: 10 solved, 633 unsolved
[2024-05-29 13:25:22] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 1 ms to minimize.
[2024-05-29 13:25:25] [INFO ] Deduced a trap composed of 27 places in 187 ms of which 1 ms to minimize.
[2024-05-29 13:25:25] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 25 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 3/49 constraints. Problems are: Problem set: 10 solved, 633 unsolved
[2024-05-29 13:25:28] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 1 ms to minimize.
[2024-05-29 13:25:28] [INFO ] Deduced a trap composed of 21 places in 169 ms of which 1 ms to minimize.
[2024-05-29 13:25:28] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 1 ms to minimize.
[2024-05-29 13:25:29] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 1 ms to minimize.
[2024-05-29 13:25:29] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 1 ms to minimize.
[2024-05-29 13:25:29] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 6/55 constraints. Problems are: Problem set: 10 solved, 633 unsolved
[2024-05-29 13:25:32] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 1/56 constraints. Problems are: Problem set: 10 solved, 633 unsolved
[2024-05-29 13:25:34] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 1 ms to minimize.
[2024-05-29 13:25:34] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 2/58 constraints. Problems are: Problem set: 10 solved, 633 unsolved
[2024-05-29 13:25:37] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 1/59 constraints. Problems are: Problem set: 10 solved, 633 unsolved
[2024-05-29 13:25:41] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 1/60 constraints. Problems are: Problem set: 10 solved, 633 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/60 constraints. Problems are: Problem set: 10 solved, 633 unsolved
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 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 TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 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 TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD649 is UNSAT
At refinement iteration 10 (OVERLAPS) 642/834 variables, 192/252 constraints. Problems are: Problem set: 134 solved, 509 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/834 variables, 161/413 constraints. Problems are: Problem set: 134 solved, 509 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 834/835 variables, and 922 constraints, problems are : Problem set: 134 solved, 509 unsolved in 30724 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 192/192 constraints, ReadFeed: 161/162 constraints, PredecessorRefiner: 509/643 constraints, Known Traps: 58/58 constraints]
After SMT, in 62779ms problems are : Problem set: 134 solved, 509 unsolved
Search for dead transitions found 134 dead transitions in 62786ms
Found 134 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 134 transitions
Dead transitions reduction (with SMT) removed 134 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 192/1373 places, 517/5980 transitions.
Graph (complete) has 740 edges and 192 vertex of which 99 are kept as prefixes of interest. Removing 93 places using SCC suffix rule.2 ms
Discarding 93 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 99 transition count 525
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 22 ms. Remains 99 /192 variables (removed 93) and now considering 525/517 (removed -8) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/1373 places, 525/5980 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63722 ms. Remains : 99/1373 places, 525/5980 transitions.
Built C files in :
/tmp/ltsmin5565505847683032949
[2024-05-29 13:25:50] [INFO ] Built C files in 237ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5565505847683032949
Running compilation step : cd /tmp/ltsmin5565505847683032949;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5565505847683032949;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5565505847683032949;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 4 out of 1373 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1373/1373 places, 5980/5980 transitions.
Applied a total of 0 rules in 79 ms. Remains 1373 /1373 variables (removed 0) and now considering 5980/5980 (removed 0) transitions.
// Phase 1: matrix 5980 rows 1373 cols
[2024-05-29 13:25:53] [INFO ] Computed 8 invariants in 93 ms
[2024-05-29 13:25:55] [INFO ] Implicit Places using invariants in 1586 ms returned []
[2024-05-29 13:25:55] [INFO ] Invariant cache hit.
[2024-05-29 13:25:58] [INFO ] Implicit Places using invariants and state equation in 3647 ms returned []
Implicit Place search using SMT with State Equation took 5237 ms to find 0 implicit places.
Running 5979 sub problems to find dead transitions.
[2024-05-29 13:25:58] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1372/7353 variables, and 0 constraints, problems are : Problem set: 0 solved, 5979 unsolved in 30080 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1373 constraints, PredecessorRefiner: 5979/1591 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5979 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1372/7353 variables, and 0 constraints, problems are : Problem set: 0 solved, 5979 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1373 constraints, PredecessorRefiner: 4388/1591 constraints, Known Traps: 0/0 constraints]
After SMT, in 124886ms problems are : Problem set: 0 solved, 5979 unsolved
Search for dead transitions found 0 dead transitions in 124946ms
Finished structural reductions in LTL mode , in 1 iterations and 130285 ms. Remains : 1373/1373 places, 5980/5980 transitions.
Built C files in :
/tmp/ltsmin11315687724850887735
[2024-05-29 13:28:03] [INFO ] Built C files in 93ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11315687724850887735
Running compilation step : cd /tmp/ltsmin11315687724850887735;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11315687724850887735;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11315687724850887735;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-29 13:28:07] [INFO ] Flatten gal took : 336 ms
[2024-05-29 13:28:08] [INFO ] Flatten gal took : 336 ms
[2024-05-29 13:28:08] [INFO ] Time to serialize gal into /tmp/LTL16169784643791519596.gal : 112 ms
[2024-05-29 13:28:08] [INFO ] Time to serialize properties into /tmp/LTL8616019658490505551.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16169784643791519596.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9347446599835173174.hoa' '-atoms' '/tmp/LTL8616019658490505551.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8616019658490505551.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9347446599835173174.hoa
Detected timeout of ITS tools.
[2024-05-29 13:28:23] [INFO ] Flatten gal took : 357 ms
[2024-05-29 13:28:24] [INFO ] Flatten gal took : 363 ms
[2024-05-29 13:28:24] [INFO ] Time to serialize gal into /tmp/LTL10678881005871967201.gal : 177 ms
[2024-05-29 13:28:24] [INFO ] Time to serialize properties into /tmp/LTL1857768318568617114.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10678881005871967201.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1857768318568617114.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(X(((G("((p1762==0)||(p1929==1))"))&&("((p1762==0)||(p1929==1))"))&&("((p658==0)||(p427==1))"))))))))
Formula 0 simplified : XXXXX(!"((p658==0)||(p427==1))" | F!"((p1762==0)||(p1929==1))")
Detected timeout of ITS tools.
[2024-05-29 13:28:39] [INFO ] Flatten gal took : 328 ms
[2024-05-29 13:28:39] [INFO ] Applying decomposition
[2024-05-29 13:28:40] [INFO ] Flatten gal took : 333 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17315984916064245307.txt' '-o' '/tmp/graph17315984916064245307.bin' '-w' '/tmp/graph17315984916064245307.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17315984916064245307.bin' '-l' '-1' '-v' '-w' '/tmp/graph17315984916064245307.weights' '-q' '0' '-e' '0.001'
[2024-05-29 13:28:41] [INFO ] Decomposing Gal with order
[2024-05-29 13:28:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:28:42] [INFO ] Removed a total of 31736 redundant transitions.
[2024-05-29 13:28:42] [INFO ] Flatten gal took : 850 ms
[2024-05-29 13:28:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 250 ms.
[2024-05-29 13:28:43] [INFO ] Time to serialize gal into /tmp/LTL12348464105627311709.gal : 54 ms
[2024-05-29 13:28:43] [INFO ] Time to serialize properties into /tmp/LTL12333096248474332049.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12348464105627311709.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12333096248474332049.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(X(((G("((i31.i1.i3.u474.p1762==0)||(i40.i1.i1.u531.p1929==1))"))&&("((i31.i1.i3.u474.p1762==0)||(i40.i1.i1.u531.p1929==1))"...216
Formula 0 simplified : XXXXX(!"((i15.i0.i0.u184.p658==0)||(i12.u128.p427==1))" | F!"((i31.i1.i3.u474.p1762==0)||(i40.i1.i1.u531.p1929==1))")
Detected timeout of ITS tools.
Treatment of property StigmergyCommit-PT-06b-LTLCardinality-00 finished in 531503 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 4 out of 1417 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1417/1417 places, 6027/6027 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1403 transition count 6013
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1403 transition count 6013
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 1403 transition count 6012
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 1396 transition count 6005
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 1396 transition count 6005
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 1392 transition count 6001
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 1392 transition count 6001
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 55 place count 1388 transition count 5997
Iterating global reduction 1 with 4 rules applied. Total rules applied 59 place count 1388 transition count 5997
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 1388 transition count 5996
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 1386 transition count 5994
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 1386 transition count 5994
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 1384 transition count 5992
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 1384 transition count 5992
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 1383 transition count 5991
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 1383 transition count 5991
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 1382 transition count 5990
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 1382 transition count 5990
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 1381 transition count 5989
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 1381 transition count 5989
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 75 place count 1381 transition count 5988
Applied a total of 75 rules in 767 ms. Remains 1381 /1417 variables (removed 36) and now considering 5988/6027 (removed 39) transitions.
// Phase 1: matrix 5988 rows 1381 cols
[2024-05-29 13:28:59] [INFO ] Computed 8 invariants in 76 ms
[2024-05-29 13:29:00] [INFO ] Implicit Places using invariants in 1526 ms returned []
[2024-05-29 13:29:00] [INFO ] Invariant cache hit.
[2024-05-29 13:29:04] [INFO ] Implicit Places using invariants and state equation in 3770 ms returned []
Implicit Place search using SMT with State Equation took 5300 ms to find 0 implicit places.
Running 5987 sub problems to find dead transitions.
[2024-05-29 13:29:04] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1380/7369 variables, and 0 constraints, problems are : Problem set: 0 solved, 5987 unsolved in 30086 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1381 constraints, PredecessorRefiner: 5987/1599 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5987 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1380/7369 variables, and 0 constraints, problems are : Problem set: 0 solved, 5987 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1381 constraints, PredecessorRefiner: 4388/1599 constraints, Known Traps: 0/0 constraints]
After SMT, in 130585ms problems are : Problem set: 0 solved, 5987 unsolved
Search for dead transitions found 0 dead transitions in 130635ms
Starting structural reductions in LTL mode, iteration 1 : 1381/1417 places, 5988/6027 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 136715 ms. Remains : 1381/1417 places, 5988/6027 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLCardinality-03
Product exploration explored 100000 steps with 769 reset in 534 ms.
Product exploration explored 100000 steps with 770 reset in 467 ms.
Computed a total of 287 stabilizing places and 301 stable transitions
Computed a total of 287 stabilizing places and 301 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 75 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 (307 resets) in 328 ms. (121 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (46 resets) in 196 ms. (203 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 145813 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 1
Probabilistic random walk after 145813 steps, saw 34223 distinct states, run finished after 3006 ms. (steps per millisecond=48 ) properties seen :0
[2024-05-29 13:31:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 784/788 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/788 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 593/1381 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1381 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7369/7369 variables, and 1389 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1941 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 1381/1381 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 784/788 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 13:31:22] [INFO ] Deduced a trap composed of 295 places in 1152 ms of which 6 ms to minimize.
[2024-05-29 13:31:23] [INFO ] Deduced a trap composed of 295 places in 1034 ms of which 5 ms to minimize.
[2024-05-29 13:31:24] [INFO ] Deduced a trap composed of 295 places in 1083 ms of which 4 ms to minimize.
[2024-05-29 13:31:25] [INFO ] Deduced a trap composed of 295 places in 938 ms of which 4 ms to minimize.
[2024-05-29 13:31:26] [INFO ] Deduced a trap composed of 303 places in 975 ms of which 4 ms to minimize.
SMT process timed out in 7347ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1381/1381 places, 5988/5988 transitions.
Graph (trivial) has 1374 edges and 1381 vertex of which 119 / 1381 are part of one of the 21 SCC in 2 ms
Free SCC test removed 98 places
Drop transitions (Empty/Sink Transition effects.) removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Graph (complete) has 2525 edges and 1283 vertex of which 1276 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.10 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 961 transitions
Trivial Post-agglo rules discarded 961 transitions
Performed 961 trivial Post agglomeration. Transition count delta: 961
Iterating post reduction 0 with 968 rules applied. Total rules applied 970 place count 1276 transition count 4887
Reduce places removed 961 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 981 rules applied. Total rules applied 1951 place count 315 transition count 4867
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 1959 place count 308 transition count 4866
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1960 place count 307 transition count 4866
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 79 Pre rules applied. Total rules applied 1960 place count 307 transition count 4787
Deduced a syphon composed of 79 places in 2 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 4 with 158 rules applied. Total rules applied 2118 place count 228 transition count 4787
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 2119 place count 228 transition count 4786
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 5 with 100 rules applied. Total rules applied 2219 place count 178 transition count 4736
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 2232 place count 178 transition count 4723
Discarding 41 places :
Symmetric choice reduction at 6 with 41 rule applications. Total rules 2273 place count 137 transition count 628
Iterating global reduction 6 with 41 rules applied. Total rules applied 2314 place count 137 transition count 628
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 2335 place count 137 transition count 607
Discarding 20 places :
Symmetric choice reduction at 7 with 20 rule applications. Total rules 2355 place count 117 transition count 587
Iterating global reduction 7 with 20 rules applied. Total rules applied 2375 place count 117 transition count 587
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 2389 place count 103 transition count 573
Iterating global reduction 7 with 14 rules applied. Total rules applied 2403 place count 103 transition count 573
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 2410 place count 103 transition count 566
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 2426 place count 95 transition count 558
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 2432 place count 92 transition count 566
Free-agglomeration rule applied 39 times.
Iterating global reduction 8 with 39 rules applied. Total rules applied 2471 place count 92 transition count 527
Reduce places removed 39 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.
Iterating post reduction 8 with 104 rules applied. Total rules applied 2575 place count 53 transition count 462
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 2582 place count 46 transition count 455
Iterating global reduction 9 with 7 rules applied. Total rules applied 2589 place count 46 transition count 455
Drop transitions (Redundant composition of simpler transitions.) removed 194 transitions
Redundant transition composition rules discarded 194 transitions
Iterating global reduction 9 with 194 rules applied. Total rules applied 2783 place count 46 transition count 261
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 9 with 2 rules applied. Total rules applied 2785 place count 45 transition count 260
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 9 with 4 rules applied. Total rules applied 2789 place count 43 transition count 278
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2791 place count 43 transition count 276
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 2793 place count 41 transition count 276
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 2799 place count 41 transition count 276
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 2803 place count 41 transition count 272
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 2804 place count 40 transition count 270
Iterating global reduction 10 with 1 rules applied. Total rules applied 2805 place count 40 transition count 270
Applied a total of 2805 rules in 422 ms. Remains 40 /1381 variables (removed 1341) and now considering 270/5988 (removed 5718) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 422 ms. Remains : 40/1381 places, 270/5988 transitions.
RANDOM walk for 196 steps (0 resets) in 7 ms. (24 steps per ms) remains 0/1 properties
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-06b-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-06b-LTLCardinality-03 finished in 149142 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 4 out of 1417 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1417/1417 places, 6027/6027 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1404 transition count 6014
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1404 transition count 6014
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 1404 transition count 6013
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 35 place count 1396 transition count 6005
Iterating global reduction 1 with 8 rules applied. Total rules applied 43 place count 1396 transition count 6005
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 46 place count 1393 transition count 6002
Iterating global reduction 1 with 3 rules applied. Total rules applied 49 place count 1393 transition count 6002
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 1390 transition count 5999
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 1390 transition count 5999
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 1390 transition count 5998
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 1389 transition count 5997
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 1389 transition count 5997
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 1388 transition count 5996
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 1388 transition count 5996
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 1387 transition count 5995
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 1387 transition count 5995
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 1386 transition count 5994
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 1386 transition count 5994
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 1385 transition count 5993
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 1385 transition count 5993
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 1385 transition count 5992
Applied a total of 67 rules in 794 ms. Remains 1385 /1417 variables (removed 32) and now considering 5992/6027 (removed 35) transitions.
// Phase 1: matrix 5992 rows 1385 cols
[2024-05-29 13:31:28] [INFO ] Computed 8 invariants in 82 ms
[2024-05-29 13:31:29] [INFO ] Implicit Places using invariants in 1589 ms returned []
[2024-05-29 13:31:29] [INFO ] Invariant cache hit.
[2024-05-29 13:31:33] [INFO ] Implicit Places using invariants and state equation in 3571 ms returned []
Implicit Place search using SMT with State Equation took 5166 ms to find 0 implicit places.
Running 5991 sub problems to find dead transitions.
[2024-05-29 13:31:33] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1384/7377 variables, and 0 constraints, problems are : Problem set: 0 solved, 5991 unsolved in 30080 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1385 constraints, PredecessorRefiner: 5991/1604 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5991 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 timeout
1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1384/7377 variables, and 0 constraints, problems are : Problem set: 0 solved, 5991 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1385 constraints, PredecessorRefiner: 4387/1604 constraints, Known Traps: 0/0 constraints]
After SMT, in 130319ms problems are : Problem set: 0 solved, 5991 unsolved
Search for dead transitions found 0 dead transitions in 130384ms
Starting structural reductions in LTL mode, iteration 1 : 1385/1417 places, 5992/6027 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 136366 ms. Remains : 1385/1417 places, 5992/6027 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLCardinality-04
Product exploration explored 100000 steps with 774 reset in 376 ms.
Product exploration explored 100000 steps with 770 reset in 380 ms.
Computed a total of 287 stabilizing places and 301 stable transitions
Computed a total of 287 stabilizing places and 301 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 74 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 47 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (304 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (45 resets) in 243 ms. (163 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 153694 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 1
Probabilistic random walk after 153694 steps, saw 35674 distinct states, run finished after 3002 ms. (steps per millisecond=51 ) properties seen :0
[2024-05-29 13:33:47] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 595/599 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/599 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 786/1385 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1385 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7377/7377 variables, and 1393 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1632 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 1385/1385 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 595/599 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/599 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 786/1385 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 13:33:51] [INFO ] Deduced a trap composed of 398 places in 1784 ms of which 6 ms to minimize.
[2024-05-29 13:33:53] [INFO ] Deduced a trap composed of 300 places in 1882 ms of which 6 ms to minimize.
[2024-05-29 13:33:55] [INFO ] Deduced a trap composed of 301 places in 1800 ms of which 5 ms to minimize.
SMT process timed out in 7424ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1385 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1385/1385 places, 5992/5992 transitions.
Graph (trivial) has 1377 edges and 1385 vertex of which 119 / 1385 are part of one of the 21 SCC in 4 ms
Free SCC test removed 98 places
Drop transitions (Empty/Sink Transition effects.) removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Graph (complete) has 2533 edges and 1287 vertex of which 1280 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.5 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 963 transitions
Trivial Post-agglo rules discarded 963 transitions
Performed 963 trivial Post agglomeration. Transition count delta: 963
Iterating post reduction 0 with 970 rules applied. Total rules applied 972 place count 1280 transition count 4889
Reduce places removed 963 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 983 rules applied. Total rules applied 1955 place count 317 transition count 4869
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 1963 place count 310 transition count 4868
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1964 place count 309 transition count 4868
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 79 Pre rules applied. Total rules applied 1964 place count 309 transition count 4789
Deduced a syphon composed of 79 places in 2 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 4 with 158 rules applied. Total rules applied 2122 place count 230 transition count 4789
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 2123 place count 230 transition count 4788
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 2225 place count 179 transition count 4737
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 2239 place count 179 transition count 4723
Discarding 42 places :
Symmetric choice reduction at 6 with 42 rule applications. Total rules 2281 place count 137 transition count 627
Iterating global reduction 6 with 42 rules applied. Total rules applied 2323 place count 137 transition count 627
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 2343 place count 137 transition count 607
Discarding 21 places :
Symmetric choice reduction at 7 with 21 rule applications. Total rules 2364 place count 116 transition count 586
Iterating global reduction 7 with 21 rules applied. Total rules applied 2385 place count 116 transition count 586
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 2399 place count 102 transition count 572
Iterating global reduction 7 with 14 rules applied. Total rules applied 2413 place count 102 transition count 572
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 2420 place count 102 transition count 565
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 2434 place count 95 transition count 558
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 2440 place count 92 transition count 566
Free-agglomeration rule applied 39 times.
Iterating global reduction 8 with 39 rules applied. Total rules applied 2479 place count 92 transition count 527
Reduce places removed 39 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 8 with 104 rules applied. Total rules applied 2583 place count 53 transition count 462
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 2590 place count 46 transition count 455
Iterating global reduction 9 with 7 rules applied. Total rules applied 2597 place count 46 transition count 455
Drop transitions (Redundant composition of simpler transitions.) removed 223 transitions
Redundant transition composition rules discarded 223 transitions
Iterating global reduction 9 with 223 rules applied. Total rules applied 2820 place count 46 transition count 232
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 9 with 2 rules applied. Total rules applied 2822 place count 45 transition count 231
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 9 with 4 rules applied. Total rules applied 2826 place count 43 transition count 249
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 2829 place count 43 transition count 246
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 2832 place count 40 transition count 246
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 2837 place count 40 transition count 246
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 2841 place count 40 transition count 242
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 2843 place count 38 transition count 238
Iterating global reduction 10 with 2 rules applied. Total rules applied 2845 place count 38 transition count 238
Applied a total of 2845 rules in 395 ms. Remains 38 /1385 variables (removed 1347) and now considering 238/5992 (removed 5754) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 395 ms. Remains : 38/1385 places, 238/5992 transitions.
RANDOM walk for 2120 steps (0 resets) in 21 ms. (96 steps per ms) remains 0/1 properties
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 108 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-06b-LTLCardinality-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-06b-LTLCardinality-04 finished in 148556 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1417 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1417/1417 places, 6027/6027 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1402 transition count 6012
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1402 transition count 6012
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 1402 transition count 6011
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 40 place count 1393 transition count 6002
Iterating global reduction 1 with 9 rules applied. Total rules applied 49 place count 1393 transition count 6002
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 53 place count 1389 transition count 5998
Iterating global reduction 1 with 4 rules applied. Total rules applied 57 place count 1389 transition count 5998
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 1385 transition count 5994
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 1385 transition count 5994
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 1385 transition count 5993
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 1383 transition count 5991
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 1383 transition count 5991
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 72 place count 1381 transition count 5989
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 1381 transition count 5989
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 76 place count 1379 transition count 5987
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 1379 transition count 5987
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 80 place count 1377 transition count 5985
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 1377 transition count 5985
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 84 place count 1375 transition count 5983
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 1375 transition count 5983
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 1375 transition count 5982
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 1374 transition count 5981
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 1374 transition count 5981
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 90 place count 1373 transition count 5980
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 1373 transition count 5980
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 92 place count 1373 transition count 5979
Applied a total of 92 rules in 954 ms. Remains 1373 /1417 variables (removed 44) and now considering 5979/6027 (removed 48) transitions.
// Phase 1: matrix 5979 rows 1373 cols
[2024-05-29 13:33:56] [INFO ] Computed 8 invariants in 65 ms
[2024-05-29 13:33:58] [INFO ] Implicit Places using invariants in 1561 ms returned []
[2024-05-29 13:33:58] [INFO ] Invariant cache hit.
[2024-05-29 13:34:01] [INFO ] Implicit Places using invariants and state equation in 3590 ms returned []
Implicit Place search using SMT with State Equation took 5154 ms to find 0 implicit places.
Running 5978 sub problems to find dead transitions.
[2024-05-29 13:34:02] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1372/7352 variables, and 0 constraints, problems are : Problem set: 0 solved, 5978 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1373 constraints, PredecessorRefiner: 5978/1590 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5978 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1372/7352 variables, and 0 constraints, problems are : Problem set: 0 solved, 5978 unsolved in 30091 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1373 constraints, PredecessorRefiner: 4388/1590 constraints, Known Traps: 0/0 constraints]
After SMT, in 127772ms problems are : Problem set: 0 solved, 5978 unsolved
Search for dead transitions found 0 dead transitions in 127827ms
Starting structural reductions in LTL mode, iteration 1 : 1373/1417 places, 5979/6027 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 133955 ms. Remains : 1373/1417 places, 5979/6027 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 724 ms.
Product exploration explored 100000 steps with 50000 reset in 682 ms.
Computed a total of 287 stabilizing places and 301 stable transitions
Computed a total of 287 stabilizing places and 301 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 20 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-06b-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-06b-LTLCardinality-05 finished in 135590 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1417 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1417/1417 places, 6027/6027 transitions.
Graph (trivial) has 1414 edges and 1417 vertex of which 115 / 1417 are part of one of the 20 SCC in 1 ms
Free SCC test removed 95 places
Ensure Unique test removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 979 transitions
Trivial Post-agglo rules discarded 979 transitions
Performed 979 trivial Post agglomeration. Transition count delta: 979
Iterating post reduction 0 with 979 rules applied. Total rules applied 980 place count 1321 transition count 4939
Reduce places removed 979 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 1001 rules applied. Total rules applied 1981 place count 342 transition count 4917
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1990 place count 333 transition count 4917
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 75 Pre rules applied. Total rules applied 1990 place count 333 transition count 4842
Deduced a syphon composed of 75 places in 2 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 2140 place count 258 transition count 4842
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 2150 place count 248 transition count 4832
Iterating global reduction 3 with 10 rules applied. Total rules applied 2160 place count 248 transition count 4832
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 2161 place count 247 transition count 4831
Iterating global reduction 3 with 1 rules applied. Total rules applied 2162 place count 247 transition count 4831
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 2163 place count 246 transition count 4830
Iterating global reduction 3 with 1 rules applied. Total rules applied 2164 place count 246 transition count 4830
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2165 place count 246 transition count 4829
Performed 55 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 55 places in 2 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 4 with 110 rules applied. Total rules applied 2275 place count 191 transition count 4769
Discarding 40 places :
Symmetric choice reduction at 4 with 40 rule applications. Total rules 2315 place count 151 transition count 619
Iterating global reduction 4 with 40 rules applied. Total rules applied 2355 place count 151 transition count 619
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 2375 place count 151 transition count 599
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 2395 place count 131 transition count 573
Iterating global reduction 5 with 20 rules applied. Total rules applied 2415 place count 131 transition count 573
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 2435 place count 111 transition count 547
Iterating global reduction 5 with 20 rules applied. Total rules applied 2455 place count 111 transition count 547
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 2462 place count 111 transition count 540
Performed 13 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 2488 place count 98 transition count 546
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2489 place count 97 transition count 530
Iterating global reduction 6 with 1 rules applied. Total rules applied 2490 place count 97 transition count 530
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2491 place count 97 transition count 529
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 2498 place count 97 transition count 522
Applied a total of 2498 rules in 488 ms. Remains 97 /1417 variables (removed 1320) and now considering 522/6027 (removed 5505) transitions.
[2024-05-29 13:36:11] [INFO ] Flow matrix only has 514 transitions (discarded 8 similar events)
// Phase 1: matrix 514 rows 97 cols
[2024-05-29 13:36:11] [INFO ] Computed 2 invariants in 5 ms
[2024-05-29 13:36:12] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-29 13:36:12] [INFO ] Flow matrix only has 514 transitions (discarded 8 similar events)
[2024-05-29 13:36:12] [INFO ] Invariant cache hit.
[2024-05-29 13:36:12] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 13:36:12] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
[2024-05-29 13:36:12] [INFO ] Redundant transitions in 10 ms returned []
Running 505 sub problems to find dead transitions.
[2024-05-29 13:36:12] [INFO ] Flow matrix only has 514 transitions (discarded 8 similar events)
[2024-05-29 13:36:12] [INFO ] Invariant cache hit.
[2024-05-29 13:36:12] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2024-05-29 13:36:16] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 1 ms to minimize.
[2024-05-29 13:36:17] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 1 ms to minimize.
[2024-05-29 13:36:17] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 1 ms to minimize.
[2024-05-29 13:36:17] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 0 ms to minimize.
[2024-05-29 13:36:17] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 1 ms to minimize.
[2024-05-29 13:36:17] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 1 ms to minimize.
[2024-05-29 13:36:17] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 1 ms to minimize.
[2024-05-29 13:36:18] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 1 ms to minimize.
[2024-05-29 13:36:18] [INFO ] Deduced a trap composed of 26 places in 158 ms of which 1 ms to minimize.
[2024-05-29 13:36:19] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 0 ms to minimize.
[2024-05-29 13:36:19] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 3 ms to minimize.
[2024-05-29 13:36:19] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 1 ms to minimize.
[2024-05-29 13:36:19] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 0 ms to minimize.
[2024-05-29 13:36:19] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 1 ms to minimize.
[2024-05-29 13:36:20] [INFO ] Deduced a trap composed of 21 places in 297 ms of which 1 ms to minimize.
[2024-05-29 13:36:20] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 1 ms to minimize.
[2024-05-29 13:36:20] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 1 ms to minimize.
[2024-05-29 13:36:20] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 1 ms to minimize.
[2024-05-29 13:36:20] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 0 ms to minimize.
[2024-05-29 13:36:21] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2024-05-29 13:36:23] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 0 ms to minimize.
[2024-05-29 13:36:23] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 1 ms to minimize.
[2024-05-29 13:36:23] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 0 ms to minimize.
[2024-05-29 13:36:23] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 1 ms to minimize.
[2024-05-29 13:36:24] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 0 ms to minimize.
[2024-05-29 13:36:24] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 1 ms to minimize.
[2024-05-29 13:36:24] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 1 ms to minimize.
[2024-05-29 13:36:24] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 1 ms to minimize.
[2024-05-29 13:36:24] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 1 ms to minimize.
[2024-05-29 13:36:24] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 1 ms to minimize.
[2024-05-29 13:36:25] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 1 ms to minimize.
[2024-05-29 13:36:25] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 1 ms to minimize.
[2024-05-29 13:36:25] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 0 ms to minimize.
[2024-05-29 13:36:25] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 1 ms to minimize.
[2024-05-29 13:36:25] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 1 ms to minimize.
[2024-05-29 13:36:25] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 1 ms to minimize.
[2024-05-29 13:36:25] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 1 ms to minimize.
[2024-05-29 13:36:26] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 0 ms to minimize.
[2024-05-29 13:36:26] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 1 ms to minimize.
[2024-05-29 13:36:26] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2024-05-29 13:36:28] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 1 ms to minimize.
[2024-05-29 13:36:28] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 0 ms to minimize.
[2024-05-29 13:36:28] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 0 ms to minimize.
[2024-05-29 13:36:28] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 1 ms to minimize.
[2024-05-29 13:36:28] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 1 ms to minimize.
[2024-05-29 13:36:28] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 0 ms to minimize.
[2024-05-29 13:36:29] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2024-05-29 13:36:30] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 0 ms to minimize.
[2024-05-29 13:36:30] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2024-05-29 13:36:32] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 1 ms to minimize.
[2024-05-29 13:36:32] [INFO ] Deduced a trap composed of 30 places in 155 ms of which 0 ms to minimize.
[2024-05-29 13:36:32] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 1 ms to minimize.
[2024-05-29 13:36:32] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 1 ms to minimize.
[2024-05-29 13:36:32] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 1 ms to minimize.
[2024-05-29 13:36:32] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 1 ms to minimize.
[2024-05-29 13:36:33] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2024-05-29 13:36:36] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2024-05-29 13:36:38] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 1 ms to minimize.
[2024-05-29 13:36:38] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 1 ms to minimize.
[2024-05-29 13:36:38] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 1 ms to minimize.
[2024-05-29 13:36:38] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/97 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2024-05-29 13:36:41] [INFO ] Deduced a trap composed of 29 places in 167 ms of which 1 ms to minimize.
[2024-05-29 13:36:41] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/97 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/97 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 12 (OVERLAPS) 513/610 variables, 97/162 constraints. Problems are: Problem set: 0 solved, 505 unsolved
SMT process timed out in 32137ms, After SMT, problems are : Problem set: 0 solved, 505 unsolved
Search for dead transitions found 0 dead transitions in 32141ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/1417 places, 522/6027 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33314 ms. Remains : 97/1417 places, 522/6027 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLCardinality-07
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-06b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06b-LTLCardinality-07 finished in 33369 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 1417 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1417/1417 places, 6027/6027 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1401 transition count 6011
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1401 transition count 6011
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 1401 transition count 6010
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 42 place count 1392 transition count 6001
Iterating global reduction 1 with 9 rules applied. Total rules applied 51 place count 1392 transition count 6001
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 55 place count 1388 transition count 5997
Iterating global reduction 1 with 4 rules applied. Total rules applied 59 place count 1388 transition count 5997
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 63 place count 1384 transition count 5993
Iterating global reduction 1 with 4 rules applied. Total rules applied 67 place count 1384 transition count 5993
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 1384 transition count 5992
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 1382 transition count 5990
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 1382 transition count 5990
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 74 place count 1380 transition count 5988
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 1380 transition count 5988
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 1378 transition count 5986
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 1378 transition count 5986
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 1376 transition count 5984
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 1376 transition count 5984
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 86 place count 1374 transition count 5982
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 1374 transition count 5982
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 89 place count 1374 transition count 5981
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 90 place count 1373 transition count 5980
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 1373 transition count 5980
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 92 place count 1372 transition count 5979
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 1372 transition count 5979
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 1372 transition count 5978
Applied a total of 94 rules in 927 ms. Remains 1372 /1417 variables (removed 45) and now considering 5978/6027 (removed 49) transitions.
// Phase 1: matrix 5978 rows 1372 cols
[2024-05-29 13:36:45] [INFO ] Computed 8 invariants in 78 ms
[2024-05-29 13:36:47] [INFO ] Implicit Places using invariants in 1485 ms returned []
[2024-05-29 13:36:47] [INFO ] Invariant cache hit.
[2024-05-29 13:36:50] [INFO ] Implicit Places using invariants and state equation in 3683 ms returned []
Implicit Place search using SMT with State Equation took 5203 ms to find 0 implicit places.
Running 5977 sub problems to find dead transitions.
[2024-05-29 13:36:51] [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 1371/7350 variables, and 0 constraints, problems are : Problem set: 0 solved, 5977 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1372 constraints, PredecessorRefiner: 5977/1589 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5977 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 1371/7350 variables, and 0 constraints, problems are : Problem set: 0 solved, 5977 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1372 constraints, PredecessorRefiner: 4388/1589 constraints, Known Traps: 0/0 constraints]
After SMT, in 125231ms problems are : Problem set: 0 solved, 5977 unsolved
Search for dead transitions found 0 dead transitions in 125291ms
Starting structural reductions in LTL mode, iteration 1 : 1372/1417 places, 5978/6027 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131435 ms. Remains : 1372/1417 places, 5978/6027 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLCardinality-08
Product exploration explored 100000 steps with 33333 reset in 582 ms.
Product exploration explored 100000 steps with 33333 reset in 569 ms.
Computed a total of 287 stabilizing places and 301 stable transitions
Computed a total of 287 stabilizing places and 301 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 19 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-06b-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-06b-LTLCardinality-08 finished in 132829 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 1417 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1417/1417 places, 6027/6027 transitions.
Graph (trivial) has 1416 edges and 1417 vertex of which 122 / 1417 are part of one of the 21 SCC in 1 ms
Free SCC test removed 101 places
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 977 transitions
Trivial Post-agglo rules discarded 977 transitions
Performed 977 trivial Post agglomeration. Transition count delta: 977
Iterating post reduction 0 with 977 rules applied. Total rules applied 978 place count 1315 transition count 4934
Reduce places removed 977 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 996 rules applied. Total rules applied 1974 place count 338 transition count 4915
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1981 place count 331 transition count 4915
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 74 Pre rules applied. Total rules applied 1981 place count 331 transition count 4841
Deduced a syphon composed of 74 places in 2 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 2129 place count 257 transition count 4841
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 2140 place count 246 transition count 4830
Iterating global reduction 3 with 11 rules applied. Total rules applied 2151 place count 246 transition count 4830
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 2153 place count 244 transition count 4828
Iterating global reduction 3 with 2 rules applied. Total rules applied 2155 place count 244 transition count 4828
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2156 place count 244 transition count 4827
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 2157 place count 243 transition count 4826
Iterating global reduction 4 with 1 rules applied. Total rules applied 2158 place count 243 transition count 4826
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2159 place count 243 transition count 4825
Performed 55 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 5 with 110 rules applied. Total rules applied 2269 place count 188 transition count 4766
Discarding 41 places :
Symmetric choice reduction at 5 with 41 rule applications. Total rules 2310 place count 147 transition count 614
Iterating global reduction 5 with 41 rules applied. Total rules applied 2351 place count 147 transition count 614
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 2371 place count 147 transition count 594
Discarding 21 places :
Symmetric choice reduction at 6 with 21 rule applications. Total rules 2392 place count 126 transition count 566
Iterating global reduction 6 with 21 rules applied. Total rules applied 2413 place count 126 transition count 566
Discarding 21 places :
Symmetric choice reduction at 6 with 21 rule applications. Total rules 2434 place count 105 transition count 538
Iterating global reduction 6 with 21 rules applied. Total rules applied 2455 place count 105 transition count 538
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2462 place count 105 transition count 531
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 2484 place count 94 transition count 538
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2485 place count 93 transition count 524
Iterating global reduction 7 with 1 rules applied. Total rules applied 2486 place count 93 transition count 524
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2487 place count 93 transition count 523
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 2494 place count 93 transition count 516
Applied a total of 2494 rules in 455 ms. Remains 93 /1417 variables (removed 1324) and now considering 516/6027 (removed 5511) transitions.
[2024-05-29 13:38:58] [INFO ] Flow matrix only has 508 transitions (discarded 8 similar events)
// Phase 1: matrix 508 rows 93 cols
[2024-05-29 13:38:58] [INFO ] Computed 2 invariants in 11 ms
[2024-05-29 13:38:58] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-29 13:38:58] [INFO ] Flow matrix only has 508 transitions (discarded 8 similar events)
[2024-05-29 13:38:58] [INFO ] Invariant cache hit.
[2024-05-29 13:38:58] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 13:38:58] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
[2024-05-29 13:38:58] [INFO ] Redundant transitions in 9 ms returned []
Running 499 sub problems to find dead transitions.
[2024-05-29 13:38:58] [INFO ] Flow matrix only has 508 transitions (discarded 8 similar events)
[2024-05-29 13:38:58] [INFO ] Invariant cache hit.
[2024-05-29 13:38:58] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-29 13:39:02] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 1 ms to minimize.
[2024-05-29 13:39:02] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 1 ms to minimize.
[2024-05-29 13:39:02] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 2 ms to minimize.
[2024-05-29 13:39:03] [INFO ] Deduced a trap composed of 21 places in 151 ms of which 1 ms to minimize.
[2024-05-29 13:39:03] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 1 ms to minimize.
[2024-05-29 13:39:03] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 1 ms to minimize.
[2024-05-29 13:39:03] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 0 ms to minimize.
[2024-05-29 13:39:03] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 0 ms to minimize.
[2024-05-29 13:39:03] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 1 ms to minimize.
[2024-05-29 13:39:03] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 1 ms to minimize.
[2024-05-29 13:39:04] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 1 ms to minimize.
[2024-05-29 13:39:04] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 1 ms to minimize.
[2024-05-29 13:39:05] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 0 ms to minimize.
[2024-05-29 13:39:05] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 1 ms to minimize.
[2024-05-29 13:39:05] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 1 ms to minimize.
[2024-05-29 13:39:05] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 1 ms to minimize.
[2024-05-29 13:39:06] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 1 ms to minimize.
[2024-05-29 13:39:06] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 0 ms to minimize.
[2024-05-29 13:39:06] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 1 ms to minimize.
[2024-05-29 13:39:06] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-29 13:39:08] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 0 ms to minimize.
[2024-05-29 13:39:08] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 1 ms to minimize.
[2024-05-29 13:39:08] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 1 ms to minimize.
[2024-05-29 13:39:08] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 1 ms to minimize.
[2024-05-29 13:39:09] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 1 ms to minimize.
[2024-05-29 13:39:09] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 1 ms to minimize.
[2024-05-29 13:39:09] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 1 ms to minimize.
[2024-05-29 13:39:09] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 1 ms to minimize.
[2024-05-29 13:39:10] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 1 ms to minimize.
[2024-05-29 13:39:10] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 0 ms to minimize.
[2024-05-29 13:39:10] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 1 ms to minimize.
[2024-05-29 13:39:10] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 0 ms to minimize.
[2024-05-29 13:39:10] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 0 ms to minimize.
[2024-05-29 13:39:10] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 0 ms to minimize.
[2024-05-29 13:39:10] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 0 ms to minimize.
[2024-05-29 13:39:11] [INFO ] Deduced a trap composed of 29 places in 160 ms of which 0 ms to minimize.
[2024-05-29 13:39:11] [INFO ] Deduced a trap composed of 30 places in 155 ms of which 1 ms to minimize.
[2024-05-29 13:39:11] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 0 ms to minimize.
[2024-05-29 13:39:11] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 1 ms to minimize.
[2024-05-29 13:39:11] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-29 13:39:13] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 1 ms to minimize.
[2024-05-29 13:39:13] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 1 ms to minimize.
[2024-05-29 13:39:13] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
[2024-05-29 13:39:13] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 1 ms to minimize.
[2024-05-29 13:39:13] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 1 ms to minimize.
[2024-05-29 13:39:13] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 1 ms to minimize.
[2024-05-29 13:39:14] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 0 ms to minimize.
[2024-05-29 13:39:14] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-29 13:39:15] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 1 ms to minimize.
[2024-05-29 13:39:15] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 1 ms to minimize.
[2024-05-29 13:39:16] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 1 ms to minimize.
[2024-05-29 13:39:16] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 1 ms to minimize.
[2024-05-29 13:39:16] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 1 ms to minimize.
[2024-05-29 13:39:16] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 1 ms to minimize.
[2024-05-29 13:39:16] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 1 ms to minimize.
[2024-05-29 13:39:16] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 1 ms to minimize.
[2024-05-29 13:39:17] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-29 13:39:19] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 1 ms to minimize.
[2024-05-29 13:39:19] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 1 ms to minimize.
[2024-05-29 13:39:19] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 9 (OVERLAPS) 507/600 variables, 93/155 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/600 variables, 126/281 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-29 13:39:29] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 0 ms to minimize.
[2024-05-29 13:39:29] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 0 ms to minimize.
[2024-05-29 13:39:29] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/600 variables, 3/284 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 600/601 variables, and 284 constraints, problems are : Problem set: 0 solved, 499 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 63/63 constraints]
Escalating to Integer solving :Problem set: 0 solved, 499 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-29 13:39:33] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 1 ms to minimize.
[2024-05-29 13:39:33] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-29 13:39:35] [INFO ] Deduced a trap composed of 24 places in 168 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-29 13:39:37] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 1 ms to minimize.
[2024-05-29 13:39:37] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 1 ms to minimize.
[2024-05-29 13:39:37] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-29 13:39:39] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 1 ms to minimize.
[2024-05-29 13:39:39] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-29 13:39:41] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 0 ms to minimize.
[2024-05-29 13:39:41] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 10 (OVERLAPS) 507/600 variables, 93/168 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/600 variables, 126/294 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/600 variables, 499/793 constraints. Problems are: Problem set: 0 solved, 499 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 600/601 variables, and 793 constraints, problems are : Problem set: 0 solved, 499 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 73/73 constraints]
After SMT, in 61811ms problems are : Problem set: 0 solved, 499 unsolved
Search for dead transitions found 0 dead transitions in 61816ms
Starting structural reductions in SI_LTL mode, iteration 1 : 93/1417 places, 516/6027 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62825 ms. Remains : 93/1417 places, 516/6027 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLCardinality-09
Product exploration explored 100000 steps with 8102 reset in 220 ms.
Product exploration explored 100000 steps with 8132 reset in 269 ms.
Computed a total of 4 stabilizing places and 22 stable transitions
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 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 77 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (3225 resets) in 634 ms. (62 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (284 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1861920 steps, run timeout after 3001 ms. (steps per millisecond=620 ) properties seen :0 out of 1
Probabilistic random walk after 1861920 steps, saw 330074 distinct states, run finished after 3001 ms. (steps per millisecond=620 ) properties seen :0
[2024-05-29 13:40:04] [INFO ] Flow matrix only has 508 transitions (discarded 8 similar events)
[2024-05-29 13:40:04] [INFO ] Invariant cache hit.
[2024-05-29 13:40:04] [INFO ] State equation strengthened by 127 read => feed constraints.
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) 90/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 13:40:04] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 1 ms to minimize.
[2024-05-29 13:40:04] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 1 ms to minimize.
[2024-05-29 13:40:04] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 1 ms to minimize.
[2024-05-29 13:40:05] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 1 ms to minimize.
[2024-05-29 13:40:05] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 1 ms to minimize.
[2024-05-29 13:40:05] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 1 ms to minimize.
[2024-05-29 13:40:05] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 0 ms to minimize.
[2024-05-29 13:40:05] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 1 ms to minimize.
[2024-05-29 13:40:05] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 1 ms to minimize.
[2024-05-29 13:40:05] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 1 ms to minimize.
[2024-05-29 13:40:05] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 1 ms to minimize.
[2024-05-29 13:40:06] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 506/597 variables, 91/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/597 variables, 126/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/597 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/600 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/600 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/600 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/601 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/601 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/601 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 601/601 variables, and 234 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1866 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 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) 90/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 13:40:06] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 506/597 variables, 91/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/597 variables, 126/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/597 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/597 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/600 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/600 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/600 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/601 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/601 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/601 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 601/601 variables, and 236 constraints, problems are : Problem set: 0 solved, 1 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 2254ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 516/516 transitions.
Graph (complete) has 610 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 92 transition count 500
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 1 with 14 rules applied. Total rules applied 30 place count 85 transition count 493
Free-agglomeration rule applied 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 67 place count 85 transition count 456
Reduce places removed 38 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 129 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 174 rules applied. Total rules applied 241 place count 47 transition count 320
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 248 place count 40 transition count 320
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 255 place count 33 transition count 313
Iterating global reduction 3 with 7 rules applied. Total rules applied 262 place count 33 transition count 313
Performed 14 Post agglomeration using F-continuation condition with reduction of 131 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 290 place count 19 transition count 168
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 318 place count 19 transition count 140
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 321 place count 16 transition count 137
Iterating global reduction 4 with 3 rules applied. Total rules applied 324 place count 16 transition count 137
Performed 6 Post agglomeration using F-continuation condition with reduction of 114 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 341 place count 5 transition count 17
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 353 place count 5 transition count 5
Renaming transitions due to excessive name length > 1024 char.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 354 place count 5 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 355 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 356 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 356 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 6 with 2 rules applied. Total rules applied 358 place count 2 transition count 2
Applied a total of 358 rules in 35 ms. Remains 2 /93 variables (removed 91) and now considering 2/516 (removed 514) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 2/93 places, 2/516 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 114 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 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 516/516 transitions.
Applied a total of 0 rules in 22 ms. Remains 93 /93 variables (removed 0) and now considering 516/516 (removed 0) transitions.
[2024-05-29 13:40:07] [INFO ] Flow matrix only has 508 transitions (discarded 8 similar events)
[2024-05-29 13:40:07] [INFO ] Invariant cache hit.
[2024-05-29 13:40:07] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-29 13:40:07] [INFO ] Flow matrix only has 508 transitions (discarded 8 similar events)
[2024-05-29 13:40:07] [INFO ] Invariant cache hit.
[2024-05-29 13:40:07] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 13:40:07] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
[2024-05-29 13:40:07] [INFO ] Redundant transitions in 9 ms returned []
Running 499 sub problems to find dead transitions.
[2024-05-29 13:40:07] [INFO ] Flow matrix only has 508 transitions (discarded 8 similar events)
[2024-05-29 13:40:07] [INFO ] Invariant cache hit.
[2024-05-29 13:40:07] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-29 13:40:11] [INFO ] Deduced a trap composed of 20 places in 154 ms of which 1 ms to minimize.
[2024-05-29 13:40:11] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 1 ms to minimize.
[2024-05-29 13:40:11] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 1 ms to minimize.
[2024-05-29 13:40:11] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 1 ms to minimize.
[2024-05-29 13:40:11] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 2 ms to minimize.
[2024-05-29 13:40:12] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 1 ms to minimize.
[2024-05-29 13:40:12] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 1 ms to minimize.
[2024-05-29 13:40:12] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 1 ms to minimize.
[2024-05-29 13:40:12] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 1 ms to minimize.
[2024-05-29 13:40:12] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 1 ms to minimize.
[2024-05-29 13:40:12] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 1 ms to minimize.
[2024-05-29 13:40:13] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 1 ms to minimize.
[2024-05-29 13:40:13] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 1 ms to minimize.
[2024-05-29 13:40:13] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 1 ms to minimize.
[2024-05-29 13:40:14] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 1 ms to minimize.
[2024-05-29 13:40:14] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 1 ms to minimize.
[2024-05-29 13:40:14] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 1 ms to minimize.
[2024-05-29 13:40:14] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 0 ms to minimize.
[2024-05-29 13:40:15] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 1 ms to minimize.
[2024-05-29 13:40:15] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-29 13:40:17] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 1 ms to minimize.
[2024-05-29 13:40:17] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 0 ms to minimize.
[2024-05-29 13:40:17] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 1 ms to minimize.
[2024-05-29 13:40:17] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 1 ms to minimize.
[2024-05-29 13:40:18] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 1 ms to minimize.
[2024-05-29 13:40:18] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 1 ms to minimize.
[2024-05-29 13:40:18] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 1 ms to minimize.
[2024-05-29 13:40:18] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 1 ms to minimize.
[2024-05-29 13:40:18] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 1 ms to minimize.
[2024-05-29 13:40:18] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 1 ms to minimize.
[2024-05-29 13:40:19] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 3 ms to minimize.
[2024-05-29 13:40:19] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 1 ms to minimize.
[2024-05-29 13:40:19] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 1 ms to minimize.
[2024-05-29 13:40:19] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 0 ms to minimize.
[2024-05-29 13:40:19] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 0 ms to minimize.
[2024-05-29 13:40:19] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 1 ms to minimize.
[2024-05-29 13:40:19] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 1 ms to minimize.
[2024-05-29 13:40:20] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 1 ms to minimize.
[2024-05-29 13:40:20] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 1 ms to minimize.
[2024-05-29 13:40:20] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-29 13:40:21] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 0 ms to minimize.
[2024-05-29 13:40:22] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 1 ms to minimize.
[2024-05-29 13:40:22] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 0 ms to minimize.
[2024-05-29 13:40:22] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 1 ms to minimize.
[2024-05-29 13:40:22] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 1 ms to minimize.
[2024-05-29 13:40:22] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 1 ms to minimize.
[2024-05-29 13:40:22] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 1 ms to minimize.
[2024-05-29 13:40:22] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-29 13:40:24] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 1 ms to minimize.
[2024-05-29 13:40:24] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 1 ms to minimize.
[2024-05-29 13:40:24] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 1 ms to minimize.
[2024-05-29 13:40:25] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 1 ms to minimize.
[2024-05-29 13:40:25] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 1 ms to minimize.
[2024-05-29 13:40:25] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 1 ms to minimize.
[2024-05-29 13:40:25] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 0 ms to minimize.
[2024-05-29 13:40:25] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 1 ms to minimize.
[2024-05-29 13:40:25] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-29 13:40:28] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 1 ms to minimize.
[2024-05-29 13:40:28] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 0 ms to minimize.
[2024-05-29 13:40:29] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 9 (OVERLAPS) 507/600 variables, 93/155 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/600 variables, 126/281 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-29 13:40:38] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 1 ms to minimize.
[2024-05-29 13:40:38] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 1 ms to minimize.
[2024-05-29 13:40:38] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 0 ms to minimize.
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 600/601 variables, and 284 constraints, problems are : Problem set: 0 solved, 499 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 63/63 constraints]
Escalating to Integer solving :Problem set: 0 solved, 499 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-29 13:40:42] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 0 ms to minimize.
[2024-05-29 13:40:42] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-29 13:40:44] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-29 13:40:45] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 0 ms to minimize.
[2024-05-29 13:40:45] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 0 ms to minimize.
[2024-05-29 13:40:46] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-29 13:40:47] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 1 ms to minimize.
[2024-05-29 13:40:47] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-29 13:40:49] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 1 ms to minimize.
[2024-05-29 13:40:49] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 10 (OVERLAPS) 507/600 variables, 93/168 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/600 variables, 126/294 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/600 variables, 499/793 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 600/601 variables, and 793 constraints, problems are : Problem set: 0 solved, 499 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 73/73 constraints]
After SMT, in 61647ms problems are : Problem set: 0 solved, 499 unsolved
Search for dead transitions found 0 dead transitions in 61652ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62213 ms. Remains : 93/93 places, 516/516 transitions.
Computed a total of 4 stabilizing places and 22 stable transitions
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 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 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (3246 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (274 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1797143 steps, run timeout after 3001 ms. (steps per millisecond=598 ) properties seen :0 out of 1
Probabilistic random walk after 1797143 steps, saw 317834 distinct states, run finished after 3001 ms. (steps per millisecond=598 ) properties seen :0
[2024-05-29 13:41:12] [INFO ] Flow matrix only has 508 transitions (discarded 8 similar events)
[2024-05-29 13:41:12] [INFO ] Invariant cache hit.
[2024-05-29 13:41:12] [INFO ] State equation strengthened by 127 read => feed constraints.
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) 90/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 13:41:12] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 1 ms to minimize.
[2024-05-29 13:41:12] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 0 ms to minimize.
[2024-05-29 13:41:12] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 1 ms to minimize.
[2024-05-29 13:41:13] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 1 ms to minimize.
[2024-05-29 13:41:13] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 0 ms to minimize.
[2024-05-29 13:41:13] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 1 ms to minimize.
[2024-05-29 13:41:13] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 4 ms to minimize.
[2024-05-29 13:41:13] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 1 ms to minimize.
[2024-05-29 13:41:13] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 1 ms to minimize.
[2024-05-29 13:41:13] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 1 ms to minimize.
[2024-05-29 13:41:14] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 1 ms to minimize.
[2024-05-29 13:41:14] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 506/597 variables, 91/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/597 variables, 126/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/597 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/600 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/600 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/600 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/601 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/601 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/601 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 601/601 variables, and 234 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1960 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 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) 90/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 13:41:14] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 506/597 variables, 91/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/597 variables, 126/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/597 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/597 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/600 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/600 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/600 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/601 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/601 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/601 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 601/601 variables, and 236 constraints, problems are : Problem set: 0 solved, 1 unsolved in 364 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 2343ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 516/516 transitions.
Graph (complete) has 610 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 92 transition count 500
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 1 with 14 rules applied. Total rules applied 30 place count 85 transition count 493
Free-agglomeration rule applied 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 67 place count 85 transition count 456
Reduce places removed 38 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 129 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 174 rules applied. Total rules applied 241 place count 47 transition count 320
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 248 place count 40 transition count 320
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 255 place count 33 transition count 313
Iterating global reduction 3 with 7 rules applied. Total rules applied 262 place count 33 transition count 313
Performed 14 Post agglomeration using F-continuation condition with reduction of 131 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 290 place count 19 transition count 168
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 318 place count 19 transition count 140
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 321 place count 16 transition count 137
Iterating global reduction 4 with 3 rules applied. Total rules applied 324 place count 16 transition count 137
Performed 6 Post agglomeration using F-continuation condition with reduction of 114 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 341 place count 5 transition count 17
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 353 place count 5 transition count 5
Renaming transitions due to excessive name length > 1024 char.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 354 place count 5 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 355 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 356 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 356 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 6 with 2 rules applied. Total rules applied 358 place count 2 transition count 2
Applied a total of 358 rules in 31 ms. Remains 2 /93 variables (removed 91) and now considering 2/516 (removed 514) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 2/93 places, 2/516 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 120 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 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8101 reset in 259 ms.
Product exploration explored 100000 steps with 8137 reset in 253 ms.
Built C files in :
/tmp/ltsmin9665711008654461942
[2024-05-29 13:41:15] [INFO ] Computing symmetric may disable matrix : 516 transitions.
[2024-05-29 13:41:15] [INFO ] Computation of Complete disable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:41:15] [INFO ] Computing symmetric may enable matrix : 516 transitions.
[2024-05-29 13:41:15] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:41:15] [INFO ] Computing Do-Not-Accords matrix : 516 transitions.
[2024-05-29 13:41:15] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:41:15] [INFO ] Built C files in 141ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9665711008654461942
Running compilation step : cd /tmp/ltsmin9665711008654461942;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1928 ms.
Running link step : cd /tmp/ltsmin9665711008654461942;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin9665711008654461942;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1807684756201804222.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 516/516 transitions.
Applied a total of 0 rules in 16 ms. Remains 93 /93 variables (removed 0) and now considering 516/516 (removed 0) transitions.
[2024-05-29 13:41:30] [INFO ] Flow matrix only has 508 transitions (discarded 8 similar events)
[2024-05-29 13:41:30] [INFO ] Invariant cache hit.
[2024-05-29 13:41:30] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-29 13:41:30] [INFO ] Flow matrix only has 508 transitions (discarded 8 similar events)
[2024-05-29 13:41:30] [INFO ] Invariant cache hit.
[2024-05-29 13:41:31] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 13:41:31] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
[2024-05-29 13:41:31] [INFO ] Redundant transitions in 8 ms returned []
Running 499 sub problems to find dead transitions.
[2024-05-29 13:41:31] [INFO ] Flow matrix only has 508 transitions (discarded 8 similar events)
[2024-05-29 13:41:31] [INFO ] Invariant cache hit.
[2024-05-29 13:41:31] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-29 13:41:35] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 1 ms to minimize.
[2024-05-29 13:41:35] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 1 ms to minimize.
[2024-05-29 13:41:35] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 1 ms to minimize.
[2024-05-29 13:41:35] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 1 ms to minimize.
[2024-05-29 13:41:35] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 1 ms to minimize.
[2024-05-29 13:41:35] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 0 ms to minimize.
[2024-05-29 13:41:36] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 1 ms to minimize.
[2024-05-29 13:41:36] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 1 ms to minimize.
[2024-05-29 13:41:36] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 0 ms to minimize.
[2024-05-29 13:41:36] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 0 ms to minimize.
[2024-05-29 13:41:36] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 1 ms to minimize.
[2024-05-29 13:41:37] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 1 ms to minimize.
[2024-05-29 13:41:37] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 1 ms to minimize.
[2024-05-29 13:41:37] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 1 ms to minimize.
[2024-05-29 13:41:38] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 0 ms to minimize.
[2024-05-29 13:41:38] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 0 ms to minimize.
[2024-05-29 13:41:38] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 1 ms to minimize.
[2024-05-29 13:41:38] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 0 ms to minimize.
[2024-05-29 13:41:39] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 1 ms to minimize.
[2024-05-29 13:41:39] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-29 13:41:41] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 1 ms to minimize.
[2024-05-29 13:41:41] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 0 ms to minimize.
[2024-05-29 13:41:41] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 0 ms to minimize.
[2024-05-29 13:41:41] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 1 ms to minimize.
[2024-05-29 13:41:42] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 1 ms to minimize.
[2024-05-29 13:41:42] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 0 ms to minimize.
[2024-05-29 13:41:42] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 1 ms to minimize.
[2024-05-29 13:41:42] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 1 ms to minimize.
[2024-05-29 13:41:42] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 1 ms to minimize.
[2024-05-29 13:41:42] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 1 ms to minimize.
[2024-05-29 13:41:43] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 1 ms to minimize.
[2024-05-29 13:41:43] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 0 ms to minimize.
[2024-05-29 13:41:43] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 1 ms to minimize.
[2024-05-29 13:41:43] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 1 ms to minimize.
[2024-05-29 13:41:43] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 1 ms to minimize.
[2024-05-29 13:41:43] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 1 ms to minimize.
[2024-05-29 13:41:43] [INFO ] Deduced a trap composed of 30 places in 152 ms of which 1 ms to minimize.
[2024-05-29 13:41:44] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 0 ms to minimize.
[2024-05-29 13:41:44] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 1 ms to minimize.
[2024-05-29 13:41:44] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-29 13:41:45] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 1 ms to minimize.
[2024-05-29 13:41:46] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 1 ms to minimize.
[2024-05-29 13:41:46] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 1 ms to minimize.
[2024-05-29 13:41:46] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 1 ms to minimize.
[2024-05-29 13:41:46] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 1 ms to minimize.
[2024-05-29 13:41:46] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 0 ms to minimize.
[2024-05-29 13:41:46] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 0 ms to minimize.
[2024-05-29 13:41:46] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-29 13:41:48] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 1 ms to minimize.
[2024-05-29 13:41:48] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 0 ms to minimize.
[2024-05-29 13:41:48] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 1 ms to minimize.
[2024-05-29 13:41:49] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 1 ms to minimize.
[2024-05-29 13:41:49] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 1 ms to minimize.
[2024-05-29 13:41:49] [INFO ] Deduced a trap composed of 21 places in 154 ms of which 1 ms to minimize.
[2024-05-29 13:41:49] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 1 ms to minimize.
[2024-05-29 13:41:49] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 1 ms to minimize.
[2024-05-29 13:41:49] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-29 13:41:52] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 1 ms to minimize.
[2024-05-29 13:41:52] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 1 ms to minimize.
[2024-05-29 13:41:52] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 9 (OVERLAPS) 507/600 variables, 93/155 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/600 variables, 126/281 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-29 13:42:02] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 1 ms to minimize.
[2024-05-29 13:42:02] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 1 ms to minimize.
[2024-05-29 13:42:02] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/600 variables, 3/284 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 600/601 variables, and 284 constraints, problems are : Problem set: 0 solved, 499 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 63/63 constraints]
Escalating to Integer solving :Problem set: 0 solved, 499 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-29 13:42:05] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 1 ms to minimize.
[2024-05-29 13:42:05] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-29 13:42:07] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-29 13:42:09] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 1 ms to minimize.
[2024-05-29 13:42:09] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 1 ms to minimize.
[2024-05-29 13:42:09] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-29 13:42:11] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 1 ms to minimize.
[2024-05-29 13:42:11] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-29 13:42:13] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 0 ms to minimize.
[2024-05-29 13:42:13] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 10 (OVERLAPS) 507/600 variables, 93/168 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/600 variables, 126/294 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/600 variables, 499/793 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 600/601 variables, and 793 constraints, problems are : Problem set: 0 solved, 499 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 73/73 constraints]
After SMT, in 61438ms problems are : Problem set: 0 solved, 499 unsolved
Search for dead transitions found 0 dead transitions in 61446ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61975 ms. Remains : 93/93 places, 516/516 transitions.
Built C files in :
/tmp/ltsmin16978161484895497554
[2024-05-29 13:42:32] [INFO ] Computing symmetric may disable matrix : 516 transitions.
[2024-05-29 13:42:32] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:42:32] [INFO ] Computing symmetric may enable matrix : 516 transitions.
[2024-05-29 13:42:32] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:42:32] [INFO ] Computing Do-Not-Accords matrix : 516 transitions.
[2024-05-29 13:42:32] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:42:32] [INFO ] Built C files in 101ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16978161484895497554
Running compilation step : cd /tmp/ltsmin16978161484895497554;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1894 ms.
Running link step : cd /tmp/ltsmin16978161484895497554;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin16978161484895497554;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7545155387048944513.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 13:42:48] [INFO ] Flatten gal took : 36 ms
[2024-05-29 13:42:48] [INFO ] Flatten gal took : 36 ms
[2024-05-29 13:42:48] [INFO ] Time to serialize gal into /tmp/LTL1205085197677836992.gal : 5 ms
[2024-05-29 13:42:48] [INFO ] Time to serialize properties into /tmp/LTL14539649909759114564.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1205085197677836992.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14422266913838506435.hoa' '-atoms' '/tmp/LTL14539649909759114564.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14539649909759114564.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14422266913838506435.hoa
Detected timeout of ITS tools.
[2024-05-29 13:43:03] [INFO ] Flatten gal took : 45 ms
[2024-05-29 13:43:03] [INFO ] Flatten gal took : 34 ms
[2024-05-29 13:43:03] [INFO ] Time to serialize gal into /tmp/LTL16963531642775160624.gal : 5 ms
[2024-05-29 13:43:03] [INFO ] Time to serialize properties into /tmp/LTL15203592783321401296.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16963531642775160624.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15203592783321401296.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("(p816!=1)"))))
Formula 0 simplified : FG!"(p816!=1)"
Detected timeout of ITS tools.
[2024-05-29 13:43:18] [INFO ] Flatten gal took : 33 ms
[2024-05-29 13:43:18] [INFO ] Applying decomposition
[2024-05-29 13:43:18] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14715723064242124628.txt' '-o' '/tmp/graph14715723064242124628.bin' '-w' '/tmp/graph14715723064242124628.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14715723064242124628.bin' '-l' '-1' '-v' '-w' '/tmp/graph14715723064242124628.weights' '-q' '0' '-e' '0.001'
[2024-05-29 13:43:18] [INFO ] Decomposing Gal with order
[2024-05-29 13:43:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:43:18] [INFO ] Removed a total of 2738 redundant transitions.
[2024-05-29 13:43:18] [INFO ] Flatten gal took : 51 ms
[2024-05-29 13:43:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 10 ms.
[2024-05-29 13:43:18] [INFO ] Time to serialize gal into /tmp/LTL11166807055595945582.gal : 2 ms
[2024-05-29 13:43:18] [INFO ] Time to serialize properties into /tmp/LTL2258510483470512651.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11166807055595945582.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2258510483470512651.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("(i4.u9.p816!=1)"))))
Formula 0 simplified : FG!"(i4.u9.p816!=1)"
Detected timeout of ITS tools.
Treatment of property StigmergyCommit-PT-06b-LTLCardinality-09 finished in 276239 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(X(F(p0)))||(p1 U G((G(p0)||p2))))))'
Support contains 3 out of 1417 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1417/1417 places, 6027/6027 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1403 transition count 6013
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1403 transition count 6013
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 1403 transition count 6012
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 37 place count 1395 transition count 6004
Iterating global reduction 1 with 8 rules applied. Total rules applied 45 place count 1395 transition count 6004
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 49 place count 1391 transition count 6000
Iterating global reduction 1 with 4 rules applied. Total rules applied 53 place count 1391 transition count 6000
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 57 place count 1387 transition count 5996
Iterating global reduction 1 with 4 rules applied. Total rules applied 61 place count 1387 transition count 5996
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 1387 transition count 5995
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 1385 transition count 5993
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 1385 transition count 5993
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 1383 transition count 5991
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 1383 transition count 5991
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 72 place count 1381 transition count 5989
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 1381 transition count 5989
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 76 place count 1379 transition count 5987
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 1379 transition count 5987
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 80 place count 1377 transition count 5985
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 1377 transition count 5985
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 1377 transition count 5984
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 84 place count 1376 transition count 5983
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 1376 transition count 5983
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 86 place count 1375 transition count 5982
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 1375 transition count 5982
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 88 place count 1375 transition count 5981
Applied a total of 88 rules in 929 ms. Remains 1375 /1417 variables (removed 42) and now considering 5981/6027 (removed 46) transitions.
// Phase 1: matrix 5981 rows 1375 cols
[2024-05-29 13:43:34] [INFO ] Computed 8 invariants in 73 ms
[2024-05-29 13:43:36] [INFO ] Implicit Places using invariants in 1527 ms returned []
[2024-05-29 13:43:36] [INFO ] Invariant cache hit.
[2024-05-29 13:43:39] [INFO ] Implicit Places using invariants and state equation in 3541 ms returned []
Implicit Place search using SMT with State Equation took 5071 ms to find 0 implicit places.
Running 5980 sub problems to find dead transitions.
[2024-05-29 13:43:39] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1374/7356 variables, and 0 constraints, problems are : Problem set: 0 solved, 5980 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1375 constraints, PredecessorRefiner: 5980/1592 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5980 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1374/7356 variables, and 0 constraints, problems are : Problem set: 0 solved, 5980 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1375 constraints, PredecessorRefiner: 4388/1592 constraints, Known Traps: 0/0 constraints]
After SMT, in 120805ms problems are : Problem set: 0 solved, 5980 unsolved
Search for dead transitions found 0 dead transitions in 120869ms
Starting structural reductions in LTL mode, iteration 1 : 1375/1417 places, 5981/6027 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126887 ms. Remains : 1375/1417 places, 5981/6027 transitions.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLCardinality-10
Product exploration explored 100000 steps with 992 reset in 578 ms.
Product exploration explored 100000 steps with 1011 reset in 552 ms.
Computed a total of 288 stabilizing places and 302 stable transitions
Computed a total of 288 stabilizing places and 302 stable transitions
Detected a total of 288/1375 stabilizing places and 302/5981 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 122 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (304 resets) in 419 ms. (95 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (45 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (45 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
[2024-05-29 13:45:42] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 393/396 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 979/1375 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1375 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5981/7356 variables, 1375/1383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7356 variables, 0/1383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/7356 variables, 0/1383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7356/7356 variables, and 1383 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2072 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 1375/1375 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 393/396 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 979/1375 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 13:45:47] [INFO ] Deduced a trap composed of 298 places in 2412 ms of which 9 ms to minimize.
[2024-05-29 13:45:49] [INFO ] Deduced a trap composed of 294 places in 2379 ms of which 8 ms to minimize.
SMT process timed out in 7152ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1375 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1375/1375 places, 5981/5981 transitions.
Graph (trivial) has 1368 edges and 1375 vertex of which 116 / 1375 are part of one of the 20 SCC in 1 ms
Free SCC test removed 96 places
Drop transitions (Empty/Sink Transition effects.) removed 130 transitions
Reduce isomorphic transitions removed 130 transitions.
Graph (complete) has 2521 edges and 1279 vertex of which 1273 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 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 960 transitions
Trivial Post-agglo rules discarded 960 transitions
Performed 960 trivial Post agglomeration. Transition count delta: 960
Iterating post reduction 0 with 966 rules applied. Total rules applied 968 place count 1273 transition count 4885
Reduce places removed 960 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 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 981 rules applied. Total rules applied 1949 place count 313 transition count 4864
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 1958 place count 306 transition count 4862
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1960 place count 304 transition count 4862
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 77 Pre rules applied. Total rules applied 1960 place count 304 transition count 4785
Deduced a syphon composed of 77 places in 2 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 2114 place count 227 transition count 4785
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 2115 place count 227 transition count 4784
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 2217 place count 176 transition count 4733
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 2230 place count 176 transition count 4720
Discarding 42 places :
Symmetric choice reduction at 6 with 42 rule applications. Total rules 2272 place count 134 transition count 561
Iterating global reduction 6 with 42 rules applied. Total rules applied 2314 place count 134 transition count 561
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 6 with 22 rules applied. Total rules applied 2336 place count 134 transition count 539
Discarding 20 places :
Symmetric choice reduction at 7 with 20 rule applications. Total rules 2356 place count 114 transition count 519
Iterating global reduction 7 with 20 rules applied. Total rules applied 2376 place count 114 transition count 519
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 2390 place count 100 transition count 505
Iterating global reduction 7 with 14 rules applied. Total rules applied 2404 place count 100 transition count 505
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 2411 place count 100 transition count 498
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 2427 place count 92 transition count 490
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 2433 place count 89 transition count 498
Free-agglomeration rule applied 36 times.
Iterating global reduction 8 with 36 rules applied. Total rules applied 2469 place count 89 transition count 462
Reduce places removed 36 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.
Iterating post reduction 8 with 101 rules applied. Total rules applied 2570 place count 53 transition count 397
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 2577 place count 46 transition count 390
Iterating global reduction 9 with 7 rules applied. Total rules applied 2584 place count 46 transition count 390
Drop transitions (Redundant composition of simpler transitions.) removed 133 transitions
Redundant transition composition rules discarded 133 transitions
Iterating global reduction 9 with 133 rules applied. Total rules applied 2717 place count 46 transition count 257
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 9 with 2 rules applied. Total rules applied 2719 place count 45 transition count 256
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2721 place count 44 transition count 261
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 2724 place count 44 transition count 258
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 2727 place count 41 transition count 258
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 2734 place count 41 transition count 258
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 2739 place count 41 transition count 253
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 2741 place count 39 transition count 249
Iterating global reduction 10 with 2 rules applied. Total rules applied 2743 place count 39 transition count 249
Applied a total of 2743 rules in 400 ms. Remains 39 /1375 variables (removed 1336) and now considering 249/5981 (removed 5732) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 401 ms. Remains : 39/1375 places, 249/5981 transitions.
RANDOM walk for 2651 steps (0 resets) in 66 ms. (39 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p2 (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (AND (NOT p0) p2)))]
Knowledge based reduction with 6 factoid took 293 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 1375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1375/1375 places, 5981/5981 transitions.
Applied a total of 0 rules in 76 ms. Remains 1375 /1375 variables (removed 0) and now considering 5981/5981 (removed 0) transitions.
[2024-05-29 13:45:50] [INFO ] Invariant cache hit.
[2024-05-29 13:45:52] [INFO ] Implicit Places using invariants in 1458 ms returned []
[2024-05-29 13:45:52] [INFO ] Invariant cache hit.
[2024-05-29 13:45:55] [INFO ] Implicit Places using invariants and state equation in 3545 ms returned []
Implicit Place search using SMT with State Equation took 5004 ms to find 0 implicit places.
Running 5980 sub problems to find dead transitions.
[2024-05-29 13:45:55] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1374/7356 variables, and 0 constraints, problems are : Problem set: 0 solved, 5980 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1375 constraints, PredecessorRefiner: 5980/1592 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5980 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1374/7356 variables, and 0 constraints, problems are : Problem set: 0 solved, 5980 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1375 constraints, PredecessorRefiner: 4388/1592 constraints, Known Traps: 0/0 constraints]
After SMT, in 128188ms problems are : Problem set: 0 solved, 5980 unsolved
Search for dead transitions found 0 dead transitions in 128239ms
Finished structural reductions in LTL mode , in 1 iterations and 133336 ms. Remains : 1375/1375 places, 5981/5981 transitions.
Computed a total of 288 stabilizing places and 302 stable transitions
Computed a total of 288 stabilizing places and 302 stable transitions
Detected a total of 288/1375 stabilizing places and 302/5981 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2), (X (X p2)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 132 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (307 resets) in 749 ms. (53 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (43 resets) in 138 ms. (287 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (47 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
[2024-05-29 13:48:04] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 393/396 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 979/1375 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1375 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5981/7356 variables, 1375/1383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7356 variables, 0/1383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/7356 variables, 0/1383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7356/7356 variables, and 1383 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2060 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 1375/1375 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 393/396 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 979/1375 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 13:48:09] [INFO ] Deduced a trap composed of 298 places in 2482 ms of which 9 ms to minimize.
[2024-05-29 13:48:12] [INFO ] Deduced a trap composed of 294 places in 2454 ms of which 9 ms to minimize.
SMT process timed out in 7273ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1375 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1375/1375 places, 5981/5981 transitions.
Graph (trivial) has 1368 edges and 1375 vertex of which 116 / 1375 are part of one of the 20 SCC in 1 ms
Free SCC test removed 96 places
Drop transitions (Empty/Sink Transition effects.) removed 130 transitions
Reduce isomorphic transitions removed 130 transitions.
Graph (complete) has 2521 edges and 1279 vertex of which 1273 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 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 960 transitions
Trivial Post-agglo rules discarded 960 transitions
Performed 960 trivial Post agglomeration. Transition count delta: 960
Iterating post reduction 0 with 966 rules applied. Total rules applied 968 place count 1273 transition count 4885
Reduce places removed 960 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 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 981 rules applied. Total rules applied 1949 place count 313 transition count 4864
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 1958 place count 306 transition count 4862
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1960 place count 304 transition count 4862
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 77 Pre rules applied. Total rules applied 1960 place count 304 transition count 4785
Deduced a syphon composed of 77 places in 2 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 2114 place count 227 transition count 4785
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 2115 place count 227 transition count 4784
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 2 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 2217 place count 176 transition count 4733
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 2230 place count 176 transition count 4720
Discarding 42 places :
Symmetric choice reduction at 6 with 42 rule applications. Total rules 2272 place count 134 transition count 561
Iterating global reduction 6 with 42 rules applied. Total rules applied 2314 place count 134 transition count 561
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 6 with 22 rules applied. Total rules applied 2336 place count 134 transition count 539
Discarding 20 places :
Symmetric choice reduction at 7 with 20 rule applications. Total rules 2356 place count 114 transition count 519
Iterating global reduction 7 with 20 rules applied. Total rules applied 2376 place count 114 transition count 519
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 2390 place count 100 transition count 505
Iterating global reduction 7 with 14 rules applied. Total rules applied 2404 place count 100 transition count 505
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 2411 place count 100 transition count 498
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 2427 place count 92 transition count 490
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 2433 place count 89 transition count 498
Free-agglomeration rule applied 36 times.
Iterating global reduction 8 with 36 rules applied. Total rules applied 2469 place count 89 transition count 462
Reduce places removed 36 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.
Iterating post reduction 8 with 101 rules applied. Total rules applied 2570 place count 53 transition count 397
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 2577 place count 46 transition count 390
Iterating global reduction 9 with 7 rules applied. Total rules applied 2584 place count 46 transition count 390
Drop transitions (Redundant composition of simpler transitions.) removed 133 transitions
Redundant transition composition rules discarded 133 transitions
Iterating global reduction 9 with 133 rules applied. Total rules applied 2717 place count 46 transition count 257
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 9 with 2 rules applied. Total rules applied 2719 place count 45 transition count 256
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2721 place count 44 transition count 261
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 2724 place count 44 transition count 258
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 2727 place count 41 transition count 258
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 2734 place count 41 transition count 258
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 2739 place count 41 transition count 253
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 2741 place count 39 transition count 249
Iterating global reduction 10 with 2 rules applied. Total rules applied 2743 place count 39 transition count 249
Applied a total of 2743 rules in 433 ms. Remains 39 /1375 variables (removed 1336) and now considering 249/5981 (removed 5732) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 433 ms. Remains : 39/1375 places, 249/5981 transitions.
RANDOM walk for 1626 steps (0 resets) in 42 ms. (37 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p2), (X (X p2)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (AND (NOT p0) p2)))]
Knowledge based reduction with 6 factoid took 255 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1012 reset in 456 ms.
Product exploration explored 100000 steps with 1005 reset in 479 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 1375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1375/1375 places, 5981/5981 transitions.
Graph (trivial) has 1368 edges and 1375 vertex of which 116 / 1375 are part of one of the 20 SCC in 2 ms
Free SCC test removed 96 places
Ensure Unique test removed 110 transitions
Reduce isomorphic transitions removed 110 transitions.
Performed 948 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 948 rules applied. Total rules applied 949 place count 1279 transition count 5871
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 963 place count 1279 transition count 5857
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 963 place count 1279 transition count 5864
Deduced a syphon composed of 1004 places in 3 ms
Iterating global reduction 2 with 56 rules applied. Total rules applied 1019 place count 1279 transition count 5864
Discarding 852 places :
Symmetric choice reduction at 2 with 852 rule applications. Total rules 1871 place count 427 transition count 5012
Deduced a syphon composed of 157 places in 2 ms
Iterating global reduction 2 with 852 rules applied. Total rules applied 2723 place count 427 transition count 5012
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 235 places in 2 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 2801 place count 427 transition count 5033
Discarding 128 places :
Symmetric choice reduction at 2 with 128 rule applications. Total rules 2929 place count 299 transition count 781
Deduced a syphon composed of 150 places in 0 ms
Iterating global reduction 2 with 128 rules applied. Total rules applied 3057 place count 299 transition count 781
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 3086 place count 299 transition count 752
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 3142 place count 243 transition count 690
Deduced a syphon composed of 114 places in 0 ms
Iterating global reduction 3 with 56 rules applied. Total rules applied 3198 place count 243 transition count 690
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 3218 place count 223 transition count 670
Deduced a syphon composed of 114 places in 0 ms
Iterating global reduction 3 with 20 rules applied. Total rules applied 3238 place count 223 transition count 670
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 3245 place count 223 transition count 663
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 3259 place count 209 transition count 649
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 4 with 14 rules applied. Total rules applied 3273 place count 209 transition count 649
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 101 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 3274 place count 209 transition count 650
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 3275 place count 208 transition count 648
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 3276 place count 208 transition count 648
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 110 places in 0 ms
Iterating global reduction 4 with 10 rules applied. Total rules applied 3286 place count 208 transition count 698
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 3302 place count 192 transition count 666
Deduced a syphon composed of 94 places in 0 ms
Iterating global reduction 4 with 16 rules applied. Total rules applied 3318 place count 192 transition count 666
Deduced a syphon composed of 94 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 3332 place count 192 transition count 652
Deduced a syphon composed of 94 places in 0 ms
Applied a total of 3332 rules in 705 ms. Remains 192 /1375 variables (removed 1183) and now considering 652/5981 (removed 5329) transitions.
[2024-05-29 13:48:15] [INFO ] Redundant transitions in 5 ms returned []
Running 644 sub problems to find dead transitions.
[2024-05-29 13:48:15] [INFO ] Flow matrix only has 644 transitions (discarded 8 similar events)
// Phase 1: matrix 644 rows 192 cols
[2024-05-29 13:48:15] [INFO ] Computed 3 invariants in 5 ms
[2024-05-29 13:48:15] [INFO ] State equation strengthened by 162 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (OVERLAPS) 1/192 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-05-29 13:48:21] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 1 ms to minimize.
[2024-05-29 13:48:21] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 1 ms to minimize.
[2024-05-29 13:48:21] [INFO ] Deduced a trap composed of 21 places in 171 ms of which 1 ms to minimize.
[2024-05-29 13:48:22] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 1 ms to minimize.
[2024-05-29 13:48:22] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 1 ms to minimize.
[2024-05-29 13:48:22] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 1 ms to minimize.
[2024-05-29 13:48:22] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 1 ms to minimize.
[2024-05-29 13:48:22] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 1 ms to minimize.
[2024-05-29 13:48:22] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 1 ms to minimize.
[2024-05-29 13:48:23] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 1 ms to minimize.
[2024-05-29 13:48:23] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 2 ms to minimize.
[2024-05-29 13:48:23] [INFO ] Deduced a trap composed of 23 places in 251 ms of which 1 ms to minimize.
[2024-05-29 13:48:23] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 1 ms to minimize.
[2024-05-29 13:48:23] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 1 ms to minimize.
[2024-05-29 13:48:23] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 1 ms to minimize.
[2024-05-29 13:48:24] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 0 ms to minimize.
[2024-05-29 13:48:24] [INFO ] Deduced a trap composed of 22 places in 165 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
[2024-05-29 13:48:24] [INFO ] Deduced a trap composed of 26 places in 186 ms of which 1 ms to minimize.
[2024-05-29 13:48:24] [INFO ] Deduced a trap composed of 26 places in 170 ms of which 1 ms to minimize.
[2024-05-29 13:48:25] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 20/23 constraints. Problems are: Problem set: 50 solved, 594 unsolved
[2024-05-29 13:48:25] [INFO ] Deduced a trap composed of 3 places in 184 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-29 13:48:25] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 1 ms to minimize.
[2024-05-29 13:48:25] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 1 ms to minimize.
[2024-05-29 13:48:25] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 1 ms to minimize.
[2024-05-29 13:48:26] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 1 ms to minimize.
[2024-05-29 13:48:26] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 1 ms to minimize.
[2024-05-29 13:48:26] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 1 ms to minimize.
[2024-05-29 13:48:26] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 1 ms to minimize.
[2024-05-29 13:48:27] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 1 ms to minimize.
[2024-05-29 13:48:27] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 0 ms to minimize.
Problem TDEAD553 is UNSAT
[2024-05-29 13:48:29] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 11/34 constraints. Problems are: Problem set: 52 solved, 592 unsolved
[2024-05-29 13:48:32] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 1 ms to minimize.
[2024-05-29 13:48:32] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 2/36 constraints. Problems are: Problem set: 52 solved, 592 unsolved
[2024-05-29 13:48:35] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 1 ms to minimize.
[2024-05-29 13:48:35] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 1 ms to minimize.
[2024-05-29 13:48:35] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 1 ms to minimize.
[2024-05-29 13:48:35] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 1 ms to minimize.
[2024-05-29 13:48:35] [INFO ] Deduced a trap composed of 20 places in 154 ms of which 1 ms to minimize.
[2024-05-29 13:48:35] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 6/42 constraints. Problems are: Problem set: 52 solved, 592 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/42 constraints. Problems are: Problem set: 52 solved, 592 unsolved
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 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 TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD650 is UNSAT
At refinement iteration 7 (OVERLAPS) 643/835 variables, 192/234 constraints. Problems are: Problem set: 138 solved, 506 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/835 variables, 161/395 constraints. Problems are: Problem set: 138 solved, 506 unsolved
[2024-05-29 13:48:45] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 1 ms to minimize.
[2024-05-29 13:48:45] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 1 ms to minimize.
[2024-05-29 13:48:46] [INFO ] Deduced a trap composed of 22 places in 166 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 835/836 variables, and 398 constraints, problems are : Problem set: 138 solved, 506 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 192/192 constraints, ReadFeed: 161/162 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 138 solved, 506 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 138 solved, 506 unsolved
At refinement iteration 1 (OVERLAPS) 95/192 variables, 3/3 constraints. Problems are: Problem set: 138 solved, 506 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 42/45 constraints. Problems are: Problem set: 138 solved, 506 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/45 constraints. Problems are: Problem set: 138 solved, 506 unsolved
At refinement iteration 4 (OVERLAPS) 643/835 variables, 192/237 constraints. Problems are: Problem set: 138 solved, 506 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/835 variables, 161/398 constraints. Problems are: Problem set: 138 solved, 506 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/835 variables, 506/904 constraints. Problems are: Problem set: 138 solved, 506 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 835/836 variables, and 904 constraints, problems are : Problem set: 138 solved, 506 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 192/192 constraints, ReadFeed: 161/162 constraints, PredecessorRefiner: 506/644 constraints, Known Traps: 42/42 constraints]
After SMT, in 61992ms problems are : Problem set: 138 solved, 506 unsolved
Search for dead transitions found 138 dead transitions in 62000ms
Found 138 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 138 transitions
Dead transitions reduction (with SMT) removed 138 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 192/1375 places, 514/5981 transitions.
Graph (complete) has 740 edges and 192 vertex of which 98 are kept as prefixes of interest. Removing 94 places using SCC suffix rule.2 ms
Discarding 94 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 98 transition count 522
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 2 rules in 39 ms. Remains 98 /192 variables (removed 94) and now considering 522/514 (removed -8) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 98/1375 places, 522/5981 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62758 ms. Remains : 98/1375 places, 522/5981 transitions.
Built C files in :
/tmp/ltsmin17375082939645858429
[2024-05-29 13:49:17] [INFO ] Built C files in 99ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17375082939645858429
Running compilation step : cd /tmp/ltsmin17375082939645858429;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17375082939645858429;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17375082939645858429;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 3 out of 1375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1375/1375 places, 5981/5981 transitions.
Applied a total of 0 rules in 73 ms. Remains 1375 /1375 variables (removed 0) and now considering 5981/5981 (removed 0) transitions.
// Phase 1: matrix 5981 rows 1375 cols
[2024-05-29 13:49:20] [INFO ] Computed 8 invariants in 72 ms
[2024-05-29 13:49:21] [INFO ] Implicit Places using invariants in 1506 ms returned []
[2024-05-29 13:49:21] [INFO ] Invariant cache hit.
[2024-05-29 13:49:25] [INFO ] Implicit Places using invariants and state equation in 3434 ms returned []
Implicit Place search using SMT with State Equation took 4954 ms to find 0 implicit places.
Running 5980 sub problems to find dead transitions.
[2024-05-29 13:49:25] [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 1374/7356 variables, and 0 constraints, problems are : Problem set: 0 solved, 5980 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1375 constraints, PredecessorRefiner: 5980/1592 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5980 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1374/7356 variables, and 0 constraints, problems are : Problem set: 0 solved, 5980 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1375 constraints, PredecessorRefiner: 4388/1592 constraints, Known Traps: 0/0 constraints]
After SMT, in 122372ms problems are : Problem set: 0 solved, 5980 unsolved
Search for dead transitions found 0 dead transitions in 122424ms
Finished structural reductions in LTL mode , in 1 iterations and 127466 ms. Remains : 1375/1375 places, 5981/5981 transitions.
Built C files in :
/tmp/ltsmin6628600694086219801
[2024-05-29 13:51:27] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6628600694086219801
Running compilation step : cd /tmp/ltsmin6628600694086219801;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6628600694086219801;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6628600694086219801;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-29 13:51:31] [INFO ] Flatten gal took : 358 ms
[2024-05-29 13:51:31] [INFO ] Flatten gal took : 366 ms
[2024-05-29 13:51:32] [INFO ] Time to serialize gal into /tmp/LTL7440583034021763694.gal : 80 ms
[2024-05-29 13:51:32] [INFO ] Time to serialize properties into /tmp/LTL4985366196774038516.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7440583034021763694.gal' '-t' 'CGAL' '-hoa' '/tmp/aut877311951923672090.hoa' '-atoms' '/tmp/LTL4985366196774038516.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL4985366196774038516.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut877311951923672090.hoa
Detected timeout of ITS tools.
[2024-05-29 13:51:47] [INFO ] Flatten gal took : 327 ms
[2024-05-29 13:51:47] [INFO ] Flatten gal took : 326 ms
[2024-05-29 13:51:48] [INFO ] Time to serialize gal into /tmp/LTL13995869657807499189.gal : 62 ms
[2024-05-29 13:51:48] [INFO ] Time to serialize properties into /tmp/LTL5849230207585568693.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13995869657807499189.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5849230207585568693.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((X(X(F("(p2071==1)"))))||(("((p147==0)||(p22==1))")U(G(("((p147==0)||(p22==1))")||(G("(p2071==1)"))))))))
Formula 0 simplified : G(XXG!"(p2071==1)" & (!"((p147==0)||(p22==1))" R F(!"((p147==0)||(p22==1))" & F!"(p2071==1)")))
Detected timeout of ITS tools.
[2024-05-29 13:52:03] [INFO ] Flatten gal took : 323 ms
[2024-05-29 13:52:03] [INFO ] Applying decomposition
[2024-05-29 13:52:03] [INFO ] Flatten gal took : 323 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4905205955036865755.txt' '-o' '/tmp/graph4905205955036865755.bin' '-w' '/tmp/graph4905205955036865755.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4905205955036865755.bin' '-l' '-1' '-v' '-w' '/tmp/graph4905205955036865755.weights' '-q' '0' '-e' '0.001'
[2024-05-29 13:52:04] [INFO ] Decomposing Gal with order
[2024-05-29 13:52:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:52:05] [INFO ] Removed a total of 31740 redundant transitions.
[2024-05-29 13:52:05] [INFO ] Flatten gal took : 509 ms
[2024-05-29 13:52:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 159 ms.
[2024-05-29 13:52:06] [INFO ] Time to serialize gal into /tmp/LTL3595098873844951522.gal : 31 ms
[2024-05-29 13:52:06] [INFO ] Time to serialize properties into /tmp/LTL15384037011728052204.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3595098873844951522.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15384037011728052204.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((X(X(F("(i7.i3.i2.u568.p2071==1)"))))||(("((i26.u56.p147==0)||(i4.i0.i0.u6.p22==1))")U(G(("((i26.u56.p147==0)||(i4.i0.i0.u6.p22==...199
Formula 0 simplified : G(XXG!"(i7.i3.i2.u568.p2071==1)" & (!"((i26.u56.p147==0)||(i4.i0.i0.u6.p22==1))" R F(!"((i26.u56.p147==0)||(i4.i0.i0.u6.p22==1))" & ...186
Detected timeout of ITS tools.
Treatment of property StigmergyCommit-PT-06b-LTLCardinality-10 finished in 527250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(X((X(p0) U p1))))))'
Support contains 4 out of 1417 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1417/1417 places, 6027/6027 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1404 transition count 6014
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1404 transition count 6014
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 1404 transition count 6013
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 1397 transition count 6006
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 1397 transition count 6006
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 1394 transition count 6003
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 1394 transition count 6003
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 50 place count 1391 transition count 6000
Iterating global reduction 1 with 3 rules applied. Total rules applied 53 place count 1391 transition count 6000
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 1389 transition count 5998
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 1389 transition count 5998
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 1387 transition count 5996
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 1387 transition count 5996
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 1385 transition count 5994
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 1385 transition count 5994
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 1383 transition count 5992
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 1383 transition count 5992
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 1381 transition count 5990
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 1381 transition count 5990
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 74 place count 1381 transition count 5989
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 1380 transition count 5988
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 1380 transition count 5988
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 1379 transition count 5987
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 1379 transition count 5987
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 79 place count 1379 transition count 5986
Applied a total of 79 rules in 913 ms. Remains 1379 /1417 variables (removed 38) and now considering 5986/6027 (removed 41) transitions.
// Phase 1: matrix 5986 rows 1379 cols
[2024-05-29 13:52:22] [INFO ] Computed 8 invariants in 71 ms
[2024-05-29 13:52:23] [INFO ] Implicit Places using invariants in 1526 ms returned []
[2024-05-29 13:52:23] [INFO ] Invariant cache hit.
[2024-05-29 13:52:26] [INFO ] Implicit Places using invariants and state equation in 3344 ms returned []
Implicit Place search using SMT with State Equation took 4890 ms to find 0 implicit places.
Running 5985 sub problems to find dead transitions.
[2024-05-29 13:52:27] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1378/7365 variables, and 0 constraints, problems are : Problem set: 0 solved, 5985 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1379 constraints, PredecessorRefiner: 5985/1597 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5985 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1378/7365 variables, and 0 constraints, problems are : Problem set: 0 solved, 5985 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1379 constraints, PredecessorRefiner: 4388/1597 constraints, Known Traps: 0/0 constraints]
After SMT, in 119493ms problems are : Problem set: 0 solved, 5985 unsolved
Search for dead transitions found 0 dead transitions in 119544ms
Starting structural reductions in LTL mode, iteration 1 : 1379/1417 places, 5986/6027 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125365 ms. Remains : 1379/1417 places, 5986/6027 transitions.
Stuttering acceptance computed with spot in 242 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLCardinality-12
Product exploration explored 100000 steps with 771 reset in 360 ms.
Product exploration explored 100000 steps with 764 reset in 317 ms.
Computed a total of 287 stabilizing places and 301 stable transitions
Computed a total of 287 stabilizing places and 301 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), true]
RANDOM walk for 40000 steps (308 resets) in 814 ms. (49 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (43 resets) in 183 ms. (217 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (43 resets) in 155 ms. (256 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (43 resets) in 170 ms. (233 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 193534 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :2 out of 3
Probabilistic random walk after 193534 steps, saw 40457 distinct states, run finished after 3002 ms. (steps per millisecond=64 ) properties seen :2
[2024-05-29 13:54:31] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 394/396 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 983/1379 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1379 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7365/7365 variables, and 1387 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1564 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 1379/1379 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 394/396 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 983/1379 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1379 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5986/7365 variables, 1379/1387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7365 variables, 1/1388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 13:54:36] [INFO ] Deduced a trap composed of 298 places in 1938 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/7365 variables, 1/1389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/7365 variables, 0/1389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/7365 variables, 0/1389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7365/7365 variables, and 1389 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4351 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 1379/1379 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 5944ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 124 ms.
Support contains 2 out of 1379 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1379/1379 places, 5986/5986 transitions.
Graph (trivial) has 1375 edges and 1379 vertex of which 119 / 1379 are part of one of the 21 SCC in 1 ms
Free SCC test removed 98 places
Drop transitions (Empty/Sink Transition effects.) removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Graph (complete) has 2523 edges and 1281 vertex of which 1274 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.5 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 962 transitions
Trivial Post-agglo rules discarded 962 transitions
Performed 962 trivial Post agglomeration. Transition count delta: 962
Iterating post reduction 0 with 969 rules applied. Total rules applied 971 place count 1274 transition count 4884
Reduce places removed 962 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 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 983 rules applied. Total rules applied 1954 place count 312 transition count 4863
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1961 place count 305 transition count 4863
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 1961 place count 305 transition count 4785
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 2117 place count 227 transition count 4785
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 2118 place count 227 transition count 4784
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 2119 place count 226 transition count 4783
Iterating global reduction 4 with 1 rules applied. Total rules applied 2120 place count 226 transition count 4783
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 2222 place count 175 transition count 4732
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 2236 place count 175 transition count 4718
Discarding 42 places :
Symmetric choice reduction at 5 with 42 rule applications. Total rules 2278 place count 133 transition count 559
Iterating global reduction 5 with 42 rules applied. Total rules applied 2320 place count 133 transition count 559
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 2341 place count 133 transition count 538
Discarding 21 places :
Symmetric choice reduction at 6 with 21 rule applications. Total rules 2362 place count 112 transition count 517
Iterating global reduction 6 with 21 rules applied. Total rules applied 2383 place count 112 transition count 517
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 2397 place count 98 transition count 503
Iterating global reduction 6 with 14 rules applied. Total rules applied 2411 place count 98 transition count 503
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2418 place count 98 transition count 496
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 7 with 14 rules applied. Total rules applied 2432 place count 91 transition count 489
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 2438 place count 88 transition count 497
Free-agglomeration rule applied 38 times.
Iterating global reduction 7 with 38 rules applied. Total rules applied 2476 place count 88 transition count 459
Reduce places removed 38 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 129 transitions.
Iterating post reduction 7 with 167 rules applied. Total rules applied 2643 place count 50 transition count 330
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 2650 place count 43 transition count 323
Iterating global reduction 8 with 7 rules applied. Total rules applied 2657 place count 43 transition count 323
Drop transitions (Redundant composition of simpler transitions.) removed 134 transitions
Redundant transition composition rules discarded 134 transitions
Iterating global reduction 8 with 134 rules applied. Total rules applied 2791 place count 43 transition count 189
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 2793 place count 42 transition count 188
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 2797 place count 40 transition count 206
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 2800 place count 40 transition count 203
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 2803 place count 37 transition count 203
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 2808 place count 37 transition count 203
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 2812 place count 37 transition count 199
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2813 place count 36 transition count 197
Iterating global reduction 9 with 1 rules applied. Total rules applied 2814 place count 36 transition count 197
Applied a total of 2814 rules in 405 ms. Remains 36 /1379 variables (removed 1343) and now considering 197/5986 (removed 5789) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 405 ms. Remains : 36/1379 places, 197/5986 transitions.
RANDOM walk for 586 steps (0 resets) in 8 ms. (65 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 151 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 243 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), true]
Support contains 4 out of 1379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1379/1379 places, 5986/5986 transitions.
Applied a total of 0 rules in 80 ms. Remains 1379 /1379 variables (removed 0) and now considering 5986/5986 (removed 0) transitions.
[2024-05-29 13:54:38] [INFO ] Invariant cache hit.
[2024-05-29 13:54:39] [INFO ] Implicit Places using invariants in 1496 ms returned []
[2024-05-29 13:54:39] [INFO ] Invariant cache hit.
[2024-05-29 13:54:43] [INFO ] Implicit Places using invariants and state equation in 3421 ms returned []
Implicit Place search using SMT with State Equation took 4920 ms to find 0 implicit places.
Running 5985 sub problems to find dead transitions.
[2024-05-29 13:54:43] [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 1378/7365 variables, and 0 constraints, problems are : Problem set: 0 solved, 5985 unsolved in 30085 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1379 constraints, PredecessorRefiner: 5985/1597 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5985 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 1378/7365 variables, and 0 constraints, problems are : Problem set: 0 solved, 5985 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1379 constraints, PredecessorRefiner: 4388/1597 constraints, Known Traps: 0/0 constraints]
After SMT, in 132589ms problems are : Problem set: 0 solved, 5985 unsolved
Search for dead transitions found 0 dead transitions in 132652ms
Finished structural reductions in LTL mode , in 1 iterations and 137670 ms. Remains : 1379/1379 places, 5986/5986 transitions.
Computed a total of 287 stabilizing places and 301 stable transitions
Computed a total of 287 stabilizing places and 301 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 107 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), true]
RANDOM walk for 40000 steps (307 resets) in 1477 ms. (27 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (45 resets) in 171 ms. (232 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (45 resets) in 207 ms. (192 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (44 resets) in 222 ms. (179 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 193268 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :2 out of 3
Probabilistic random walk after 193268 steps, saw 40399 distinct states, run finished after 3002 ms. (steps per millisecond=64 ) properties seen :2
[2024-05-29 13:57:00] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 394/396 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 983/1379 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1379 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7365/7365 variables, and 1387 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1597 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 1379/1379 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 394/396 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 983/1379 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1379 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5986/7365 variables, 1379/1387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7365 variables, 1/1388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 13:57:05] [INFO ] Deduced a trap composed of 298 places in 1909 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/7365 variables, 1/1389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/7365 variables, 0/1389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/7365 variables, 0/1389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7365/7365 variables, and 1389 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4410 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 1379/1379 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 6036ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 104 ms.
Support contains 2 out of 1379 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1379/1379 places, 5986/5986 transitions.
Graph (trivial) has 1375 edges and 1379 vertex of which 119 / 1379 are part of one of the 21 SCC in 1 ms
Free SCC test removed 98 places
Drop transitions (Empty/Sink Transition effects.) removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Graph (complete) has 2523 edges and 1281 vertex of which 1274 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.5 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 962 transitions
Trivial Post-agglo rules discarded 962 transitions
Performed 962 trivial Post agglomeration. Transition count delta: 962
Iterating post reduction 0 with 969 rules applied. Total rules applied 971 place count 1274 transition count 4884
Reduce places removed 962 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 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 983 rules applied. Total rules applied 1954 place count 312 transition count 4863
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1961 place count 305 transition count 4863
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 1961 place count 305 transition count 4785
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 2117 place count 227 transition count 4785
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 2118 place count 227 transition count 4784
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 2119 place count 226 transition count 4783
Iterating global reduction 4 with 1 rules applied. Total rules applied 2120 place count 226 transition count 4783
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 2222 place count 175 transition count 4732
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 2236 place count 175 transition count 4718
Discarding 42 places :
Symmetric choice reduction at 5 with 42 rule applications. Total rules 2278 place count 133 transition count 559
Iterating global reduction 5 with 42 rules applied. Total rules applied 2320 place count 133 transition count 559
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 2341 place count 133 transition count 538
Discarding 21 places :
Symmetric choice reduction at 6 with 21 rule applications. Total rules 2362 place count 112 transition count 517
Iterating global reduction 6 with 21 rules applied. Total rules applied 2383 place count 112 transition count 517
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 2397 place count 98 transition count 503
Iterating global reduction 6 with 14 rules applied. Total rules applied 2411 place count 98 transition count 503
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2418 place count 98 transition count 496
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 2432 place count 91 transition count 489
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 2438 place count 88 transition count 497
Free-agglomeration rule applied 38 times.
Iterating global reduction 7 with 38 rules applied. Total rules applied 2476 place count 88 transition count 459
Reduce places removed 38 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 129 transitions.
Iterating post reduction 7 with 167 rules applied. Total rules applied 2643 place count 50 transition count 330
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 2650 place count 43 transition count 323
Iterating global reduction 8 with 7 rules applied. Total rules applied 2657 place count 43 transition count 323
Drop transitions (Redundant composition of simpler transitions.) removed 134 transitions
Redundant transition composition rules discarded 134 transitions
Iterating global reduction 8 with 134 rules applied. Total rules applied 2791 place count 43 transition count 189
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 2793 place count 42 transition count 188
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 8 with 4 rules applied. Total rules applied 2797 place count 40 transition count 206
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 2800 place count 40 transition count 203
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 2803 place count 37 transition count 203
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 2808 place count 37 transition count 203
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 2812 place count 37 transition count 199
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2813 place count 36 transition count 197
Iterating global reduction 9 with 1 rules applied. Total rules applied 2814 place count 36 transition count 197
Applied a total of 2814 rules in 387 ms. Remains 36 /1379 variables (removed 1343) and now considering 197/5986 (removed 5789) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 387 ms. Remains : 36/1379 places, 197/5986 transitions.
RANDOM walk for 379 steps (0 resets) in 11 ms. (31 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 180 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 227 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 249 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), true]
Product exploration explored 100000 steps with 778 reset in 485 ms.
Product exploration explored 100000 steps with 770 reset in 511 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 220 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), true]
Support contains 4 out of 1379 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1379/1379 places, 5986/5986 transitions.
Graph (trivial) has 1372 edges and 1379 vertex of which 119 / 1379 are part of one of the 21 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Performed 946 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 946 rules applied. Total rules applied 947 place count 1281 transition count 5874
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 961 place count 1281 transition count 5860
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 961 place count 1281 transition count 5867
Deduced a syphon composed of 1002 places in 4 ms
Iterating global reduction 2 with 56 rules applied. Total rules applied 1017 place count 1281 transition count 5867
Discarding 848 places :
Symmetric choice reduction at 2 with 848 rule applications. Total rules 1865 place count 433 transition count 5019
Deduced a syphon composed of 160 places in 2 ms
Iterating global reduction 2 with 848 rules applied. Total rules applied 2713 place count 433 transition count 5019
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 239 places in 1 ms
Iterating global reduction 2 with 79 rules applied. Total rules applied 2792 place count 433 transition count 5041
Discarding 130 places :
Symmetric choice reduction at 2 with 130 rule applications. Total rules 2922 place count 303 transition count 787
Deduced a syphon composed of 151 places in 0 ms
Iterating global reduction 2 with 130 rules applied. Total rules applied 3052 place count 303 transition count 787
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 3079 place count 303 transition count 760
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 3135 place count 247 transition count 697
Deduced a syphon composed of 116 places in 0 ms
Iterating global reduction 3 with 56 rules applied. Total rules applied 3191 place count 247 transition count 697
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 3212 place count 226 transition count 676
Deduced a syphon composed of 116 places in 0 ms
Iterating global reduction 3 with 21 rules applied. Total rules applied 3233 place count 226 transition count 676
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 3239 place count 226 transition count 670
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 3253 place count 212 transition count 656
Deduced a syphon composed of 102 places in 1 ms
Iterating global reduction 4 with 14 rules applied. Total rules applied 3267 place count 212 transition count 656
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 112 places in 0 ms
Iterating global reduction 4 with 10 rules applied. Total rules applied 3277 place count 212 transition count 706
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 3294 place count 195 transition count 672
Deduced a syphon composed of 95 places in 0 ms
Iterating global reduction 4 with 17 rules applied. Total rules applied 3311 place count 195 transition count 672
Deduced a syphon composed of 95 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 3325 place count 195 transition count 658
Deduced a syphon composed of 95 places in 0 ms
Applied a total of 3325 rules in 736 ms. Remains 195 /1379 variables (removed 1184) and now considering 658/5986 (removed 5328) transitions.
[2024-05-29 13:57:09] [INFO ] Redundant transitions in 4 ms returned []
Running 650 sub problems to find dead transitions.
[2024-05-29 13:57:09] [INFO ] Flow matrix only has 650 transitions (discarded 8 similar events)
// Phase 1: matrix 650 rows 195 cols
[2024-05-29 13:57:09] [INFO ] Computed 2 invariants in 10 ms
[2024-05-29 13:57:09] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 13:57:15] [INFO ] Deduced a trap composed of 5 places in 190 ms of which 1 ms to minimize.
[2024-05-29 13:57:16] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 2 ms to minimize.
[2024-05-29 13:57:16] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 1 ms to minimize.
[2024-05-29 13:57:16] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 1 ms to minimize.
[2024-05-29 13:57:16] [INFO ] Deduced a trap composed of 21 places in 164 ms of which 2 ms to minimize.
[2024-05-29 13:57:16] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 1 ms to minimize.
[2024-05-29 13:57:16] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 0 ms to minimize.
[2024-05-29 13:57:17] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 1 ms to minimize.
[2024-05-29 13:57:17] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 1 ms to minimize.
[2024-05-29 13:57:17] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 1 ms to minimize.
[2024-05-29 13:57:18] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 1 ms to minimize.
[2024-05-29 13:57:18] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 1 ms to minimize.
[2024-05-29 13:57:18] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 1 ms to minimize.
[2024-05-29 13:57:19] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 1 ms to minimize.
[2024-05-29 13:57:19] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 1 ms to minimize.
[2024-05-29 13:57:21] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
Problem TDEAD596 is UNSAT
[2024-05-29 13:57:21] [INFO ] Deduced a trap composed of 21 places in 174 ms of which 1 ms to minimize.
[2024-05-29 13:57:21] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 2 ms to minimize.
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 18/20 constraints. Problems are: Problem set: 10 solved, 640 unsolved
[2024-05-29 13:57:22] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 1 ms to minimize.
[2024-05-29 13:57:22] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 1 ms to minimize.
[2024-05-29 13:57:25] [INFO ] Deduced a trap composed of 20 places in 154 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 3/23 constraints. Problems are: Problem set: 10 solved, 640 unsolved
[2024-05-29 13:57:27] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 1 ms to minimize.
[2024-05-29 13:57:28] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 1 ms to minimize.
[2024-05-29 13:57:28] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 3/26 constraints. Problems are: Problem set: 10 solved, 640 unsolved
[2024-05-29 13:57:31] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 1 ms to minimize.
[2024-05-29 13:57:31] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 1 ms to minimize.
[2024-05-29 13:57:31] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 1 ms to minimize.
[2024-05-29 13:57:31] [INFO ] Deduced a trap composed of 21 places in 151 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 4/30 constraints. Problems are: Problem set: 10 solved, 640 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/30 constraints. Problems are: Problem set: 10 solved, 640 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD656 is UNSAT
At refinement iteration 7 (OVERLAPS) 649/844 variables, 195/225 constraints. Problems are: Problem set: 140 solved, 510 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/844 variables, 126/351 constraints. Problems are: Problem set: 140 solved, 510 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 844/845 variables, and 351 constraints, problems are : Problem set: 140 solved, 510 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 195/195 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 140 solved, 510 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 140 solved, 510 unsolved
At refinement iteration 1 (OVERLAPS) 96/195 variables, 2/2 constraints. Problems are: Problem set: 140 solved, 510 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 28/30 constraints. Problems are: Problem set: 140 solved, 510 unsolved
[2024-05-29 13:57:42] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 1/31 constraints. Problems are: Problem set: 140 solved, 510 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/31 constraints. Problems are: Problem set: 140 solved, 510 unsolved
At refinement iteration 5 (OVERLAPS) 649/844 variables, 195/226 constraints. Problems are: Problem set: 140 solved, 510 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/844 variables, 126/352 constraints. Problems are: Problem set: 140 solved, 510 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/844 variables, 510/862 constraints. Problems are: Problem set: 140 solved, 510 unsolved
[2024-05-29 13:58:07] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 1 ms to minimize.
[2024-05-29 13:58:07] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 1 ms to minimize.
[2024-05-29 13:58:07] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 1 ms to minimize.
[2024-05-29 13:58:07] [INFO ] Deduced a trap composed of 20 places in 160 ms of which 1 ms to minimize.
[2024-05-29 13:58:10] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 1 ms to minimize.
[2024-05-29 13:58:10] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 1 ms to minimize.
[2024-05-29 13:58:10] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 844/845 variables, and 869 constraints, problems are : Problem set: 140 solved, 510 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 195/195 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 510/650 constraints, Known Traps: 36/36 constraints]
After SMT, in 61854ms problems are : Problem set: 140 solved, 510 unsolved
Search for dead transitions found 140 dead transitions in 61863ms
Found 140 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 140 transitions
Dead transitions reduction (with SMT) removed 140 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 195/1379 places, 518/5986 transitions.
Graph (complete) has 743 edges and 195 vertex of which 100 are kept as prefixes of interest. Removing 95 places using SCC suffix rule.1 ms
Discarding 95 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 100 transition count 526
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 18 ms. Remains 100 /195 variables (removed 95) and now considering 526/518 (removed -8) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/1379 places, 526/5986 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62632 ms. Remains : 100/1379 places, 526/5986 transitions.
Built C files in :
/tmp/ltsmin11899527255735669901
[2024-05-29 13:58:11] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11899527255735669901
Running compilation step : cd /tmp/ltsmin11899527255735669901;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11899527255735669901;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11899527255735669901;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 4 out of 1379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1379/1379 places, 5986/5986 transitions.
Applied a total of 0 rules in 82 ms. Remains 1379 /1379 variables (removed 0) and now considering 5986/5986 (removed 0) transitions.
// Phase 1: matrix 5986 rows 1379 cols
[2024-05-29 13:58:14] [INFO ] Computed 8 invariants in 72 ms
[2024-05-29 13:58:16] [INFO ] Implicit Places using invariants in 1499 ms returned []
[2024-05-29 13:58:16] [INFO ] Invariant cache hit.
[2024-05-29 13:58:19] [INFO ] Implicit Places using invariants and state equation in 3464 ms returned []
Implicit Place search using SMT with State Equation took 4965 ms to find 0 implicit places.
Running 5985 sub problems to find dead transitions.
[2024-05-29 13:58:19] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1378/7365 variables, and 0 constraints, problems are : Problem set: 0 solved, 5985 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1379 constraints, PredecessorRefiner: 5985/1597 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5985 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 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)
(s1223 1)
(s1224 1)
(s1225 1)
(s1226 1)
(s1227 1)
(s1228 1)
(s1229 1)
(s1230 1)
(s1231 1)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 1)
(s1238 1)
(s1239 1)
(s1240 1)
(s1241 1)
(s1242 1)
(s1243 1)
(s1244 1)
(s1245 1)
(s1246 1)
(s1247 1)
(s1248 1)
(s1249 1)
(s1250 1)
(s1251 1)
(s1252 1)
(s1253 1)
(s1254 1)
(s1255 1)
(s1256 1)
(s1257 1)
(s1258 1)
(s1259 1)
(s1260 1)
(s1261 1)
(s1262 1)
(s1263 1)
(s1264 1)
(s1265 1)
(s1266 1)
(s1267 1)
(s1268 1)
(s1269 1)
(s1270 1)
(s1271 1)
(s1272 1)
(s1273 1)
(s1274 1)
(s1275 1)
(s1276 1)
(s1277 1)
(s1278 1)
(s1279 1)
(s1280 1)
(s1281 1)
(s1282 1)
(s1283 1)
(s1284 1)
(s1285 1)
(s1286 1)
(s1287 1)
(s1288 1)
(s1289 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1378/7365 variables, and 0 constraints, problems are : Problem set: 0 solved, 5985 unsolved in 30082 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1379 constraints, PredecessorRefiner: 4388/1597 constraints, Known Traps: 0/0 constraints]
After SMT, in 123285ms problems are : Problem set: 0 solved, 5985 unsolved
Search for dead transitions found 0 dead transitions in 123338ms
Finished structural reductions in LTL mode , in 1 iterations and 128401 ms. Remains : 1379/1379 places, 5986/5986 transitions.
Built C files in :
/tmp/ltsmin4931254700518957977
[2024-05-29 14:00:23] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4931254700518957977
Running compilation step : cd /tmp/ltsmin4931254700518957977;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4931254700518957977;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4931254700518957977;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-29 14:00:26] [INFO ] Flatten gal took : 319 ms
[2024-05-29 14:00:26] [INFO ] Flatten gal took : 324 ms
[2024-05-29 14:00:27] [INFO ] Time to serialize gal into /tmp/LTL13532972402185828465.gal : 62 ms
[2024-05-29 14:00:27] [INFO ] Time to serialize properties into /tmp/LTL15635179602074545025.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13532972402185828465.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9021036842629747165.hoa' '-atoms' '/tmp/LTL15635179602074545025.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15635179602074545025.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9021036842629747165.hoa
Detected timeout of ITS tools.
[2024-05-29 14:00:42] [INFO ] Flatten gal took : 318 ms
[2024-05-29 14:00:43] [INFO ] Flatten gal took : 449 ms
[2024-05-29 14:00:43] [INFO ] Time to serialize gal into /tmp/LTL10205564575363582849.gal : 58 ms
[2024-05-29 14:00:43] [INFO ] Time to serialize properties into /tmp/LTL9091703239207702529.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10205564575363582849.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9091703239207702529.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(X(X(X((X("((p1665==0)||(p1457==1))"))U("((p2137==0)||(p1179==1))")))))))
Formula 0 simplified : XXXF(!"((p2137==0)||(p1179==1))" & X(!"((p2137==0)||(p1179==1))" W !"((p1665==0)||(p1457==1))"))
Detected timeout of ITS tools.
[2024-05-29 14:00:58] [INFO ] Flatten gal took : 354 ms
[2024-05-29 14:00:58] [INFO ] Applying decomposition
[2024-05-29 14:00:58] [INFO ] Flatten gal took : 336 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14991703259672220265.txt' '-o' '/tmp/graph14991703259672220265.bin' '-w' '/tmp/graph14991703259672220265.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14991703259672220265.bin' '-l' '-1' '-v' '-w' '/tmp/graph14991703259672220265.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:00:59] [INFO ] Decomposing Gal with order
[2024-05-29 14:00:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:01:00] [INFO ] Removed a total of 31737 redundant transitions.
[2024-05-29 14:01:00] [INFO ] Flatten gal took : 519 ms
[2024-05-29 14:01:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 109 ms.
[2024-05-29 14:01:00] [INFO ] Time to serialize gal into /tmp/LTL4046953897708644951.gal : 26 ms
[2024-05-29 14:01:00] [INFO ] Time to serialize properties into /tmp/LTL4237620592414386826.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4046953897708644951.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4237620592414386826.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(X(X(X((X("((i36.i1.i0.u455.p1665==0)||(i33.i2.i2.u385.p1457==1))"))U("((i26.u571.p2137==0)||(i35.i1.i0.u312.p1179==1))")))))))
Formula 0 simplified : XXXF(!"((i26.u571.p2137==0)||(i35.i1.i0.u312.p1179==1))" & X(!"((i26.u571.p2137==0)||(i35.i1.i0.u312.p1179==1))" W !"((i36.i1.i0.u45...197
Detected timeout of ITS tools.
Treatment of property StigmergyCommit-PT-06b-LTLCardinality-12 finished in 534915 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1417 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1417/1417 places, 6027/6027 transitions.
Graph (trivial) has 1414 edges and 1417 vertex of which 119 / 1417 are part of one of the 20 SCC in 2 ms
Free SCC test removed 99 places
Ensure Unique test removed 113 transitions
Reduce isomorphic transitions removed 113 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 977 transitions
Trivial Post-agglo rules discarded 977 transitions
Performed 977 trivial Post agglomeration. Transition count delta: 977
Iterating post reduction 0 with 977 rules applied. Total rules applied 978 place count 1317 transition count 4936
Reduce places removed 977 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 996 rules applied. Total rules applied 1974 place count 340 transition count 4917
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1981 place count 333 transition count 4917
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 75 Pre rules applied. Total rules applied 1981 place count 333 transition count 4842
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 2131 place count 258 transition count 4842
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 2141 place count 248 transition count 4832
Iterating global reduction 3 with 10 rules applied. Total rules applied 2151 place count 248 transition count 4832
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 2153 place count 246 transition count 4830
Iterating global reduction 3 with 2 rules applied. Total rules applied 2155 place count 246 transition count 4830
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2156 place count 246 transition count 4829
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 2157 place count 245 transition count 4828
Iterating global reduction 4 with 1 rules applied. Total rules applied 2158 place count 245 transition count 4828
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2159 place count 245 transition count 4827
Performed 55 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 5 with 110 rules applied. Total rules applied 2269 place count 190 transition count 4767
Discarding 41 places :
Symmetric choice reduction at 5 with 41 rule applications. Total rules 2310 place count 149 transition count 615
Iterating global reduction 5 with 41 rules applied. Total rules applied 2351 place count 149 transition count 615
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 2371 place count 149 transition count 595
Discarding 20 places :
Symmetric choice reduction at 6 with 20 rule applications. Total rules 2391 place count 129 transition count 568
Iterating global reduction 6 with 20 rules applied. Total rules applied 2411 place count 129 transition count 568
Discarding 20 places :
Symmetric choice reduction at 6 with 20 rule applications. Total rules 2431 place count 109 transition count 541
Iterating global reduction 6 with 20 rules applied. Total rules applied 2451 place count 109 transition count 541
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 2457 place count 109 transition count 535
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 2479 place count 98 transition count 542
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2480 place count 97 transition count 528
Iterating global reduction 7 with 1 rules applied. Total rules applied 2481 place count 97 transition count 528
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2482 place count 97 transition count 527
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 2489 place count 97 transition count 520
Applied a total of 2489 rules in 432 ms. Remains 97 /1417 variables (removed 1320) and now considering 520/6027 (removed 5507) transitions.
[2024-05-29 14:01:16] [INFO ] Flow matrix only has 512 transitions (discarded 8 similar events)
// Phase 1: matrix 512 rows 97 cols
[2024-05-29 14:01:16] [INFO ] Computed 3 invariants in 9 ms
[2024-05-29 14:01:16] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-29 14:01:16] [INFO ] Flow matrix only has 512 transitions (discarded 8 similar events)
[2024-05-29 14:01:16] [INFO ] Invariant cache hit.
[2024-05-29 14:01:16] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 14:01:17] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
[2024-05-29 14:01:17] [INFO ] Redundant transitions in 4 ms returned []
Running 503 sub problems to find dead transitions.
[2024-05-29 14:01:17] [INFO ] Flow matrix only has 512 transitions (discarded 8 similar events)
[2024-05-29 14:01:17] [INFO ] Invariant cache hit.
[2024-05-29 14:01:17] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:01:21] [INFO ] Deduced a trap composed of 24 places in 169 ms of which 1 ms to minimize.
[2024-05-29 14:01:21] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 1 ms to minimize.
[2024-05-29 14:01:21] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 1 ms to minimize.
[2024-05-29 14:01:21] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 1 ms to minimize.
[2024-05-29 14:01:21] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 1 ms to minimize.
[2024-05-29 14:01:21] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 1 ms to minimize.
[2024-05-29 14:01:22] [INFO ] Deduced a trap composed of 20 places in 161 ms of which 0 ms to minimize.
[2024-05-29 14:01:22] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 0 ms to minimize.
[2024-05-29 14:01:23] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 1 ms to minimize.
[2024-05-29 14:01:23] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 1 ms to minimize.
[2024-05-29 14:01:23] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 0 ms to minimize.
[2024-05-29 14:01:23] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 0 ms to minimize.
[2024-05-29 14:01:23] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 0 ms to minimize.
[2024-05-29 14:01:24] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 0 ms to minimize.
[2024-05-29 14:01:24] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 0 ms to minimize.
[2024-05-29 14:01:24] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 1 ms to minimize.
[2024-05-29 14:01:24] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 0 ms to minimize.
[2024-05-29 14:01:25] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 1 ms to minimize.
[2024-05-29 14:01:25] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 1 ms to minimize.
[2024-05-29 14:01:25] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:01:26] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 0 ms to minimize.
[2024-05-29 14:01:26] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 0 ms to minimize.
[2024-05-29 14:01:26] [INFO ] Deduced a trap composed of 25 places in 179 ms of which 1 ms to minimize.
[2024-05-29 14:01:26] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 0 ms to minimize.
[2024-05-29 14:01:28] [INFO ] Deduced a trap composed of 20 places in 248 ms of which 1 ms to minimize.
[2024-05-29 14:01:28] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 1 ms to minimize.
[2024-05-29 14:01:29] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 1 ms to minimize.
[2024-05-29 14:01:29] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 1 ms to minimize.
[2024-05-29 14:01:29] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 1 ms to minimize.
[2024-05-29 14:01:29] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 1 ms to minimize.
[2024-05-29 14:01:29] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 1 ms to minimize.
[2024-05-29 14:01:29] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 0 ms to minimize.
[2024-05-29 14:01:30] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 1 ms to minimize.
[2024-05-29 14:01:30] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 1 ms to minimize.
[2024-05-29 14:01:30] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 1 ms to minimize.
[2024-05-29 14:01:30] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 1 ms to minimize.
[2024-05-29 14:01:30] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 1 ms to minimize.
[2024-05-29 14:01:30] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 0 ms to minimize.
[2024-05-29 14:01:31] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 1 ms to minimize.
[2024-05-29 14:01:31] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:01:32] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 0 ms to minimize.
[2024-05-29 14:01:32] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 0 ms to minimize.
[2024-05-29 14:01:33] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 0 ms to minimize.
[2024-05-29 14:01:33] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 1 ms to minimize.
[2024-05-29 14:01:33] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 0 ms to minimize.
[2024-05-29 14:01:33] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 1 ms to minimize.
[2024-05-29 14:01:33] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 1 ms to minimize.
[2024-05-29 14:01:33] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 0 ms to minimize.
[2024-05-29 14:01:33] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:01:35] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 0 ms to minimize.
[2024-05-29 14:01:35] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 1 ms to minimize.
[2024-05-29 14:01:35] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 1 ms to minimize.
[2024-05-29 14:01:36] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 0 ms to minimize.
[2024-05-29 14:01:36] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:01:39] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 1 ms to minimize.
[2024-05-29 14:01:39] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 1 ms to minimize.
[2024-05-29 14:01:39] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 0 ms to minimize.
[2024-05-29 14:01:39] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 1 ms to minimize.
[2024-05-29 14:01:39] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 1 ms to minimize.
[2024-05-29 14:01:39] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 1 ms to minimize.
[2024-05-29 14:01:39] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 0 ms to minimize.
[2024-05-29 14:01:40] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 0 ms to minimize.
[2024-05-29 14:01:40] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 0 ms to minimize.
[2024-05-29 14:01:40] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:01:40] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 0 ms to minimize.
[2024-05-29 14:01:40] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 1 ms to minimize.
[2024-05-29 14:01:40] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 0 ms to minimize.
[2024-05-29 14:01:42] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 1 ms to minimize.
[2024-05-29 14:01:42] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 0 ms to minimize.
[2024-05-29 14:01:42] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 1 ms to minimize.
[2024-05-29 14:01:42] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 7/74 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:01:44] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 0 ms to minimize.
[2024-05-29 14:01:45] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 1 ms to minimize.
[2024-05-29 14:01:45] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 0 ms to minimize.
[2024-05-29 14:01:45] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/97 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:01:48] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 1 ms to minimize.
[2024-05-29 14:01:48] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/97 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 97/609 variables, and 80 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/97 constraints, ReadFeed: 0/127 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 77/77 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 77/80 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:01:51] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 1 ms to minimize.
[2024-05-29 14:01:52] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 1 ms to minimize.
[2024-05-29 14:01:52] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:01:54] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 1 ms to minimize.
[2024-05-29 14:01:54] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 511/608 variables, 97/182 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/608 variables, 126/308 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/608 variables, 503/811 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/609 variables, and 811 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 82/82 constraints]
After SMT, in 61962ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 61966ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/1417 places, 520/6027 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62938 ms. Remains : 97/1417 places, 520/6027 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLCardinality-13
Product exploration explored 100000 steps with 8078 reset in 222 ms.
Product exploration explored 100000 steps with 8029 reset in 225 ms.
Computed a total of 8 stabilizing places and 27 stable transitions
Computed a total of 8 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
RANDOM walk for 399 steps (26 resets) in 5 ms. (66 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 520/520 transitions.
Applied a total of 0 rules in 20 ms. Remains 97 /97 variables (removed 0) and now considering 520/520 (removed 0) transitions.
[2024-05-29 14:02:19] [INFO ] Flow matrix only has 512 transitions (discarded 8 similar events)
[2024-05-29 14:02:19] [INFO ] Invariant cache hit.
[2024-05-29 14:02:19] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-29 14:02:19] [INFO ] Flow matrix only has 512 transitions (discarded 8 similar events)
[2024-05-29 14:02:19] [INFO ] Invariant cache hit.
[2024-05-29 14:02:20] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 14:02:20] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
[2024-05-29 14:02:20] [INFO ] Redundant transitions in 7 ms returned []
Running 503 sub problems to find dead transitions.
[2024-05-29 14:02:20] [INFO ] Flow matrix only has 512 transitions (discarded 8 similar events)
[2024-05-29 14:02:20] [INFO ] Invariant cache hit.
[2024-05-29 14:02:20] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:02:24] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 1 ms to minimize.
[2024-05-29 14:02:24] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 1 ms to minimize.
[2024-05-29 14:02:25] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 1 ms to minimize.
[2024-05-29 14:02:25] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 1 ms to minimize.
[2024-05-29 14:02:25] [INFO ] Deduced a trap composed of 22 places in 168 ms of which 1 ms to minimize.
[2024-05-29 14:02:25] [INFO ] Deduced a trap composed of 20 places in 177 ms of which 1 ms to minimize.
[2024-05-29 14:02:25] [INFO ] Deduced a trap composed of 20 places in 162 ms of which 1 ms to minimize.
[2024-05-29 14:02:25] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 0 ms to minimize.
[2024-05-29 14:02:26] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 0 ms to minimize.
[2024-05-29 14:02:26] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 0 ms to minimize.
[2024-05-29 14:02:27] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 1 ms to minimize.
[2024-05-29 14:02:27] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 0 ms to minimize.
[2024-05-29 14:02:27] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 1 ms to minimize.
[2024-05-29 14:02:27] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 1 ms to minimize.
[2024-05-29 14:02:28] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 0 ms to minimize.
[2024-05-29 14:02:28] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 1 ms to minimize.
[2024-05-29 14:02:28] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 0 ms to minimize.
[2024-05-29 14:02:28] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 1 ms to minimize.
[2024-05-29 14:02:28] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 1 ms to minimize.
[2024-05-29 14:02:28] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:02:30] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 1 ms to minimize.
[2024-05-29 14:02:30] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 0 ms to minimize.
[2024-05-29 14:02:30] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 0 ms to minimize.
[2024-05-29 14:02:30] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 0 ms to minimize.
[2024-05-29 14:02:32] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 0 ms to minimize.
[2024-05-29 14:02:32] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 0 ms to minimize.
[2024-05-29 14:02:32] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 1 ms to minimize.
[2024-05-29 14:02:32] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 2 ms to minimize.
[2024-05-29 14:02:32] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 0 ms to minimize.
[2024-05-29 14:02:32] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 1 ms to minimize.
[2024-05-29 14:02:33] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 1 ms to minimize.
[2024-05-29 14:02:33] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 1 ms to minimize.
[2024-05-29 14:02:33] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 1 ms to minimize.
[2024-05-29 14:02:33] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 1 ms to minimize.
[2024-05-29 14:02:33] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 1 ms to minimize.
[2024-05-29 14:02:33] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 1 ms to minimize.
[2024-05-29 14:02:33] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 1 ms to minimize.
[2024-05-29 14:02:34] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 1 ms to minimize.
[2024-05-29 14:02:34] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 0 ms to minimize.
[2024-05-29 14:02:34] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:02:36] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 1 ms to minimize.
[2024-05-29 14:02:36] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 1 ms to minimize.
[2024-05-29 14:02:36] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 1 ms to minimize.
[2024-05-29 14:02:36] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 1 ms to minimize.
[2024-05-29 14:02:36] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 1 ms to minimize.
[2024-05-29 14:02:36] [INFO ] Deduced a trap composed of 30 places in 134 ms of which 1 ms to minimize.
[2024-05-29 14:02:36] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 1 ms to minimize.
[2024-05-29 14:02:37] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 1 ms to minimize.
[2024-05-29 14:02:37] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:02:38] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 1 ms to minimize.
[2024-05-29 14:02:39] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 0 ms to minimize.
[2024-05-29 14:02:39] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 0 ms to minimize.
[2024-05-29 14:02:39] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 1 ms to minimize.
[2024-05-29 14:02:39] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:02:42] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 0 ms to minimize.
[2024-05-29 14:02:42] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 0 ms to minimize.
[2024-05-29 14:02:42] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 1 ms to minimize.
[2024-05-29 14:02:43] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 0 ms to minimize.
[2024-05-29 14:02:43] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 1 ms to minimize.
[2024-05-29 14:02:43] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 1 ms to minimize.
[2024-05-29 14:02:43] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 1 ms to minimize.
[2024-05-29 14:02:43] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 0 ms to minimize.
[2024-05-29 14:02:43] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 1 ms to minimize.
[2024-05-29 14:02:44] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:02:44] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 1 ms to minimize.
[2024-05-29 14:02:44] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 0 ms to minimize.
[2024-05-29 14:02:44] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 0 ms to minimize.
[2024-05-29 14:02:46] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 0 ms to minimize.
[2024-05-29 14:02:46] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 0 ms to minimize.
[2024-05-29 14:02:46] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 0 ms to minimize.
[2024-05-29 14:02:46] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 7/74 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:02:48] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 1 ms to minimize.
[2024-05-29 14:02:48] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 0 ms to minimize.
[2024-05-29 14:02:48] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 0 ms to minimize.
[2024-05-29 14:02:48] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/97 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:02:51] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 1 ms to minimize.
[2024-05-29 14:02:51] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/97 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 97/609 variables, and 80 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/97 constraints, ReadFeed: 0/127 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 77/77 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 77/80 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:02:55] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 0 ms to minimize.
[2024-05-29 14:02:55] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 1 ms to minimize.
[2024-05-29 14:02:55] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:02:57] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 1 ms to minimize.
[2024-05-29 14:02:58] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 511/608 variables, 97/182 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/608 variables, 126/308 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/608 variables, 503/811 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/609 variables, and 811 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 82/82 constraints]
After SMT, in 62039ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 62044ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62620 ms. Remains : 97/97 places, 520/520 transitions.
Computed a total of 8 stabilizing places and 27 stable transitions
Computed a total of 8 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 565 steps (42 resets) in 5 ms. (94 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 8067 reset in 239 ms.
Product exploration explored 100000 steps with 8003 reset in 243 ms.
Built C files in :
/tmp/ltsmin12756822076762831216
[2024-05-29 14:03:23] [INFO ] Computing symmetric may disable matrix : 520 transitions.
[2024-05-29 14:03:23] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:03:23] [INFO ] Computing symmetric may enable matrix : 520 transitions.
[2024-05-29 14:03:23] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:03:23] [INFO ] Computing Do-Not-Accords matrix : 520 transitions.
[2024-05-29 14:03:23] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:03:23] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12756822076762831216
Running compilation step : cd /tmp/ltsmin12756822076762831216;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1878 ms.
Running link step : cd /tmp/ltsmin12756822076762831216;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin12756822076762831216;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17370502280323131209.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 520/520 transitions.
Applied a total of 0 rules in 23 ms. Remains 97 /97 variables (removed 0) and now considering 520/520 (removed 0) transitions.
[2024-05-29 14:03:38] [INFO ] Flow matrix only has 512 transitions (discarded 8 similar events)
[2024-05-29 14:03:38] [INFO ] Invariant cache hit.
[2024-05-29 14:03:38] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-29 14:03:38] [INFO ] Flow matrix only has 512 transitions (discarded 8 similar events)
[2024-05-29 14:03:38] [INFO ] Invariant cache hit.
[2024-05-29 14:03:38] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 14:03:38] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 557 ms to find 0 implicit places.
[2024-05-29 14:03:38] [INFO ] Redundant transitions in 3 ms returned []
Running 503 sub problems to find dead transitions.
[2024-05-29 14:03:38] [INFO ] Flow matrix only has 512 transitions (discarded 8 similar events)
[2024-05-29 14:03:38] [INFO ] Invariant cache hit.
[2024-05-29 14:03:38] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:03:43] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 2 ms to minimize.
[2024-05-29 14:03:43] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 1 ms to minimize.
[2024-05-29 14:03:43] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 1 ms to minimize.
[2024-05-29 14:03:43] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 1 ms to minimize.
[2024-05-29 14:03:43] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 1 ms to minimize.
[2024-05-29 14:03:43] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 1 ms to minimize.
[2024-05-29 14:03:44] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 0 ms to minimize.
[2024-05-29 14:03:44] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 1 ms to minimize.
[2024-05-29 14:03:45] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 1 ms to minimize.
[2024-05-29 14:03:45] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 1 ms to minimize.
[2024-05-29 14:03:45] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 0 ms to minimize.
[2024-05-29 14:03:45] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 1 ms to minimize.
[2024-05-29 14:03:45] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2024-05-29 14:03:46] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 0 ms to minimize.
[2024-05-29 14:03:46] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 0 ms to minimize.
[2024-05-29 14:03:46] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 1 ms to minimize.
[2024-05-29 14:03:46] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 1 ms to minimize.
[2024-05-29 14:03:46] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 1 ms to minimize.
[2024-05-29 14:03:46] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 0 ms to minimize.
[2024-05-29 14:03:47] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:03:48] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 1 ms to minimize.
[2024-05-29 14:03:48] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 1 ms to minimize.
[2024-05-29 14:03:48] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 1 ms to minimize.
[2024-05-29 14:03:48] [INFO ] Deduced a trap composed of 30 places in 159 ms of which 1 ms to minimize.
[2024-05-29 14:03:50] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 0 ms to minimize.
[2024-05-29 14:03:50] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 1 ms to minimize.
[2024-05-29 14:03:50] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 1 ms to minimize.
[2024-05-29 14:03:50] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 1 ms to minimize.
[2024-05-29 14:03:50] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 1 ms to minimize.
[2024-05-29 14:03:51] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 1 ms to minimize.
[2024-05-29 14:03:51] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 0 ms to minimize.
[2024-05-29 14:03:51] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 1 ms to minimize.
[2024-05-29 14:03:51] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 1 ms to minimize.
[2024-05-29 14:03:51] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 0 ms to minimize.
[2024-05-29 14:03:51] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 0 ms to minimize.
[2024-05-29 14:03:52] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 1 ms to minimize.
[2024-05-29 14:03:52] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 0 ms to minimize.
[2024-05-29 14:03:52] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 1 ms to minimize.
[2024-05-29 14:03:52] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 1 ms to minimize.
[2024-05-29 14:03:52] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:03:54] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 1 ms to minimize.
[2024-05-29 14:03:54] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 1 ms to minimize.
[2024-05-29 14:03:54] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 0 ms to minimize.
[2024-05-29 14:03:54] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 0 ms to minimize.
[2024-05-29 14:03:54] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 1 ms to minimize.
[2024-05-29 14:03:54] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 1 ms to minimize.
[2024-05-29 14:03:55] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 1 ms to minimize.
[2024-05-29 14:03:55] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 1 ms to minimize.
[2024-05-29 14:03:55] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:03:57] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 1 ms to minimize.
[2024-05-29 14:03:57] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 1 ms to minimize.
[2024-05-29 14:03:57] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 1 ms to minimize.
[2024-05-29 14:03:57] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 1 ms to minimize.
[2024-05-29 14:03:57] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:04:00] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 1 ms to minimize.
[2024-05-29 14:04:00] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 1 ms to minimize.
[2024-05-29 14:04:00] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 0 ms to minimize.
[2024-05-29 14:04:01] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 0 ms to minimize.
[2024-05-29 14:04:01] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 0 ms to minimize.
[2024-05-29 14:04:01] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 1 ms to minimize.
[2024-05-29 14:04:01] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 1 ms to minimize.
[2024-05-29 14:04:01] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 1 ms to minimize.
[2024-05-29 14:04:01] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 0 ms to minimize.
[2024-05-29 14:04:01] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:04:02] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 0 ms to minimize.
[2024-05-29 14:04:02] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 0 ms to minimize.
[2024-05-29 14:04:02] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 0 ms to minimize.
[2024-05-29 14:04:04] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 0 ms to minimize.
[2024-05-29 14:04:04] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 0 ms to minimize.
[2024-05-29 14:04:04] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 1 ms to minimize.
[2024-05-29 14:04:04] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 7/74 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:04:06] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 1 ms to minimize.
[2024-05-29 14:04:06] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 1 ms to minimize.
[2024-05-29 14:04:06] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 1 ms to minimize.
[2024-05-29 14:04:07] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/97 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:04:10] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 0 ms to minimize.
[2024-05-29 14:04:10] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/97 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 97/609 variables, and 80 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/97 constraints, ReadFeed: 0/127 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 77/77 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 77/80 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:04:13] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 1 ms to minimize.
[2024-05-29 14:04:13] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 1 ms to minimize.
[2024-05-29 14:04:14] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:04:15] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 0 ms to minimize.
[2024-05-29 14:04:16] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 511/608 variables, 97/182 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/608 variables, 126/308 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/608 variables, 503/811 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/609 variables, and 811 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 82/82 constraints]
After SMT, in 61871ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 61877ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62470 ms. Remains : 97/97 places, 520/520 transitions.
Built C files in :
/tmp/ltsmin2921870898398411202
[2024-05-29 14:04:40] [INFO ] Computing symmetric may disable matrix : 520 transitions.
[2024-05-29 14:04:40] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:04:40] [INFO ] Computing symmetric may enable matrix : 520 transitions.
[2024-05-29 14:04:40] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:04:40] [INFO ] Computing Do-Not-Accords matrix : 520 transitions.
[2024-05-29 14:04:40] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:04:40] [INFO ] Built C files in 90ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2921870898398411202
Running compilation step : cd /tmp/ltsmin2921870898398411202;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1883 ms.
Running link step : cd /tmp/ltsmin2921870898398411202;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin2921870898398411202;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2289207061022947462.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 14:04:56] [INFO ] Flatten gal took : 33 ms
[2024-05-29 14:04:56] [INFO ] Flatten gal took : 33 ms
[2024-05-29 14:04:56] [INFO ] Time to serialize gal into /tmp/LTL8545027420938763648.gal : 5 ms
[2024-05-29 14:04:56] [INFO ] Time to serialize properties into /tmp/LTL1192756546061120640.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8545027420938763648.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4443094042947855518.hoa' '-atoms' '/tmp/LTL1192756546061120640.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1192756546061120640.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4443094042947855518.hoa
Detected timeout of ITS tools.
[2024-05-29 14:05:11] [INFO ] Flatten gal took : 58 ms
[2024-05-29 14:05:11] [INFO ] Flatten gal took : 32 ms
[2024-05-29 14:05:11] [INFO ] Time to serialize gal into /tmp/LTL9320714713667871165.gal : 4 ms
[2024-05-29 14:05:11] [INFO ] Time to serialize properties into /tmp/LTL17711517726731295895.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9320714713667871165.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17711517726731295895.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((p2074==0)||(p1353==1))"))))
Formula 0 simplified : GF!"((p2074==0)||(p1353==1))"
Detected timeout of ITS tools.
[2024-05-29 14:05:26] [INFO ] Flatten gal took : 32 ms
[2024-05-29 14:05:26] [INFO ] Applying decomposition
[2024-05-29 14:05:26] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13820498590958828639.txt' '-o' '/tmp/graph13820498590958828639.bin' '-w' '/tmp/graph13820498590958828639.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13820498590958828639.bin' '-l' '-1' '-v' '-w' '/tmp/graph13820498590958828639.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:05:26] [INFO ] Decomposing Gal with order
[2024-05-29 14:05:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:05:26] [INFO ] Removed a total of 2740 redundant transitions.
[2024-05-29 14:05:26] [INFO ] Flatten gal took : 43 ms
[2024-05-29 14:05:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 9 ms.
[2024-05-29 14:05:26] [INFO ] Time to serialize gal into /tmp/LTL15398734885523102291.gal : 3 ms
[2024-05-29 14:05:26] [INFO ] Time to serialize properties into /tmp/LTL279172164823060015.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15398734885523102291.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL279172164823060015.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G("((i6.u23.p2074==0)||(u15.p1353==1))"))))
Formula 0 simplified : GF!"((i6.u23.p2074==0)||(u15.p1353==1))"
Detected timeout of ITS tools.
Treatment of property StigmergyCommit-PT-06b-LTLCardinality-13 finished in 265803 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1417 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1417/1417 places, 6027/6027 transitions.
Graph (trivial) has 1414 edges and 1417 vertex of which 122 / 1417 are part of one of the 21 SCC in 1 ms
Free SCC test removed 101 places
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 975 transitions
Trivial Post-agglo rules discarded 975 transitions
Performed 975 trivial Post agglomeration. Transition count delta: 975
Iterating post reduction 0 with 975 rules applied. Total rules applied 976 place count 1315 transition count 4936
Reduce places removed 975 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 994 rules applied. Total rules applied 1970 place count 340 transition count 4917
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 1978 place count 333 transition count 4916
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1979 place count 332 transition count 4916
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 73 Pre rules applied. Total rules applied 1979 place count 332 transition count 4843
Deduced a syphon composed of 73 places in 2 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 2125 place count 259 transition count 4843
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 2136 place count 248 transition count 4832
Iterating global reduction 4 with 11 rules applied. Total rules applied 2147 place count 248 transition count 4832
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 2149 place count 246 transition count 4830
Iterating global reduction 4 with 2 rules applied. Total rules applied 2151 place count 246 transition count 4830
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2152 place count 246 transition count 4829
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2153 place count 245 transition count 4828
Iterating global reduction 5 with 1 rules applied. Total rules applied 2154 place count 245 transition count 4828
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2155 place count 245 transition count 4827
Performed 55 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 6 with 110 rules applied. Total rules applied 2265 place count 190 transition count 4767
Discarding 41 places :
Symmetric choice reduction at 6 with 41 rule applications. Total rules 2306 place count 149 transition count 615
Iterating global reduction 6 with 41 rules applied. Total rules applied 2347 place count 149 transition count 615
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 2366 place count 149 transition count 596
Discarding 21 places :
Symmetric choice reduction at 7 with 21 rule applications. Total rules 2387 place count 128 transition count 568
Iterating global reduction 7 with 21 rules applied. Total rules applied 2408 place count 128 transition count 568
Discarding 20 places :
Symmetric choice reduction at 7 with 20 rule applications. Total rules 2428 place count 108 transition count 541
Iterating global reduction 7 with 20 rules applied. Total rules applied 2448 place count 108 transition count 541
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 2454 place count 108 transition count 535
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 2476 place count 97 transition count 542
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2477 place count 96 transition count 528
Iterating global reduction 8 with 1 rules applied. Total rules applied 2478 place count 96 transition count 528
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2479 place count 96 transition count 527
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 2486 place count 96 transition count 520
Applied a total of 2486 rules in 459 ms. Remains 96 /1417 variables (removed 1321) and now considering 520/6027 (removed 5507) transitions.
[2024-05-29 14:05:42] [INFO ] Flow matrix only has 512 transitions (discarded 8 similar events)
// Phase 1: matrix 512 rows 96 cols
[2024-05-29 14:05:42] [INFO ] Computed 2 invariants in 6 ms
[2024-05-29 14:05:42] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-29 14:05:42] [INFO ] Flow matrix only has 512 transitions (discarded 8 similar events)
[2024-05-29 14:05:42] [INFO ] Invariant cache hit.
[2024-05-29 14:05:42] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 14:05:42] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2024-05-29 14:05:42] [INFO ] Redundant transitions in 4 ms returned []
Running 503 sub problems to find dead transitions.
[2024-05-29 14:05:42] [INFO ] Flow matrix only has 512 transitions (discarded 8 similar events)
[2024-05-29 14:05:42] [INFO ] Invariant cache hit.
[2024-05-29 14:05:42] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:05:46] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 1 ms to minimize.
[2024-05-29 14:05:47] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 1 ms to minimize.
[2024-05-29 14:05:47] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 1 ms to minimize.
[2024-05-29 14:05:47] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 0 ms to minimize.
[2024-05-29 14:05:47] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 1 ms to minimize.
[2024-05-29 14:05:47] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 0 ms to minimize.
[2024-05-29 14:05:47] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 1 ms to minimize.
[2024-05-29 14:05:48] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 1 ms to minimize.
[2024-05-29 14:05:48] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 1 ms to minimize.
[2024-05-29 14:05:48] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 1 ms to minimize.
[2024-05-29 14:05:48] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 1 ms to minimize.
[2024-05-29 14:05:48] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 1 ms to minimize.
[2024-05-29 14:05:48] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 1 ms to minimize.
[2024-05-29 14:05:48] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 1 ms to minimize.
[2024-05-29 14:05:49] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 1 ms to minimize.
[2024-05-29 14:05:49] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 1 ms to minimize.
[2024-05-29 14:05:50] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 1 ms to minimize.
[2024-05-29 14:05:50] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 0 ms to minimize.
[2024-05-29 14:05:50] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 1 ms to minimize.
[2024-05-29 14:05:50] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:05:53] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 1 ms to minimize.
[2024-05-29 14:05:53] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 0 ms to minimize.
[2024-05-29 14:05:54] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 1 ms to minimize.
[2024-05-29 14:05:54] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 0 ms to minimize.
[2024-05-29 14:05:54] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 1 ms to minimize.
[2024-05-29 14:05:54] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 0 ms to minimize.
[2024-05-29 14:05:54] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 1 ms to minimize.
[2024-05-29 14:05:54] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 0 ms to minimize.
[2024-05-29 14:05:55] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 1 ms to minimize.
[2024-05-29 14:05:55] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 1 ms to minimize.
[2024-05-29 14:05:55] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 0 ms to minimize.
[2024-05-29 14:05:55] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 1 ms to minimize.
[2024-05-29 14:05:55] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 0 ms to minimize.
[2024-05-29 14:05:56] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 1 ms to minimize.
[2024-05-29 14:05:56] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 1 ms to minimize.
[2024-05-29 14:05:56] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 0 ms to minimize.
[2024-05-29 14:05:56] [INFO ] Deduced a trap composed of 33 places in 158 ms of which 1 ms to minimize.
[2024-05-29 14:05:56] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 0 ms to minimize.
[2024-05-29 14:05:56] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 1 ms to minimize.
[2024-05-29 14:05:56] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:05:58] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 1 ms to minimize.
[2024-05-29 14:05:58] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 1 ms to minimize.
[2024-05-29 14:05:59] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 1 ms to minimize.
[2024-05-29 14:05:59] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 0 ms to minimize.
[2024-05-29 14:05:59] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 0 ms to minimize.
[2024-05-29 14:05:59] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 1 ms to minimize.
[2024-05-29 14:05:59] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 0 ms to minimize.
[2024-05-29 14:05:59] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 1 ms to minimize.
[2024-05-29 14:05:59] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 1 ms to minimize.
[2024-05-29 14:06:00] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 1 ms to minimize.
[2024-05-29 14:06:00] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:06:01] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 0 ms to minimize.
[2024-05-29 14:06:02] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 1 ms to minimize.
[2024-05-29 14:06:02] [INFO ] Deduced a trap composed of 21 places in 170 ms of which 1 ms to minimize.
[2024-05-29 14:06:02] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 0 ms to minimize.
[2024-05-29 14:06:02] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 0 ms to minimize.
[2024-05-29 14:06:02] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 1 ms to minimize.
[2024-05-29 14:06:02] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:06:05] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 1 ms to minimize.
[2024-05-29 14:06:05] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:06:07] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 0 ms to minimize.
[2024-05-29 14:06:07] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 1 ms to minimize.
[2024-05-29 14:06:08] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 0 ms to minimize.
[2024-05-29 14:06:08] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 0 ms to minimize.
[2024-05-29 14:06:08] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 0 ms to minimize.
[2024-05-29 14:06:08] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (OVERLAPS) 511/607 variables, 96/164 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/607 variables, 126/290 constraints. Problems are: Problem set: 0 solved, 503 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 607/608 variables, and 290 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (OVERLAPS) 511/607 variables, 96/164 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/607 variables, 126/290 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/607 variables, 503/793 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:06:43] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 607/608 variables, and 794 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 67/67 constraints]
After SMT, in 61956ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 61962ms
Starting structural reductions in SI_LTL mode, iteration 1 : 96/1417 places, 520/6027 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62970 ms. Remains : 96/1417 places, 520/6027 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06b-LTLCardinality-15
Product exploration explored 100000 steps with 8025 reset in 216 ms.
Product exploration explored 100000 steps with 8020 reset in 252 ms.
Computed a total of 7 stabilizing places and 26 stable transitions
Computed a total of 7 stabilizing places and 26 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
RANDOM walk for 40000 steps (3192 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (274 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1767565 steps, run timeout after 3001 ms. (steps per millisecond=588 ) properties seen :0 out of 1
Probabilistic random walk after 1767565 steps, saw 307651 distinct states, run finished after 3001 ms. (steps per millisecond=588 ) properties seen :0
[2024-05-29 14:06:48] [INFO ] Flow matrix only has 512 transitions (discarded 8 similar events)
[2024-05-29 14:06:48] [INFO ] Invariant cache hit.
[2024-05-29 14:06:48] [INFO ] State equation strengthened by 127 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 510/604 variables, 94/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 126/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/607 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/607 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/607 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/608 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/608 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/608 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 608/608 variables, and 225 constraints, problems are : Problem set: 0 solved, 1 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 127/127 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 14:06:48] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 0 ms to minimize.
[2024-05-29 14:06:49] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 1 ms to minimize.
[2024-05-29 14:06:49] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 1 ms to minimize.
[2024-05-29 14:06:49] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 1 ms to minimize.
[2024-05-29 14:06:49] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 0 ms to minimize.
[2024-05-29 14:06:49] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 1 ms to minimize.
[2024-05-29 14:06:49] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 1 ms to minimize.
[2024-05-29 14:06:50] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 1 ms to minimize.
[2024-05-29 14:06:50] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 0 ms to minimize.
[2024-05-29 14:06:50] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 0 ms to minimize.
[2024-05-29 14:06:50] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 510/604 variables, 94/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 126/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/604 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/604 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/607 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/607 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/607 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/608 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/608 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/608 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 608/608 variables, and 237 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1964 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 2215ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 108 steps, including 6 resets, run visited all 1 properties in 2 ms. (steps per millisecond=54 )
Parikh walk visited 1 properties in 13 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 520/520 transitions.
Applied a total of 0 rules in 19 ms. Remains 96 /96 variables (removed 0) and now considering 520/520 (removed 0) transitions.
[2024-05-29 14:06:51] [INFO ] Flow matrix only has 512 transitions (discarded 8 similar events)
[2024-05-29 14:06:51] [INFO ] Invariant cache hit.
[2024-05-29 14:06:51] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-29 14:06:51] [INFO ] Flow matrix only has 512 transitions (discarded 8 similar events)
[2024-05-29 14:06:51] [INFO ] Invariant cache hit.
[2024-05-29 14:06:51] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 14:06:51] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
[2024-05-29 14:06:51] [INFO ] Redundant transitions in 3 ms returned []
Running 503 sub problems to find dead transitions.
[2024-05-29 14:06:51] [INFO ] Flow matrix only has 512 transitions (discarded 8 similar events)
[2024-05-29 14:06:51] [INFO ] Invariant cache hit.
[2024-05-29 14:06:51] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:06:55] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 1 ms to minimize.
[2024-05-29 14:06:55] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 1 ms to minimize.
[2024-05-29 14:06:56] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 1 ms to minimize.
[2024-05-29 14:06:56] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 0 ms to minimize.
[2024-05-29 14:06:56] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 0 ms to minimize.
[2024-05-29 14:06:56] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 1 ms to minimize.
[2024-05-29 14:06:56] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 0 ms to minimize.
[2024-05-29 14:06:56] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 1 ms to minimize.
[2024-05-29 14:06:56] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 1 ms to minimize.
[2024-05-29 14:06:57] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 1 ms to minimize.
[2024-05-29 14:06:57] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 1 ms to minimize.
[2024-05-29 14:06:57] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 1 ms to minimize.
[2024-05-29 14:06:57] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 1 ms to minimize.
[2024-05-29 14:06:57] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 1 ms to minimize.
[2024-05-29 14:06:57] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 1 ms to minimize.
[2024-05-29 14:06:57] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 1 ms to minimize.
[2024-05-29 14:06:58] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 2 ms to minimize.
[2024-05-29 14:06:58] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 0 ms to minimize.
[2024-05-29 14:06:59] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 0 ms to minimize.
[2024-05-29 14:06:59] [INFO ] Deduced a trap composed of 20 places in 221 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:07:01] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 0 ms to minimize.
[2024-05-29 14:07:01] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 1 ms to minimize.
[2024-05-29 14:07:01] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 0 ms to minimize.
[2024-05-29 14:07:01] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 0 ms to minimize.
[2024-05-29 14:07:01] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 1 ms to minimize.
[2024-05-29 14:07:01] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 1 ms to minimize.
[2024-05-29 14:07:01] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 1 ms to minimize.
[2024-05-29 14:07:02] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 0 ms to minimize.
[2024-05-29 14:07:02] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 0 ms to minimize.
[2024-05-29 14:07:02] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 1 ms to minimize.
[2024-05-29 14:07:02] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 1 ms to minimize.
[2024-05-29 14:07:03] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 1 ms to minimize.
[2024-05-29 14:07:03] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 0 ms to minimize.
[2024-05-29 14:07:03] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 1 ms to minimize.
[2024-05-29 14:07:03] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 1 ms to minimize.
[2024-05-29 14:07:03] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 1 ms to minimize.
[2024-05-29 14:07:03] [INFO ] Deduced a trap composed of 33 places in 144 ms of which 1 ms to minimize.
[2024-05-29 14:07:03] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 1 ms to minimize.
[2024-05-29 14:07:04] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 1 ms to minimize.
[2024-05-29 14:07:04] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:07:05] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 1 ms to minimize.
[2024-05-29 14:07:06] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 0 ms to minimize.
[2024-05-29 14:07:06] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 1 ms to minimize.
[2024-05-29 14:07:06] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 1 ms to minimize.
[2024-05-29 14:07:06] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 1 ms to minimize.
[2024-05-29 14:07:06] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 1 ms to minimize.
[2024-05-29 14:07:06] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 1 ms to minimize.
[2024-05-29 14:07:06] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 1 ms to minimize.
[2024-05-29 14:07:07] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 1 ms to minimize.
[2024-05-29 14:07:07] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 0 ms to minimize.
[2024-05-29 14:07:07] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:07:09] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 0 ms to minimize.
[2024-05-29 14:07:09] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 1 ms to minimize.
[2024-05-29 14:07:09] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 1 ms to minimize.
[2024-05-29 14:07:09] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 1 ms to minimize.
[2024-05-29 14:07:09] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 0 ms to minimize.
[2024-05-29 14:07:09] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 1 ms to minimize.
[2024-05-29 14:07:10] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:07:12] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 1 ms to minimize.
[2024-05-29 14:07:13] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:07:14] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 1 ms to minimize.
[2024-05-29 14:07:14] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 1 ms to minimize.
[2024-05-29 14:07:15] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 0 ms to minimize.
[2024-05-29 14:07:15] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 0 ms to minimize.
[2024-05-29 14:07:15] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 1 ms to minimize.
[2024-05-29 14:07:15] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (OVERLAPS) 511/607 variables, 96/164 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/607 variables, 126/290 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 607/608 variables, and 290 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (OVERLAPS) 511/607 variables, 96/164 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/607 variables, 126/290 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/607 variables, 503/793 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:07:53] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 607/608 variables, and 794 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 67/67 constraints]
After SMT, in 62045ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 62049ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62619 ms. Remains : 96/96 places, 520/520 transitions.
Computed a total of 7 stabilizing places and 26 stable transitions
Computed a total of 7 stabilizing places and 26 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 40000 steps (3205 resets) in 136 ms. (291 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (282 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1556865 steps, run timeout after 3001 ms. (steps per millisecond=518 ) properties seen :0 out of 1
Probabilistic random walk after 1556865 steps, saw 274958 distinct states, run finished after 3001 ms. (steps per millisecond=518 ) properties seen :0
[2024-05-29 14:07:56] [INFO ] Flow matrix only has 512 transitions (discarded 8 similar events)
[2024-05-29 14:07:56] [INFO ] Invariant cache hit.
[2024-05-29 14:07:56] [INFO ] State equation strengthened by 127 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 510/604 variables, 94/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 126/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/607 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/607 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/607 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/608 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/608 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/608 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 608/608 variables, and 225 constraints, problems are : Problem set: 0 solved, 1 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 127/127 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 14:07:57] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 1 ms to minimize.
[2024-05-29 14:07:57] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 1 ms to minimize.
[2024-05-29 14:07:57] [INFO ] Deduced a trap composed of 20 places in 160 ms of which 1 ms to minimize.
[2024-05-29 14:07:57] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 1 ms to minimize.
[2024-05-29 14:07:57] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 1 ms to minimize.
[2024-05-29 14:07:57] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 0 ms to minimize.
[2024-05-29 14:07:58] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 1 ms to minimize.
[2024-05-29 14:07:58] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 1 ms to minimize.
[2024-05-29 14:07:58] [INFO ] Deduced a trap composed of 24 places in 247 ms of which 1 ms to minimize.
[2024-05-29 14:07:58] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 1 ms to minimize.
[2024-05-29 14:07:58] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 510/604 variables, 94/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 126/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/604 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/604 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/607 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/607 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/607 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/608 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/608 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/608 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 608/608 variables, and 237 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2107 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 2356ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 291 steps, including 18 resets, run visited all 1 properties in 2 ms. (steps per millisecond=145 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Product exploration explored 100000 steps with 8039 reset in 222 ms.
Product exploration explored 100000 steps with 8061 reset in 261 ms.
Built C files in :
/tmp/ltsmin13058671715407506803
[2024-05-29 14:07:59] [INFO ] Computing symmetric may disable matrix : 520 transitions.
[2024-05-29 14:07:59] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:07:59] [INFO ] Computing symmetric may enable matrix : 520 transitions.
[2024-05-29 14:07:59] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:07:59] [INFO ] Computing Do-Not-Accords matrix : 520 transitions.
[2024-05-29 14:07:59] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:07:59] [INFO ] Built C files in 93ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13058671715407506803
Running compilation step : cd /tmp/ltsmin13058671715407506803;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1881 ms.
Running link step : cd /tmp/ltsmin13058671715407506803;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin13058671715407506803;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18052213219822947208.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 520/520 transitions.
Applied a total of 0 rules in 15 ms. Remains 96 /96 variables (removed 0) and now considering 520/520 (removed 0) transitions.
[2024-05-29 14:08:14] [INFO ] Flow matrix only has 512 transitions (discarded 8 similar events)
[2024-05-29 14:08:14] [INFO ] Invariant cache hit.
[2024-05-29 14:08:15] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-29 14:08:15] [INFO ] Flow matrix only has 512 transitions (discarded 8 similar events)
[2024-05-29 14:08:15] [INFO ] Invariant cache hit.
[2024-05-29 14:08:15] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 14:08:15] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
[2024-05-29 14:08:15] [INFO ] Redundant transitions in 2 ms returned []
Running 503 sub problems to find dead transitions.
[2024-05-29 14:08:15] [INFO ] Flow matrix only has 512 transitions (discarded 8 similar events)
[2024-05-29 14:08:15] [INFO ] Invariant cache hit.
[2024-05-29 14:08:15] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:08:19] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 1 ms to minimize.
[2024-05-29 14:08:19] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 1 ms to minimize.
[2024-05-29 14:08:19] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 1 ms to minimize.
[2024-05-29 14:08:20] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 1 ms to minimize.
[2024-05-29 14:08:20] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 1 ms to minimize.
[2024-05-29 14:08:20] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 0 ms to minimize.
[2024-05-29 14:08:20] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 1 ms to minimize.
[2024-05-29 14:08:20] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 1 ms to minimize.
[2024-05-29 14:08:20] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 0 ms to minimize.
[2024-05-29 14:08:21] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 0 ms to minimize.
[2024-05-29 14:08:21] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 1 ms to minimize.
[2024-05-29 14:08:21] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 1 ms to minimize.
[2024-05-29 14:08:21] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 1 ms to minimize.
[2024-05-29 14:08:21] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 0 ms to minimize.
[2024-05-29 14:08:21] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 1 ms to minimize.
[2024-05-29 14:08:21] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 0 ms to minimize.
[2024-05-29 14:08:22] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 1 ms to minimize.
[2024-05-29 14:08:23] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 12 ms to minimize.
[2024-05-29 14:08:23] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 1 ms to minimize.
[2024-05-29 14:08:23] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:08:25] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 1 ms to minimize.
[2024-05-29 14:08:25] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 0 ms to minimize.
[2024-05-29 14:08:25] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 1 ms to minimize.
[2024-05-29 14:08:25] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 0 ms to minimize.
[2024-05-29 14:08:25] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 0 ms to minimize.
[2024-05-29 14:08:25] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 1 ms to minimize.
[2024-05-29 14:08:26] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 1 ms to minimize.
[2024-05-29 14:08:26] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 0 ms to minimize.
[2024-05-29 14:08:26] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 1 ms to minimize.
[2024-05-29 14:08:26] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 1 ms to minimize.
[2024-05-29 14:08:26] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 0 ms to minimize.
[2024-05-29 14:08:27] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 1 ms to minimize.
[2024-05-29 14:08:27] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 1 ms to minimize.
[2024-05-29 14:08:27] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 1 ms to minimize.
[2024-05-29 14:08:27] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 0 ms to minimize.
[2024-05-29 14:08:27] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 0 ms to minimize.
[2024-05-29 14:08:27] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 1 ms to minimize.
[2024-05-29 14:08:28] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 1 ms to minimize.
[2024-05-29 14:08:28] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 1 ms to minimize.
[2024-05-29 14:08:28] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:08:30] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 0 ms to minimize.
[2024-05-29 14:08:30] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 0 ms to minimize.
[2024-05-29 14:08:30] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 1 ms to minimize.
[2024-05-29 14:08:30] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 0 ms to minimize.
[2024-05-29 14:08:30] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 1 ms to minimize.
[2024-05-29 14:08:31] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 1 ms to minimize.
[2024-05-29 14:08:31] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 1 ms to minimize.
[2024-05-29 14:08:31] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 1 ms to minimize.
[2024-05-29 14:08:31] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 1 ms to minimize.
[2024-05-29 14:08:31] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 1 ms to minimize.
[2024-05-29 14:08:31] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:08:33] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 1 ms to minimize.
[2024-05-29 14:08:33] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 1 ms to minimize.
[2024-05-29 14:08:34] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 0 ms to minimize.
[2024-05-29 14:08:34] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 1 ms to minimize.
[2024-05-29 14:08:34] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 1 ms to minimize.
[2024-05-29 14:08:34] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 0 ms to minimize.
[2024-05-29 14:08:34] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:08:37] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 0 ms to minimize.
[2024-05-29 14:08:37] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:08:39] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 1 ms to minimize.
[2024-05-29 14:08:39] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 1 ms to minimize.
[2024-05-29 14:08:39] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 1 ms to minimize.
[2024-05-29 14:08:40] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 1 ms to minimize.
[2024-05-29 14:08:40] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 1 ms to minimize.
[2024-05-29 14:08:40] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (OVERLAPS) 511/607 variables, 96/164 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/607 variables, 126/290 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 607/608 variables, and 290 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (OVERLAPS) 511/607 variables, 96/164 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/607 variables, 126/290 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/607 variables, 503/793 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 607/608 variables, and 793 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 66/66 constraints]
After SMT, in 62026ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 62031ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62579 ms. Remains : 96/96 places, 520/520 transitions.
Built C files in :
/tmp/ltsmin1269337382697149645
[2024-05-29 14:09:17] [INFO ] Computing symmetric may disable matrix : 520 transitions.
[2024-05-29 14:09:17] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:09:17] [INFO ] Computing symmetric may enable matrix : 520 transitions.
[2024-05-29 14:09:17] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:09:17] [INFO ] Computing Do-Not-Accords matrix : 520 transitions.
[2024-05-29 14:09:17] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:09:17] [INFO ] Built C files in 87ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1269337382697149645
Running compilation step : cd /tmp/ltsmin1269337382697149645;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1917 ms.
Running link step : cd /tmp/ltsmin1269337382697149645;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin1269337382697149645;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5602765702047869931.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 14:09:32] [INFO ] Flatten gal took : 33 ms
[2024-05-29 14:09:32] [INFO ] Flatten gal took : 33 ms
[2024-05-29 14:09:32] [INFO ] Time to serialize gal into /tmp/LTL4815559157571163615.gal : 5 ms
[2024-05-29 14:09:32] [INFO ] Time to serialize properties into /tmp/LTL15252588260159889938.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4815559157571163615.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10736116602182304.hoa' '-atoms' '/tmp/LTL15252588260159889938.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL15252588260159889938.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10736116602182304.hoa
Detected timeout of ITS tools.
[2024-05-29 14:09:48] [INFO ] Flatten gal took : 34 ms
[2024-05-29 14:09:48] [INFO ] Flatten gal took : 33 ms
[2024-05-29 14:09:48] [INFO ] Time to serialize gal into /tmp/LTL9674686334001761998.gal : 5 ms
[2024-05-29 14:09:48] [INFO ] Time to serialize properties into /tmp/LTL13261387168401301849.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9674686334001761998.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13261387168401301849.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((p1697==0)||(p1779==1))"))))
Formula 0 simplified : GF!"((p1697==0)||(p1779==1))"
Detected timeout of ITS tools.
[2024-05-29 14:10:03] [INFO ] Flatten gal took : 37 ms
[2024-05-29 14:10:03] [INFO ] Applying decomposition
[2024-05-29 14:10:03] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7337429707210627624.txt' '-o' '/tmp/graph7337429707210627624.bin' '-w' '/tmp/graph7337429707210627624.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7337429707210627624.bin' '-l' '-1' '-v' '-w' '/tmp/graph7337429707210627624.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:10:03] [INFO ] Decomposing Gal with order
[2024-05-29 14:10:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:10:03] [INFO ] Removed a total of 2742 redundant transitions.
[2024-05-29 14:10:03] [INFO ] Flatten gal took : 41 ms
[2024-05-29 14:10:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 9 ms.
[2024-05-29 14:10:03] [INFO ] Time to serialize gal into /tmp/LTL5367302597351355679.gal : 2 ms
[2024-05-29 14:10:03] [INFO ] Time to serialize properties into /tmp/LTL12293476092677485488.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5367302597351355679.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12293476092677485488.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("((i5.u18.p1697==0)||(i5.u20.p1779==1))"))))
Formula 0 simplified : GF!"((i5.u18.p1697==0)||(i5.u20.p1779==1))"
Detected timeout of ITS tools.
Treatment of property StigmergyCommit-PT-06b-LTLCardinality-15 finished in 276662 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(X((G(p1)&&p0)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(F(p0)))||(p1 U G((G(p0)||p2))))))'
Found a Shortening insensitive property : StigmergyCommit-PT-06b-LTLCardinality-10
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 3 out of 1417 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1417/1417 places, 6027/6027 transitions.
Graph (trivial) has 1412 edges and 1417 vertex of which 119 / 1417 are part of one of the 20 SCC in 1 ms
Free SCC test removed 99 places
Ensure Unique test removed 113 transitions
Reduce isomorphic transitions removed 113 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 976 transitions
Trivial Post-agglo rules discarded 976 transitions
Performed 976 trivial Post agglomeration. Transition count delta: 976
Iterating post reduction 0 with 976 rules applied. Total rules applied 977 place count 1317 transition count 4937
Reduce places removed 976 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 995 rules applied. Total rules applied 1972 place count 341 transition count 4918
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 1980 place count 334 transition count 4917
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1981 place count 333 transition count 4917
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 74 Pre rules applied. Total rules applied 1981 place count 333 transition count 4843
Deduced a syphon composed of 74 places in 2 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 2129 place count 259 transition count 4843
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 2139 place count 249 transition count 4833
Iterating global reduction 4 with 10 rules applied. Total rules applied 2149 place count 249 transition count 4833
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 2151 place count 247 transition count 4831
Iterating global reduction 4 with 2 rules applied. Total rules applied 2153 place count 247 transition count 4831
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2154 place count 247 transition count 4830
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2155 place count 246 transition count 4829
Iterating global reduction 5 with 1 rules applied. Total rules applied 2156 place count 246 transition count 4829
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2157 place count 246 transition count 4828
Performed 55 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 6 with 110 rules applied. Total rules applied 2267 place count 191 transition count 4768
Discarding 41 places :
Symmetric choice reduction at 6 with 41 rule applications. Total rules 2308 place count 150 transition count 616
Iterating global reduction 6 with 41 rules applied. Total rules applied 2349 place count 150 transition count 616
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 2369 place count 150 transition count 596
Discarding 20 places :
Symmetric choice reduction at 7 with 20 rule applications. Total rules 2389 place count 130 transition count 570
Iterating global reduction 7 with 20 rules applied. Total rules applied 2409 place count 130 transition count 570
Discarding 20 places :
Symmetric choice reduction at 7 with 20 rule applications. Total rules 2429 place count 110 transition count 544
Iterating global reduction 7 with 20 rules applied. Total rules applied 2449 place count 110 transition count 544
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 2456 place count 110 transition count 537
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 2480 place count 98 transition count 544
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2481 place count 97 transition count 528
Iterating global reduction 8 with 1 rules applied. Total rules applied 2482 place count 97 transition count 528
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2483 place count 97 transition count 527
Applied a total of 2483 rules in 464 ms. Remains 97 /1417 variables (removed 1320) and now considering 527/6027 (removed 5500) transitions.
[2024-05-29 14:10:19] [INFO ] Flow matrix only has 519 transitions (discarded 8 similar events)
// Phase 1: matrix 519 rows 97 cols
[2024-05-29 14:10:19] [INFO ] Computed 3 invariants in 4 ms
[2024-05-29 14:10:19] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-29 14:10:19] [INFO ] Flow matrix only has 519 transitions (discarded 8 similar events)
[2024-05-29 14:10:19] [INFO ] Invariant cache hit.
[2024-05-29 14:10:19] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 14:10:19] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
Running 510 sub problems to find dead transitions.
[2024-05-29 14:10:19] [INFO ] Flow matrix only has 519 transitions (discarded 8 similar events)
[2024-05-29 14:10:19] [INFO ] Invariant cache hit.
[2024-05-29 14:10:19] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 510 unsolved
[2024-05-29 14:10:24] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 0 ms to minimize.
[2024-05-29 14:10:24] [INFO ] Deduced a trap composed of 21 places in 166 ms of which 0 ms to minimize.
[2024-05-29 14:10:24] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 1 ms to minimize.
[2024-05-29 14:10:24] [INFO ] Deduced a trap composed of 20 places in 154 ms of which 1 ms to minimize.
[2024-05-29 14:10:24] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 0 ms to minimize.
[2024-05-29 14:10:25] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 1 ms to minimize.
[2024-05-29 14:10:25] [INFO ] Deduced a trap composed of 21 places in 255 ms of which 1 ms to minimize.
[2024-05-29 14:10:25] [INFO ] Deduced a trap composed of 21 places in 179 ms of which 1 ms to minimize.
[2024-05-29 14:10:25] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 1 ms to minimize.
[2024-05-29 14:10:25] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 1 ms to minimize.
[2024-05-29 14:10:25] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 1 ms to minimize.
[2024-05-29 14:10:26] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 0 ms to minimize.
[2024-05-29 14:10:26] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 0 ms to minimize.
[2024-05-29 14:10:26] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 0 ms to minimize.
[2024-05-29 14:10:26] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 0 ms to minimize.
[2024-05-29 14:10:26] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 0 ms to minimize.
[2024-05-29 14:10:26] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 1 ms to minimize.
[2024-05-29 14:10:28] [INFO ] Deduced a trap composed of 16 places in 427 ms of which 1 ms to minimize.
[2024-05-29 14:10:28] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 1 ms to minimize.
[2024-05-29 14:10:28] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 510 unsolved
[2024-05-29 14:10:30] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 1 ms to minimize.
[2024-05-29 14:10:30] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 1 ms to minimize.
[2024-05-29 14:10:30] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 1 ms to minimize.
[2024-05-29 14:10:30] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 1 ms to minimize.
[2024-05-29 14:10:31] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 1 ms to minimize.
[2024-05-29 14:10:31] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 0 ms to minimize.
[2024-05-29 14:10:31] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 1 ms to minimize.
[2024-05-29 14:10:32] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 6 (OVERLAPS) 518/615 variables, 97/128 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/615 variables, 126/254 constraints. Problems are: Problem set: 0 solved, 510 unsolved
[2024-05-29 14:10:41] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 1 ms to minimize.
[2024-05-29 14:10:41] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 1 ms to minimize.
[2024-05-29 14:10:42] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 1 ms to minimize.
[2024-05-29 14:10:42] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 1 ms to minimize.
[2024-05-29 14:10:42] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 0 ms to minimize.
[2024-05-29 14:10:42] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 1 ms to minimize.
[2024-05-29 14:10:42] [INFO ] Deduced a trap composed of 29 places in 163 ms of which 1 ms to minimize.
[2024-05-29 14:10:42] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 1 ms to minimize.
[2024-05-29 14:10:43] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 0 ms to minimize.
[2024-05-29 14:10:43] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 1 ms to minimize.
[2024-05-29 14:10:43] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 1 ms to minimize.
[2024-05-29 14:10:43] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 1 ms to minimize.
[2024-05-29 14:10:43] [INFO ] Deduced a trap composed of 33 places in 144 ms of which 0 ms to minimize.
[2024-05-29 14:10:43] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 1 ms to minimize.
[2024-05-29 14:10:44] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 1 ms to minimize.
[2024-05-29 14:10:44] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 1 ms to minimize.
[2024-05-29 14:10:44] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 1 ms to minimize.
[2024-05-29 14:10:44] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 1 ms to minimize.
[2024-05-29 14:10:44] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 1 ms to minimize.
[2024-05-29 14:10:44] [INFO ] Deduced a trap composed of 23 places in 202 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/615 variables, 20/274 constraints. Problems are: Problem set: 0 solved, 510 unsolved
[2024-05-29 14:10:50] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 1 ms to minimize.
[2024-05-29 14:10:50] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 1 ms to minimize.
[2024-05-29 14:10:50] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 1 ms to minimize.
[2024-05-29 14:10:50] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/615 variables, 4/278 constraints. Problems are: Problem set: 0 solved, 510 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/616 variables, and 278 constraints, problems are : Problem set: 0 solved, 510 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 510/510 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 510 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 510 unsolved
[2024-05-29 14:10:53] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 1 ms to minimize.
[2024-05-29 14:10:53] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 0 ms to minimize.
[2024-05-29 14:10:55] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 510 unsolved
[2024-05-29 14:10:56] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 510 unsolved
[2024-05-29 14:10:58] [INFO ] Deduced a trap composed of 21 places in 151 ms of which 1 ms to minimize.
[2024-05-29 14:10:58] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 8 (OVERLAPS) 518/615 variables, 97/158 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/615 variables, 126/284 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/615 variables, 510/794 constraints. Problems are: Problem set: 0 solved, 510 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 615/616 variables, and 794 constraints, problems are : Problem set: 0 solved, 510 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 510/510 constraints, Known Traps: 58/58 constraints]
After SMT, in 62068ms problems are : Problem set: 0 solved, 510 unsolved
Search for dead transitions found 0 dead transitions in 62074ms
Starting structural reductions in LI_LTL mode, iteration 1 : 97/1417 places, 527/6027 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 63081 ms. Remains : 97/1417 places, 527/6027 transitions.
Running random walk in product with property : StigmergyCommit-PT-06b-LTLCardinality-10
Product exploration explored 100000 steps with 10406 reset in 247 ms.
Product exploration explored 100000 steps with 10444 reset in 234 ms.
Computed a total of 5 stabilizing places and 23 stable transitions
Computed a total of 5 stabilizing places and 23 stable transitions
Detected a total of 5/97 stabilizing places and 23/527 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 197 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (3144 resets) in 185 ms. (215 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (295 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (301 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
[2024-05-29 14:11:22] [INFO ] Flow matrix only has 519 transitions (discarded 8 similar events)
[2024-05-29 14:11:22] [INFO ] Invariant cache hit.
[2024-05-29 14:11:22] [INFO ] State equation strengthened by 127 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 92/95 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 517/612 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 126/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/612 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3/615 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/615 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/615 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/616 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/616 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/616 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 616/616 variables, and 227 constraints, problems are : Problem set: 0 solved, 2 unsolved in 243 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 127/127 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 92/95 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 14:11:23] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 1 ms to minimize.
[2024-05-29 14:11:23] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 0 ms to minimize.
[2024-05-29 14:11:23] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 0 ms to minimize.
[2024-05-29 14:11:23] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 1 ms to minimize.
[2024-05-29 14:11:24] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 0 ms to minimize.
[2024-05-29 14:11:24] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 517/612 variables, 95/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/612 variables, 126/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/612 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/612 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/615 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/615 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/615 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/616 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/616 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/616 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 616/616 variables, and 235 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1223 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 1514ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 37 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=18 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p2 (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (AND (NOT p0) p2)))]
Knowledge based reduction with 4 factoid took 304 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 527/527 transitions.
Applied a total of 0 rules in 2 ms. Remains 97 /97 variables (removed 0) and now considering 527/527 (removed 0) transitions.
[2024-05-29 14:11:25] [INFO ] Flow matrix only has 519 transitions (discarded 8 similar events)
[2024-05-29 14:11:25] [INFO ] Invariant cache hit.
[2024-05-29 14:11:25] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-29 14:11:25] [INFO ] Flow matrix only has 519 transitions (discarded 8 similar events)
[2024-05-29 14:11:25] [INFO ] Invariant cache hit.
[2024-05-29 14:11:25] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 14:11:25] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
Running 510 sub problems to find dead transitions.
[2024-05-29 14:11:25] [INFO ] Flow matrix only has 519 transitions (discarded 8 similar events)
[2024-05-29 14:11:25] [INFO ] Invariant cache hit.
[2024-05-29 14:11:25] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 510 unsolved
[2024-05-29 14:11:29] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 1 ms to minimize.
[2024-05-29 14:11:30] [INFO ] Deduced a trap composed of 21 places in 416 ms of which 0 ms to minimize.
[2024-05-29 14:11:31] [INFO ] Deduced a trap composed of 22 places in 1030 ms of which 0 ms to minimize.
[2024-05-29 14:11:31] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 0 ms to minimize.
[2024-05-29 14:11:31] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 0 ms to minimize.
[2024-05-29 14:11:31] [INFO ] Deduced a trap composed of 20 places in 177 ms of which 1 ms to minimize.
[2024-05-29 14:11:31] [INFO ] Deduced a trap composed of 21 places in 161 ms of which 1 ms to minimize.
[2024-05-29 14:11:32] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 0 ms to minimize.
[2024-05-29 14:11:32] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 0 ms to minimize.
[2024-05-29 14:11:32] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 1 ms to minimize.
[2024-05-29 14:11:32] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 1 ms to minimize.
[2024-05-29 14:11:32] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 0 ms to minimize.
[2024-05-29 14:11:32] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 1 ms to minimize.
[2024-05-29 14:11:33] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 1 ms to minimize.
[2024-05-29 14:11:33] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 1 ms to minimize.
[2024-05-29 14:11:33] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 1 ms to minimize.
[2024-05-29 14:11:33] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 1 ms to minimize.
[2024-05-29 14:11:34] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 1 ms to minimize.
[2024-05-29 14:11:34] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 1 ms to minimize.
[2024-05-29 14:11:34] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 510 unsolved
[2024-05-29 14:11:36] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 1 ms to minimize.
[2024-05-29 14:11:36] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 1 ms to minimize.
[2024-05-29 14:11:36] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 1 ms to minimize.
[2024-05-29 14:11:37] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 1 ms to minimize.
[2024-05-29 14:11:37] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 1 ms to minimize.
[2024-05-29 14:11:37] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 1 ms to minimize.
[2024-05-29 14:11:37] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 1 ms to minimize.
[2024-05-29 14:11:38] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 6 (OVERLAPS) 518/615 variables, 97/128 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/615 variables, 126/254 constraints. Problems are: Problem set: 0 solved, 510 unsolved
[2024-05-29 14:11:48] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 1 ms to minimize.
[2024-05-29 14:11:48] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 0 ms to minimize.
[2024-05-29 14:11:49] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 1 ms to minimize.
[2024-05-29 14:11:49] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 0 ms to minimize.
[2024-05-29 14:11:49] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 0 ms to minimize.
[2024-05-29 14:11:49] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 1 ms to minimize.
[2024-05-29 14:11:49] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 0 ms to minimize.
[2024-05-29 14:11:49] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 1 ms to minimize.
[2024-05-29 14:11:50] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 0 ms to minimize.
[2024-05-29 14:11:50] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 0 ms to minimize.
[2024-05-29 14:11:50] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 1 ms to minimize.
[2024-05-29 14:11:50] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 1 ms to minimize.
[2024-05-29 14:11:50] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 1 ms to minimize.
[2024-05-29 14:11:50] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 1 ms to minimize.
[2024-05-29 14:11:51] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 1 ms to minimize.
[2024-05-29 14:11:51] [INFO ] Deduced a trap composed of 21 places in 154 ms of which 1 ms to minimize.
[2024-05-29 14:11:51] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 1 ms to minimize.
[2024-05-29 14:11:51] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 0 ms to minimize.
[2024-05-29 14:11:51] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 0 ms to minimize.
[2024-05-29 14:11:51] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/615 variables, 20/274 constraints. Problems are: Problem set: 0 solved, 510 unsolved
[2024-05-29 14:11:56] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 1 ms to minimize.
[2024-05-29 14:11:56] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 1 ms to minimize.
[2024-05-29 14:11:56] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 1 ms to minimize.
[2024-05-29 14:11:56] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/615 variables, 4/278 constraints. Problems are: Problem set: 0 solved, 510 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/616 variables, and 278 constraints, problems are : Problem set: 0 solved, 510 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 510/510 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 510 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 510 unsolved
[2024-05-29 14:11:59] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 1 ms to minimize.
[2024-05-29 14:11:59] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 0 ms to minimize.
[2024-05-29 14:12:00] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 510 unsolved
[2024-05-29 14:12:02] [INFO ] Deduced a trap composed of 25 places in 179 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 510 unsolved
[2024-05-29 14:12:04] [INFO ] Deduced a trap composed of 21 places in 281 ms of which 0 ms to minimize.
[2024-05-29 14:12:04] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 8 (OVERLAPS) 518/615 variables, 97/158 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/615 variables, 126/284 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/615 variables, 510/794 constraints. Problems are: Problem set: 0 solved, 510 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 615/616 variables, and 794 constraints, problems are : Problem set: 0 solved, 510 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 510/510 constraints, Known Traps: 58/58 constraints]
After SMT, in 62077ms problems are : Problem set: 0 solved, 510 unsolved
Search for dead transitions found 0 dead transitions in 62081ms
Finished structural reductions in LTL mode , in 1 iterations and 62600 ms. Remains : 97/97 places, 527/527 transitions.
Computed a total of 5 stabilizing places and 23 stable transitions
Computed a total of 5 stabilizing places and 23 stable transitions
Detected a total of 5/97 stabilizing places and 23/527 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 202 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (3098 resets) in 565 ms. (70 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (287 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (287 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
[2024-05-29 14:12:28] [INFO ] Flow matrix only has 519 transitions (discarded 8 similar events)
[2024-05-29 14:12:28] [INFO ] Invariant cache hit.
[2024-05-29 14:12:28] [INFO ] State equation strengthened by 127 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 92/95 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 517/612 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 126/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/612 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3/615 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/615 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/615 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/616 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/616 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/616 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 616/616 variables, and 227 constraints, problems are : Problem set: 0 solved, 2 unsolved in 244 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 127/127 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 92/95 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 14:12:28] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 1 ms to minimize.
[2024-05-29 14:12:28] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 0 ms to minimize.
[2024-05-29 14:12:28] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 1 ms to minimize.
[2024-05-29 14:12:29] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 1 ms to minimize.
[2024-05-29 14:12:29] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 1 ms to minimize.
[2024-05-29 14:12:29] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 517/612 variables, 95/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/612 variables, 126/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/612 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/612 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/615 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/615 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/615 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/616 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/616 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/616 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 616/616 variables, and 235 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1264 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 1567ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 37 steps, including 1 resets, run visited all 2 properties in 1 ms. (steps per millisecond=37 )
Parikh walk visited 2 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p2), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (AND (NOT p0) p2)))]
Knowledge based reduction with 4 factoid took 288 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 10511 reset in 225 ms.
Product exploration explored 100000 steps with 10543 reset in 234 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 527/527 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 97 transition count 520
Applied a total of 7 rules in 29 ms. Remains 97 /97 variables (removed 0) and now considering 520/527 (removed 7) transitions.
[2024-05-29 14:12:31] [INFO ] Redundant transitions in 2 ms returned []
Running 503 sub problems to find dead transitions.
[2024-05-29 14:12:31] [INFO ] Flow matrix only has 512 transitions (discarded 8 similar events)
// Phase 1: matrix 512 rows 97 cols
[2024-05-29 14:12:31] [INFO ] Computed 3 invariants in 4 ms
[2024-05-29 14:12:31] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:12:36] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 1 ms to minimize.
[2024-05-29 14:12:36] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 1 ms to minimize.
[2024-05-29 14:12:36] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 0 ms to minimize.
[2024-05-29 14:12:36] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 0 ms to minimize.
[2024-05-29 14:12:36] [INFO ] Deduced a trap composed of 18 places in 160 ms of which 1 ms to minimize.
[2024-05-29 14:12:36] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 1 ms to minimize.
[2024-05-29 14:12:37] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 0 ms to minimize.
[2024-05-29 14:12:37] [INFO ] Deduced a trap composed of 29 places in 164 ms of which 1 ms to minimize.
[2024-05-29 14:12:37] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 1 ms to minimize.
[2024-05-29 14:12:37] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 0 ms to minimize.
[2024-05-29 14:12:37] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 0 ms to minimize.
[2024-05-29 14:12:37] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 1 ms to minimize.
[2024-05-29 14:12:38] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 0 ms to minimize.
[2024-05-29 14:12:38] [INFO ] Deduced a trap composed of 21 places in 163 ms of which 1 ms to minimize.
[2024-05-29 14:12:38] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 1 ms to minimize.
[2024-05-29 14:12:38] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 1 ms to minimize.
[2024-05-29 14:12:38] [INFO ] Deduced a trap composed of 21 places in 261 ms of which 1 ms to minimize.
[2024-05-29 14:12:39] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 0 ms to minimize.
[2024-05-29 14:12:39] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 0 ms to minimize.
[2024-05-29 14:12:39] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:12:40] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 0 ms to minimize.
[2024-05-29 14:12:40] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 1 ms to minimize.
[2024-05-29 14:12:41] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 1 ms to minimize.
[2024-05-29 14:12:41] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 1 ms to minimize.
[2024-05-29 14:12:41] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 1 ms to minimize.
[2024-05-29 14:12:41] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 1 ms to minimize.
[2024-05-29 14:12:42] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 1 ms to minimize.
[2024-05-29 14:12:42] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 1 ms to minimize.
[2024-05-29 14:12:42] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 1 ms to minimize.
[2024-05-29 14:12:42] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 1 ms to minimize.
[2024-05-29 14:12:43] [INFO ] Deduced a trap composed of 16 places in 302 ms of which 1 ms to minimize.
[2024-05-29 14:12:43] [INFO ] Deduced a trap composed of 20 places in 302 ms of which 1 ms to minimize.
[2024-05-29 14:12:44] [INFO ] Deduced a trap composed of 23 places in 531 ms of which 17 ms to minimize.
[2024-05-29 14:12:44] [INFO ] Deduced a trap composed of 20 places in 337 ms of which 0 ms to minimize.
[2024-05-29 14:12:44] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 1 ms to minimize.
[2024-05-29 14:12:44] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 0 ms to minimize.
[2024-05-29 14:12:45] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 1 ms to minimize.
[2024-05-29 14:12:45] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 0 ms to minimize.
[2024-05-29 14:12:45] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 1 ms to minimize.
[2024-05-29 14:12:45] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:12:47] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 0 ms to minimize.
[2024-05-29 14:12:47] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 0 ms to minimize.
[2024-05-29 14:12:47] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:12:49] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 0 ms to minimize.
[2024-05-29 14:12:49] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 0 ms to minimize.
[2024-05-29 14:12:49] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 1 ms to minimize.
[2024-05-29 14:12:49] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 1 ms to minimize.
[2024-05-29 14:12:49] [INFO ] Deduced a trap composed of 32 places in 165 ms of which 1 ms to minimize.
[2024-05-29 14:12:50] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 1 ms to minimize.
[2024-05-29 14:12:50] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:12:52] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 1 ms to minimize.
[2024-05-29 14:12:53] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 0 ms to minimize.
[2024-05-29 14:12:53] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 1 ms to minimize.
[2024-05-29 14:12:53] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 0 ms to minimize.
[2024-05-29 14:12:53] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 1 ms to minimize.
[2024-05-29 14:12:53] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:12:55] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 1 ms to minimize.
[2024-05-29 14:12:55] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 0 ms to minimize.
[2024-05-29 14:12:55] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 0 ms to minimize.
[2024-05-29 14:12:55] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 1 ms to minimize.
[2024-05-29 14:12:56] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 0 ms to minimize.
[2024-05-29 14:12:56] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 1 ms to minimize.
[2024-05-29 14:12:56] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 1 ms to minimize.
[2024-05-29 14:12:56] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:12:58] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/97 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/97 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 511/608 variables, 97/165 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/608 variables, 126/291 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/609 variables, and 291 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 65/65 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 65/68 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 14:13:05] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 0 ms to minimize.
[2024-05-29 14:13:06] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 1 ms to minimize.
[2024-05-29 14:13:06] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 0 ms to minimize.
[2024-05-29 14:13:06] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (OVERLAPS) 511/608 variables, 97/169 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/608 variables, 126/295 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/608 variables, 503/798 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/609 variables, and 798 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 69/69 constraints]
After SMT, in 62081ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 62085ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/97 places, 520/527 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62127 ms. Remains : 97/97 places, 520/527 transitions.
Built C files in :
/tmp/ltsmin7803950200146176543
[2024-05-29 14:13:33] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7803950200146176543
Running compilation step : cd /tmp/ltsmin7803950200146176543;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1462 ms.
Running link step : cd /tmp/ltsmin7803950200146176543;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin7803950200146176543;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16514176414633382924.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 527/527 transitions.
Applied a total of 0 rules in 8 ms. Remains 97 /97 variables (removed 0) and now considering 527/527 (removed 0) transitions.
[2024-05-29 14:13:48] [INFO ] Flow matrix only has 519 transitions (discarded 8 similar events)
// Phase 1: matrix 519 rows 97 cols
[2024-05-29 14:13:48] [INFO ] Computed 3 invariants in 8 ms
[2024-05-29 14:13:48] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-29 14:13:48] [INFO ] Flow matrix only has 519 transitions (discarded 8 similar events)
[2024-05-29 14:13:48] [INFO ] Invariant cache hit.
[2024-05-29 14:13:48] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 14:13:48] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
Running 510 sub problems to find dead transitions.
[2024-05-29 14:13:48] [INFO ] Flow matrix only has 519 transitions (discarded 8 similar events)
[2024-05-29 14:13:48] [INFO ] Invariant cache hit.
[2024-05-29 14:13:48] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 510 unsolved
[2024-05-29 14:13:52] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 1 ms to minimize.
[2024-05-29 14:13:52] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 1 ms to minimize.
[2024-05-29 14:13:53] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 1 ms to minimize.
[2024-05-29 14:13:53] [INFO ] Deduced a trap composed of 20 places in 278 ms of which 1 ms to minimize.
[2024-05-29 14:13:53] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 0 ms to minimize.
[2024-05-29 14:13:53] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 1 ms to minimize.
[2024-05-29 14:13:53] [INFO ] Deduced a trap composed of 21 places in 166 ms of which 1 ms to minimize.
[2024-05-29 14:13:54] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 1 ms to minimize.
[2024-05-29 14:13:54] [INFO ] Deduced a trap composed of 18 places in 155 ms of which 1 ms to minimize.
[2024-05-29 14:13:54] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 1 ms to minimize.
[2024-05-29 14:13:54] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 0 ms to minimize.
[2024-05-29 14:13:54] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 0 ms to minimize.
[2024-05-29 14:13:54] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 1 ms to minimize.
[2024-05-29 14:13:54] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 0 ms to minimize.
[2024-05-29 14:13:55] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 1 ms to minimize.
[2024-05-29 14:13:55] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 1 ms to minimize.
[2024-05-29 14:13:55] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 1 ms to minimize.
[2024-05-29 14:13:56] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 0 ms to minimize.
[2024-05-29 14:13:56] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 0 ms to minimize.
[2024-05-29 14:13:56] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 510 unsolved
[2024-05-29 14:13:58] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 1 ms to minimize.
[2024-05-29 14:13:58] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 1 ms to minimize.
[2024-05-29 14:13:58] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 1 ms to minimize.
[2024-05-29 14:13:58] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 0 ms to minimize.
[2024-05-29 14:13:58] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 1 ms to minimize.
[2024-05-29 14:13:59] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 1 ms to minimize.
[2024-05-29 14:13:59] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 0 ms to minimize.
[2024-05-29 14:14:00] [INFO ] Deduced a trap composed of 32 places in 150 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 6 (OVERLAPS) 518/615 variables, 97/128 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/615 variables, 126/254 constraints. Problems are: Problem set: 0 solved, 510 unsolved
[2024-05-29 14:14:09] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 0 ms to minimize.
[2024-05-29 14:14:09] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 1 ms to minimize.
[2024-05-29 14:14:09] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 0 ms to minimize.
[2024-05-29 14:14:09] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 1 ms to minimize.
[2024-05-29 14:14:09] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 0 ms to minimize.
[2024-05-29 14:14:10] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 1 ms to minimize.
[2024-05-29 14:14:10] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 0 ms to minimize.
[2024-05-29 14:14:10] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 1 ms to minimize.
[2024-05-29 14:14:10] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 0 ms to minimize.
[2024-05-29 14:14:10] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 1 ms to minimize.
[2024-05-29 14:14:10] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 1 ms to minimize.
[2024-05-29 14:14:11] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 1 ms to minimize.
[2024-05-29 14:14:11] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 1 ms to minimize.
[2024-05-29 14:14:11] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 0 ms to minimize.
[2024-05-29 14:14:11] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 1 ms to minimize.
[2024-05-29 14:14:11] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 1 ms to minimize.
[2024-05-29 14:14:11] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 1 ms to minimize.
[2024-05-29 14:14:12] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 1 ms to minimize.
[2024-05-29 14:14:12] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 1 ms to minimize.
[2024-05-29 14:14:12] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/615 variables, 20/274 constraints. Problems are: Problem set: 0 solved, 510 unsolved
[2024-05-29 14:14:16] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 1 ms to minimize.
[2024-05-29 14:14:17] [INFO ] Deduced a trap composed of 30 places in 157 ms of which 1 ms to minimize.
[2024-05-29 14:14:17] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 1 ms to minimize.
[2024-05-29 14:14:17] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/615 variables, 4/278 constraints. Problems are: Problem set: 0 solved, 510 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/616 variables, and 278 constraints, problems are : Problem set: 0 solved, 510 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 510/510 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 510 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 510 unsolved
[2024-05-29 14:14:22] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 1 ms to minimize.
[2024-05-29 14:14:22] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 1 ms to minimize.
[2024-05-29 14:14:23] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 510 unsolved
[2024-05-29 14:14:25] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 510 unsolved
[2024-05-29 14:14:27] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 1 ms to minimize.
[2024-05-29 14:14:27] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 8 (OVERLAPS) 518/615 variables, 97/158 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/615 variables, 126/284 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/615 variables, 510/794 constraints. Problems are: Problem set: 0 solved, 510 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 615/616 variables, and 794 constraints, problems are : Problem set: 0 solved, 510 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 510/510 constraints, Known Traps: 58/58 constraints]
After SMT, in 61797ms problems are : Problem set: 0 solved, 510 unsolved
Search for dead transitions found 0 dead transitions in 61802ms
Finished structural reductions in LTL mode , in 1 iterations and 62354 ms. Remains : 97/97 places, 527/527 transitions.
Built C files in :
/tmp/ltsmin14966753940591383850
[2024-05-29 14:14:50] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14966753940591383850
Running compilation step : cd /tmp/ltsmin14966753940591383850;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1400 ms.
Running link step : cd /tmp/ltsmin14966753940591383850;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin14966753940591383850;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16358448411650379972.hoa' '--buchi-type=spotba'
LTSmin run took 7465 ms.
Treatment of property StigmergyCommit-PT-06b-LTLCardinality-10 finished in 280836 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
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(X((X(p0) U p1))))))'
Found a Lengthening insensitive property : StigmergyCommit-PT-06b-LTLCardinality-12
Stuttering acceptance computed with spot in 229 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), true]
Support contains 4 out of 1417 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1417/1417 places, 6027/6027 transitions.
Graph (trivial) has 1411 edges and 1417 vertex of which 122 / 1417 are part of one of the 21 SCC in 1 ms
Free SCC test removed 101 places
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 973 transitions
Trivial Post-agglo rules discarded 973 transitions
Performed 973 trivial Post agglomeration. Transition count delta: 973
Iterating post reduction 0 with 973 rules applied. Total rules applied 974 place count 1315 transition count 4938
Reduce places removed 973 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 992 rules applied. Total rules applied 1966 place count 342 transition count 4919
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 1974 place count 335 transition count 4918
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1975 place count 334 transition count 4918
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 73 Pre rules applied. Total rules applied 1975 place count 334 transition count 4845
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 2121 place count 261 transition count 4845
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 2130 place count 252 transition count 4836
Iterating global reduction 4 with 9 rules applied. Total rules applied 2139 place count 252 transition count 4836
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 2141 place count 250 transition count 4834
Iterating global reduction 4 with 2 rules applied. Total rules applied 2143 place count 250 transition count 4834
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2144 place count 250 transition count 4833
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2145 place count 249 transition count 4832
Iterating global reduction 5 with 1 rules applied. Total rules applied 2146 place count 249 transition count 4832
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2147 place count 249 transition count 4831
Performed 56 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 6 with 112 rules applied. Total rules applied 2259 place count 193 transition count 4771
Discarding 40 places :
Symmetric choice reduction at 6 with 40 rule applications. Total rules 2299 place count 153 transition count 620
Iterating global reduction 6 with 40 rules applied. Total rules applied 2339 place count 153 transition count 620
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 2358 place count 153 transition count 601
Discarding 21 places :
Symmetric choice reduction at 7 with 21 rule applications. Total rules 2379 place count 132 transition count 573
Iterating global reduction 7 with 21 rules applied. Total rules applied 2400 place count 132 transition count 573
Discarding 21 places :
Symmetric choice reduction at 7 with 21 rule applications. Total rules 2421 place count 111 transition count 545
Iterating global reduction 7 with 21 rules applied. Total rules applied 2442 place count 111 transition count 545
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 2448 place count 111 transition count 539
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 2470 place count 100 transition count 553
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2471 place count 99 transition count 539
Iterating global reduction 8 with 1 rules applied. Total rules applied 2472 place count 99 transition count 539
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2473 place count 99 transition count 538
Applied a total of 2473 rules in 462 ms. Remains 99 /1417 variables (removed 1318) and now considering 538/6027 (removed 5489) transitions.
[2024-05-29 14:15:00] [INFO ] Flow matrix only has 530 transitions (discarded 8 similar events)
// Phase 1: matrix 530 rows 99 cols
[2024-05-29 14:15:00] [INFO ] Computed 2 invariants in 6 ms
[2024-05-29 14:15:00] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-29 14:15:00] [INFO ] Flow matrix only has 530 transitions (discarded 8 similar events)
[2024-05-29 14:15:00] [INFO ] Invariant cache hit.
[2024-05-29 14:15:00] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 14:15:00] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
Running 513 sub problems to find dead transitions.
[2024-05-29 14:15:00] [INFO ] Flow matrix only has 530 transitions (discarded 8 similar events)
[2024-05-29 14:15:00] [INFO ] Invariant cache hit.
[2024-05-29 14:15:00] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2024-05-29 14:15:05] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 1 ms to minimize.
[2024-05-29 14:15:05] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 1 ms to minimize.
[2024-05-29 14:15:05] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 1 ms to minimize.
[2024-05-29 14:15:05] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 1 ms to minimize.
[2024-05-29 14:15:06] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 0 ms to minimize.
[2024-05-29 14:15:06] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 1 ms to minimize.
[2024-05-29 14:15:06] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 1 ms to minimize.
[2024-05-29 14:15:06] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 1 ms to minimize.
[2024-05-29 14:15:06] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 1 ms to minimize.
[2024-05-29 14:15:06] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 1 ms to minimize.
[2024-05-29 14:15:07] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 1 ms to minimize.
[2024-05-29 14:15:07] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 1 ms to minimize.
[2024-05-29 14:15:08] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 1 ms to minimize.
[2024-05-29 14:15:08] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 2 ms to minimize.
[2024-05-29 14:15:08] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 1 ms to minimize.
[2024-05-29 14:15:08] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 1 ms to minimize.
[2024-05-29 14:15:08] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 0 ms to minimize.
[2024-05-29 14:15:08] [INFO ] Deduced a trap composed of 64 places in 176 ms of which 0 ms to minimize.
[2024-05-29 14:15:08] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 1 ms to minimize.
[2024-05-29 14:15:09] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2024-05-29 14:15:10] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 1 ms to minimize.
[2024-05-29 14:15:10] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 1 ms to minimize.
[2024-05-29 14:15:10] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 1 ms to minimize.
[2024-05-29 14:15:10] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 1 ms to minimize.
[2024-05-29 14:15:11] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 1 ms to minimize.
[2024-05-29 14:15:11] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 1 ms to minimize.
[2024-05-29 14:15:11] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 1 ms to minimize.
[2024-05-29 14:15:11] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 0 ms to minimize.
[2024-05-29 14:15:11] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 0 ms to minimize.
[2024-05-29 14:15:11] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 0 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 29 places in 155 ms of which 0 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 1 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 29 places in 147 ms of which 1 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 1 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 0 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 0 ms to minimize.
[2024-05-29 14:15:12] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 1 ms to minimize.
[2024-05-29 14:15:13] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 1 ms to minimize.
[2024-05-29 14:15:13] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 1 ms to minimize.
[2024-05-29 14:15:14] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2024-05-29 14:15:15] [INFO ] Deduced a trap composed of 64 places in 154 ms of which 0 ms to minimize.
[2024-05-29 14:15:16] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 0 ms to minimize.
[2024-05-29 14:15:16] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 1 ms to minimize.
[2024-05-29 14:15:16] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 1 ms to minimize.
[2024-05-29 14:15:16] [INFO ] Deduced a trap composed of 20 places in 208 ms of which 1 ms to minimize.
[2024-05-29 14:15:16] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 1 ms to minimize.
[2024-05-29 14:15:17] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 1 ms to minimize.
[2024-05-29 14:15:17] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 1 ms to minimize.
[2024-05-29 14:15:17] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 1 ms to minimize.
[2024-05-29 14:15:17] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 0 ms to minimize.
[2024-05-29 14:15:17] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 0 ms to minimize.
[2024-05-29 14:15:17] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 0 ms to minimize.
[2024-05-29 14:15:17] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 1 ms to minimize.
[2024-05-29 14:15:17] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 0 ms to minimize.
[2024-05-29 14:15:18] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 1 ms to minimize.
[2024-05-29 14:15:18] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 0 ms to minimize.
[2024-05-29 14:15:18] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 0 ms to minimize.
[2024-05-29 14:15:18] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 1 ms to minimize.
[2024-05-29 14:15:18] [INFO ] Deduced a trap composed of 27 places in 166 ms of which 1 ms to minimize.
[2024-05-29 14:15:18] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2024-05-29 14:15:20] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 0 ms to minimize.
[2024-05-29 14:15:20] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 0 ms to minimize.
[2024-05-29 14:15:20] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 0 ms to minimize.
[2024-05-29 14:15:21] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 1 ms to minimize.
[2024-05-29 14:15:21] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 1 ms to minimize.
[2024-05-29 14:15:21] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 1 ms to minimize.
[2024-05-29 14:15:21] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 1 ms to minimize.
[2024-05-29 14:15:21] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 0 ms to minimize.
[2024-05-29 14:15:21] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 1 ms to minimize.
[2024-05-29 14:15:21] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 1 ms to minimize.
[2024-05-29 14:15:22] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 0 ms to minimize.
[2024-05-29 14:15:22] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 1 ms to minimize.
[2024-05-29 14:15:22] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 1 ms to minimize.
[2024-05-29 14:15:22] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 0 ms to minimize.
[2024-05-29 14:15:22] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 1 ms to minimize.
[2024-05-29 14:15:22] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 1 ms to minimize.
[2024-05-29 14:15:23] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 0 ms to minimize.
[2024-05-29 14:15:23] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 1 ms to minimize.
[2024-05-29 14:15:23] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 1 ms to minimize.
[2024-05-29 14:15:23] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2024-05-29 14:15:24] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 1 ms to minimize.
[2024-05-29 14:15:25] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 1 ms to minimize.
[2024-05-29 14:15:26] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 1 ms to minimize.
[2024-05-29 14:15:27] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 1 ms to minimize.
[2024-05-29 14:15:27] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 1 ms to minimize.
[2024-05-29 14:15:27] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 1 ms to minimize.
[2024-05-29 14:15:27] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 7/89 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 9 (OVERLAPS) 529/628 variables, 99/188 constraints. Problems are: Problem set: 0 solved, 513 unsolved
SMT process timed out in 31876ms, After SMT, problems are : Problem set: 0 solved, 513 unsolved
Search for dead transitions found 0 dead transitions in 31883ms
Starting structural reductions in LI_LTL mode, iteration 1 : 99/1417 places, 538/6027 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 32892 ms. Remains : 99/1417 places, 538/6027 transitions.
Running random walk in product with property : StigmergyCommit-PT-06b-LTLCardinality-12
Product exploration explored 100000 steps with 9681 reset in 240 ms.
Product exploration explored 100000 steps with 9675 reset in 244 ms.
Computed a total of 6 stabilizing places and 32 stable transitions
Computed a total of 6 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 104 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), true]
RANDOM walk for 40000 steps (2568 resets) in 129 ms. (307 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (270 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
[2024-05-29 14:15:33] [INFO ] Flow matrix only has 530 transitions (discarded 8 similar events)
[2024-05-29 14:15:33] [INFO ] Invariant cache hit.
[2024-05-29 14:15:33] [INFO ] State equation strengthened by 127 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 94/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 527/623 variables, 96/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/623 variables, 126/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/623 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/628 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/628 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/628 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/629 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/629 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/629 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 629/629 variables, and 228 constraints, problems are : Problem set: 0 solved, 1 unsolved in 223 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 127/127 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 94/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 14:15:34] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 0 ms to minimize.
[2024-05-29 14:15:34] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 1 ms to minimize.
[2024-05-29 14:15:34] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 1 ms to minimize.
[2024-05-29 14:15:34] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 1 ms to minimize.
[2024-05-29 14:15:34] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 1 ms to minimize.
[2024-05-29 14:15:34] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 0 ms to minimize.
[2024-05-29 14:15:34] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 0 ms to minimize.
[2024-05-29 14:15:35] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 0 ms to minimize.
[2024-05-29 14:15:35] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 1 ms to minimize.
[2024-05-29 14:15:35] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 0 ms to minimize.
[2024-05-29 14:15:35] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 0 ms to minimize.
[2024-05-29 14:15:35] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 0 ms to minimize.
[2024-05-29 14:15:35] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 1 ms to minimize.
[2024-05-29 14:15:35] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 527/623 variables, 96/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/623 variables, 126/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/623 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/623 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/628 variables, 3/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/628 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/628 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/629 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/629 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/629 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 629/629 variables, and 243 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2113 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 14/14 constraints]
After SMT, in 2360ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 126 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=126 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 222 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), true]
Support contains 4 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 538/538 transitions.
Applied a total of 0 rules in 4 ms. Remains 99 /99 variables (removed 0) and now considering 538/538 (removed 0) transitions.
[2024-05-29 14:15:36] [INFO ] Flow matrix only has 530 transitions (discarded 8 similar events)
[2024-05-29 14:15:36] [INFO ] Invariant cache hit.
[2024-05-29 14:15:36] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-29 14:15:36] [INFO ] Flow matrix only has 530 transitions (discarded 8 similar events)
[2024-05-29 14:15:36] [INFO ] Invariant cache hit.
[2024-05-29 14:15:36] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 14:15:37] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
Running 513 sub problems to find dead transitions.
[2024-05-29 14:15:37] [INFO ] Flow matrix only has 530 transitions (discarded 8 similar events)
[2024-05-29 14:15:37] [INFO ] Invariant cache hit.
[2024-05-29 14:15:37] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2024-05-29 14:15:41] [INFO ] Deduced a trap composed of 21 places in 378 ms of which 1 ms to minimize.
[2024-05-29 14:15:41] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 1 ms to minimize.
[2024-05-29 14:15:41] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 1 ms to minimize.
[2024-05-29 14:15:42] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 0 ms to minimize.
[2024-05-29 14:15:42] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 0 ms to minimize.
[2024-05-29 14:15:42] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 0 ms to minimize.
[2024-05-29 14:15:42] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 1 ms to minimize.
[2024-05-29 14:15:42] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 1 ms to minimize.
[2024-05-29 14:15:42] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 0 ms to minimize.
[2024-05-29 14:15:42] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 1 ms to minimize.
[2024-05-29 14:15:43] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 1 ms to minimize.
[2024-05-29 14:15:43] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 1 ms to minimize.
[2024-05-29 14:15:44] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 1 ms to minimize.
[2024-05-29 14:15:44] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 0 ms to minimize.
[2024-05-29 14:15:44] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 1 ms to minimize.
[2024-05-29 14:15:44] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 1 ms to minimize.
[2024-05-29 14:15:44] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 1 ms to minimize.
[2024-05-29 14:15:44] [INFO ] Deduced a trap composed of 64 places in 163 ms of which 0 ms to minimize.
[2024-05-29 14:15:44] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 1 ms to minimize.
[2024-05-29 14:15:45] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2024-05-29 14:15:46] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 1 ms to minimize.
[2024-05-29 14:15:46] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 0 ms to minimize.
[2024-05-29 14:15:46] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 0 ms to minimize.
[2024-05-29 14:15:46] [INFO ] Deduced a trap composed of 20 places in 173 ms of which 1 ms to minimize.
[2024-05-29 14:15:46] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 1 ms to minimize.
[2024-05-29 14:15:47] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 0 ms to minimize.
[2024-05-29 14:15:47] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 0 ms to minimize.
[2024-05-29 14:15:47] [INFO ] Deduced a trap composed of 26 places in 160 ms of which 1 ms to minimize.
[2024-05-29 14:15:47] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 1 ms to minimize.
[2024-05-29 14:15:47] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 1 ms to minimize.
[2024-05-29 14:15:47] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 1 ms to minimize.
[2024-05-29 14:15:48] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 0 ms to minimize.
[2024-05-29 14:15:48] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 1 ms to minimize.
[2024-05-29 14:15:48] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 1 ms to minimize.
[2024-05-29 14:15:48] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 1 ms to minimize.
[2024-05-29 14:15:48] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 0 ms to minimize.
[2024-05-29 14:15:48] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 1 ms to minimize.
[2024-05-29 14:15:48] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 1 ms to minimize.
[2024-05-29 14:15:49] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 1 ms to minimize.
[2024-05-29 14:15:50] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2024-05-29 14:15:51] [INFO ] Deduced a trap composed of 64 places in 175 ms of which 1 ms to minimize.
[2024-05-29 14:15:52] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 0 ms to minimize.
[2024-05-29 14:15:52] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 1 ms to minimize.
[2024-05-29 14:15:52] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 1 ms to minimize.
[2024-05-29 14:15:52] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 1 ms to minimize.
[2024-05-29 14:15:52] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 1 ms to minimize.
[2024-05-29 14:15:52] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 1 ms to minimize.
[2024-05-29 14:15:52] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 0 ms to minimize.
[2024-05-29 14:15:53] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 0 ms to minimize.
[2024-05-29 14:15:53] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 1 ms to minimize.
[2024-05-29 14:15:53] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 1 ms to minimize.
[2024-05-29 14:15:53] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 0 ms to minimize.
[2024-05-29 14:15:53] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 1 ms to minimize.
[2024-05-29 14:15:53] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 1 ms to minimize.
[2024-05-29 14:15:53] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 0 ms to minimize.
[2024-05-29 14:15:54] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 0 ms to minimize.
[2024-05-29 14:15:54] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 1 ms to minimize.
[2024-05-29 14:15:54] [INFO ] Deduced a trap composed of 29 places in 170 ms of which 1 ms to minimize.
[2024-05-29 14:15:54] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 0 ms to minimize.
[2024-05-29 14:15:54] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2024-05-29 14:15:56] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 1 ms to minimize.
[2024-05-29 14:15:56] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 1 ms to minimize.
[2024-05-29 14:15:57] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 1 ms to minimize.
[2024-05-29 14:15:57] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 0 ms to minimize.
[2024-05-29 14:15:57] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 1 ms to minimize.
[2024-05-29 14:15:57] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 1 ms to minimize.
[2024-05-29 14:15:57] [INFO ] Deduced a trap composed of 25 places in 212 ms of which 1 ms to minimize.
[2024-05-29 14:15:57] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 0 ms to minimize.
[2024-05-29 14:15:58] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 1 ms to minimize.
[2024-05-29 14:15:58] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 0 ms to minimize.
[2024-05-29 14:15:58] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 1 ms to minimize.
[2024-05-29 14:15:58] [INFO ] Deduced a trap composed of 32 places in 163 ms of which 1 ms to minimize.
[2024-05-29 14:15:58] [INFO ] Deduced a trap composed of 34 places in 169 ms of which 1 ms to minimize.
[2024-05-29 14:15:58] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 0 ms to minimize.
[2024-05-29 14:15:59] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 1 ms to minimize.
[2024-05-29 14:15:59] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 0 ms to minimize.
[2024-05-29 14:15:59] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 0 ms to minimize.
[2024-05-29 14:15:59] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 1 ms to minimize.
[2024-05-29 14:15:59] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 1 ms to minimize.
[2024-05-29 14:15:59] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2024-05-29 14:16:01] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 1 ms to minimize.
[2024-05-29 14:16:01] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 0 ms to minimize.
[2024-05-29 14:16:03] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 0 ms to minimize.
[2024-05-29 14:16:03] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 1 ms to minimize.
[2024-05-29 14:16:03] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 0 ms to minimize.
[2024-05-29 14:16:03] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 1 ms to minimize.
[2024-05-29 14:16:03] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 7/89 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 9 (OVERLAPS) 529/628 variables, 99/188 constraints. Problems are: Problem set: 0 solved, 513 unsolved
SMT process timed out in 31787ms, After SMT, problems are : Problem set: 0 solved, 513 unsolved
Search for dead transitions found 0 dead transitions in 31793ms
Finished structural reductions in LTL mode , in 1 iterations and 32322 ms. Remains : 99/99 places, 538/538 transitions.
Computed a total of 6 stabilizing places and 32 stable transitions
Computed a total of 6 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 75 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), true]
RANDOM walk for 40000 steps (2594 resets) in 153 ms. (259 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (272 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
[2024-05-29 14:16:09] [INFO ] Flow matrix only has 530 transitions (discarded 8 similar events)
[2024-05-29 14:16:09] [INFO ] Invariant cache hit.
[2024-05-29 14:16:09] [INFO ] State equation strengthened by 127 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 94/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 527/623 variables, 96/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/623 variables, 126/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/623 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/628 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/628 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/628 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/629 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/629 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/629 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 629/629 variables, and 228 constraints, problems are : Problem set: 0 solved, 1 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 127/127 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 94/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 14:16:09] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 2 ms to minimize.
[2024-05-29 14:16:09] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 1 ms to minimize.
[2024-05-29 14:16:10] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 1 ms to minimize.
[2024-05-29 14:16:10] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 1 ms to minimize.
[2024-05-29 14:16:10] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 0 ms to minimize.
[2024-05-29 14:16:10] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 1 ms to minimize.
[2024-05-29 14:16:10] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 1 ms to minimize.
[2024-05-29 14:16:10] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 1 ms to minimize.
[2024-05-29 14:16:10] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 1 ms to minimize.
[2024-05-29 14:16:11] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 1 ms to minimize.
[2024-05-29 14:16:11] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 0 ms to minimize.
[2024-05-29 14:16:11] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 1 ms to minimize.
[2024-05-29 14:16:11] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 1 ms to minimize.
[2024-05-29 14:16:11] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 527/623 variables, 96/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/623 variables, 126/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/623 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/623 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/628 variables, 3/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/628 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/628 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/629 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/629 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/629 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 629/629 variables, and 243 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2206 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 14/14 constraints]
After SMT, in 2464ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 844 steps, including 27 resets, run visited all 1 properties in 4 ms. (steps per millisecond=211 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 150 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 227 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), true]
Product exploration explored 100000 steps with 9693 reset in 238 ms.
Product exploration explored 100000 steps with 9705 reset in 243 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), true]
Support contains 4 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 538/538 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 99 transition count 531
Applied a total of 7 rules in 37 ms. Remains 99 /99 variables (removed 0) and now considering 531/538 (removed 7) transitions.
[2024-05-29 14:16:13] [INFO ] Redundant transitions in 4 ms returned []
Running 506 sub problems to find dead transitions.
[2024-05-29 14:16:13] [INFO ] Flow matrix only has 523 transitions (discarded 8 similar events)
// Phase 1: matrix 523 rows 99 cols
[2024-05-29 14:16:13] [INFO ] Computed 2 invariants in 6 ms
[2024-05-29 14:16:13] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 506 unsolved
[2024-05-29 14:16:18] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 1 ms to minimize.
[2024-05-29 14:16:18] [INFO ] Deduced a trap composed of 22 places in 258 ms of which 1 ms to minimize.
[2024-05-29 14:16:18] [INFO ] Deduced a trap composed of 64 places in 193 ms of which 1 ms to minimize.
[2024-05-29 14:16:18] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 0 ms to minimize.
[2024-05-29 14:16:19] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 1 ms to minimize.
[2024-05-29 14:16:19] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 1 ms to minimize.
[2024-05-29 14:16:19] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 0 ms to minimize.
[2024-05-29 14:16:19] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 1 ms to minimize.
[2024-05-29 14:16:19] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 1 ms to minimize.
[2024-05-29 14:16:19] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 1 ms to minimize.
[2024-05-29 14:16:19] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 1 ms to minimize.
[2024-05-29 14:16:20] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 1 ms to minimize.
[2024-05-29 14:16:20] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 1 ms to minimize.
[2024-05-29 14:16:20] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 1 ms to minimize.
[2024-05-29 14:16:20] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 1 ms to minimize.
[2024-05-29 14:16:20] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 1 ms to minimize.
[2024-05-29 14:16:20] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 0 ms to minimize.
[2024-05-29 14:16:21] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 1 ms to minimize.
[2024-05-29 14:16:21] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 0 ms to minimize.
[2024-05-29 14:16:21] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 506 unsolved
[2024-05-29 14:16:22] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 1 ms to minimize.
[2024-05-29 14:16:22] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 1 ms to minimize.
[2024-05-29 14:16:22] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 1 ms to minimize.
[2024-05-29 14:16:23] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 0 ms to minimize.
[2024-05-29 14:16:23] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 1 ms to minimize.
[2024-05-29 14:16:23] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 1 ms to minimize.
[2024-05-29 14:16:24] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 0 ms to minimize.
[2024-05-29 14:16:24] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 1 ms to minimize.
[2024-05-29 14:16:24] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 1 ms to minimize.
[2024-05-29 14:16:24] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 1 ms to minimize.
[2024-05-29 14:16:24] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 0 ms to minimize.
[2024-05-29 14:16:24] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 1 ms to minimize.
[2024-05-29 14:16:25] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 1 ms to minimize.
[2024-05-29 14:16:25] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 1 ms to minimize.
[2024-05-29 14:16:25] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 1 ms to minimize.
[2024-05-29 14:16:26] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 1 ms to minimize.
[2024-05-29 14:16:26] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 1 ms to minimize.
[2024-05-29 14:16:26] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 0 ms to minimize.
[2024-05-29 14:16:26] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 0 ms to minimize.
[2024-05-29 14:16:26] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 506 unsolved
[2024-05-29 14:16:26] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 1 ms to minimize.
[2024-05-29 14:16:27] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 0 ms to minimize.
[2024-05-29 14:16:27] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 1 ms to minimize.
[2024-05-29 14:16:28] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 0 ms to minimize.
[2024-05-29 14:16:28] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 0 ms to minimize.
[2024-05-29 14:16:28] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 1 ms to minimize.
[2024-05-29 14:16:29] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 1 ms to minimize.
[2024-05-29 14:16:29] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 0 ms to minimize.
[2024-05-29 14:16:29] [INFO ] Deduced a trap composed of 22 places in 216 ms of which 1 ms to minimize.
[2024-05-29 14:16:30] [INFO ] Deduced a trap composed of 22 places in 797 ms of which 1 ms to minimize.
[2024-05-29 14:16:30] [INFO ] Deduced a trap composed of 22 places in 233 ms of which 1 ms to minimize.
[2024-05-29 14:16:30] [INFO ] Deduced a trap composed of 29 places in 223 ms of which 1 ms to minimize.
[2024-05-29 14:16:30] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 0 ms to minimize.
[2024-05-29 14:16:31] [INFO ] Deduced a trap composed of 25 places in 173 ms of which 0 ms to minimize.
[2024-05-29 14:16:31] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 1 ms to minimize.
[2024-05-29 14:16:31] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 0 ms to minimize.
[2024-05-29 14:16:31] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 0 ms to minimize.
[2024-05-29 14:16:31] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 0 ms to minimize.
[2024-05-29 14:16:31] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 1 ms to minimize.
[2024-05-29 14:16:31] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 506 unsolved
[2024-05-29 14:16:32] [INFO ] Deduced a trap composed of 65 places in 167 ms of which 1 ms to minimize.
[2024-05-29 14:16:32] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 1 ms to minimize.
[2024-05-29 14:16:32] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 0 ms to minimize.
[2024-05-29 14:16:34] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 0 ms to minimize.
[2024-05-29 14:16:34] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 1 ms to minimize.
[2024-05-29 14:16:34] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 0 ms to minimize.
[2024-05-29 14:16:34] [INFO ] Deduced a trap composed of 36 places in 157 ms of which 1 ms to minimize.
[2024-05-29 14:16:34] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 1 ms to minimize.
[2024-05-29 14:16:35] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 1 ms to minimize.
[2024-05-29 14:16:35] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 1 ms to minimize.
[2024-05-29 14:16:35] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 0 ms to minimize.
[2024-05-29 14:16:35] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 1 ms to minimize.
[2024-05-29 14:16:35] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 1 ms to minimize.
[2024-05-29 14:16:35] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 1 ms to minimize.
[2024-05-29 14:16:35] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 1 ms to minimize.
[2024-05-29 14:16:36] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 1 ms to minimize.
[2024-05-29 14:16:36] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 1 ms to minimize.
[2024-05-29 14:16:36] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 1 ms to minimize.
[2024-05-29 14:16:36] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 0 ms to minimize.
[2024-05-29 14:16:36] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 506 unsolved
[2024-05-29 14:16:38] [INFO ] Deduced a trap composed of 25 places in 172 ms of which 0 ms to minimize.
[2024-05-29 14:16:38] [INFO ] Deduced a trap composed of 24 places in 168 ms of which 0 ms to minimize.
[2024-05-29 14:16:38] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 1 ms to minimize.
[2024-05-29 14:16:40] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 1 ms to minimize.
[2024-05-29 14:16:40] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 5/87 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 9 (OVERLAPS) 522/621 variables, 99/186 constraints. Problems are: Problem set: 0 solved, 506 unsolved
SMT process timed out in 32121ms, After SMT, problems are : Problem set: 0 solved, 506 unsolved
Search for dead transitions found 0 dead transitions in 32127ms
Starting structural reductions in SI_LTL mode, iteration 1 : 99/99 places, 531/538 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32177 ms. Remains : 99/99 places, 531/538 transitions.
Built C files in :
/tmp/ltsmin18314176278944979165
[2024-05-29 14:16:45] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18314176278944979165
Running compilation step : cd /tmp/ltsmin18314176278944979165;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1420 ms.
Running link step : cd /tmp/ltsmin18314176278944979165;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin18314176278944979165;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5039186003885342811.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 538/538 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 538/538 (removed 0) transitions.
[2024-05-29 14:17:00] [INFO ] Flow matrix only has 530 transitions (discarded 8 similar events)
// Phase 1: matrix 530 rows 99 cols
[2024-05-29 14:17:00] [INFO ] Computed 2 invariants in 3 ms
[2024-05-29 14:17:01] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-29 14:17:01] [INFO ] Flow matrix only has 530 transitions (discarded 8 similar events)
[2024-05-29 14:17:01] [INFO ] Invariant cache hit.
[2024-05-29 14:17:01] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-29 14:17:01] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
Running 513 sub problems to find dead transitions.
[2024-05-29 14:17:01] [INFO ] Flow matrix only has 530 transitions (discarded 8 similar events)
[2024-05-29 14:17:01] [INFO ] Invariant cache hit.
[2024-05-29 14:17:01] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2024-05-29 14:17:05] [INFO ] Deduced a trap composed of 21 places in 161 ms of which 1 ms to minimize.
[2024-05-29 14:17:06] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 1 ms to minimize.
[2024-05-29 14:17:06] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 1 ms to minimize.
[2024-05-29 14:17:06] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 0 ms to minimize.
[2024-05-29 14:17:06] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 0 ms to minimize.
[2024-05-29 14:17:06] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 1 ms to minimize.
[2024-05-29 14:17:06] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 1 ms to minimize.
[2024-05-29 14:17:07] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 1 ms to minimize.
[2024-05-29 14:17:07] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 0 ms to minimize.
[2024-05-29 14:17:07] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 1 ms to minimize.
[2024-05-29 14:17:07] [INFO ] Deduced a trap composed of 18 places in 160 ms of which 1 ms to minimize.
[2024-05-29 14:17:07] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 1 ms to minimize.
[2024-05-29 14:17:08] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 0 ms to minimize.
[2024-05-29 14:17:08] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 0 ms to minimize.
[2024-05-29 14:17:08] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 0 ms to minimize.
[2024-05-29 14:17:09] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 0 ms to minimize.
[2024-05-29 14:17:09] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 0 ms to minimize.
[2024-05-29 14:17:09] [INFO ] Deduced a trap composed of 64 places in 171 ms of which 0 ms to minimize.
[2024-05-29 14:17:09] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 1 ms to minimize.
[2024-05-29 14:17:09] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2024-05-29 14:17:10] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 1 ms to minimize.
[2024-05-29 14:17:11] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 1 ms to minimize.
[2024-05-29 14:17:11] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 1 ms to minimize.
[2024-05-29 14:17:11] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 1 ms to minimize.
[2024-05-29 14:17:11] [INFO ] Deduced a trap composed of 24 places in 168 ms of which 1 ms to minimize.
[2024-05-29 14:17:11] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 0 ms to minimize.
[2024-05-29 14:17:11] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 1 ms to minimize.
[2024-05-29 14:17:12] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 1 ms to minimize.
[2024-05-29 14:17:12] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 1 ms to minimize.
[2024-05-29 14:17:12] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 1 ms to minimize.
[2024-05-29 14:17:12] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 0 ms to minimize.
[2024-05-29 14:17:12] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 1 ms to minimize.
[2024-05-29 14:17:12] [INFO ] Deduced a trap composed of 29 places in 150 ms of which 1 ms to minimize.
[2024-05-29 14:17:12] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 1 ms to minimize.
[2024-05-29 14:17:13] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 0 ms to minimize.
[2024-05-29 14:17:13] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 0 ms to minimize.
[2024-05-29 14:17:13] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 1 ms to minimize.
[2024-05-29 14:17:13] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 0 ms to minimize.
[2024-05-29 14:17:13] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 0 ms to minimize.
[2024-05-29 14:17:14] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2024-05-29 14:17:15] [INFO ] Deduced a trap composed of 64 places in 173 ms of which 1 ms to minimize.
[2024-05-29 14:17:16] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 2 ms to minimize.
[2024-05-29 14:17:16] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 1 ms to minimize.
[2024-05-29 14:17:16] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 0 ms to minimize.
[2024-05-29 14:17:16] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 1 ms to minimize.
[2024-05-29 14:17:17] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 0 ms to minimize.
[2024-05-29 14:17:17] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 1 ms to minimize.
[2024-05-29 14:17:17] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 1 ms to minimize.
[2024-05-29 14:17:17] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 1 ms to minimize.
[2024-05-29 14:17:17] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 0 ms to minimize.
[2024-05-29 14:17:17] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 1 ms to minimize.
[2024-05-29 14:17:17] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 0 ms to minimize.
[2024-05-29 14:17:18] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 0 ms to minimize.
[2024-05-29 14:17:18] [INFO ] Deduced a trap composed of 24 places in 214 ms of which 1 ms to minimize.
[2024-05-29 14:17:18] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 1 ms to minimize.
[2024-05-29 14:17:18] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 1 ms to minimize.
[2024-05-29 14:17:18] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 1 ms to minimize.
[2024-05-29 14:17:18] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 0 ms to minimize.
[2024-05-29 14:17:19] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 1 ms to minimize.
[2024-05-29 14:17:19] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2024-05-29 14:17:21] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 1 ms to minimize.
[2024-05-29 14:17:21] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 0 ms to minimize.
[2024-05-29 14:17:21] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 1 ms to minimize.
[2024-05-29 14:17:21] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 1 ms to minimize.
[2024-05-29 14:17:21] [INFO ] Deduced a trap composed of 33 places in 144 ms of which 1 ms to minimize.
[2024-05-29 14:17:22] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 0 ms to minimize.
[2024-05-29 14:17:22] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 1 ms to minimize.
[2024-05-29 14:17:22] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 1 ms to minimize.
[2024-05-29 14:17:22] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 1 ms to minimize.
[2024-05-29 14:17:22] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 1 ms to minimize.
[2024-05-29 14:17:22] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 1 ms to minimize.
[2024-05-29 14:17:22] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 1 ms to minimize.
[2024-05-29 14:17:23] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 1 ms to minimize.
[2024-05-29 14:17:23] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 1 ms to minimize.
[2024-05-29 14:17:23] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 1 ms to minimize.
[2024-05-29 14:17:23] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 1 ms to minimize.
[2024-05-29 14:17:23] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 1 ms to minimize.
[2024-05-29 14:17:23] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 0 ms to minimize.
[2024-05-29 14:17:23] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 0 ms to minimize.
[2024-05-29 14:17:24] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 513 unsolved
[2024-05-29 14:17:25] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 0 ms to minimize.
[2024-05-29 14:17:25] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 1 ms to minimize.
[2024-05-29 14:17:27] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 0 ms to minimize.
[2024-05-29 14:17:27] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 0 ms to minimize.
[2024-05-29 14:17:27] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 0 ms to minimize.
[2024-05-29 14:17:27] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
[2024-05-29 14:17:27] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 7/89 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 513 unsolved
At refinement iteration 9 (OVERLAPS) 529/628 variables, 99/188 constraints. Problems are: Problem set: 0 solved, 513 unsolved
SMT process timed out in 32003ms, After SMT, problems are : Problem set: 0 solved, 513 unsolved
Search for dead transitions found 0 dead transitions in 32010ms
Finished structural reductions in LTL mode , in 1 iterations and 32583 ms. Remains : 99/99 places, 538/538 transitions.
Built C files in :
/tmp/ltsmin8200396964737856524
[2024-05-29 14:17:33] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8200396964737856524
Running compilation step : cd /tmp/ltsmin8200396964737856524;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1404 ms.
Running link step : cd /tmp/ltsmin8200396964737856524;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin8200396964737856524;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8132551416026778097.hoa' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600