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.r092-tall-171624189800708.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 DES-PT-30b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189800708
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 12 08:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 08:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 08:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 103K May 18 16:42 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 DES-PT-30b-LTLFireability-00
FORMULA_NAME DES-PT-30b-LTLFireability-01
FORMULA_NAME DES-PT-30b-LTLFireability-02
FORMULA_NAME DES-PT-30b-LTLFireability-03
FORMULA_NAME DES-PT-30b-LTLFireability-04
FORMULA_NAME DES-PT-30b-LTLFireability-05
FORMULA_NAME DES-PT-30b-LTLFireability-06
FORMULA_NAME DES-PT-30b-LTLFireability-07
FORMULA_NAME DES-PT-30b-LTLFireability-08
FORMULA_NAME DES-PT-30b-LTLFireability-09
FORMULA_NAME DES-PT-30b-LTLFireability-10
FORMULA_NAME DES-PT-30b-LTLFireability-11
FORMULA_NAME DES-PT-30b-LTLFireability-12
FORMULA_NAME DES-PT-30b-LTLFireability-13
FORMULA_NAME DES-PT-30b-LTLFireability-14
FORMULA_NAME DES-PT-30b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716351519198

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-30b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-22 04:18:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 04:18:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 04:18:40] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2024-05-22 04:18:40] [INFO ] Transformed 399 places.
[2024-05-22 04:18:40] [INFO ] Transformed 350 transitions.
[2024-05-22 04:18:40] [INFO ] Found NUPN structural information;
[2024-05-22 04:18:40] [INFO ] Parsed PT model containing 399 places and 350 transitions and 1143 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Support contains 48 out of 399 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 399/399 places, 350/350 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 396 transition count 350
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 26 place count 373 transition count 327
Iterating global reduction 1 with 23 rules applied. Total rules applied 49 place count 373 transition count 327
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 60 place count 362 transition count 316
Iterating global reduction 1 with 11 rules applied. Total rules applied 71 place count 362 transition count 316
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 80 place count 362 transition count 307
Applied a total of 80 rules in 87 ms. Remains 362 /399 variables (removed 37) and now considering 307/350 (removed 43) transitions.
// Phase 1: matrix 307 rows 362 cols
[2024-05-22 04:18:41] [INFO ] Computed 62 invariants in 44 ms
[2024-05-22 04:18:41] [INFO ] Implicit Places using invariants in 387 ms returned []
[2024-05-22 04:18:41] [INFO ] Invariant cache hit.
[2024-05-22 04:18:41] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 792 ms to find 0 implicit places.
Running 306 sub problems to find dead transitions.
[2024-05-22 04:18:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (OVERLAPS) 1/362 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (OVERLAPS) 307/669 variables, 362/424 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-05-22 04:18:48] [INFO ] Deduced a trap composed of 10 places in 220 ms of which 20 ms to minimize.
[2024-05-22 04:18:48] [INFO ] Deduced a trap composed of 18 places in 174 ms of which 2 ms to minimize.
[2024-05-22 04:18:48] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-22 04:18:49] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
[2024-05-22 04:18:49] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
[2024-05-22 04:18:50] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 2 ms to minimize.
[2024-05-22 04:18:50] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-22 04:18:50] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/669 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-05-22 04:18:56] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 3 ms to minimize.
[2024-05-22 04:18:56] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 2 ms to minimize.
[2024-05-22 04:18:56] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 2 ms to minimize.
[2024-05-22 04:18:56] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-22 04:18:57] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-22 04:18:57] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-22 04:18:57] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-22 04:18:57] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
[2024-05-22 04:18:57] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 2 ms to minimize.
[2024-05-22 04:18:57] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-22 04:18:57] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 2 ms to minimize.
[2024-05-22 04:18:57] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-22 04:18:57] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-22 04:18:57] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-22 04:18:57] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-22 04:18:57] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-22 04:18:58] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/669 variables, 17/449 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-05-22 04:19:00] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-22 04:19:00] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-22 04:19:00] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-22 04:19:00] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 4/453 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-05-22 04:19:04] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2024-05-22 04:19:04] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-22 04:19:05] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-05-22 04:19:05] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-22 04:19:06] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 5/458 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 669/669 variables, and 458 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 362/362 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (OVERLAPS) 1/362 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 34/96 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-05-22 04:19:14] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-22 04:19:14] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 2 ms to minimize.
[2024-05-22 04:19:14] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-22 04:19:14] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-22 04:19:14] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-22 04:19:14] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 2 ms to minimize.
[2024-05-22 04:19:15] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-22 04:19:15] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-22 04:19:15] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-22 04:19:15] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-22 04:19:16] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 11/107 constraints. Problems are: Problem set: 0 solved, 306 unsolved
[2024-05-22 04:19:17] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (OVERLAPS) 307/669 variables, 362/470 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 306/776 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 669/669 variables, and 776 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 362/362 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 46/46 constraints]
After SMT, in 60201ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 60222ms
Starting structural reductions in LTL mode, iteration 1 : 362/399 places, 307/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61126 ms. Remains : 362/399 places, 307/350 transitions.
Support contains 48 out of 362 places after structural reductions.
[2024-05-22 04:19:42] [INFO ] Flatten gal took : 47 ms
[2024-05-22 04:19:42] [INFO ] Flatten gal took : 22 ms
[2024-05-22 04:19:42] [INFO ] Input system was already deterministic with 307 transitions.
Support contains 46 out of 362 places (down from 48) after GAL structural reductions.
RANDOM walk for 40000 steps (356 resets) in 1891 ms. (21 steps per ms) remains 13/33 properties
BEST_FIRST walk for 40003 steps (52 resets) in 193 ms. (206 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (49 resets) in 167 ms. (238 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (50 resets) in 112 ms. (354 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (49 resets) in 186 ms. (213 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (62 resets) in 148 ms. (268 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (64 resets) in 174 ms. (228 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (50 resets) in 88 ms. (449 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (46 resets) in 219 ms. (181 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (50 resets) in 70 ms. (563 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (48 resets) in 46 ms. (851 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (49 resets) in 94 ms. (421 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (53 resets) in 46 ms. (851 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (58 resets) in 54 ms. (727 steps per ms) remains 13/13 properties
[2024-05-22 04:19:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 32/49 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 123/172 variables, 27/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 169/341 variables, 27/60 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 4/345 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 292/637 variables, 345/407 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 04:19:44] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-22 04:19:44] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-22 04:19:44] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-22 04:19:44] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
[2024-05-22 04:19:44] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 3 ms to minimize.
[2024-05-22 04:19:44] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 2 ms to minimize.
[2024-05-22 04:19:44] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/637 variables, 7/414 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/637 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 20/657 variables, 11/425 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/657 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 6/663 variables, 3/428 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 04:19:45] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-22 04:19:45] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-22 04:19:45] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-22 04:19:45] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 8 ms to minimize.
[2024-05-22 04:19:46] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/663 variables, 5/433 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 04:19:46] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/663 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/663 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (OVERLAPS) 4/667 variables, 2/436 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/667 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (OVERLAPS) 2/669 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 04:19:47] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-05-22 04:19:47] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/669 variables, 2/439 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 04:19:48] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/669 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/669 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 669/669 variables, and 440 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 362/362 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 32/49 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 123/172 variables, 27/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 169/341 variables, 27/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 12/75 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 4/345 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 292/637 variables, 345/423 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/637 variables, 13/436 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 04:19:49] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-05-22 04:19:50] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/637 variables, 2/438 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 04:19:51] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-05-22 04:19:52] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/637 variables, 2/440 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 04:19:53] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-05-22 04:19:53] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2024-05-22 04:19:53] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
SMT process timed out in 10089ms, After SMT, problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 17 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 307/307 transitions.
Graph (complete) has 786 edges and 362 vertex of which 355 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 355 transition count 286
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 34 place count 340 transition count 285
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 34 place count 340 transition count 274
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 56 place count 329 transition count 274
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 62 place count 323 transition count 268
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 323 transition count 268
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 71 place count 323 transition count 265
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 71 place count 323 transition count 264
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 73 place count 322 transition count 264
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 74 place count 321 transition count 263
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 321 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 76 place count 321 transition count 262
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 76 place count 321 transition count 261
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 78 place count 320 transition count 261
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 224 place count 247 transition count 188
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 228 place count 245 transition count 190
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 229 place count 245 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 230 place count 244 transition count 189
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 231 place count 243 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 232 place count 242 transition count 188
Applied a total of 232 rules in 126 ms. Remains 242 /362 variables (removed 120) and now considering 188/307 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 242/362 places, 188/307 transitions.
RANDOM walk for 40000 steps (1585 resets) in 1008 ms. (39 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (325 resets) in 130 ms. (305 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (305 resets) in 136 ms. (292 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (303 resets) in 134 ms. (296 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (304 resets) in 106 ms. (373 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (313 resets) in 128 ms. (310 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (319 resets) in 76 ms. (519 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (305 resets) in 53 ms. (740 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (317 resets) in 59 ms. (666 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (273 resets) in 57 ms. (689 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (301 resets) in 53 ms. (740 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (303 resets) in 71 ms. (555 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (310 resets) in 106 ms. (373 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (315 resets) in 56 ms. (701 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 594697 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :0 out of 13
Probabilistic random walk after 594697 steps, saw 92115 distinct states, run finished after 3006 ms. (steps per millisecond=197 ) properties seen :0
// Phase 1: matrix 188 rows 242 cols
[2024-05-22 04:19:57] [INFO ] Computed 60 invariants in 12 ms
[2024-05-22 04:19:57] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 16/33 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 75/108 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 107/215 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/216 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 188/404 variables, 216/276 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 6/282 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 04:19:57] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/404 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 04:19:58] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 04:19:58] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/404 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/404 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 26/430 variables, 26/311 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/430 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 0/430 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 311 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1923 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 242/242 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 16/33 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 75/108 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 107/215 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/216 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 188/404 variables, 216/279 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/404 variables, 6/285 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 9/294 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/404 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 26/430 variables, 26/320 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/430 variables, 4/324 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 04:20:02] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-22 04:20:02] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 2 ms to minimize.
[2024-05-22 04:20:03] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-05-22 04:20:03] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-22 04:20:03] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-22 04:20:03] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/430 variables, 6/330 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/430 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (OVERLAPS) 0/430 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 330 constraints, problems are : Problem set: 0 solved, 13 unsolved in 8276 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 242/242 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 9/9 constraints]
After SMT, in 10231ms problems are : Problem set: 0 solved, 13 unsolved
Parikh walk visited 0 properties in 25076 ms.
Support contains 17 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 188/188 transitions.
Applied a total of 0 rules in 8 ms. Remains 242 /242 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 242/242 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 188/188 transitions.
Applied a total of 0 rules in 10 ms. Remains 242 /242 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-22 04:20:32] [INFO ] Invariant cache hit.
[2024-05-22 04:20:32] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-22 04:20:32] [INFO ] Invariant cache hit.
[2024-05-22 04:20:33] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 04:20:33] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2024-05-22 04:20:33] [INFO ] Redundant transitions in 6 ms returned []
Running 185 sub problems to find dead transitions.
[2024-05-22 04:20:33] [INFO ] Invariant cache hit.
[2024-05-22 04:20:33] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 3/242 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 188/430 variables, 242/302 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/430 variables, 6/308 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 04:20:39] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (OVERLAPS) 0/430 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 309 constraints, problems are : Problem set: 0 solved, 185 unsolved in 10139 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 242/242 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 3/242 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 188/430 variables, 242/303 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 6/309 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 185/494 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 04:20:50] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-22 04:20:50] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-22 04:20:50] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2024-05-22 04:20:50] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 2 ms to minimize.
[2024-05-22 04:20:51] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 2 ms to minimize.
[2024-05-22 04:20:51] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-22 04:20:55] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 7/501 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 04:21:05] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-22 04:21:05] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-22 04:21:09] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 3/504 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/430 variables, and 504 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 242/242 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 11/11 constraints]
After SMT, in 40248ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 40250ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40613 ms. Remains : 242/242 places, 188/188 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 7 ms. Remains 242 /242 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Running SMT prover for 13 properties.
[2024-05-22 04:21:13] [INFO ] Invariant cache hit.
[2024-05-22 04:21:13] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-22 04:21:13] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 57 ms returned sat
[2024-05-22 04:21:13] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-22 04:21:13] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 04:21:13] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 04:21:14] [INFO ] After 309ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
TRAPS : Iteration 0
[2024-05-22 04:21:14] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-05-22 04:21:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
TRAPS : Iteration 1
[2024-05-22 04:21:14] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 2 ms to minimize.
[2024-05-22 04:21:14] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 2 ms to minimize.
[2024-05-22 04:21:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 157 ms
[2024-05-22 04:21:15] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 2 ms to minimize.
[2024-05-22 04:21:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
TRAPS : Iteration 2
[2024-05-22 04:21:15] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-05-22 04:21:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
TRAPS : Iteration 3
[2024-05-22 04:21:15] [INFO ] After 1913ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
[2024-05-22 04:21:16] [INFO ] After 2333ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Over-approximation ignoring read arcs solved 0 properties in 2598 ms.
Computed a total of 178 stabilizing places and 170 stable transitions
Graph (complete) has 786 edges and 362 vertex of which 355 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.14 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (G((F(p1)&&F(G(!p2)))) U p2)))'
Support contains 5 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 354 transition count 299
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 354 transition count 299
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 354 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 353 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 353 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 353 transition count 293
Applied a total of 23 rules in 13 ms. Remains 353 /362 variables (removed 9) and now considering 293/307 (removed 14) transitions.
// Phase 1: matrix 293 rows 353 cols
[2024-05-22 04:21:16] [INFO ] Computed 62 invariants in 11 ms
[2024-05-22 04:21:16] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-22 04:21:16] [INFO ] Invariant cache hit.
[2024-05-22 04:21:16] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2024-05-22 04:21:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/353 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 293/646 variables, 353/415 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:21:22] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 2 ms to minimize.
[2024-05-22 04:21:22] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-22 04:21:23] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 2 ms to minimize.
[2024-05-22 04:21:23] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-05-22 04:21:23] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2024-05-22 04:21:23] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-22 04:21:23] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-22 04:21:23] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-22 04:21:23] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-22 04:21:23] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-22 04:21:23] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-22 04:21:23] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-22 04:21:24] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-22 04:21:24] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-22 04:21:24] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-22 04:21:24] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-22 04:21:24] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 2 ms to minimize.
[2024-05-22 04:21:25] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-22 04:21:25] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-22 04:21:26] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 20/435 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:21:29] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-22 04:21:30] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-05-22 04:21:30] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 2 ms to minimize.
[2024-05-22 04:21:30] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 4/439 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:21:32] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-22 04:21:34] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 2/441 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:21:35] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-22 04:21:35] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-22 04:21:36] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 2 ms to minimize.
[2024-05-22 04:21:36] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 2 ms to minimize.
[2024-05-22 04:21:36] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-22 04:21:36] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 6/447 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:21:43] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:21:44] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2024-05-22 04:21:46] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 2 ms to minimize.
[2024-05-22 04:21:46] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2024-05-22 04:21:46] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-22 04:21:46] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 646/646 variables, and 453 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/353 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 38/100 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:21:49] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-05-22 04:21:49] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
[2024-05-22 04:21:49] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-22 04:21:49] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-05-22 04:21:49] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-22 04:21:49] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-22 04:21:49] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-22 04:21:49] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-05-22 04:21:50] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 9/109 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:21:51] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-22 04:21:52] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:21:54] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-22 04:21:54] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-22 04:21:54] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:21:57] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-05-22 04:21:57] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:21:59] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-22 04:21:59] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 11 (OVERLAPS) 293/646 variables, 353/471 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/646 variables, 292/763 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 763 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 56/56 constraints]
After SMT, in 60120ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 60125ms
Starting structural reductions in LTL mode, iteration 1 : 353/362 places, 293/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60670 ms. Remains : 353/362 places, 293/307 transitions.
Stuttering acceptance computed with spot in 384 ms :[(NOT p2), (NOT p0), (NOT p1), p2, (OR (NOT p1) p2), (NOT p2)]
Running random walk in product with property : DES-PT-30b-LTLFireability-00
Product exploration explored 100000 steps with 2240 reset in 273 ms.
Product exploration explored 100000 steps with 2253 reset in 225 ms.
Computed a total of 176 stabilizing places and 168 stable transitions
Graph (complete) has 766 edges and 353 vertex of which 347 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Computed a total of 176 stabilizing places and 168 stable transitions
Detected a total of 176/353 stabilizing places and 168/293 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 299 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 233 ms :[(NOT p2), (AND (NOT p0) p2), (NOT p1), p2, (OR (NOT p1) p2), (AND p0 (NOT p2))]
RANDOM walk for 40000 steps (345 resets) in 287 ms. (138 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40004 steps (49 resets) in 206 ms. (193 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (53 resets) in 129 ms. (307 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (51 resets) in 96 ms. (412 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (50 resets) in 302 ms. (132 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (50 resets) in 106 ms. (373 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (46 resets) in 76 ms. (519 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (57 resets) in 119 ms. (333 steps per ms) remains 7/7 properties
[2024-05-22 04:22:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 21/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 138/164 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 169/333 variables, 26/59 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 5/338 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 280/618 variables, 338/400 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/618 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 18/636 variables, 10/410 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/636 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 6/642 variables, 3/413 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/642 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 2/644 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/644 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 2/646 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 415 constraints, problems are : Problem set: 0 solved, 7 unsolved in 913 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 21/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 138/164 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 169/333 variables, 26/59 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 04:22:20] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-22 04:22:20] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 5/338 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 280/618 variables, 338/402 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/618 variables, 7/409 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/618 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 18/636 variables, 10/419 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 04:22:20] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/636 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/636 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 6/642 variables, 3/423 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 04:22:21] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/642 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/642 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 2/644 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/644 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 2/646 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/646 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 0/646 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 426 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2220 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 4/4 constraints]
After SMT, in 3151ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 14887 ms.
Support contains 5 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 293/293 transitions.
Graph (complete) has 766 edges and 353 vertex of which 347 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 347 transition count 271
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 330 transition count 271
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 37 place count 330 transition count 260
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 59 place count 319 transition count 260
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 203 place count 247 transition count 188
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 207 place count 245 transition count 190
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 208 place count 245 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 209 place count 244 transition count 189
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 210 place count 243 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 211 place count 242 transition count 188
Applied a total of 211 rules in 73 ms. Remains 242 /353 variables (removed 111) and now considering 188/293 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 242/353 places, 188/293 transitions.
RANDOM walk for 40000 steps (1640 resets) in 233 ms. (170 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (291 resets) in 104 ms. (380 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (303 resets) in 103 ms. (384 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (291 resets) in 67 ms. (588 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (287 resets) in 76 ms. (519 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (284 resets) in 79 ms. (500 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (283 resets) in 59 ms. (666 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (300 resets) in 46 ms. (851 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 660197 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :0 out of 7
Probabilistic random walk after 660197 steps, saw 91545 distinct states, run finished after 3001 ms. (steps per millisecond=219 ) properties seen :0
// Phase 1: matrix 188 rows 242 cols
[2024-05-22 04:22:40] [INFO ] Computed 60 invariants in 8 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 54/70 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 128/198 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 10/208 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 1/209 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 188/397 variables, 209/267 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/397 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 33/430 variables, 33/300 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/430 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/430 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/430 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 302 constraints, problems are : Problem set: 0 solved, 7 unsolved in 472 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 54/70 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 128/198 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 10/208 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 1/209 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 188/397 variables, 209/267 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/397 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/397 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 33/430 variables, 33/301 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/430 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/430 variables, 6/309 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/430 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 0/430 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 309 constraints, problems are : Problem set: 0 solved, 7 unsolved in 685 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 1178ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3471 ms.
Support contains 5 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 188/188 transitions.
Applied a total of 0 rules in 6 ms. Remains 242 /242 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 242/242 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 188/188 transitions.
Applied a total of 0 rules in 6 ms. Remains 242 /242 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-22 04:22:45] [INFO ] Invariant cache hit.
[2024-05-22 04:22:45] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-22 04:22:45] [INFO ] Invariant cache hit.
[2024-05-22 04:22:45] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2024-05-22 04:22:45] [INFO ] Redundant transitions in 7 ms returned []
Running 184 sub problems to find dead transitions.
[2024-05-22 04:22:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 2/240 variables, 26/46 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 2/242 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (OVERLAPS) 188/430 variables, 242/302 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-22 04:22:49] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-22 04:22:50] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-22 04:22:50] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-22 04:22:51] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-22 04:22:51] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 5/307 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (OVERLAPS) 0/430 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 307 constraints, problems are : Problem set: 0 solved, 184 unsolved in 10219 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 2/240 variables, 26/48 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (OVERLAPS) 2/242 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (OVERLAPS) 188/430 variables, 242/307 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 184/491 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-22 04:23:03] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-05-22 04:23:03] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-22 04:23:05] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-22 04:23:07] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-22 04:23:09] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/430 variables, 5/496 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-22 04:23:18] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/430 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/430 variables, and 497 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 11/11 constraints]
After SMT, in 40313ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 40314ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40665 ms. Remains : 242/242 places, 188/188 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 15 ms. Remains 242 /242 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Running SMT prover for 7 properties.
[2024-05-22 04:23:25] [INFO ] Invariant cache hit.
[2024-05-22 04:23:26] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 04:23:26] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 04:23:26] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-22 04:23:26] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-22 04:23:26] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2024-05-22 04:23:26] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
TRAPS : Iteration 0
[2024-05-22 04:23:26] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2024-05-22 04:23:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
TRAPS : Iteration 1
[2024-05-22 04:23:26] [INFO ] After 576ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
[2024-05-22 04:23:26] [INFO ] After 813ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Over-approximation ignoring read arcs solved 0 properties in 966 ms.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p0 p2 p1))), (F (NOT p1))]
Knowledge based reduction with 16 factoid took 413 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 286 ms :[(NOT p2), (AND (NOT p0) p2), (NOT p1), p2, (OR (NOT p1) p2), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 252 ms :[(NOT p2), (AND (NOT p0) p2), (NOT p1), p2, (OR (NOT p1) p2), (AND p0 (NOT p2))]
// Phase 1: matrix 293 rows 353 cols
[2024-05-22 04:23:27] [INFO ] Computed 62 invariants in 5 ms
[2024-05-22 04:23:28] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2024-05-22 04:23:28] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 26 ms returned sat
[2024-05-22 04:23:28] [INFO ] [Real]Absence check using state equation in 965 ms returned sat
[2024-05-22 04:23:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 04:23:29] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2024-05-22 04:23:29] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 23 ms returned sat
[2024-05-22 04:23:31] [INFO ] [Nat]Absence check using state equation in 2372 ms returned sat
[2024-05-22 04:23:31] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-22 04:23:31] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-22 04:23:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 609 ms
[2024-05-22 04:23:32] [INFO ] Computed and/alt/rep : 287/602/287 causal constraints (skipped 5 transitions) in 18 ms.
[2024-05-22 04:23:35] [INFO ] Added : 201 causal constraints over 41 iterations in 3065 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 353 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 353/353 places, 293/293 transitions.
Graph (complete) has 766 edges and 353 vertex of which 347 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 346 transition count 274
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 331 transition count 274
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 331 transition count 263
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 320 transition count 263
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 197 place count 248 transition count 191
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 201 place count 246 transition count 193
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 203 place count 244 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 204 place count 243 transition count 191
Applied a total of 204 rules in 40 ms. Remains 243 /353 variables (removed 110) and now considering 191/293 (removed 102) transitions.
// Phase 1: matrix 191 rows 243 cols
[2024-05-22 04:23:35] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 04:23:35] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-22 04:23:35] [INFO ] Invariant cache hit.
[2024-05-22 04:23:35] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2024-05-22 04:23:35] [INFO ] Redundant transitions in 12 ms returned []
Running 187 sub problems to find dead transitions.
[2024-05-22 04:23:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (OVERLAPS) 2/241 variables, 23/44 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (OVERLAPS) 2/243 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 191/434 variables, 243/301 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 04:23:40] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 2 ms to minimize.
[2024-05-22 04:23:41] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 04:23:45] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/434 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 04:23:46] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 2 ms to minimize.
[2024-05-22 04:23:46] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/434 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/434 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 04:23:51] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/434 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 04:23:51] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
[2024-05-22 04:23:51] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 04:23:52] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-22 04:23:52] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/434 variables, 4/311 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/434 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 17 (OVERLAPS) 0/434 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 311 constraints, problems are : Problem set: 0 solved, 187 unsolved in 21772 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 2/241 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 2/243 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 11 (OVERLAPS) 191/434 variables, 243/311 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/434 variables, 187/498 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 04:24:07] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-22 04:24:08] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/434 variables, 2/500 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/434 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/434 variables, and 500 constraints, problems are : Problem set: 0 solved, 187 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 12/12 constraints]
After SMT, in 51860ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 51863ms
Starting structural reductions in SI_LTL mode, iteration 1 : 243/353 places, 191/293 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52312 ms. Remains : 243/353 places, 191/293 transitions.
Computed a total of 138 stabilizing places and 133 stable transitions
Computed a total of 138 stabilizing places and 133 stable transitions
Detected a total of 138/243 stabilizing places and 133/191 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 17 factoid took 861 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 240 ms :[(NOT p2), (AND (NOT p0) p2), (NOT p1), p2, (OR (NOT p1) p2), (AND p0 (NOT p2))]
RANDOM walk for 40000 steps (1822 resets) in 208 ms. (191 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40003 steps (320 resets) in 132 ms. (300 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (337 resets) in 227 ms. (175 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (311 resets) in 201 ms. (198 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (314 resets) in 62 ms. (634 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (313 resets) in 135 ms. (294 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (309 resets) in 76 ms. (519 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (325 resets) in 137 ms. (289 steps per ms) remains 7/7 properties
[2024-05-22 04:24:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 44/60 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 128/188 variables, 22/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 10/198 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 7/205 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 188/393 variables, 205/261 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/393 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 41/434 variables, 38/299 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/434 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/434 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/434 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 301 constraints, problems are : Problem set: 0 solved, 7 unsolved in 443 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 44/60 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 128/188 variables, 22/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 04:24:29] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 10/198 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 7/205 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 188/393 variables, 205/262 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/393 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/393 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 41/434 variables, 38/301 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/434 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/434 variables, 6/309 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/434 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 0/434 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 309 constraints, problems are : Problem set: 0 solved, 7 unsolved in 739 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 1193ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 5710 ms.
Support contains 5 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 191/191 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 243 transition count 190
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 243 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 242 transition count 189
Applied a total of 3 rules in 13 ms. Remains 242 /243 variables (removed 1) and now considering 189/191 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 242/243 places, 189/191 transitions.
RANDOM walk for 40000 steps (1793 resets) in 611 ms. (65 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (327 resets) in 138 ms. (287 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (340 resets) in 148 ms. (268 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (319 resets) in 65 ms. (606 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (297 resets) in 107 ms. (370 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (300 resets) in 120 ms. (330 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (306 resets) in 164 ms. (242 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (319 resets) in 113 ms. (350 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 671190 steps, run timeout after 3008 ms. (steps per millisecond=223 ) properties seen :0 out of 7
Probabilistic random walk after 671190 steps, saw 88312 distinct states, run finished after 3008 ms. (steps per millisecond=223 ) properties seen :0
// Phase 1: matrix 189 rows 242 cols
[2024-05-22 04:24:39] [INFO ] Computed 59 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 50/66 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 128/194 variables, 23/50 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 10/204 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 1/205 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 186/391 variables, 205/262 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/391 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 40/431 variables, 37/299 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/431 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 431/431 variables, and 301 constraints, problems are : Problem set: 0 solved, 7 unsolved in 432 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 50/66 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 128/194 variables, 23/50 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 10/204 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 1/205 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 186/391 variables, 205/262 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/391 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/391 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 40/431 variables, 37/300 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/431 variables, 6/308 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 04:24:40] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 0 ms to minimize.
[2024-05-22 04:24:40] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/431 variables, 2/310 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 04:24:40] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 2 ms to minimize.
[2024-05-22 04:24:40] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-22 04:24:41] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/431 variables, 3/313 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/431 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 0/431 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 431/431 variables, and 313 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1208 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 5/5 constraints]
After SMT, in 1656ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 11330 ms.
Support contains 5 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 189/189 transitions.
Applied a total of 0 rules in 6 ms. Remains 242 /242 variables (removed 0) and now considering 189/189 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 242/242 places, 189/189 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 189/189 transitions.
Applied a total of 0 rules in 5 ms. Remains 242 /242 variables (removed 0) and now considering 189/189 (removed 0) transitions.
[2024-05-22 04:24:52] [INFO ] Invariant cache hit.
[2024-05-22 04:24:52] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-22 04:24:52] [INFO ] Invariant cache hit.
[2024-05-22 04:24:53] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
[2024-05-22 04:24:53] [INFO ] Redundant transitions in 1 ms returned []
Running 185 sub problems to find dead transitions.
[2024-05-22 04:24:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 2/240 variables, 25/45 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 2/242 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 189/431 variables, 242/301 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 04:24:57] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-22 04:24:57] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-05-22 04:24:58] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-22 04:24:58] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 4/305 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 11 (OVERLAPS) 0/431 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 431/431 variables, and 305 constraints, problems are : Problem set: 0 solved, 185 unsolved in 9738 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 2/240 variables, 25/47 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 2/242 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (OVERLAPS) 189/431 variables, 242/305 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 185/490 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 04:25:09] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-22 04:25:10] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-22 04:25:10] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-22 04:25:12] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 431/431 variables, and 494 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 8/8 constraints]
After SMT, in 39840ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 39844ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40233 ms. Remains : 242/242 places, 189/189 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 6 ms. Remains 242 /242 variables (removed 0) and now considering 189/189 (removed 0) transitions.
Running SMT prover for 7 properties.
[2024-05-22 04:25:32] [INFO ] Invariant cache hit.
[2024-05-22 04:25:32] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 04:25:32] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 04:25:33] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-22 04:25:33] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 04:25:33] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 04:25:33] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
TRAPS : Iteration 0
[2024-05-22 04:25:33] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-22 04:25:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-05-22 04:25:33] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-22 04:25:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
TRAPS : Iteration 1
[2024-05-22 04:25:33] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-22 04:25:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
TRAPS : Iteration 2
[2024-05-22 04:25:34] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-22 04:25:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
TRAPS : Iteration 3
[2024-05-22 04:25:34] [INFO ] After 1106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
[2024-05-22 04:25:34] [INFO ] After 1356ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Over-approximation ignoring read arcs solved 0 properties in 1480 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p2 p1))), (F (NOT p1))]
Knowledge based reduction with 17 factoid took 909 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 255 ms :[(NOT p2), (AND (NOT p0) p2), (NOT p1), p2, (OR (NOT p1) p2), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 270 ms :[(NOT p2), (AND (NOT p0) p2), (NOT p1), p2, (OR (NOT p1) p2), (AND p0 (NOT p2))]
// Phase 1: matrix 191 rows 243 cols
[2024-05-22 04:25:35] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 04:25:35] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2024-05-22 04:25:35] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-22 04:25:36] [INFO ] [Real]Absence check using state equation in 348 ms returned sat
[2024-05-22 04:25:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 04:25:36] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-22 04:25:36] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-22 04:25:36] [INFO ] [Nat]Absence check using state equation in 524 ms returned sat
[2024-05-22 04:25:36] [INFO ] Computed and/alt/rep : 176/425/176 causal constraints (skipped 11 transitions) in 13 ms.
[2024-05-22 04:25:37] [INFO ] Added : 126 causal constraints over 26 iterations in 588 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 396 ms :[(NOT p2), (AND (NOT p0) p2), (NOT p1), p2, (OR (NOT p1) p2), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 13224 reset in 214 ms.
Product exploration explored 100000 steps with 13114 reset in 293 ms.
Built C files in :
/tmp/ltsmin8683370624482062508
[2024-05-22 04:25:38] [INFO ] Computing symmetric may disable matrix : 191 transitions.
[2024-05-22 04:25:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 04:25:38] [INFO ] Computing symmetric may enable matrix : 191 transitions.
[2024-05-22 04:25:38] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 04:25:38] [INFO ] Computing Do-Not-Accords matrix : 191 transitions.
[2024-05-22 04:25:38] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 04:25:38] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8683370624482062508
Running compilation step : cd /tmp/ltsmin8683370624482062508;'/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 593 ms.
Running link step : cd /tmp/ltsmin8683370624482062508;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin8683370624482062508;'/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/stateBased3576475731683065211.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 191/191 transitions.
Applied a total of 0 rules in 9 ms. Remains 243 /243 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2024-05-22 04:25:53] [INFO ] Invariant cache hit.
[2024-05-22 04:25:53] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-22 04:25:53] [INFO ] Invariant cache hit.
[2024-05-22 04:25:53] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2024-05-22 04:25:53] [INFO ] Redundant transitions in 1 ms returned []
Running 187 sub problems to find dead transitions.
[2024-05-22 04:25:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (OVERLAPS) 2/241 variables, 23/44 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (OVERLAPS) 2/243 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 191/434 variables, 243/301 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 04:25:58] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-22 04:25:59] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 04:26:03] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/434 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 04:26:04] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
[2024-05-22 04:26:04] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/434 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/434 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 04:26:09] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/434 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 04:26:10] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-22 04:26:10] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-22 04:26:10] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
[2024-05-22 04:26:10] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/434 variables, 4/311 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/434 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 17 (OVERLAPS) 0/434 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 311 constraints, problems are : Problem set: 0 solved, 187 unsolved in 21992 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 2/241 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 2/243 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 11 (OVERLAPS) 191/434 variables, 243/311 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/434 variables, 187/498 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 04:26:26] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-22 04:26:26] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/434 variables, 2/500 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/434 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/434 variables, and 500 constraints, problems are : Problem set: 0 solved, 187 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 12/12 constraints]
After SMT, in 52097ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 52100ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52485 ms. Remains : 243/243 places, 191/191 transitions.
Built C files in :
/tmp/ltsmin12574677434985617909
[2024-05-22 04:26:46] [INFO ] Computing symmetric may disable matrix : 191 transitions.
[2024-05-22 04:26:46] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 04:26:46] [INFO ] Computing symmetric may enable matrix : 191 transitions.
[2024-05-22 04:26:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 04:26:46] [INFO ] Computing Do-Not-Accords matrix : 191 transitions.
[2024-05-22 04:26:46] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 04:26:46] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12574677434985617909
Running compilation step : cd /tmp/ltsmin12574677434985617909;'/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 485 ms.
Running link step : cd /tmp/ltsmin12574677434985617909;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin12574677434985617909;'/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/stateBased2478484297850819654.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 04:27:01] [INFO ] Flatten gal took : 17 ms
[2024-05-22 04:27:01] [INFO ] Flatten gal took : 16 ms
[2024-05-22 04:27:01] [INFO ] Time to serialize gal into /tmp/LTL7830892218341624903.gal : 4 ms
[2024-05-22 04:27:01] [INFO ] Time to serialize properties into /tmp/LTL6632335026019808893.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/LTL7830892218341624903.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15021991749313665586.hoa' '-atoms' '/tmp/LTL6632335026019808893.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/LTL6632335026019808893.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15021991749313665586.hoa
Detected timeout of ITS tools.
[2024-05-22 04:27:16] [INFO ] Flatten gal took : 14 ms
[2024-05-22 04:27:16] [INFO ] Flatten gal took : 14 ms
[2024-05-22 04:27:16] [INFO ] Time to serialize gal into /tmp/LTL11770220816653914916.gal : 3 ms
[2024-05-22 04:27:16] [INFO ] Time to serialize properties into /tmp/LTL2545103072692469585.ltl : 2 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/LTL11770220816653914916.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2545103072692469585.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("((p19==1)&&(p250==1))"))U((G((F("(p258!=1)"))&&(F(G(!("((p91==1)&&(p243==1))"))))))U("((p91==1)&&(p243==1))"))))
Formula 0 simplified : X!"((p19==1)&&(p250==1))" R (F(G!"(p258!=1)" | GF"((p91==1)&&(p243==1))") R !"((p91==1)&&(p243==1))")
Detected timeout of ITS tools.
[2024-05-22 04:27:31] [INFO ] Flatten gal took : 13 ms
[2024-05-22 04:27:31] [INFO ] Applying decomposition
[2024-05-22 04:27:31] [INFO ] Flatten gal took : 12 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/graph15510482058290828489.txt' '-o' '/tmp/graph15510482058290828489.bin' '-w' '/tmp/graph15510482058290828489.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15510482058290828489.bin' '-l' '-1' '-v' '-w' '/tmp/graph15510482058290828489.weights' '-q' '0' '-e' '0.001'
[2024-05-22 04:27:31] [INFO ] Decomposing Gal with order
[2024-05-22 04:27:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 04:27:31] [INFO ] Removed a total of 45 redundant transitions.
[2024-05-22 04:27:31] [INFO ] Flatten gal took : 42 ms
[2024-05-22 04:27:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 6 ms.
[2024-05-22 04:27:31] [INFO ] Time to serialize gal into /tmp/LTL8101790029843520842.gal : 5 ms
[2024-05-22 04:27:31] [INFO ] Time to serialize properties into /tmp/LTL11566742408787626890.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/LTL8101790029843520842.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11566742408787626890.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 : !(((X("((u9.p19==1)&&(u9.p250==1))"))U((G((F("(i10.i0.u10.p258!=1)"))&&(F(G(!("((u8.p91==1)&&(u8.p243==1))"))))))U("((u8.p91==1)&&(u8....169
Formula 0 simplified : X!"((u9.p19==1)&&(u9.p250==1))" R (F(G!"(i10.i0.u10.p258!=1)" | GF"((u8.p91==1)&&(u8.p243==1))") R !"((u8.p91==1)&&(u8.p243==1))")
Reverse transition relation is NOT exact ! Due to transitions t299, t78_t80_t81_t90_t91_t82, t7_t48_t39, t35_t36_t38_t49_t65_t66_t67_t68_t69_t70_t71_t50_t5...839
Computing Next relation with stutter on 6.88693e+07 deadlock states
Detected timeout of ITS tools.
Treatment of property DES-PT-30b-LTLFireability-00 finished in 390385 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((!p0 U p1))))) U (G(p0) U p2)))'
Support contains 4 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 355 transition count 300
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 355 transition count 300
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 355 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 354 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 354 transition count 295
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 354 transition count 294
Applied a total of 21 rules in 19 ms. Remains 354 /362 variables (removed 8) and now considering 294/307 (removed 13) transitions.
// Phase 1: matrix 294 rows 354 cols
[2024-05-22 04:27:46] [INFO ] Computed 62 invariants in 8 ms
[2024-05-22 04:27:47] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-05-22 04:27:47] [INFO ] Invariant cache hit.
[2024-05-22 04:27:47] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
Running 293 sub problems to find dead transitions.
[2024-05-22 04:27:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/354 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 293 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (OVERLAPS) 294/648 variables, 354/416 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 04:27:53] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 2 ms to minimize.
[2024-05-22 04:27:53] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-22 04:27:53] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 2 ms to minimize.
[2024-05-22 04:27:53] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-22 04:27:53] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-05-22 04:27:54] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-22 04:27:54] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-22 04:27:54] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 2 ms to minimize.
[2024-05-22 04:27:55] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-22 04:27:56] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-22 04:27:57] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
[2024-05-22 04:27:57] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 12/428 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 04:27:58] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
[2024-05-22 04:27:58] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
[2024-05-22 04:27:58] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2024-05-22 04:27:58] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 2 ms to minimize.
[2024-05-22 04:27:58] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 2 ms to minimize.
[2024-05-22 04:27:59] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 2 ms to minimize.
[2024-05-22 04:27:59] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-22 04:27:59] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-22 04:27:59] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 2 ms to minimize.
[2024-05-22 04:27:59] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-22 04:28:00] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 11/439 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 04:28:02] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-22 04:28:02] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 2 ms to minimize.
[2024-05-22 04:28:03] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-22 04:28:03] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-22 04:28:03] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-22 04:28:04] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 2 ms to minimize.
[2024-05-22 04:28:04] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 2 ms to minimize.
[2024-05-22 04:28:04] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 2 ms to minimize.
[2024-05-22 04:28:04] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 2 ms to minimize.
[2024-05-22 04:28:05] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 2 ms to minimize.
[2024-05-22 04:28:05] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 11/450 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 04:28:07] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-05-22 04:28:07] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-22 04:28:08] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 3/453 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 04:28:11] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 2 ms to minimize.
[2024-05-22 04:28:12] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-22 04:28:12] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-22 04:28:13] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 2 ms to minimize.
[2024-05-22 04:28:13] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 1 ms to minimize.
[2024-05-22 04:28:14] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/648 variables, 6/459 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 04:28:15] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
[2024-05-22 04:28:15] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
[2024-05-22 04:28:15] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 3 ms to minimize.
[2024-05-22 04:28:16] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-22 04:28:16] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-22 04:28:16] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-22 04:28:16] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-22 04:28:16] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-22 04:28:16] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 648/648 variables, and 468 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/354 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 52/114 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 04:28:19] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-22 04:28:19] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-22 04:28:19] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2024-05-22 04:28:20] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-05-22 04:28:20] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-22 04:28:20] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-22 04:28:21] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 7/121 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 04:28:22] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-22 04:28:22] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 04:28:24] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-22 04:28:25] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-22 04:28:25] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 04:28:27] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (OVERLAPS) 294/648 variables, 354/481 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/648 variables, 293/774 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 774 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 65/65 constraints]
After SMT, in 60103ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Starting structural reductions in LTL mode, iteration 1 : 354/362 places, 294/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60753 ms. Remains : 354/362 places, 294/307 transitions.
Stuttering acceptance computed with spot in 657 ms :[(NOT p2), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p0) (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (NOT p0), (NOT p2)]
Running random walk in product with property : DES-PT-30b-LTLFireability-01
Stuttering criterion allowed to conclude after 126 steps with 0 reset in 1 ms.
FORMULA DES-PT-30b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-01 finished in 61446 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 U X(X(X(!p0)))))))'
Support contains 2 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 354 transition count 299
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 354 transition count 299
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 354 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 353 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 353 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 353 transition count 293
Applied a total of 23 rules in 13 ms. Remains 353 /362 variables (removed 9) and now considering 293/307 (removed 14) transitions.
// Phase 1: matrix 293 rows 353 cols
[2024-05-22 04:28:48] [INFO ] Computed 62 invariants in 7 ms
[2024-05-22 04:28:48] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-22 04:28:48] [INFO ] Invariant cache hit.
[2024-05-22 04:28:48] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2024-05-22 04:28:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/353 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 293/646 variables, 353/415 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:28:54] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 2 ms to minimize.
[2024-05-22 04:28:54] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-22 04:28:55] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-22 04:28:55] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 1 ms to minimize.
[2024-05-22 04:28:55] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2024-05-22 04:28:55] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-22 04:28:55] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-22 04:28:55] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-22 04:28:55] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-22 04:28:55] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-22 04:28:55] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-22 04:28:56] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-22 04:28:56] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 0 ms to minimize.
[2024-05-22 04:28:56] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-22 04:28:56] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-22 04:28:56] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-22 04:28:56] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-05-22 04:28:57] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-22 04:28:57] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 2 ms to minimize.
[2024-05-22 04:28:58] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 20/435 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:29:01] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-22 04:29:02] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 2 ms to minimize.
[2024-05-22 04:29:02] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-05-22 04:29:02] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 4/439 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:29:04] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-22 04:29:06] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 2/441 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:29:07] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-22 04:29:08] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-22 04:29:08] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
[2024-05-22 04:29:09] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 2 ms to minimize.
[2024-05-22 04:29:09] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-22 04:29:09] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 6/447 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:29:15] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:29:17] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2024-05-22 04:29:18] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 2 ms to minimize.
[2024-05-22 04:29:18] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-05-22 04:29:18] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-22 04:29:18] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.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 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 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 646/646 variables, and 453 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/353 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 38/100 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:29:20] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-22 04:29:21] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-22 04:29:21] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-22 04:29:21] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-22 04:29:21] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-22 04:29:21] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-22 04:29:21] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-22 04:29:21] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-22 04:29:21] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 9/109 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:29:23] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-05-22 04:29:23] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:29:25] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-22 04:29:26] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-22 04:29:26] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:29:28] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-22 04:29:29] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:29:30] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-22 04:29:30] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 11 (OVERLAPS) 293/646 variables, 353/471 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/646 variables, 292/763 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 763 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 56/56 constraints]
After SMT, in 60112ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
Starting structural reductions in LTL mode, iteration 1 : 353/362 places, 293/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60692 ms. Remains : 353/362 places, 293/307 transitions.
Stuttering acceptance computed with spot in 325 ms :[p0, p0, p0, p0, p0, p0, p0, p0]
Running random walk in product with property : DES-PT-30b-LTLFireability-02
Product exploration explored 100000 steps with 882 reset in 254 ms.
Product exploration explored 100000 steps with 899 reset in 201 ms.
Computed a total of 176 stabilizing places and 168 stable transitions
Graph (complete) has 766 edges and 353 vertex of which 347 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.12 ms
Computed a total of 176 stabilizing places and 168 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 8 states, 16 edges and 1 AP (stutter sensitive) to 8 states, 16 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 342 ms :[p0, p0, p0, p0, p0, p0, p0, p0]
RANDOM walk for 1988 steps (18 resets) in 19 ms. (99 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 8 states, 16 edges and 1 AP (stutter sensitive) to 8 states, 16 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 353 ms :[p0, p0, p0, p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 334 ms :[p0, p0, p0, p0, p0, p0, p0, p0]
Support contains 2 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 353 /353 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-05-22 04:29:50] [INFO ] Invariant cache hit.
[2024-05-22 04:29:51] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-22 04:29:51] [INFO ] Invariant cache hit.
[2024-05-22 04:29:51] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2024-05-22 04:29:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/353 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 293/646 variables, 353/415 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:29:57] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 2 ms to minimize.
[2024-05-22 04:29:57] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-22 04:29:57] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 2 ms to minimize.
[2024-05-22 04:29:57] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-22 04:29:58] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 2 ms to minimize.
[2024-05-22 04:29:58] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-22 04:29:58] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-22 04:29:58] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-22 04:29:58] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-22 04:29:58] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-22 04:29:58] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-22 04:29:58] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-22 04:29:58] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-22 04:29:59] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-22 04:29:59] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-22 04:29:59] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2024-05-22 04:29:59] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2024-05-22 04:30:00] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-22 04:30:00] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-05-22 04:30:00] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 20/435 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:30:04] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-22 04:30:05] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2024-05-22 04:30:05] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-05-22 04:30:05] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 4/439 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:30:07] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-22 04:30:09] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 2/441 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:30:10] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-22 04:30:11] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-22 04:30:11] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
[2024-05-22 04:30:12] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 2 ms to minimize.
[2024-05-22 04:30:12] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-22 04:30:12] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 6/447 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:30:19] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:30:20] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 646/646 variables, and 449 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/353 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 34/96 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:30:23] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2024-05-22 04:30:23] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-22 04:30:24] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 2 ms to minimize.
[2024-05-22 04:30:24] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-22 04:30:24] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-05-22 04:30:24] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-22 04:30:24] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-22 04:30:24] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-22 04:30:24] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-22 04:30:24] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2024-05-22 04:30:24] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 2 ms to minimize.
[2024-05-22 04:30:24] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-22 04:30:25] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 2 ms to minimize.
[2024-05-22 04:30:25] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-22 04:30:25] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-22 04:30:25] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-22 04:30:25] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-22 04:30:25] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-22 04:30:25] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-22 04:30:26] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:30:27] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
[2024-05-22 04:30:27] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-22 04:30:27] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-22 04:30:29] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-05-22 04:30:29] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 5/121 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:30:29] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:30:31] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:30:34] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-22 04:30:34] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-05-22 04:30:34] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:30:36] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 12 (OVERLAPS) 293/646 variables, 353/480 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/646 variables, 292/772 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 772 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 65/65 constraints]
After SMT, in 60116ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 60119ms
Finished structural reductions in LTL mode , in 1 iterations and 60702 ms. Remains : 353/353 places, 293/293 transitions.
Computed a total of 176 stabilizing places and 168 stable transitions
Graph (complete) has 766 edges and 353 vertex of which 347 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Computed a total of 176 stabilizing places and 168 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 8 states, 16 edges and 1 AP (stutter sensitive) to 8 states, 16 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 359 ms :[p0, p0, p0, p0, p0, p0, p0, p0]
RANDOM walk for 908 steps (6 resets) in 9 ms. (90 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 8 states, 16 edges and 1 AP (stutter sensitive) to 8 states, 16 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 311 ms :[p0, p0, p0, p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 319 ms :[p0, p0, p0, p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 312 ms :[p0, p0, p0, p0, p0, p0, p0, p0]
Product exploration explored 100000 steps with 879 reset in 164 ms.
Product exploration explored 100000 steps with 881 reset in 193 ms.
Built C files in :
/tmp/ltsmin16985258607636352191
[2024-05-22 04:30:53] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16985258607636352191
Running compilation step : cd /tmp/ltsmin16985258607636352191;'/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 556 ms.
Running link step : cd /tmp/ltsmin16985258607636352191;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin16985258607636352191;'/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/stateBased14106371131582804546.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 293/293 transitions.
Applied a total of 0 rules in 3 ms. Remains 353 /353 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-05-22 04:31:08] [INFO ] Invariant cache hit.
[2024-05-22 04:31:09] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-22 04:31:09] [INFO ] Invariant cache hit.
[2024-05-22 04:31:09] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2024-05-22 04:31:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/353 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 293/646 variables, 353/415 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:31:15] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 3 ms to minimize.
[2024-05-22 04:31:15] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-22 04:31:15] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 2 ms to minimize.
[2024-05-22 04:31:15] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-05-22 04:31:16] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 2 ms to minimize.
[2024-05-22 04:31:16] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-22 04:31:16] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-22 04:31:16] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-22 04:31:16] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-22 04:31:16] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-22 04:31:16] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-22 04:31:16] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-22 04:31:16] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-22 04:31:17] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 0 ms to minimize.
[2024-05-22 04:31:17] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-22 04:31:17] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-22 04:31:17] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-05-22 04:31:18] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-22 04:31:18] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-05-22 04:31:19] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 20/435 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:31:22] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-22 04:31:23] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 2 ms to minimize.
[2024-05-22 04:31:23] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-05-22 04:31:23] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 4/439 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:31:25] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-22 04:31:27] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 2/441 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:31:28] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2024-05-22 04:31:29] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-22 04:31:30] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 2 ms to minimize.
[2024-05-22 04:31:30] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 2 ms to minimize.
[2024-05-22 04:31:30] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-22 04:31:30] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 6/447 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:31:37] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:31:38] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 646/646 variables, and 449 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/353 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 34/96 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:31:41] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-05-22 04:31:41] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-05-22 04:31:41] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-05-22 04:31:42] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-05-22 04:31:42] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
[2024-05-22 04:31:42] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2024-05-22 04:31:42] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2024-05-22 04:31:42] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2024-05-22 04:31:42] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-22 04:31:42] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-22 04:31:42] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 2 ms to minimize.
[2024-05-22 04:31:42] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-22 04:31:43] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 2 ms to minimize.
[2024-05-22 04:31:43] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-22 04:31:43] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-22 04:31:43] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-22 04:31:43] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-22 04:31:43] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2024-05-22 04:31:43] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-22 04:31:45] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:31:45] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 1 ms to minimize.
[2024-05-22 04:31:45] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-22 04:31:45] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-22 04:31:47] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-22 04:31:47] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 5/121 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:31:48] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:31:50] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:31:52] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-22 04:31:52] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-22 04:31:52] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:31:55] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 12 (OVERLAPS) 293/646 variables, 353/480 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/646 variables, 292/772 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 772 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 65/65 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Finished structural reductions in LTL mode , in 1 iterations and 60684 ms. Remains : 353/353 places, 293/293 transitions.
Built C files in :
/tmp/ltsmin6715771557315521138
[2024-05-22 04:32:09] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6715771557315521138
Running compilation step : cd /tmp/ltsmin6715771557315521138;'/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 542 ms.
Running link step : cd /tmp/ltsmin6715771557315521138;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin6715771557315521138;'/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/stateBased5709001752558953543.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 04:32:24] [INFO ] Flatten gal took : 14 ms
[2024-05-22 04:32:24] [INFO ] Flatten gal took : 13 ms
[2024-05-22 04:32:24] [INFO ] Time to serialize gal into /tmp/LTL17945251640681178761.gal : 2 ms
[2024-05-22 04:32:24] [INFO ] Time to serialize properties into /tmp/LTL11429616658948304865.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/LTL17945251640681178761.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16580986080217545969.hoa' '-atoms' '/tmp/LTL11429616658948304865.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...320
Loading property file /tmp/LTL11429616658948304865.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16580986080217545969.hoa
Detected timeout of ITS tools.
[2024-05-22 04:32:39] [INFO ] Flatten gal took : 13 ms
[2024-05-22 04:32:39] [INFO ] Flatten gal took : 12 ms
[2024-05-22 04:32:39] [INFO ] Time to serialize gal into /tmp/LTL4781340376493872314.gal : 2 ms
[2024-05-22 04:32:39] [INFO ] Time to serialize properties into /tmp/LTL10398903129720767027.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/LTL4781340376493872314.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10398903129720767027.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((!("((p366==1)&&(p395==1))"))U(X(X(X(!("((p366==1)&&(p395==1))")))))))))
Formula 0 simplified : GF("((p366==1)&&(p395==1))" R XXX"((p366==1)&&(p395==1))")
Detected timeout of ITS tools.
[2024-05-22 04:32:54] [INFO ] Flatten gal took : 14 ms
[2024-05-22 04:32:54] [INFO ] Applying decomposition
[2024-05-22 04:32:54] [INFO ] Flatten gal took : 11 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/graph8294687360770191568.txt' '-o' '/tmp/graph8294687360770191568.bin' '-w' '/tmp/graph8294687360770191568.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8294687360770191568.bin' '-l' '-1' '-v' '-w' '/tmp/graph8294687360770191568.weights' '-q' '0' '-e' '0.001'
[2024-05-22 04:32:54] [INFO ] Decomposing Gal with order
[2024-05-22 04:32:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 04:32:54] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-22 04:32:54] [INFO ] Flatten gal took : 21 ms
[2024-05-22 04:32:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2024-05-22 04:32:54] [INFO ] Time to serialize gal into /tmp/LTL6316317118719905322.gal : 4 ms
[2024-05-22 04:32:54] [INFO ] Time to serialize properties into /tmp/LTL12660880876110875783.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/LTL6316317118719905322.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12660880876110875783.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((!("((i6.i0.i1.u67.p366==1)&&(u76.p395==1))"))U(X(X(X(!("((i6.i0.i1.u67.p366==1)&&(u76.p395==1))")))))))))
Formula 0 simplified : GF("((i6.i0.i1.u67.p366==1)&&(u76.p395==1))" R XXX"((i6.i0.i1.u67.p366==1)&&(u76.p395==1))")
Detected timeout of ITS tools.
Treatment of property DES-PT-30b-LTLFireability-02 finished in 261865 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(((p1&&G(F(p2)))||p0)))'
Support contains 5 out of 362 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Graph (complete) has 786 edges and 362 vertex of which 355 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 354 transition count 288
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 340 transition count 287
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 30 place count 340 transition count 276
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 52 place count 329 transition count 276
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 58 place count 323 transition count 270
Iterating global reduction 2 with 6 rules applied. Total rules applied 64 place count 323 transition count 270
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 67 place count 323 transition count 267
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 67 place count 323 transition count 266
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 322 transition count 266
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 321 transition count 265
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 321 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 321 transition count 264
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 72 place count 321 transition count 263
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 74 place count 320 transition count 263
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
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 220 place count 247 transition count 190
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 224 place count 245 transition count 192
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 226 place count 243 transition count 190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 227 place count 242 transition count 190
Applied a total of 227 rules in 45 ms. Remains 242 /362 variables (removed 120) and now considering 190/307 (removed 117) transitions.
// Phase 1: matrix 190 rows 242 cols
[2024-05-22 04:33:10] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 04:33:10] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-22 04:33:10] [INFO ] Invariant cache hit.
[2024-05-22 04:33:10] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 04:33:10] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2024-05-22 04:33:10] [INFO ] Redundant transitions in 1 ms returned []
Running 185 sub problems to find dead transitions.
[2024-05-22 04:33:10] [INFO ] Invariant cache hit.
[2024-05-22 04:33:10] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 2/239 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 2/241 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 190/431 variables, 241/299 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 6/305 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 04:33:15] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-22 04:33:15] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2024-05-22 04:33:16] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-22 04:33:17] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 4/309 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 04:33:18] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 04:33:21] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-22 04:33:21] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-22 04:33:21] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-22 04:33:21] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-22 04:33:21] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-22 04:33:21] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 6/316 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 13 (OVERLAPS) 1/432 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/432 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 04:33:27] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/432 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/432 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 17 (OVERLAPS) 0/432 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 318 constraints, problems are : Problem set: 0 solved, 185 unsolved in 21779 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 242/242 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 2/239 variables, 11/59 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 04:33:33] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 2/241 variables, 9/69 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (OVERLAPS) 190/431 variables, 241/312 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 6/318 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 185/503 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 04:33:45] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 04:33:56] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 431/432 variables, and 505 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 241/242 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 15/15 constraints]
After SMT, in 51873ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 51876ms
Starting structural reductions in SI_LTL mode, iteration 1 : 242/362 places, 190/307 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52328 ms. Remains : 242/362 places, 190/307 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Running random walk in product with property : DES-PT-30b-LTLFireability-03
Product exploration explored 100000 steps with 4219 reset in 220 ms.
Product exploration explored 100000 steps with 4216 reset in 239 ms.
Computed a total of 137 stabilizing places and 132 stable transitions
Computed a total of 137 stabilizing places and 132 stable transitions
Detected a total of 137/242 stabilizing places and 132/190 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (OR p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 14 factoid took 354 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (1706 resets) in 321 ms. (124 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (360 resets) in 188 ms. (211 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (296 resets) in 164 ms. (242 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (334 resets) in 253 ms. (157 steps per ms) remains 3/3 properties
[2024-05-22 04:34:03] [INFO ] Invariant cache hit.
[2024-05-22 04:34:03] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 18/23 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/29 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 131/160 variables, 17/28 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 31/191 variables, 20/48 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 12/203 variables, 8/56 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 158/361 variables, 203/259 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/361 variables, 6/265 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/361 variables, 0/265 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 9/370 variables, 7/272 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 1/273 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/370 variables, 0/273 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 32/402 variables, 2/275 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/402 variables, 1/276 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/402 variables, 0/276 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 30/432 variables, 30/306 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/432 variables, 0/306 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/432 variables, 0/306 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 306 constraints, problems are : Problem set: 1 solved, 2 unsolved in 252 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 242/242 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/29 variables, 9/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 131/160 variables, 17/28 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 31/191 variables, 20/48 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 12/203 variables, 8/56 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 158/361 variables, 203/259 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/361 variables, 6/265 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/361 variables, 2/267 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-22 04:34:04] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-22 04:34:04] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/361 variables, 2/269 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/361 variables, 0/269 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 9/370 variables, 7/276 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/370 variables, 1/277 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/370 variables, 0/277 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 32/402 variables, 2/279 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/402 variables, 1/280 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/402 variables, 0/280 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 30/432 variables, 30/310 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/432 variables, 0/310 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/432 variables, 0/310 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 310 constraints, problems are : Problem set: 1 solved, 2 unsolved in 473 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 242/242 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 731ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 485 ms.
Support contains 4 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 190/190 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 242 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 1 with 2 rules applied. Total rules applied 3 place count 241 transition count 188
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 241 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 240 transition count 187
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 240 transition count 187
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 239 transition count 186
Applied a total of 7 rules in 18 ms. Remains 239 /242 variables (removed 3) and now considering 186/190 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 239/242 places, 186/190 transitions.
RANDOM walk for 40000 steps (1841 resets) in 504 ms. (79 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (349 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (346 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 940769 steps, run timeout after 3001 ms. (steps per millisecond=313 ) properties seen :0 out of 2
Probabilistic random walk after 940769 steps, saw 126336 distinct states, run finished after 3001 ms. (steps per millisecond=313 ) properties seen :0
// Phase 1: matrix 186 rows 239 cols
[2024-05-22 04:34:08] [INFO ] Computed 59 invariants in 6 ms
[2024-05-22 04:34:08] [INFO ] State equation strengthened by 6 read => feed constraints.
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) 5/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/13 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 111/124 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 43/167 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 28/195 variables, 21/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/201 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 154/355 variables, 201/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 6/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 9/364 variables, 6/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/364 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/364 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 32/396 variables, 3/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/396 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/396 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 29/425 variables, 29/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/425 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/425 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 304 constraints, problems are : Problem set: 0 solved, 2 unsolved in 235 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 239/239 constraints, ReadFeed: 6/6 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) 5/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/13 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 111/124 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 43/167 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 28/195 variables, 21/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/201 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 154/355 variables, 201/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 6/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/355 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 9/364 variables, 6/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/364 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/364 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 32/396 variables, 3/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/396 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/396 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 29/425 variables, 29/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/425 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/425 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 306 constraints, problems are : Problem set: 0 solved, 2 unsolved in 335 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 239/239 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 584ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 532 ms.
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 186/186 transitions.
Applied a total of 0 rules in 4 ms. Remains 239 /239 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 239/239 places, 186/186 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 186/186 transitions.
Applied a total of 0 rules in 4 ms. Remains 239 /239 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2024-05-22 04:34:09] [INFO ] Invariant cache hit.
[2024-05-22 04:34:09] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-22 04:34:09] [INFO ] Invariant cache hit.
[2024-05-22 04:34:09] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 04:34:09] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2024-05-22 04:34:09] [INFO ] Redundant transitions in 0 ms returned []
Running 182 sub problems to find dead transitions.
[2024-05-22 04:34:09] [INFO ] Invariant cache hit.
[2024-05-22 04:34:09] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 15/47 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (OVERLAPS) 1/236 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 2/238 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 182 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 186/424 variables, 238/297 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 6/303 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 04:34:15] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-22 04:34:15] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-22 04:34:16] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 3/306 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 04:34:17] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 04:34:18] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 13 (OVERLAPS) 1/425 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 04:34:22] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 2 ms to minimize.
[2024-05-22 04:34:22] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-22 04:34:22] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/425 variables, 3/312 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/425 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 16 (OVERLAPS) 0/425 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 312 constraints, problems are : Problem set: 0 solved, 182 unsolved in 16872 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 239/239 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 15/47 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 1/236 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (OVERLAPS) 2/238 variables, 9/64 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 04:34:29] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (OVERLAPS) 186/424 variables, 238/306 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 6/312 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 182/494 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 04:34:40] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-22 04:34:40] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/424 variables, 2/496 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 04:34:49] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/425 variables, and 497 constraints, problems are : Problem set: 0 solved, 182 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 238/239 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 12/12 constraints]
After SMT, in 46966ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 46968ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47371 ms. Remains : 239/239 places, 186/186 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 239 transition count 186
Applied a total of 1 rules in 9 ms. Remains 239 /239 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 186 rows 239 cols
[2024-05-22 04:34:56] [INFO ] Computed 59 invariants in 2 ms
[2024-05-22 04:34:56] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 04:34:56] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 38 ms returned sat
[2024-05-22 04:34:56] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 04:34:57] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 04:34:57] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 04:34:57] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 04:34:57] [INFO ] After 128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 04:34:57] [INFO ] After 238ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 396 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (OR p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (G (OR p0 (NOT p1) p2))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 15 factoid took 578 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 105 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Support contains 5 out of 242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 242/242 places, 190/190 transitions.
Applied a total of 0 rules in 10 ms. Remains 242 /242 variables (removed 0) and now considering 190/190 (removed 0) transitions.
// Phase 1: matrix 190 rows 242 cols
[2024-05-22 04:34:58] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 04:34:58] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-22 04:34:58] [INFO ] Invariant cache hit.
[2024-05-22 04:34:58] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 04:34:58] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2024-05-22 04:34:58] [INFO ] Redundant transitions in 0 ms returned []
Running 185 sub problems to find dead transitions.
[2024-05-22 04:34:58] [INFO ] Invariant cache hit.
[2024-05-22 04:34:58] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 2/239 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 2/241 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 190/431 variables, 241/299 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 6/305 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 04:35:03] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-22 04:35:03] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2024-05-22 04:35:04] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-22 04:35:05] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 4/309 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 04:35:06] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 04:35:08] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-22 04:35:08] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-22 04:35:08] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-22 04:35:08] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-22 04:35:08] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-22 04:35:09] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 6/316 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 13 (OVERLAPS) 1/432 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/432 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 04:35:15] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/432 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/432 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 17 (OVERLAPS) 0/432 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 318 constraints, problems are : Problem set: 0 solved, 185 unsolved in 21487 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 242/242 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 2/239 variables, 11/59 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 04:35:21] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 2/241 variables, 9/69 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (OVERLAPS) 190/431 variables, 241/312 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 6/318 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 185/503 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 04:35:32] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 04:35:43] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 431/432 variables, and 505 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 241/242 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 15/15 constraints]
After SMT, in 51572ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 51577ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51979 ms. Remains : 242/242 places, 190/190 transitions.
Computed a total of 137 stabilizing places and 132 stable transitions
Computed a total of 137 stabilizing places and 132 stable transitions
Detected a total of 137/242 stabilizing places and 132/190 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (OR p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 14 factoid took 349 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (1725 resets) in 595 ms. (67 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40001 steps (334 resets) in 133 ms. (298 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (302 resets) in 79 ms. (500 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (333 resets) in 236 ms. (168 steps per ms) remains 3/3 properties
[2024-05-22 04:35:50] [INFO ] Invariant cache hit.
[2024-05-22 04:35:50] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 18/23 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/29 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 131/160 variables, 17/28 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 31/191 variables, 20/48 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 12/203 variables, 8/56 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 158/361 variables, 203/259 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/361 variables, 6/265 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/361 variables, 0/265 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 9/370 variables, 7/272 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 1/273 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/370 variables, 0/273 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 32/402 variables, 2/275 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/402 variables, 1/276 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/402 variables, 0/276 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 30/432 variables, 30/306 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/432 variables, 0/306 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/432 variables, 0/306 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 306 constraints, problems are : Problem set: 1 solved, 2 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 242/242 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/29 variables, 9/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 131/160 variables, 17/28 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 31/191 variables, 20/48 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 12/203 variables, 8/56 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 158/361 variables, 203/259 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/361 variables, 6/265 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/361 variables, 2/267 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-22 04:35:51] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-22 04:35:51] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/361 variables, 2/269 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/361 variables, 0/269 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 9/370 variables, 7/276 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/370 variables, 1/277 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/370 variables, 0/277 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 32/402 variables, 2/279 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/402 variables, 1/280 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/402 variables, 0/280 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 30/432 variables, 30/310 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/432 variables, 0/310 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/432 variables, 0/310 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 310 constraints, problems are : Problem set: 1 solved, 2 unsolved in 499 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 242/242 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 758ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 508 ms.
Support contains 4 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 190/190 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 242 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 1 with 2 rules applied. Total rules applied 3 place count 241 transition count 188
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 241 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 240 transition count 187
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 240 transition count 187
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 239 transition count 186
Applied a total of 7 rules in 20 ms. Remains 239 /242 variables (removed 3) and now considering 186/190 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 239/242 places, 186/190 transitions.
RANDOM walk for 40000 steps (1839 resets) in 617 ms. (64 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (351 resets) in 251 ms. (158 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (337 resets) in 188 ms. (211 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1042725 steps, run timeout after 3001 ms. (steps per millisecond=347 ) properties seen :0 out of 2
Probabilistic random walk after 1042725 steps, saw 138569 distinct states, run finished after 3001 ms. (steps per millisecond=347 ) properties seen :0
// Phase 1: matrix 186 rows 239 cols
[2024-05-22 04:35:55] [INFO ] Computed 59 invariants in 5 ms
[2024-05-22 04:35:55] [INFO ] State equation strengthened by 6 read => feed constraints.
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) 5/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/13 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 111/124 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 43/167 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 28/195 variables, 21/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/201 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 154/355 variables, 201/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 6/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 9/364 variables, 6/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/364 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/364 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 32/396 variables, 3/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/396 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/396 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 29/425 variables, 29/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/425 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/425 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 304 constraints, problems are : Problem set: 0 solved, 2 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 239/239 constraints, ReadFeed: 6/6 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) 5/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/13 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 111/124 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 43/167 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 28/195 variables, 21/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/201 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 154/355 variables, 201/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 6/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/355 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 9/364 variables, 6/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/364 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/364 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 32/396 variables, 3/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/396 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/396 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 29/425 variables, 29/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/425 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/425 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 306 constraints, problems are : Problem set: 0 solved, 2 unsolved in 352 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 239/239 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 673ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 633 ms.
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 186/186 transitions.
Applied a total of 0 rules in 3 ms. Remains 239 /239 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 239/239 places, 186/186 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 186/186 transitions.
Applied a total of 0 rules in 7 ms. Remains 239 /239 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2024-05-22 04:35:56] [INFO ] Invariant cache hit.
[2024-05-22 04:35:57] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-22 04:35:57] [INFO ] Invariant cache hit.
[2024-05-22 04:35:57] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 04:35:57] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2024-05-22 04:35:57] [INFO ] Redundant transitions in 1 ms returned []
Running 182 sub problems to find dead transitions.
[2024-05-22 04:35:57] [INFO ] Invariant cache hit.
[2024-05-22 04:35:57] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 15/47 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (OVERLAPS) 1/236 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 2/238 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 182 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 186/424 variables, 238/297 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 6/303 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 04:36:02] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-22 04:36:03] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-22 04:36:03] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 3/306 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 04:36:04] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 04:36:06] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 13 (OVERLAPS) 1/425 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 04:36:09] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 2 ms to minimize.
[2024-05-22 04:36:10] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-22 04:36:10] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/425 variables, 3/312 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/425 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 16 (OVERLAPS) 0/425 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 312 constraints, problems are : Problem set: 0 solved, 182 unsolved in 16813 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 239/239 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 15/47 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 1/236 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (OVERLAPS) 2/238 variables, 9/64 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 04:36:16] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (OVERLAPS) 186/424 variables, 238/306 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 6/312 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 182/494 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 04:36:27] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 2 ms to minimize.
[2024-05-22 04:36:27] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/424 variables, 2/496 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 04:36:36] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/425 variables, and 497 constraints, problems are : Problem set: 0 solved, 182 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 238/239 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 12/12 constraints]
After SMT, in 46892ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 46894ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47339 ms. Remains : 239/239 places, 186/186 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 239 transition count 186
Applied a total of 1 rules in 13 ms. Remains 239 /239 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 186 rows 239 cols
[2024-05-22 04:36:44] [INFO ] Computed 59 invariants in 4 ms
[2024-05-22 04:36:44] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 04:36:44] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-22 04:36:44] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 04:36:44] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 04:36:44] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-22 04:36:44] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 04:36:44] [INFO ] After 130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 04:36:44] [INFO ] After 233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 328 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (OR p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (G (OR p0 (NOT p1) p2))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 15 factoid took 633 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 149 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 142 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 4245 reset in 217 ms.
Product exploration explored 100000 steps with 4282 reset in 251 ms.
Built C files in :
/tmp/ltsmin17565436427457007023
[2024-05-22 04:36:46] [INFO ] Computing symmetric may disable matrix : 190 transitions.
[2024-05-22 04:36:46] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 04:36:46] [INFO ] Computing symmetric may enable matrix : 190 transitions.
[2024-05-22 04:36:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 04:36:46] [INFO ] Computing Do-Not-Accords matrix : 190 transitions.
[2024-05-22 04:36:46] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 04:36:46] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17565436427457007023
Running compilation step : cd /tmp/ltsmin17565436427457007023;'/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 520 ms.
Running link step : cd /tmp/ltsmin17565436427457007023;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin17565436427457007023;'/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/stateBased18421175257012484871.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 242/242 places, 190/190 transitions.
Applied a total of 0 rules in 11 ms. Remains 242 /242 variables (removed 0) and now considering 190/190 (removed 0) transitions.
// Phase 1: matrix 190 rows 242 cols
[2024-05-22 04:37:01] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 04:37:01] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-22 04:37:01] [INFO ] Invariant cache hit.
[2024-05-22 04:37:01] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 04:37:01] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2024-05-22 04:37:01] [INFO ] Redundant transitions in 0 ms returned []
Running 185 sub problems to find dead transitions.
[2024-05-22 04:37:01] [INFO ] Invariant cache hit.
[2024-05-22 04:37:01] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 2/239 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 2/241 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 190/431 variables, 241/299 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 6/305 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 04:37:06] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-22 04:37:06] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-22 04:37:07] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-05-22 04:37:08] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 4/309 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 04:37:09] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 04:37:11] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-22 04:37:11] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-22 04:37:12] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-22 04:37:12] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-22 04:37:12] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-22 04:37:12] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 6/316 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 13 (OVERLAPS) 1/432 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/432 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 04:37:18] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/432 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/432 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 17 (OVERLAPS) 0/432 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 318 constraints, problems are : Problem set: 0 solved, 185 unsolved in 21270 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 242/242 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 2/239 variables, 11/59 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 04:37:24] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 2/241 variables, 9/69 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (OVERLAPS) 190/431 variables, 241/312 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 6/318 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 185/503 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 04:37:35] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 04:37:46] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 431/432 variables, and 505 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 241/242 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 15/15 constraints]
After SMT, in 51358ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 51360ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51776 ms. Remains : 242/242 places, 190/190 transitions.
Built C files in :
/tmp/ltsmin5399636674134217508
[2024-05-22 04:37:53] [INFO ] Computing symmetric may disable matrix : 190 transitions.
[2024-05-22 04:37:53] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 04:37:53] [INFO ] Computing symmetric may enable matrix : 190 transitions.
[2024-05-22 04:37:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 04:37:53] [INFO ] Computing Do-Not-Accords matrix : 190 transitions.
[2024-05-22 04:37:53] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 04:37:53] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5399636674134217508
Running compilation step : cd /tmp/ltsmin5399636674134217508;'/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 486 ms.
Running link step : cd /tmp/ltsmin5399636674134217508;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin5399636674134217508;'/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/stateBased11831085572125162997.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 04:38:08] [INFO ] Flatten gal took : 14 ms
[2024-05-22 04:38:08] [INFO ] Flatten gal took : 11 ms
[2024-05-22 04:38:08] [INFO ] Time to serialize gal into /tmp/LTL8007756220073598840.gal : 2 ms
[2024-05-22 04:38:08] [INFO ] Time to serialize properties into /tmp/LTL18339170080094201130.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/LTL8007756220073598840.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2978241720973621813.hoa' '-atoms' '/tmp/LTL18339170080094201130.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/LTL18339170080094201130.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2978241720973621813.hoa
Detected timeout of ITS tools.
[2024-05-22 04:38:23] [INFO ] Flatten gal took : 7 ms
[2024-05-22 04:38:23] [INFO ] Flatten gal took : 7 ms
[2024-05-22 04:38:23] [INFO ] Time to serialize gal into /tmp/LTL10185529601055681633.gal : 1 ms
[2024-05-22 04:38:23] [INFO ] Time to serialize properties into /tmp/LTL2599852504889741840.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/LTL10185529601055681633.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2599852504889741840.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(("((p277!=1)||(p302!=1))")||((G(F("(p294!=1)")))&&("((p117!=1)||(p149!=1))")))))
Formula 0 simplified : F(!"((p277!=1)||(p302!=1))" & (!"((p117!=1)||(p149!=1))" | FG!"(p294!=1)"))
Detected timeout of ITS tools.
[2024-05-22 04:38:38] [INFO ] Flatten gal took : 8 ms
[2024-05-22 04:38:38] [INFO ] Applying decomposition
[2024-05-22 04:38:38] [INFO ] Flatten gal took : 8 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/graph16357917548490541112.txt' '-o' '/tmp/graph16357917548490541112.bin' '-w' '/tmp/graph16357917548490541112.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16357917548490541112.bin' '-l' '-1' '-v' '-w' '/tmp/graph16357917548490541112.weights' '-q' '0' '-e' '0.001'
[2024-05-22 04:38:38] [INFO ] Decomposing Gal with order
[2024-05-22 04:38:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 04:38:38] [INFO ] Removed a total of 45 redundant transitions.
[2024-05-22 04:38:38] [INFO ] Flatten gal took : 12 ms
[2024-05-22 04:38:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 4 ms.
[2024-05-22 04:38:38] [INFO ] Time to serialize gal into /tmp/LTL3296996250411873515.gal : 3 ms
[2024-05-22 04:38:38] [INFO ] Time to serialize properties into /tmp/LTL8609671781624115360.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/LTL3296996250411873515.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8609671781624115360.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(("((i7.i0.u13.p277!=1)||(i7.i0.u21.p302!=1))")||((G(F("(i6.i3.u20.p294!=1)")))&&("((u2.p117!=1)||(u2.p149!=1))")))))
Formula 0 simplified : F(!"((i7.i0.u13.p277!=1)||(i7.i0.u21.p302!=1))" & (!"((u2.p117!=1)||(u2.p149!=1))" | FG!"(i6.i3.u20.p294!=1)"))
Reverse transition relation is NOT exact ! Due to transitions t120_t128, t299_t79, t52_t54_t56_t58_t60_t62, t7_t48_t39, t266_t34, t265_t25, t110_t111_t127_...770
Computing Next relation with stutter on 6.88693e+07 deadlock states
Detected timeout of ITS tools.
Treatment of property DES-PT-30b-LTLFireability-03 finished in 343338 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 362 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Graph (complete) has 786 edges and 362 vertex of which 355 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 354 transition count 288
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 340 transition count 287
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 30 place count 340 transition count 276
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 52 place count 329 transition count 276
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 58 place count 323 transition count 270
Iterating global reduction 2 with 6 rules applied. Total rules applied 64 place count 323 transition count 270
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 67 place count 323 transition count 267
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 67 place count 323 transition count 266
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 322 transition count 266
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 321 transition count 265
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 321 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 321 transition count 264
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 72 place count 321 transition count 263
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 74 place count 320 transition count 263
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 226 place count 244 transition count 187
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 230 place count 242 transition count 189
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 232 place count 240 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 233 place count 239 transition count 187
Applied a total of 233 rules in 35 ms. Remains 239 /362 variables (removed 123) and now considering 187/307 (removed 120) transitions.
// Phase 1: matrix 187 rows 239 cols
[2024-05-22 04:38:53] [INFO ] Computed 58 invariants in 1 ms
[2024-05-22 04:38:53] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-22 04:38:53] [INFO ] Invariant cache hit.
[2024-05-22 04:38:53] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 04:38:53] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2024-05-22 04:38:53] [INFO ] Redundant transitions in 1 ms returned []
Running 184 sub problems to find dead transitions.
[2024-05-22 04:38:53] [INFO ] Invariant cache hit.
[2024-05-22 04:38:53] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 1/237 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 1/238 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 187/425 variables, 238/296 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 6/302 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-22 04:38:59] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (OVERLAPS) 1/426 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-22 04:39:03] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2024-05-22 04:39:03] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-22 04:39:03] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2024-05-22 04:39:03] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-22 04:39:03] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-22 04:39:03] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 6/310 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-22 04:39:04] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/426 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/426 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-22 04:39:08] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/426 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 17 (OVERLAPS) 0/426 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 312 constraints, problems are : Problem set: 0 solved, 184 unsolved in 18858 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 239/239 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 1/237 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 1/238 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (OVERLAPS) 187/425 variables, 238/305 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 6/311 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 184/495 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-22 04:39:19] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-22 04:39:25] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/425 variables, 2/497 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/426 variables, and 497 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 238/239 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 11/11 constraints]
After SMT, in 48951ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 48955ms
Starting structural reductions in SI_LTL mode, iteration 1 : 239/362 places, 187/307 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49431 ms. Remains : 239/362 places, 187/307 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-30b-LTLFireability-04
Product exploration explored 100000 steps with 4896 reset in 181 ms.
Product exploration explored 100000 steps with 4957 reset in 202 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 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 106 ms :[(NOT p0)]
RANDOM walk for 40000 steps (1978 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (385 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1859435 steps, run timeout after 3001 ms. (steps per millisecond=619 ) properties seen :0 out of 1
Probabilistic random walk after 1859435 steps, saw 252934 distinct states, run finished after 3001 ms. (steps per millisecond=619 ) properties seen :0
[2024-05-22 04:39:46] [INFO ] Invariant cache hit.
[2024-05-22 04:39:46] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 105/115 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 39/154 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 37/191 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/200 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 155/355 variables, 200/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 6/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/364 variables, 7/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/364 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/364 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 32/396 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/396 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/396 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 30/426 variables, 30/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/426 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/426 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 239/239 constraints, ReadFeed: 6/6 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) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 105/115 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 39/154 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 37/191 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/200 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 155/355 variables, 200/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 6/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/355 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/364 variables, 7/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/364 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/364 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 32/396 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/396 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/396 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 30/426 variables, 30/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/426 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/426 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 304 constraints, problems are : Problem set: 0 solved, 1 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 239/239 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 393ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 80 ms.
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 187/187 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 239 transition count 186
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 239 transition count 185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 238 transition count 185
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 238 transition count 185
Applied a total of 4 rules in 13 ms. Remains 238 /239 variables (removed 1) and now considering 185/187 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 238/239 places, 185/187 transitions.
RANDOM walk for 40000 steps (1858 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (387 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1780602 steps, run timeout after 3001 ms. (steps per millisecond=593 ) properties seen :0 out of 1
Probabilistic random walk after 1780602 steps, saw 242783 distinct states, run finished after 3001 ms. (steps per millisecond=593 ) properties seen :0
// Phase 1: matrix 185 rows 238 cols
[2024-05-22 04:39:50] [INFO ] Computed 59 invariants in 3 ms
[2024-05-22 04:39:50] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 105/115 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 43/158 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/191 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/200 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 153/353 variables, 200/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/353 variables, 6/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/353 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/362 variables, 6/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/362 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/362 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 32/394 variables, 3/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/394 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/394 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 29/423 variables, 29/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/423 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/423 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 238/238 constraints, ReadFeed: 6/6 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) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 105/115 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 43/158 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/191 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 04:39:50] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 9/200 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 153/353 variables, 200/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/353 variables, 6/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/353 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/353 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 9/362 variables, 6/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/362 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/362 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 32/394 variables, 3/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/394 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/394 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 29/423 variables, 29/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/423 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/423 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 305 constraints, problems are : Problem set: 0 solved, 1 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 238/238 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 466ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 57 ms.
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 185/185 transitions.
Applied a total of 0 rules in 4 ms. Remains 238 /238 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 238/238 places, 185/185 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 185/185 transitions.
Applied a total of 0 rules in 3 ms. Remains 238 /238 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2024-05-22 04:39:50] [INFO ] Invariant cache hit.
[2024-05-22 04:39:50] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-22 04:39:50] [INFO ] Invariant cache hit.
[2024-05-22 04:39:50] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 04:39:50] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2024-05-22 04:39:50] [INFO ] Redundant transitions in 0 ms returned []
Running 182 sub problems to find dead transitions.
[2024-05-22 04:39:50] [INFO ] Invariant cache hit.
[2024-05-22 04:39:50] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (OVERLAPS) 1/236 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 1/237 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 182 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 185/422 variables, 237/296 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 6/302 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 04:39:56] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-05-22 04:39:56] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 04:39:58] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-22 04:39:58] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-22 04:39:58] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 3/307 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 12 (OVERLAPS) 1/423 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 04:40:01] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-05-22 04:40:01] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 2/310 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 15 (OVERLAPS) 0/423 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 310 constraints, problems are : Problem set: 0 solved, 182 unsolved in 14934 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 238/238 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 1/236 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (OVERLAPS) 1/237 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (OVERLAPS) 185/422 variables, 237/303 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 6/309 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 182/491 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 04:40:12] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 182 unsolved
SMT process timed out in 45041ms, After SMT, problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 45043ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45430 ms. Remains : 238/238 places, 185/185 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 185
Applied a total of 1 rules in 6 ms. Remains 238 /238 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 238 cols
[2024-05-22 04:40:36] [INFO ] Computed 59 invariants in 3 ms
[2024-05-22 04:40:36] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 04:40:36] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-22 04:40:36] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 04:40:36] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 04:40:36] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-22 04:40:36] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 04:40:36] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 04:40:36] [INFO ] After 179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 262 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 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 36 ms :[(NOT p0)]
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 187/187 transitions.
Applied a total of 0 rules in 8 ms. Remains 239 /239 variables (removed 0) and now considering 187/187 (removed 0) transitions.
// Phase 1: matrix 187 rows 239 cols
[2024-05-22 04:40:36] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 04:40:36] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-22 04:40:36] [INFO ] Invariant cache hit.
[2024-05-22 04:40:36] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 04:40:36] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
[2024-05-22 04:40:36] [INFO ] Redundant transitions in 0 ms returned []
Running 184 sub problems to find dead transitions.
[2024-05-22 04:40:36] [INFO ] Invariant cache hit.
[2024-05-22 04:40:36] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 1/237 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 1/238 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 187/425 variables, 238/296 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 6/302 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-22 04:40:42] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (OVERLAPS) 1/426 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-22 04:40:46] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2024-05-22 04:40:46] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-22 04:40:46] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 2 ms to minimize.
[2024-05-22 04:40:46] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2024-05-22 04:40:46] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2024-05-22 04:40:46] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 6/310 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-22 04:40:47] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/426 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/426 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-22 04:40:51] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/426 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 17 (OVERLAPS) 0/426 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 312 constraints, problems are : Problem set: 0 solved, 184 unsolved in 18310 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 239/239 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 1/237 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 1/238 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (OVERLAPS) 187/425 variables, 238/305 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 6/311 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 184/495 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-22 04:41:01] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-22 04:41:08] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/425 variables, 2/497 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/426 variables, and 497 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 238/239 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 11/11 constraints]
After SMT, in 48410ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 48412ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 48845 ms. Remains : 239/239 places, 187/187 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 40000 steps (1945 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (399 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1812653 steps, run timeout after 3001 ms. (steps per millisecond=604 ) properties seen :0 out of 1
Probabilistic random walk after 1812653 steps, saw 247208 distinct states, run finished after 3002 ms. (steps per millisecond=603 ) properties seen :0
[2024-05-22 04:41:28] [INFO ] Invariant cache hit.
[2024-05-22 04:41:28] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 105/115 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 39/154 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 37/191 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/200 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 155/355 variables, 200/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 6/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/364 variables, 7/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/364 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/364 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 32/396 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/396 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/396 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 30/426 variables, 30/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/426 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/426 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 239/239 constraints, ReadFeed: 6/6 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) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 105/115 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 39/154 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 37/191 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/200 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 155/355 variables, 200/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 6/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/355 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/364 variables, 7/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/364 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/364 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 32/396 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/396 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/396 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 30/426 variables, 30/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/426 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/426 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 304 constraints, problems are : Problem set: 0 solved, 1 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 239/239 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 452ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 81 ms.
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 187/187 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 239 transition count 186
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 239 transition count 185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 238 transition count 185
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 238 transition count 185
Applied a total of 4 rules in 20 ms. Remains 238 /239 variables (removed 1) and now considering 185/187 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 238/239 places, 185/187 transitions.
RANDOM walk for 40000 steps (1883 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (383 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1755542 steps, run timeout after 3001 ms. (steps per millisecond=584 ) properties seen :0 out of 1
Probabilistic random walk after 1755542 steps, saw 239626 distinct states, run finished after 3001 ms. (steps per millisecond=584 ) properties seen :0
// Phase 1: matrix 185 rows 238 cols
[2024-05-22 04:41:32] [INFO ] Computed 59 invariants in 3 ms
[2024-05-22 04:41:32] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 105/115 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 43/158 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/191 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/200 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 153/353 variables, 200/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/353 variables, 6/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/353 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/362 variables, 6/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/362 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/362 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 32/394 variables, 3/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/394 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/394 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 29/423 variables, 29/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/423 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/423 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 238/238 constraints, ReadFeed: 6/6 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) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 105/115 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 43/158 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/191 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 04:41:32] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 9/200 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 153/353 variables, 200/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/353 variables, 6/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/353 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/353 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 9/362 variables, 6/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/362 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/362 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 32/394 variables, 3/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/394 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/394 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 29/423 variables, 29/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/423 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/423 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 305 constraints, problems are : Problem set: 0 solved, 1 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 238/238 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 506ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 56 ms.
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 185/185 transitions.
Applied a total of 0 rules in 3 ms. Remains 238 /238 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 238/238 places, 185/185 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 185/185 transitions.
Applied a total of 0 rules in 10 ms. Remains 238 /238 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2024-05-22 04:41:32] [INFO ] Invariant cache hit.
[2024-05-22 04:41:32] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-22 04:41:32] [INFO ] Invariant cache hit.
[2024-05-22 04:41:32] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 04:41:33] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2024-05-22 04:41:33] [INFO ] Redundant transitions in 0 ms returned []
Running 182 sub problems to find dead transitions.
[2024-05-22 04:41:33] [INFO ] Invariant cache hit.
[2024-05-22 04:41:33] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (OVERLAPS) 1/236 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 1/237 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 182 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 185/422 variables, 237/296 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 6/302 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 04:41:38] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-22 04:41:38] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 04:41:40] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-22 04:41:40] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2024-05-22 04:41:40] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 3/307 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 12 (OVERLAPS) 1/423 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 04:41:43] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 2 ms to minimize.
[2024-05-22 04:41:43] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 2/310 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 15 (OVERLAPS) 0/423 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 310 constraints, problems are : Problem set: 0 solved, 182 unsolved in 14676 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 238/238 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 1/236 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (OVERLAPS) 1/237 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (OVERLAPS) 185/422 variables, 237/303 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 6/309 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 182/491 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 04:41:54] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 182 unsolved
SMT process timed out in 44770ms, After SMT, problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 44772ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45158 ms. Remains : 238/238 places, 185/185 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 185
Applied a total of 1 rules in 5 ms. Remains 238 /238 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 238 cols
[2024-05-22 04:42:17] [INFO ] Computed 59 invariants in 5 ms
[2024-05-22 04:42:17] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 04:42:17] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-22 04:42:17] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 04:42:17] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 04:42:18] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-22 04:42:18] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 04:42:18] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 04:42:18] [INFO ] After 177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 257 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 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 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4880 reset in 190 ms.
Product exploration explored 100000 steps with 4811 reset in 205 ms.
Built C files in :
/tmp/ltsmin7370821332185377986
[2024-05-22 04:42:18] [INFO ] Computing symmetric may disable matrix : 187 transitions.
[2024-05-22 04:42:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 04:42:18] [INFO ] Computing symmetric may enable matrix : 187 transitions.
[2024-05-22 04:42:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 04:42:18] [INFO ] Computing Do-Not-Accords matrix : 187 transitions.
[2024-05-22 04:42:18] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 04:42:18] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7370821332185377986
Running compilation step : cd /tmp/ltsmin7370821332185377986;'/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 491 ms.
Running link step : cd /tmp/ltsmin7370821332185377986;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin7370821332185377986;'/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/stateBased7353806846682110635.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 187/187 transitions.
Applied a total of 0 rules in 8 ms. Remains 239 /239 variables (removed 0) and now considering 187/187 (removed 0) transitions.
// Phase 1: matrix 187 rows 239 cols
[2024-05-22 04:42:33] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 04:42:34] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-22 04:42:34] [INFO ] Invariant cache hit.
[2024-05-22 04:42:34] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 04:42:34] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2024-05-22 04:42:34] [INFO ] Redundant transitions in 0 ms returned []
Running 184 sub problems to find dead transitions.
[2024-05-22 04:42:34] [INFO ] Invariant cache hit.
[2024-05-22 04:42:34] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 1/237 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 1/238 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 187/425 variables, 238/296 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 6/302 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-22 04:42:40] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (OVERLAPS) 1/426 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-22 04:42:43] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-22 04:42:43] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-22 04:42:43] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-22 04:42:44] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-22 04:42:44] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-22 04:42:44] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 6/310 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-22 04:42:45] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/426 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/426 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-22 04:42:49] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/426 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 17 (OVERLAPS) 0/426 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 312 constraints, problems are : Problem set: 0 solved, 184 unsolved in 18772 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 239/239 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 1/237 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 1/238 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (OVERLAPS) 187/425 variables, 238/305 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 6/311 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 184/495 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-22 04:42:59] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-22 04:43:05] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/425 variables, 2/497 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/425 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 184 unsolved
SMT process timed out in 48866ms, After SMT, problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 48869ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49320 ms. Remains : 239/239 places, 187/187 transitions.
Built C files in :
/tmp/ltsmin11018916424477882648
[2024-05-22 04:43:23] [INFO ] Computing symmetric may disable matrix : 187 transitions.
[2024-05-22 04:43:23] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 04:43:23] [INFO ] Computing symmetric may enable matrix : 187 transitions.
[2024-05-22 04:43:23] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 04:43:23] [INFO ] Computing Do-Not-Accords matrix : 187 transitions.
[2024-05-22 04:43:23] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 04:43:23] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11018916424477882648
Running compilation step : cd /tmp/ltsmin11018916424477882648;'/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 507 ms.
Running link step : cd /tmp/ltsmin11018916424477882648;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin11018916424477882648;'/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/stateBased15601932806877970676.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 04:43:38] [INFO ] Flatten gal took : 8 ms
[2024-05-22 04:43:38] [INFO ] Flatten gal took : 7 ms
[2024-05-22 04:43:38] [INFO ] Time to serialize gal into /tmp/LTL6281644071309447306.gal : 2 ms
[2024-05-22 04:43:38] [INFO ] Time to serialize properties into /tmp/LTL15403817634978893535.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/LTL6281644071309447306.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11371434165686452574.hoa' '-atoms' '/tmp/LTL15403817634978893535.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/LTL15403817634978893535.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11371434165686452574.hoa
Detected timeout of ITS tools.
[2024-05-22 04:43:53] [INFO ] Flatten gal took : 7 ms
[2024-05-22 04:43:53] [INFO ] Flatten gal took : 8 ms
[2024-05-22 04:43:53] [INFO ] Time to serialize gal into /tmp/LTL2489194961313097415.gal : 2 ms
[2024-05-22 04:43:53] [INFO ] Time to serialize properties into /tmp/LTL11666281862834333246.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/LTL2489194961313097415.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11666281862834333246.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("((p119!=1)||(p149!=1))"))))
Formula 0 simplified : GF!"((p119!=1)||(p149!=1))"
Detected timeout of ITS tools.
[2024-05-22 04:44:08] [INFO ] Flatten gal took : 13 ms
[2024-05-22 04:44:08] [INFO ] Applying decomposition
[2024-05-22 04:44:08] [INFO ] Flatten gal took : 7 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/graph10150953418450464569.txt' '-o' '/tmp/graph10150953418450464569.bin' '-w' '/tmp/graph10150953418450464569.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10150953418450464569.bin' '-l' '-1' '-v' '-w' '/tmp/graph10150953418450464569.weights' '-q' '0' '-e' '0.001'
[2024-05-22 04:44:08] [INFO ] Decomposing Gal with order
[2024-05-22 04:44:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 04:44:08] [INFO ] Removed a total of 45 redundant transitions.
[2024-05-22 04:44:08] [INFO ] Flatten gal took : 15 ms
[2024-05-22 04:44:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 2 ms.
[2024-05-22 04:44:08] [INFO ] Time to serialize gal into /tmp/LTL16891304511695160022.gal : 2 ms
[2024-05-22 04:44:08] [INFO ] Time to serialize properties into /tmp/LTL10485682159917266961.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/LTL16891304511695160022.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10485682159917266961.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 : !((F(G("((u2.p119!=1)||(u2.p149!=1))"))))
Formula 0 simplified : GF!"((u2.p119!=1)||(u2.p149!=1))"
Reverse transition relation is NOT exact ! Due to transitions t120_t128, t299_t79, t7_t48_t39, t266_t34, t265_t25, t110_t111_t127_t306_t133_t134_t130_t131_...744
Computing Next relation with stutter on 6.88693e+07 deadlock states
Detected timeout of ITS tools.
Treatment of property DES-PT-30b-LTLFireability-04 finished in 330214 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((G(p0)&&X(p1)))))'
Support contains 2 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 354 transition count 299
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 354 transition count 299
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 354 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 353 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 353 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 353 transition count 293
Applied a total of 23 rules in 12 ms. Remains 353 /362 variables (removed 9) and now considering 293/307 (removed 14) transitions.
// Phase 1: matrix 293 rows 353 cols
[2024-05-22 04:44:23] [INFO ] Computed 62 invariants in 9 ms
[2024-05-22 04:44:23] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-22 04:44:23] [INFO ] Invariant cache hit.
[2024-05-22 04:44:24] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2024-05-22 04:44:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/353 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 293/646 variables, 353/415 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:44:29] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 2 ms to minimize.
[2024-05-22 04:44:30] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-22 04:44:30] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-22 04:44:30] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2024-05-22 04:44:30] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 2 ms to minimize.
[2024-05-22 04:44:30] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-22 04:44:30] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 2 ms to minimize.
[2024-05-22 04:44:30] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-22 04:44:30] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-22 04:44:30] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-22 04:44:31] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-22 04:44:31] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-22 04:44:31] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-22 04:44:31] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2024-05-22 04:44:31] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-22 04:44:31] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-22 04:44:31] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-05-22 04:44:32] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-22 04:44:32] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 2 ms to minimize.
[2024-05-22 04:44:33] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 20/435 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:44:37] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-22 04:44:37] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
[2024-05-22 04:44:37] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-05-22 04:44:37] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 4/439 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:44:40] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-22 04:44:41] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 2/441 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:44:42] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-22 04:44:43] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-22 04:44:44] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
[2024-05-22 04:44:44] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-05-22 04:44:44] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-22 04:44:44] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 6/447 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:44:51] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:44:52] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-05-22 04:44:53] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-05-22 04:44:53] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-05-22 04:44:53] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-22 04:44:53] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 646/646 variables, and 453 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/353 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 38/100 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:44:56] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-22 04:44:56] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-22 04:44:56] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-22 04:44:56] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-22 04:44:56] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-22 04:44:56] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-22 04:44:56] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-22 04:44:56] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-22 04:44:56] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 9/109 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:44:58] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 2 ms to minimize.
[2024-05-22 04:44:59] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:45:01] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-22 04:45:01] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-22 04:45:01] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:45:03] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-22 04:45:04] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:45:05] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-22 04:45:05] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 11 (OVERLAPS) 293/646 variables, 353/471 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/646 variables, 292/763 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 763 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 56/56 constraints]
After SMT, in 60109ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 60114ms
Starting structural reductions in LTL mode, iteration 1 : 353/362 places, 293/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60668 ms. Remains : 353/362 places, 293/307 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-30b-LTLFireability-05
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 0 ms.
FORMULA DES-PT-30b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-05 finished in 60846 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 362 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Graph (complete) has 786 edges and 362 vertex of which 355 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 354 transition count 287
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 339 transition count 286
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 32 place count 339 transition count 275
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 54 place count 328 transition count 275
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 60 place count 322 transition count 269
Iterating global reduction 2 with 6 rules applied. Total rules applied 66 place count 322 transition count 269
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 69 place count 322 transition count 266
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 69 place count 322 transition count 265
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 71 place count 321 transition count 265
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 72 place count 320 transition count 264
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 320 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 74 place count 320 transition count 263
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 74 place count 320 transition count 262
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 76 place count 319 transition count 262
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 226 place count 244 transition count 187
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 230 place count 242 transition count 189
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 232 place count 240 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 233 place count 239 transition count 187
Applied a total of 233 rules in 44 ms. Remains 239 /362 variables (removed 123) and now considering 187/307 (removed 120) transitions.
// Phase 1: matrix 187 rows 239 cols
[2024-05-22 04:45:24] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 04:45:24] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-22 04:45:24] [INFO ] Invariant cache hit.
[2024-05-22 04:45:24] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2024-05-22 04:45:24] [INFO ] Redundant transitions in 0 ms returned []
Running 184 sub problems to find dead transitions.
[2024-05-22 04:45:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 1/237 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 2/239 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 187/426 variables, 239/297 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-22 04:45:30] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-22 04:45:31] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-22 04:45:33] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-22 04:45:33] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
[2024-05-22 04:45:34] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2024-05-22 04:45:34] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-22 04:45:34] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 5/304 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-22 04:45:35] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 13 (OVERLAPS) 0/426 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 305 constraints, problems are : Problem set: 0 solved, 184 unsolved in 16177 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 1/237 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 2/239 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (OVERLAPS) 187/426 variables, 239/305 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 184/489 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-22 04:45:50] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-22 04:46:08] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/426 variables, and 491 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 10/10 constraints]
After SMT, in 46274ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 46276ms
Starting structural reductions in SI_LTL mode, iteration 1 : 239/362 places, 187/307 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46712 ms. Remains : 239/362 places, 187/307 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-30b-LTLFireability-06
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA DES-PT-30b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-06 finished in 46787 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))&&F(p1)))'
Support contains 5 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 354 transition count 299
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 354 transition count 299
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 354 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 353 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 353 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 353 transition count 293
Applied a total of 23 rules in 11 ms. Remains 353 /362 variables (removed 9) and now considering 293/307 (removed 14) transitions.
// Phase 1: matrix 293 rows 353 cols
[2024-05-22 04:46:11] [INFO ] Computed 62 invariants in 8 ms
[2024-05-22 04:46:11] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-22 04:46:11] [INFO ] Invariant cache hit.
[2024-05-22 04:46:11] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2024-05-22 04:46:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/353 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 293/646 variables, 353/415 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:46:17] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
[2024-05-22 04:46:17] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-22 04:46:17] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 2 ms to minimize.
[2024-05-22 04:46:17] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 2 ms to minimize.
[2024-05-22 04:46:18] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 2 ms to minimize.
[2024-05-22 04:46:18] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-05-22 04:46:18] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 2 ms to minimize.
[2024-05-22 04:46:18] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-05-22 04:46:18] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-22 04:46:18] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-22 04:46:18] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-22 04:46:18] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-22 04:46:19] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-22 04:46:19] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2024-05-22 04:46:19] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-22 04:46:19] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-22 04:46:19] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 2 ms to minimize.
[2024-05-22 04:46:20] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-05-22 04:46:20] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2024-05-22 04:46:21] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 20/435 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:46:24] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-22 04:46:25] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2024-05-22 04:46:25] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
[2024-05-22 04:46:25] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 4/439 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:46:27] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 2 ms to minimize.
[2024-05-22 04:46:29] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 2/441 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:46:30] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2024-05-22 04:46:30] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-22 04:46:31] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 2 ms to minimize.
[2024-05-22 04:46:31] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 2 ms to minimize.
[2024-05-22 04:46:31] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-22 04:46:31] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 6/447 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:46:37] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:46:39] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2024-05-22 04:46:40] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 2 ms to minimize.
[2024-05-22 04:46:40] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2024-05-22 04:46:40] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-22 04:46:40] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 646/646 variables, and 453 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/353 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 38/100 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:46:43] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-22 04:46:43] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 2 ms to minimize.
[2024-05-22 04:46:44] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-22 04:46:44] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-05-22 04:46:44] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-05-22 04:46:44] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-22 04:46:44] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-05-22 04:46:44] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-22 04:46:44] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 9/109 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:46:46] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-22 04:46:46] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:46:48] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-22 04:46:49] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-22 04:46:49] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:46:51] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-22 04:46:51] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:46:53] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-05-22 04:46:53] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 11 (OVERLAPS) 293/646 variables, 353/471 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/646 variables, 292/763 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 763 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 56/56 constraints]
After SMT, in 60100ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 60105ms
Starting structural reductions in LTL mode, iteration 1 : 353/362 places, 293/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60710 ms. Remains : 353/362 places, 293/307 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-30b-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-30b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-07 finished in 60852 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 U p1) U X((G(!p0)&&F(p2)))))))'
Support contains 5 out of 362 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Graph (complete) has 786 edges and 362 vertex of which 355 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 354 transition count 288
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 340 transition count 287
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 30 place count 340 transition count 276
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 52 place count 329 transition count 276
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 56 place count 325 transition count 272
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 325 transition count 272
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 325 transition count 270
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 62 place count 325 transition count 269
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 324 transition count 269
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 323 transition count 268
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 323 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 67 place count 323 transition count 267
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 219 place count 247 transition count 191
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 223 place count 245 transition count 193
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 225 place count 243 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 226 place count 242 transition count 191
Applied a total of 226 rules in 30 ms. Remains 242 /362 variables (removed 120) and now considering 191/307 (removed 116) transitions.
// Phase 1: matrix 191 rows 242 cols
[2024-05-22 04:47:12] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 04:47:12] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-22 04:47:12] [INFO ] Invariant cache hit.
[2024-05-22 04:47:12] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
[2024-05-22 04:47:12] [INFO ] Redundant transitions in 0 ms returned []
Running 187 sub problems to find dead transitions.
[2024-05-22 04:47:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (OVERLAPS) 1/239 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 187 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/241 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 191/432 variables, 241/299 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 04:47:17] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/432 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 11 (OVERLAPS) 1/433 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 04:47:21] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/433 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 04:47:22] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/433 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 04:47:22] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/433 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/433 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 04:47:26] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/433 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/433 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 18 (OVERLAPS) 0/433 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 433/433 variables, and 305 constraints, problems are : Problem set: 0 solved, 187 unsolved in 18065 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 1/239 variables, 25/45 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 2/241 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 11 (OVERLAPS) 191/432 variables, 241/304 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/432 variables, 187/491 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/432 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 14 (OVERLAPS) 1/433 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 433/433 variables, and 492 constraints, problems are : Problem set: 0 solved, 187 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 5/5 constraints]
After SMT, in 48151ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 48153ms
Starting structural reductions in SI_LTL mode, iteration 1 : 242/362 places, 191/307 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48653 ms. Remains : 242/362 places, 191/307 transitions.
Stuttering acceptance computed with spot in 390 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), false, (OR (NOT p2) p0), p0, (NOT p2), p0, (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-30b-LTLFireability-08
Product exploration explored 100000 steps with 5001 reset in 232 ms.
Product exploration explored 100000 steps with 4957 reset in 259 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/242 stabilizing places and 130/191 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (AND (NOT p1) (NOT p0))), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (OR p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 185 ms. Reduced automaton from 8 states, 30 edges and 3 AP (stutter insensitive) to 9 states, 35 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 409 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), p0, (NOT p2), p0, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (1934 resets) in 141 ms. (281 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40004 steps (375 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (375 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
[2024-05-22 04:48:02] [INFO ] Invariant cache hit.
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) 10/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 59/73 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 120/193 variables, 24/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/197 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3/200 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 156/356 variables, 200/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/356 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 14/370 variables, 9/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/370 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 33/403 variables, 3/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/403 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/403 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 30/433 variables, 30/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/433 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/433 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 433/433 variables, and 300 constraints, problems are : Problem set: 0 solved, 2 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 242/242 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) 10/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 59/73 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 120/193 variables, 24/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/197 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3/200 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 156/356 variables, 200/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/356 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/356 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 14/370 variables, 9/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/370 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 33/403 variables, 3/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/403 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/403 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 30/433 variables, 30/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/433 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/433 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 433/433 variables, and 302 constraints, problems are : Problem set: 0 solved, 2 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 579ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 790 ms.
Support contains 4 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 191/191 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 242 transition count 190
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 1 with 2 rules applied. Total rules applied 3 place count 241 transition count 189
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 241 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 239 transition count 187
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 239 transition count 187
Applied a total of 8 rules in 11 ms. Remains 239 /242 variables (removed 3) and now considering 187/191 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 239/242 places, 187/191 transitions.
RANDOM walk for 40000 steps (1877 resets) in 664 ms. (60 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (326 resets) in 169 ms. (235 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (369 resets) in 108 ms. (367 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1072028 steps, run timeout after 3001 ms. (steps per millisecond=357 ) properties seen :0 out of 2
Probabilistic random walk after 1072028 steps, saw 145496 distinct states, run finished after 3001 ms. (steps per millisecond=357 ) properties seen :0
// Phase 1: matrix 187 rows 239 cols
[2024-05-22 04:48:07] [INFO ] Computed 59 invariants in 6 ms
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) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 59/72 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 119/191 variables, 24/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 8/199 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 153/352 variables, 199/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 12/364 variables, 7/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/364 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/364 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 33/397 variables, 4/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/397 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/397 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 29/426 variables, 29/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/426 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/426 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 298 constraints, problems are : Problem set: 0 solved, 2 unsolved in 232 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 239/239 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) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 59/72 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 119/191 variables, 24/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 8/199 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 153/352 variables, 199/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 12/364 variables, 7/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/364 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/364 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 33/397 variables, 4/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/397 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/397 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 29/426 variables, 29/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/426 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/426 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 300 constraints, problems are : Problem set: 0 solved, 2 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 606ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 784 ms.
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 187/187 transitions.
Applied a total of 0 rules in 5 ms. Remains 239 /239 variables (removed 0) and now considering 187/187 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 239/239 places, 187/187 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 187/187 transitions.
Applied a total of 0 rules in 2 ms. Remains 239 /239 variables (removed 0) and now considering 187/187 (removed 0) transitions.
[2024-05-22 04:48:08] [INFO ] Invariant cache hit.
[2024-05-22 04:48:08] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-22 04:48:08] [INFO ] Invariant cache hit.
[2024-05-22 04:48:08] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2024-05-22 04:48:08] [INFO ] Redundant transitions in 0 ms returned []
Running 183 sub problems to find dead transitions.
[2024-05-22 04:48:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (OVERLAPS) 2/237 variables, 27/45 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 183 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/238 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (OVERLAPS) 187/425 variables, 238/297 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 04:48:13] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-22 04:48:13] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 04:48:15] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-22 04:48:15] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-22 04:48:15] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 12 (OVERLAPS) 1/426 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/426 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 04:48:19] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/426 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 04:48:22] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/426 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/426 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 18 (OVERLAPS) 0/426 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 305 constraints, problems are : Problem set: 0 solved, 183 unsolved in 18150 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (OVERLAPS) 2/237 variables, 27/48 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (OVERLAPS) 1/238 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 10 (OVERLAPS) 187/425 variables, 238/304 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 183/487 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/425 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 13 (OVERLAPS) 1/426 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/426 variables, and 488 constraints, problems are : Problem set: 0 solved, 183 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 7/7 constraints]
After SMT, in 48237ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 48239ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48624 ms. Remains : 239/239 places, 187/187 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 239 transition count 187
Applied a total of 1 rules in 5 ms. Remains 239 /239 variables (removed 0) and now considering 187/187 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 187 rows 239 cols
[2024-05-22 04:48:57] [INFO ] Computed 59 invariants in 5 ms
[2024-05-22 04:48:57] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 04:48:57] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-22 04:48:57] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 04:48:57] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 04:48:57] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 9 ms returned sat
[2024-05-22 04:48:57] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 04:48:57] [INFO ] After 147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 04:48:57] [INFO ] After 240ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 326 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (AND (NOT p1) (NOT p0))), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (OR p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F (NOT (OR (NOT p0) p1))), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (OR p0 p1 p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 17 factoid took 547 ms. Reduced automaton from 9 states, 35 edges and 3 AP (stutter insensitive) to 9 states, 35 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 440 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), p0, (NOT p2), p0, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 498 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), p0, (NOT p2), p0, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false]
Support contains 5 out of 242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 242/242 places, 191/191 transitions.
Applied a total of 0 rules in 3 ms. Remains 242 /242 variables (removed 0) and now considering 191/191 (removed 0) transitions.
// Phase 1: matrix 191 rows 242 cols
[2024-05-22 04:48:58] [INFO ] Computed 58 invariants in 1 ms
[2024-05-22 04:48:59] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-22 04:48:59] [INFO ] Invariant cache hit.
[2024-05-22 04:48:59] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2024-05-22 04:48:59] [INFO ] Redundant transitions in 0 ms returned []
Running 187 sub problems to find dead transitions.
[2024-05-22 04:48:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (OVERLAPS) 1/239 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 187 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/241 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 191/432 variables, 241/299 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 04:49:04] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/432 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 11 (OVERLAPS) 1/433 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 04:49:07] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/433 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 04:49:08] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/433 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 04:49:09] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/433 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/433 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 04:49:13] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/433 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/433 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 18 (OVERLAPS) 0/433 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 433/433 variables, and 305 constraints, problems are : Problem set: 0 solved, 187 unsolved in 18339 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 1/239 variables, 25/45 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 2/241 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 11 (OVERLAPS) 191/432 variables, 241/304 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/432 variables, 187/491 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/432 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 14 (OVERLAPS) 1/433 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 433/433 variables, and 492 constraints, problems are : Problem set: 0 solved, 187 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 5/5 constraints]
After SMT, in 48420ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 48422ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 48832 ms. Remains : 242/242 places, 191/191 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/242 stabilizing places and 130/191 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 178 ms. Reduced automaton from 9 states, 35 edges and 3 AP (stutter insensitive) to 9 states, 35 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 356 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), p0, (NOT p2), p0, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (1927 resets) in 484 ms. (82 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40004 steps (365 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (351 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
[2024-05-22 04:49:48] [INFO ] Invariant cache hit.
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) 10/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 59/73 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 120/193 variables, 24/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/197 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3/200 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 156/356 variables, 200/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/356 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 14/370 variables, 9/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/370 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 33/403 variables, 3/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/403 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/403 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 30/433 variables, 30/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/433 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/433 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 433/433 variables, and 300 constraints, problems are : Problem set: 0 solved, 2 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 242/242 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) 10/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 59/73 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 120/193 variables, 24/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/197 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3/200 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 156/356 variables, 200/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/356 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/356 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 14/370 variables, 9/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/370 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 33/403 variables, 3/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/403 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/403 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 30/433 variables, 30/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/433 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/433 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 433/433 variables, and 302 constraints, problems are : Problem set: 0 solved, 2 unsolved in 341 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 601ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 899 ms.
Support contains 4 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 191/191 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 242 transition count 190
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 1 with 2 rules applied. Total rules applied 3 place count 241 transition count 189
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 241 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 239 transition count 187
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 239 transition count 187
Applied a total of 8 rules in 12 ms. Remains 239 /242 variables (removed 3) and now considering 187/191 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 239/242 places, 187/191 transitions.
RANDOM walk for 40000 steps (1850 resets) in 476 ms. (83 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (357 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (361 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 959407 steps, run timeout after 3008 ms. (steps per millisecond=318 ) properties seen :0 out of 2
Probabilistic random walk after 959407 steps, saw 129478 distinct states, run finished after 3009 ms. (steps per millisecond=318 ) properties seen :0
// Phase 1: matrix 187 rows 239 cols
[2024-05-22 04:49:53] [INFO ] Computed 59 invariants in 3 ms
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) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 59/72 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 119/191 variables, 24/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 8/199 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 153/352 variables, 199/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 12/364 variables, 7/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/364 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/364 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 33/397 variables, 4/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/397 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/397 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 29/426 variables, 29/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/426 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/426 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 298 constraints, problems are : Problem set: 0 solved, 2 unsolved in 233 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 239/239 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) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 59/72 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 119/191 variables, 24/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 8/199 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 153/352 variables, 199/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 12/364 variables, 7/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/364 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/364 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 33/397 variables, 4/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/397 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/397 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 29/426 variables, 29/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/426 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/426 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 300 constraints, problems are : Problem set: 0 solved, 2 unsolved in 342 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 603ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 930 ms.
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 187/187 transitions.
Applied a total of 0 rules in 3 ms. Remains 239 /239 variables (removed 0) and now considering 187/187 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 239/239 places, 187/187 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 187/187 transitions.
Applied a total of 0 rules in 3 ms. Remains 239 /239 variables (removed 0) and now considering 187/187 (removed 0) transitions.
[2024-05-22 04:49:54] [INFO ] Invariant cache hit.
[2024-05-22 04:49:55] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-22 04:49:55] [INFO ] Invariant cache hit.
[2024-05-22 04:49:55] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
[2024-05-22 04:49:55] [INFO ] Redundant transitions in 0 ms returned []
Running 183 sub problems to find dead transitions.
[2024-05-22 04:49:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (OVERLAPS) 2/237 variables, 27/45 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 183 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/238 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (OVERLAPS) 187/425 variables, 238/297 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 04:49:59] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-22 04:50:00] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 04:50:01] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 0 ms to minimize.
[2024-05-22 04:50:01] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-22 04:50:01] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 12 (OVERLAPS) 1/426 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/426 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 04:50:05] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/426 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 04:50:08] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/426 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/426 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 18 (OVERLAPS) 0/426 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 305 constraints, problems are : Problem set: 0 solved, 183 unsolved in 18084 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (OVERLAPS) 2/237 variables, 27/48 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (OVERLAPS) 1/238 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 10 (OVERLAPS) 187/425 variables, 238/304 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 183/487 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/425 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 13 (OVERLAPS) 1/426 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/426 variables, and 488 constraints, problems are : Problem set: 0 solved, 183 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 7/7 constraints]
After SMT, in 48170ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 48171ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48555 ms. Remains : 239/239 places, 187/187 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 239 transition count 187
Applied a total of 1 rules in 5 ms. Remains 239 /239 variables (removed 0) and now considering 187/187 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 187 rows 239 cols
[2024-05-22 04:50:43] [INFO ] Computed 59 invariants in 2 ms
[2024-05-22 04:50:43] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 04:50:43] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-22 04:50:43] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 04:50:43] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 04:50:43] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-22 04:50:43] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 04:50:43] [INFO ] After 144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 04:50:43] [INFO ] After 250ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 355 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 p2 p1))), (F (NOT p2)), (F (NOT (AND (NOT p0) p2 (NOT p1)))), (F (NOT (OR p0 p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 21 factoid took 417 ms. Reduced automaton from 9 states, 35 edges and 3 AP (stutter insensitive) to 9 states, 35 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 417 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), p0, (NOT p2), p0, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 329 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), p0, (NOT p2), p0, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 342 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), p0, (NOT p2), p0, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false]
Product exploration explored 100000 steps with 4913 reset in 240 ms.
Product exploration explored 100000 steps with 5016 reset in 266 ms.
Built C files in :
/tmp/ltsmin2812032286280235310
[2024-05-22 04:50:45] [INFO ] Computing symmetric may disable matrix : 191 transitions.
[2024-05-22 04:50:45] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 04:50:45] [INFO ] Computing symmetric may enable matrix : 191 transitions.
[2024-05-22 04:50:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 04:50:45] [INFO ] Computing Do-Not-Accords matrix : 191 transitions.
[2024-05-22 04:50:45] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 04:50:45] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2812032286280235310
Running compilation step : cd /tmp/ltsmin2812032286280235310;'/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 508 ms.
Running link step : cd /tmp/ltsmin2812032286280235310;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin2812032286280235310;'/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/stateBased17156150796462140115.hoa' '--buchi-type=spotba'
LTSmin run took 8263 ms.
FORMULA DES-PT-30b-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-30b-LTLFireability-08 finished in 222652 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||(F(p0)&&p1)))||X(F(p2))))'
Support contains 4 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 355 transition count 300
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 355 transition count 300
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 355 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 354 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 354 transition count 296
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 354 transition count 295
Applied a total of 20 rules in 17 ms. Remains 354 /362 variables (removed 8) and now considering 295/307 (removed 12) transitions.
// Phase 1: matrix 295 rows 354 cols
[2024-05-22 04:50:54] [INFO ] Computed 62 invariants in 3 ms
[2024-05-22 04:50:54] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-22 04:50:54] [INFO ] Invariant cache hit.
[2024-05-22 04:50:55] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
Running 294 sub problems to find dead transitions.
[2024-05-22 04:50:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 1/354 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 294 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (OVERLAPS) 295/649 variables, 354/416 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-22 04:51:01] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-22 04:51:01] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-05-22 04:51:01] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-22 04:51:02] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2024-05-22 04:51:02] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 2 ms to minimize.
[2024-05-22 04:51:02] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
[2024-05-22 04:51:02] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-05-22 04:51:02] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-22 04:51:03] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-22 04:51:03] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-05-22 04:51:03] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/649 variables, 11/427 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-22 04:51:05] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2024-05-22 04:51:06] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-05-22 04:51:07] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-22 04:51:07] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-22 04:51:07] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2024-05-22 04:51:08] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-05-22 04:51:08] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 1 ms to minimize.
[2024-05-22 04:51:08] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 1 ms to minimize.
[2024-05-22 04:51:08] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-22 04:51:08] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/649 variables, 10/437 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-22 04:51:12] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-22 04:51:12] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-22 04:51:12] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/649 variables, 3/440 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-22 04:51:13] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-22 04:51:14] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-05-22 04:51:15] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-05-22 04:51:16] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 2 ms to minimize.
[2024-05-22 04:51:16] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 2 ms to minimize.
[2024-05-22 04:51:16] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/649 variables, 6/446 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-22 04:51:18] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-22 04:51:18] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-05-22 04:51:18] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-22 04:51:18] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2024-05-22 04:51:19] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 2 ms to minimize.
[2024-05-22 04:51:19] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 1 ms to minimize.
[2024-05-22 04:51:19] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2024-05-22 04:51:20] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-22 04:51:20] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-22 04:51:20] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/649 variables, 10/456 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-22 04:51:25] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 649/649 variables, and 457 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 1/354 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 41/103 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-22 04:51:27] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-05-22 04:51:27] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
[2024-05-22 04:51:27] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 2 ms to minimize.
[2024-05-22 04:51:28] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 2 ms to minimize.
[2024-05-22 04:51:28] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-22 04:51:28] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-22 04:51:28] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-22 04:51:28] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-22 04:51:28] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-22 04:51:28] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-22 04:51:28] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-22 04:51:28] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-22 04:51:28] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-22 04:51:29] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-05-22 04:51:30] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-22 04:51:30] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 16/119 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-22 04:51:31] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-22 04:51:34] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 9 (OVERLAPS) 295/649 variables, 354/475 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/649 variables, 294/769 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 649/649 variables, and 769 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 59/59 constraints]
After SMT, in 60090ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 60092ms
Starting structural reductions in LTL mode, iteration 1 : 354/362 places, 295/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60760 ms. Remains : 354/362 places, 295/307 transitions.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-30b-LTLFireability-09
Stuttering criterion allowed to conclude after 91 steps with 0 reset in 1 ms.
FORMULA DES-PT-30b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-09 finished in 60907 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 354 transition count 299
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 354 transition count 299
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 354 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 353 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 353 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 353 transition count 293
Applied a total of 23 rules in 13 ms. Remains 353 /362 variables (removed 9) and now considering 293/307 (removed 14) transitions.
// Phase 1: matrix 293 rows 353 cols
[2024-05-22 04:51:55] [INFO ] Computed 62 invariants in 4 ms
[2024-05-22 04:51:55] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-22 04:51:55] [INFO ] Invariant cache hit.
[2024-05-22 04:51:56] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2024-05-22 04:51:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/353 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 293/646 variables, 353/415 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:52:02] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 2 ms to minimize.
[2024-05-22 04:52:02] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-22 04:52:02] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 2 ms to minimize.
[2024-05-22 04:52:02] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2024-05-22 04:52:02] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 2 ms to minimize.
[2024-05-22 04:52:02] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
[2024-05-22 04:52:02] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-05-22 04:52:02] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-22 04:52:02] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
[2024-05-22 04:52:03] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2024-05-22 04:52:03] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-22 04:52:03] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-22 04:52:03] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-22 04:52:03] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2024-05-22 04:52:03] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-22 04:52:03] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 0 ms to minimize.
[2024-05-22 04:52:03] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2024-05-22 04:52:04] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-05-22 04:52:04] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 2 ms to minimize.
[2024-05-22 04:52:05] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 20/435 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:52:09] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2024-05-22 04:52:09] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 2 ms to minimize.
[2024-05-22 04:52:09] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2024-05-22 04:52:09] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 4/439 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:52:11] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-22 04:52:13] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 2/441 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:52:14] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-22 04:52:14] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-22 04:52:15] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2024-05-22 04:52:15] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 2 ms to minimize.
[2024-05-22 04:52:15] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-22 04:52:16] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 6/447 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:52:22] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:52:23] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-22 04:52:24] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
[2024-05-22 04:52:24] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-05-22 04:52:24] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-22 04:52:25] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 646/646 variables, and 453 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/353 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 38/100 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:52:28] [INFO ] Deduced a trap composed of 32 places in 283 ms of which 0 ms to minimize.
[2024-05-22 04:52:28] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 2 ms to minimize.
[2024-05-22 04:52:28] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-22 04:52:28] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-05-22 04:52:28] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-22 04:52:28] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2024-05-22 04:52:29] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-22 04:52:29] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-22 04:52:29] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 9/109 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:52:31] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-05-22 04:52:31] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:52:33] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-22 04:52:33] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2024-05-22 04:52:33] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:52:35] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-22 04:52:36] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:52:38] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-22 04:52:38] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 11 (OVERLAPS) 293/646 variables, 353/471 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/646 variables, 292/763 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 763 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 56/56 constraints]
After SMT, in 60100ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 60102ms
Starting structural reductions in LTL mode, iteration 1 : 353/362 places, 293/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60646 ms. Remains : 353/362 places, 293/307 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-30b-LTLFireability-10
Entered a terminal (fully accepting) state of product in 133 steps with 1 reset in 1 ms.
FORMULA DES-PT-30b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-10 finished in 60763 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(p0)&&(p1||X(p2)))))'
Support contains 4 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 355 transition count 300
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 355 transition count 300
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 355 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 354 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 354 transition count 295
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 354 transition count 294
Applied a total of 21 rules in 14 ms. Remains 354 /362 variables (removed 8) and now considering 294/307 (removed 13) transitions.
// Phase 1: matrix 294 rows 354 cols
[2024-05-22 04:52:56] [INFO ] Computed 62 invariants in 4 ms
[2024-05-22 04:52:56] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-22 04:52:56] [INFO ] Invariant cache hit.
[2024-05-22 04:52:56] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
Running 293 sub problems to find dead transitions.
[2024-05-22 04:52:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/354 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (OVERLAPS) 294/648 variables, 354/416 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 04:53:02] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
[2024-05-22 04:53:02] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-22 04:53:02] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2024-05-22 04:53:02] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
[2024-05-22 04:53:03] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-22 04:53:03] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
[2024-05-22 04:53:03] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2024-05-22 04:53:03] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-05-22 04:53:03] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-22 04:53:05] [INFO ] Deduced a trap composed of 48 places in 89 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 10/426 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 04:53:09] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-22 04:53:10] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-05-22 04:53:10] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 3/429 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 04:53:12] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2024-05-22 04:53:12] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-22 04:53:12] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-22 04:53:12] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2024-05-22 04:53:12] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2024-05-22 04:53:12] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-22 04:53:12] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2024-05-22 04:53:14] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-22 04:53:14] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 9/438 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 04:53:16] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 1 ms to minimize.
[2024-05-22 04:53:16] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 1 ms to minimize.
[2024-05-22 04:53:17] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-22 04:53:17] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-22 04:53:17] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-22 04:53:17] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2024-05-22 04:53:17] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2024-05-22 04:53:17] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-22 04:53:17] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-22 04:53:17] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-22 04:53:17] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-05-22 04:53:17] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 12/450 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/648 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 04:53:25] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-05-22 04:53:26] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 648/648 variables, and 452 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/354 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 36/98 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 04:53:29] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-22 04:53:29] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-22 04:53:29] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-22 04:53:29] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 04:53:29] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 0 ms to minimize.
[2024-05-22 04:53:29] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 19 ms to minimize.
[2024-05-22 04:53:29] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-22 04:53:29] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-05-22 04:53:29] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-22 04:53:29] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-22 04:53:29] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-22 04:53:29] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-22 04:53:30] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-05-22 04:53:30] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 0 ms to minimize.
[2024-05-22 04:53:30] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-22 04:53:30] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-22 04:53:30] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-22 04:53:31] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-22 04:53:31] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-22 04:53:31] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 04:53:32] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-05-22 04:53:32] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-22 04:53:32] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-05-22 04:53:32] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 4/122 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (OVERLAPS) 294/648 variables, 354/476 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 293/769 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 04:53:54] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-22 04:53:55] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-22 04:53:55] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-22 04:53:57] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 1 ms to minimize.
SMT process timed out in 60136ms, After SMT, problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60139ms
Starting structural reductions in LTL mode, iteration 1 : 354/362 places, 294/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60685 ms. Remains : 354/362 places, 294/307 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DES-PT-30b-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-30b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-11 finished in 60834 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 6 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 354 transition count 299
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 354 transition count 299
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 354 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 353 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 353 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 353 transition count 293
Applied a total of 23 rules in 14 ms. Remains 353 /362 variables (removed 9) and now considering 293/307 (removed 14) transitions.
// Phase 1: matrix 293 rows 353 cols
[2024-05-22 04:53:57] [INFO ] Computed 62 invariants in 3 ms
[2024-05-22 04:53:57] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-22 04:53:57] [INFO ] Invariant cache hit.
[2024-05-22 04:53:57] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2024-05-22 04:53:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/353 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 293/646 variables, 353/415 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:54:03] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 2 ms to minimize.
[2024-05-22 04:54:03] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-22 04:54:03] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-05-22 04:54:03] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-05-22 04:54:03] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 2 ms to minimize.
[2024-05-22 04:54:03] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-22 04:54:04] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-22 04:54:04] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-22 04:54:04] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-22 04:54:04] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2024-05-22 04:54:04] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-22 04:54:04] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-22 04:54:04] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 0 ms to minimize.
[2024-05-22 04:54:04] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2024-05-22 04:54:05] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-22 04:54:05] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-22 04:54:05] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-05-22 04:54:05] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-05-22 04:54:06] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-22 04:54:06] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 20/435 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:54:10] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-22 04:54:10] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 2 ms to minimize.
[2024-05-22 04:54:10] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2024-05-22 04:54:11] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 4/439 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:54:13] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 2 ms to minimize.
[2024-05-22 04:54:14] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 2/441 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:54:15] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-22 04:54:16] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-22 04:54:17] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 2 ms to minimize.
[2024-05-22 04:54:17] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2024-05-22 04:54:17] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-22 04:54:17] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 6/447 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:54:23] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:54:24] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-22 04:54:26] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2024-05-22 04:54:26] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2024-05-22 04:54:26] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-22 04:54:26] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.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 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 646/646 variables, and 453 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/353 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 38/100 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:54:29] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-22 04:54:29] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-22 04:54:29] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-22 04:54:30] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-05-22 04:54:30] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-05-22 04:54:30] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-22 04:54:30] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-22 04:54:30] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-05-22 04:54:30] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 9/109 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:54:32] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-22 04:54:32] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:54:34] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-22 04:54:34] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-22 04:54:35] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:54:37] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-22 04:54:37] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 04:54:39] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-22 04:54:39] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 11 (OVERLAPS) 293/646 variables, 353/471 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/646 variables, 292/763 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 763 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 56/56 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 60098ms
Starting structural reductions in LTL mode, iteration 1 : 353/362 places, 293/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60606 ms. Remains : 353/362 places, 293/307 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-30b-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-30b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-12 finished in 60743 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 362 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Graph (complete) has 786 edges and 362 vertex of which 355 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 354 transition count 288
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 340 transition count 288
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 340 transition count 278
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 49 place count 330 transition count 278
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 55 place count 324 transition count 272
Iterating global reduction 2 with 6 rules applied. Total rules applied 61 place count 324 transition count 272
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 64 place count 324 transition count 269
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 64 place count 324 transition count 268
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 323 transition count 268
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 322 transition count 267
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 322 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 322 transition count 266
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 69 place count 322 transition count 265
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 71 place count 321 transition count 265
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 225 place count 244 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 227 place count 243 transition count 188
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 229 place count 241 transition count 186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 230 place count 240 transition count 186
Applied a total of 230 rules in 40 ms. Remains 240 /362 variables (removed 122) and now considering 186/307 (removed 121) transitions.
// Phase 1: matrix 186 rows 240 cols
[2024-05-22 04:54:58] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 04:54:58] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-22 04:54:58] [INFO ] Invariant cache hit.
[2024-05-22 04:54:58] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2024-05-22 04:54:58] [INFO ] Redundant transitions in 1 ms returned []
Running 183 sub problems to find dead transitions.
[2024-05-22 04:54:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (OVERLAPS) 2/239 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (OVERLAPS) 186/425 variables, 239/297 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (OVERLAPS) 1/426 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (OVERLAPS) 0/426 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 298 constraints, problems are : Problem set: 0 solved, 183 unsolved in 9438 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (OVERLAPS) 2/239 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (OVERLAPS) 186/425 variables, 239/297 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 183/480 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 04:55:15] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-22 04:55:16] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-22 04:55:18] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2024-05-22 04:55:18] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-22 04:55:18] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-22 04:55:20] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 6/486 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 04:55:27] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-05-22 04:55:33] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 2/488 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/426 variables, and 488 constraints, problems are : Problem set: 0 solved, 183 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 239/240 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 8/8 constraints]
After SMT, in 39526ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 39528ms
Starting structural reductions in SI_LTL mode, iteration 1 : 240/362 places, 186/307 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40006 ms. Remains : 240/362 places, 186/307 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-30b-LTLFireability-13
Stuttering criterion allowed to conclude after 25 steps with 1 reset in 0 ms.
FORMULA DES-PT-30b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-13 finished in 40055 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)&&F(p1)&&X(F(p2)))))'
Support contains 6 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 355 transition count 300
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 355 transition count 300
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 355 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 354 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 354 transition count 296
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 354 transition count 295
Applied a total of 20 rules in 26 ms. Remains 354 /362 variables (removed 8) and now considering 295/307 (removed 12) transitions.
// Phase 1: matrix 295 rows 354 cols
[2024-05-22 04:55:38] [INFO ] Computed 62 invariants in 3 ms
[2024-05-22 04:55:38] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-22 04:55:38] [INFO ] Invariant cache hit.
[2024-05-22 04:55:38] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
Running 294 sub problems to find dead transitions.
[2024-05-22 04:55:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 1/354 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 294 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (OVERLAPS) 295/649 variables, 354/416 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-22 04:55:44] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
[2024-05-22 04:55:44] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-22 04:55:44] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 2 ms to minimize.
[2024-05-22 04:55:44] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 2 ms to minimize.
[2024-05-22 04:55:44] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-22 04:55:45] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-22 04:55:45] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-22 04:55:45] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-22 04:55:45] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-22 04:55:45] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 2 ms to minimize.
[2024-05-22 04:55:45] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
[2024-05-22 04:55:46] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2024-05-22 04:55:46] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
[2024-05-22 04:55:48] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/649 variables, 14/430 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-22 04:55:49] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-22 04:55:49] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2024-05-22 04:55:49] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-22 04:55:50] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-22 04:55:50] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-22 04:55:51] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-22 04:55:51] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-22 04:55:51] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/649 variables, 8/438 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-22 04:55:53] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 1 ms to minimize.
[2024-05-22 04:55:53] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-05-22 04:55:53] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-22 04:55:53] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-22 04:55:53] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-22 04:55:53] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2024-05-22 04:55:54] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-05-22 04:55:54] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-22 04:55:54] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2024-05-22 04:55:55] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/649 variables, 10/448 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-22 04:55:59] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 2 ms to minimize.
[2024-05-22 04:55:59] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-05-22 04:55:59] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 1 ms to minimize.
[2024-05-22 04:55:59] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-22 04:55:59] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/649 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-22 04:56:02] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2024-05-22 04:56:02] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-05-22 04:56:02] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-05-22 04:56:03] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 1 ms to minimize.
[2024-05-22 04:56:03] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-05-22 04:56:03] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
[2024-05-22 04:56:03] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/649 variables, 7/460 constraints. Problems are: Problem set: 0 solved, 294 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 0.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 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 649/649 variables, and 460 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 1/354 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 44/106 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-22 04:56:10] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-22 04:56:11] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-22 04:56:11] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-22 04:56:11] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-22 04:56:11] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-22 04:56:11] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-22 04:56:11] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-22 04:56:11] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
[2024-05-22 04:56:12] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-22 04:56:12] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-22 04:56:13] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 11/117 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-22 04:56:13] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-22 04:56:13] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-22 04:56:15] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 8 (OVERLAPS) 295/649 variables, 354/474 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/649 variables, 294/768 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-22 04:56:33] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
[2024-05-22 04:56:34] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 649/649 variables, and 770 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 60/60 constraints]
After SMT, in 60126ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 60129ms
Starting structural reductions in LTL mode, iteration 1 : 354/362 places, 295/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60745 ms. Remains : 354/362 places, 295/307 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : DES-PT-30b-LTLFireability-14
Stuttering criterion allowed to conclude after 102 steps with 0 reset in 0 ms.
FORMULA DES-PT-30b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-14 finished in 60943 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 355 transition count 300
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 355 transition count 300
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 355 transition count 296
Applied a total of 18 rules in 9 ms. Remains 355 /362 variables (removed 7) and now considering 296/307 (removed 11) transitions.
// Phase 1: matrix 296 rows 355 cols
[2024-05-22 04:56:38] [INFO ] Computed 62 invariants in 3 ms
[2024-05-22 04:56:39] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-22 04:56:39] [INFO ] Invariant cache hit.
[2024-05-22 04:56:39] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-05-22 04:56:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/355 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 295 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/651 variables, 355/417 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-22 04:56:45] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2024-05-22 04:56:45] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-22 04:56:45] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-22 04:56:46] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 2 ms to minimize.
[2024-05-22 04:56:46] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-05-22 04:56:46] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-05-22 04:56:46] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/651 variables, 7/424 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-22 04:56:49] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-05-22 04:56:49] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2024-05-22 04:56:50] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-22 04:56:51] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2024-05-22 04:56:51] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 2 ms to minimize.
[2024-05-22 04:56:51] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-22 04:56:52] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/651 variables, 7/431 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-22 04:56:54] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2024-05-22 04:56:54] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-05-22 04:56:55] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 2 ms to minimize.
[2024-05-22 04:56:55] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-05-22 04:56:56] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
[2024-05-22 04:56:56] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-22 04:56:56] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2024-05-22 04:56:56] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 1 ms to minimize.
[2024-05-22 04:56:56] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 1 ms to minimize.
[2024-05-22 04:56:56] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/651 variables, 10/441 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-22 04:56:58] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-22 04:56:58] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-22 04:56:58] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-22 04:56:58] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-22 04:56:58] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-05-22 04:56:58] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-22 04:56:59] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-05-22 04:56:59] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-22 04:56:59] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-05-22 04:57:00] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/651 variables, 10/451 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/651 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 11 (OVERLAPS) 0/651 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 651/651 variables, and 451 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/355 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 34/96 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-22 04:57:11] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-22 04:57:11] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-22 04:57:11] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-05-22 04:57:12] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 0 ms to minimize.
[2024-05-22 04:57:12] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 0 ms to minimize.
[2024-05-22 04:57:12] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-22 04:57:12] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-22 04:57:12] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 0 ms to minimize.
[2024-05-22 04:57:12] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-05-22 04:57:12] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-22 04:57:12] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-22 04:57:12] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-22 04:57:12] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-22 04:57:12] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-22 04:57:12] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-22 04:57:13] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-22 04:57:13] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-22 04:57:13] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-22 04:57:13] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-22 04:57:13] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-22 04:57:13] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-22 04:57:14] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 2 ms to minimize.
[2024-05-22 04:57:14] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-22 04:57:14] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-05-22 04:57:14] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-22 04:57:14] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-22 04:57:14] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-22 04:57:14] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 8/124 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (OVERLAPS) 296/651 variables, 355/479 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/651 variables, 295/774 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-22 04:57:32] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-22 04:57:32] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-05-22 04:57:32] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 2 ms to minimize.
[2024-05-22 04:57:33] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-22 04:57:33] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 651/651 variables, and 779 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 67/67 constraints]
After SMT, in 60117ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60119ms
Starting structural reductions in LTL mode, iteration 1 : 355/362 places, 296/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60707 ms. Remains : 355/362 places, 296/307 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-30b-LTLFireability-15
Stuttering criterion allowed to conclude after 94 steps with 0 reset in 0 ms.
FORMULA DES-PT-30b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLFireability-15 finished in 60793 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (G((F(p1)&&F(G(!p2)))) U p2)))'
Found a Lengthening insensitive property : DES-PT-30b-LTLFireability-00
Stuttering acceptance computed with spot in 206 ms :[(NOT p2), (NOT p0), (NOT p1), p2, (OR (NOT p1) p2), (NOT p2)]
Support contains 5 out of 362 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 362/362 places, 307/307 transitions.
Graph (complete) has 786 edges and 362 vertex of which 355 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.7 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 354 transition count 287
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 339 transition count 286
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 32 place count 339 transition count 276
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 52 place count 329 transition count 276
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 58 place count 323 transition count 270
Iterating global reduction 2 with 6 rules applied. Total rules applied 64 place count 323 transition count 270
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 67 place count 323 transition count 267
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 67 place count 323 transition count 266
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 322 transition count 266
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 321 transition count 265
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 321 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 321 transition count 264
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 72 place count 321 transition count 263
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 74 place count 320 transition count 263
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 218 place count 248 transition count 191
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 222 place count 246 transition count 193
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 224 place count 244 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 225 place count 243 transition count 191
Applied a total of 225 rules in 34 ms. Remains 243 /362 variables (removed 119) and now considering 191/307 (removed 116) transitions.
// Phase 1: matrix 191 rows 243 cols
[2024-05-22 04:57:40] [INFO ] Computed 58 invariants in 1 ms
[2024-05-22 04:57:40] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-22 04:57:40] [INFO ] Invariant cache hit.
[2024-05-22 04:57:40] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Running 187 sub problems to find dead transitions.
[2024-05-22 04:57:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (OVERLAPS) 2/241 variables, 23/44 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (OVERLAPS) 2/243 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 191/434 variables, 243/301 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 04:57:45] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-22 04:57:46] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 04:57:50] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/434 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 04:57:51] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-05-22 04:57:51] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/434 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/434 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 04:57:55] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/434 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 04:57:56] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-22 04:57:56] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-22 04:57:57] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-22 04:57:57] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/434 variables, 4/311 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/434 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 17 (OVERLAPS) 0/434 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 311 constraints, problems are : Problem set: 0 solved, 187 unsolved in 21520 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 2/241 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 2/243 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 11 (OVERLAPS) 191/434 variables, 243/311 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/434 variables, 187/498 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 04:58:12] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-22 04:58:12] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/434 variables, 2/500 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/434 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/434 variables, and 500 constraints, problems are : Problem set: 0 solved, 187 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 12/12 constraints]
After SMT, in 51608ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 51610ms
Starting structural reductions in LI_LTL mode, iteration 1 : 243/362 places, 191/307 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 52075 ms. Remains : 243/362 places, 191/307 transitions.
Running random walk in product with property : DES-PT-30b-LTLFireability-00
Stuttering criterion allowed to conclude after 48333 steps with 3539 reset in 110 ms.
Treatment of property DES-PT-30b-LTLFireability-00 finished in 52530 ms.
FORMULA DES-PT-30b-LTLFireability-00 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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 U X(X(X(!p0)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p1&&G(F(p2)))||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(G(p0)))'
[2024-05-22 04:58:32] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5592175834516727183
[2024-05-22 04:58:32] [INFO ] Computing symmetric may disable matrix : 307 transitions.
[2024-05-22 04:58:32] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 04:58:32] [INFO ] Computing symmetric may enable matrix : 307 transitions.
[2024-05-22 04:58:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 04:58:32] [INFO ] Applying decomposition
[2024-05-22 04:58:32] [INFO ] Flatten gal took : 8 ms
[2024-05-22 04:58:32] [INFO ] Computing Do-Not-Accords matrix : 307 transitions.
[2024-05-22 04:58:32] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 04:58:32] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5592175834516727183
Running compilation step : cd /tmp/ltsmin5592175834516727183;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' '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'
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/graph16913018078910931078.txt' '-o' '/tmp/graph16913018078910931078.bin' '-w' '/tmp/graph16913018078910931078.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16913018078910931078.bin' '-l' '-1' '-v' '-w' '/tmp/graph16913018078910931078.weights' '-q' '0' '-e' '0.001'
[2024-05-22 04:58:32] [INFO ] Decomposing Gal with order
[2024-05-22 04:58:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 04:58:32] [INFO ] Removed a total of 19 redundant transitions.
[2024-05-22 04:58:32] [INFO ] Flatten gal took : 30 ms
[2024-05-22 04:58:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 18 ms.
[2024-05-22 04:58:32] [INFO ] Time to serialize gal into /tmp/LTLFireability7380921518149141171.gal : 18 ms
[2024-05-22 04:58:32] [INFO ] Time to serialize properties into /tmp/LTLFireability17645683906930878842.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/LTLFireability7380921518149141171.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17645683906930878842.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...277
Read 3 LTL properties
Checking formula 0 : !((F(G((!("((i9.u67.p366==1)&&(u76.p395==1))"))U(X(X(X(!("((i9.u67.p366==1)&&(u76.p395==1))")))))))))
Formula 0 simplified : GF("((i9.u67.p366==1)&&(u76.p395==1))" R XXX"((i9.u67.p366==1)&&(u76.p395==1))")
Compilation finished in 877 ms.
Running link step : cd /tmp/ltsmin5592175834516727183;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin5592175834516727183;'/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' '--ltl' '<>([]((!(LTLAPp3==true) U X(X(X(!(LTLAPp3==true)))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t50, t52, t54, t226, t265, t266, u31.t79, u33.t76, u76.t17, i0.t128, i0.u13.t114, i0.u7.t...1040
Computing Next relation with stutter on 2.37204e+08 deadlock states
WARNING : LTSmin timed out (>300 s) on command cd /tmp/ltsmin5592175834516727183;'/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' '--ltl' '<>([]((!(LTLAPp3==true) U X(X(X(!(LTLAPp3==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5592175834516727183;'/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' '--ltl' '[]((((LTLAPp5==true)&&[](<>((LTLAPp6==true))))||(LTLAPp4==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>300 s) on command cd /tmp/ltsmin5592175834516727183;'/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' '--ltl' '[]((((LTLAPp5==true)&&[](<>((LTLAPp6==true))))||(LTLAPp4==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5592175834516727183;'/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' '--ltl' '<>([]((LTLAPp7==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>300 s) on command cd /tmp/ltsmin5592175834516727183;'/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' '--ltl' '<>([]((LTLAPp7==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin5592175834516727183;'/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' '--ltl' '<>([]((!(LTLAPp3==true) U X(X(X(!(LTLAPp3==true)))))))' '--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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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