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-171624189900723.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-40b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189900723
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K 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.2K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 08:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 08:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 12 08:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 08:03 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 115K 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-40b-LTLCardinality-00
FORMULA_NAME DES-PT-40b-LTLCardinality-01
FORMULA_NAME DES-PT-40b-LTLCardinality-02
FORMULA_NAME DES-PT-40b-LTLCardinality-03
FORMULA_NAME DES-PT-40b-LTLCardinality-04
FORMULA_NAME DES-PT-40b-LTLCardinality-05
FORMULA_NAME DES-PT-40b-LTLCardinality-06
FORMULA_NAME DES-PT-40b-LTLCardinality-07
FORMULA_NAME DES-PT-40b-LTLCardinality-08
FORMULA_NAME DES-PT-40b-LTLCardinality-09
FORMULA_NAME DES-PT-40b-LTLCardinality-10
FORMULA_NAME DES-PT-40b-LTLCardinality-11
FORMULA_NAME DES-PT-40b-LTLCardinality-12
FORMULA_NAME DES-PT-40b-LTLCardinality-13
FORMULA_NAME DES-PT-40b-LTLCardinality-14
FORMULA_NAME DES-PT-40b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716354894171

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-40b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-22 05:14:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 05:14:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 05:14:55] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2024-05-22 05:14:55] [INFO ] Transformed 439 places.
[2024-05-22 05:14:55] [INFO ] Transformed 390 transitions.
[2024-05-22 05:14:55] [INFO ] Found NUPN structural information;
[2024-05-22 05:14:55] [INFO ] Parsed PT model containing 439 places and 390 transitions and 1303 arcs in 196 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA DES-PT-40b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 439 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 390/390 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 436 transition count 390
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 26 place count 413 transition count 367
Iterating global reduction 1 with 23 rules applied. Total rules applied 49 place count 413 transition count 367
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 61 place count 401 transition count 355
Iterating global reduction 1 with 12 rules applied. Total rules applied 73 place count 401 transition count 355
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 82 place count 401 transition count 346
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 400 transition count 345
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 400 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 400 transition count 344
Applied a total of 85 rules in 130 ms. Remains 400 /439 variables (removed 39) and now considering 344/390 (removed 46) transitions.
// Phase 1: matrix 344 rows 400 cols
[2024-05-22 05:14:55] [INFO ] Computed 62 invariants in 40 ms
[2024-05-22 05:14:56] [INFO ] Implicit Places using invariants in 377 ms returned []
[2024-05-22 05:14:56] [INFO ] Invariant cache hit.
[2024-05-22 05:14:56] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 829 ms to find 0 implicit places.
Running 343 sub problems to find dead transitions.
[2024-05-22 05:14:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 2 (OVERLAPS) 1/400 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 15/62 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 5 (OVERLAPS) 344/744 variables, 400/462 constraints. Problems are: Problem set: 0 solved, 343 unsolved
[2024-05-22 05:15:04] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 22 ms to minimize.
[2024-05-22 05:15:04] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 5 ms to minimize.
[2024-05-22 05:15:04] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-05-22 05:15:05] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:15:05] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-22 05:15:05] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
[2024-05-22 05:15:05] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:15:05] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
[2024-05-22 05:15:05] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:15:05] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:15:05] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:15:05] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-22 05:15:05] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-22 05:15:06] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:15:06] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:15:06] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:15:06] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:15:06] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:15:06] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 2 ms to minimize.
[2024-05-22 05:15:06] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/744 variables, 20/482 constraints. Problems are: Problem set: 0 solved, 343 unsolved
[2024-05-22 05:15:11] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/744 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 343 unsolved
[2024-05-22 05:15:15] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 05:15:15] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2024-05-22 05:15:17] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-22 05:15:17] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/744 variables, 4/487 constraints. Problems are: Problem set: 0 solved, 343 unsolved
[2024-05-22 05:15:20] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:15:22] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:15:22] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-05-22 05:15:22] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-05-22 05:15:23] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 2 ms to minimize.
[2024-05-22 05:15:23] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 1 ms to minimize.
[2024-05-22 05:15:23] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 2 ms to minimize.
[2024-05-22 05:15:23] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/744 variables, 8/495 constraints. Problems are: Problem set: 0 solved, 343 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 744/744 variables, and 495 constraints, problems are : Problem set: 0 solved, 343 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 400/400 constraints, PredecessorRefiner: 343/343 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 343 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 2 (OVERLAPS) 1/400 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 15/62 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 33/95 constraints. Problems are: Problem set: 0 solved, 343 unsolved
[2024-05-22 05:15:29] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:15:29] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 4 ms to minimize.
[2024-05-22 05:15:29] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-22 05:15:29] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 2 ms to minimize.
[2024-05-22 05:15:30] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-22 05:15:30] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-22 05:15:30] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 2 ms to minimize.
[2024-05-22 05:15:30] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:15:30] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-22 05:15:30] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-22 05:15:30] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:15:30] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-22 05:15:30] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-22 05:15:30] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-22 05:15:31] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-22 05:15:32] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-22 05:15:32] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:15:32] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 18/113 constraints. Problems are: Problem set: 0 solved, 343 unsolved
[2024-05-22 05:15:33] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-22 05:15:33] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-22 05:15:33] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 343 unsolved
[2024-05-22 05:15:36] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:15:38] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 9 (OVERLAPS) 344/744 variables, 400/518 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/744 variables, 343/861 constraints. Problems are: Problem set: 0 solved, 343 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 744/744 variables, and 861 constraints, problems are : Problem set: 0 solved, 343 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 400/400 constraints, PredecessorRefiner: 343/343 constraints, Known Traps: 56/56 constraints]
After SMT, in 60274ms problems are : Problem set: 0 solved, 343 unsolved
Search for dead transitions found 0 dead transitions in 60291ms
Starting structural reductions in LTL mode, iteration 1 : 400/439 places, 344/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61273 ms. Remains : 400/439 places, 344/390 transitions.
Support contains 44 out of 400 places after structural reductions.
[2024-05-22 05:15:57] [INFO ] Flatten gal took : 64 ms
[2024-05-22 05:15:57] [INFO ] Flatten gal took : 25 ms
[2024-05-22 05:15:57] [INFO ] Input system was already deterministic with 344 transitions.
Support contains 40 out of 400 places (down from 44) after GAL structural reductions.
RANDOM walk for 40000 steps (344 resets) in 1510 ms. (26 steps per ms) remains 9/22 properties
BEST_FIRST walk for 40004 steps (51 resets) in 184 ms. (216 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (48 resets) in 142 ms. (279 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (42 resets) in 125 ms. (317 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (47 resets) in 101 ms. (392 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (48 resets) in 182 ms. (218 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (50 resets) in 69 ms. (571 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (46 resets) in 54 ms. (727 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (51 resets) in 65 ms. (606 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (49 resets) in 50 ms. (784 steps per ms) remains 9/9 properties
[2024-05-22 05:15:58] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 60/75 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 106/181 variables, 19/33 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 197/378 variables, 26/60 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 6/384 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/384 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 330/714 variables, 384/446 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/714 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 18/732 variables, 10/456 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/732 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 6/738 variables, 3/459 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/738 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 4/742 variables, 2/461 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/742 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 2/744 variables, 1/462 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/744 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 0/744 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 744/744 variables, and 462 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1539 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 400/400 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 60/75 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-22 05:15:59] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 106/181 variables, 19/34 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 197/378 variables, 26/61 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 6/384 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/384 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 330/714 variables, 384/447 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/714 variables, 9/456 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-22 05:16:00] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 2 ms to minimize.
[2024-05-22 05:16:00] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 2 ms to minimize.
[2024-05-22 05:16:00] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-22 05:16:00] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2024-05-22 05:16:01] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 2 ms to minimize.
[2024-05-22 05:16:01] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/714 variables, 6/462 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-22 05:16:01] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/714 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/714 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 18/732 variables, 10/473 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-22 05:16:02] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:16:02] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-22 05:16:02] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/732 variables, 3/476 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/732 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 6/738 variables, 3/479 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/738 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 4/742 variables, 2/481 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/742 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 2/744 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 744/744 variables, and 482 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 400/400 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 11/11 constraints]
After SMT, in 6557ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 344/344 transitions.
Graph (complete) has 902 edges and 400 vertex of which 393 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 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 393 transition count 323
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 34 place count 378 transition count 322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 377 transition count 322
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 35 place count 377 transition count 311
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 57 place count 366 transition count 311
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 61 place count 362 transition count 307
Iterating global reduction 3 with 4 rules applied. Total rules applied 65 place count 362 transition count 307
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 68 place count 362 transition count 304
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 68 place count 362 transition count 303
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 70 place count 361 transition count 303
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 71 place count 360 transition count 302
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 360 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 360 transition count 301
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 73 place count 360 transition count 300
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 75 place count 359 transition count 300
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 5 with 146 rules applied. Total rules applied 221 place count 286 transition count 227
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 5 with 4 rules applied. Total rules applied 225 place count 284 transition count 229
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 226 place count 284 transition count 228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 227 place count 283 transition count 228
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 228 place count 283 transition count 228
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 229 place count 282 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 230 place count 281 transition count 227
Applied a total of 230 rules in 176 ms. Remains 281 /400 variables (removed 119) and now considering 227/344 (removed 117) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 281/400 places, 227/344 transitions.
RANDOM walk for 40000 steps (1605 resets) in 414 ms. (96 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (261 resets) in 124 ms. (320 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (286 resets) in 126 ms. (314 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (258 resets) in 193 ms. (206 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (268 resets) in 83 ms. (476 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (256 resets) in 156 ms. (254 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (275 resets) in 186 ms. (213 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (267 resets) in 143 ms. (277 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (283 resets) in 168 ms. (236 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (255 resets) in 72 ms. (547 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 767653 steps, run timeout after 3001 ms. (steps per millisecond=255 ) properties seen :0 out of 9
Probabilistic random walk after 767653 steps, saw 107054 distinct states, run finished after 3004 ms. (steps per millisecond=255 ) properties seen :0
// Phase 1: matrix 227 rows 281 cols
[2024-05-22 05:16:08] [INFO ] Computed 60 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 30/45 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 2/47 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 161/208 variables, 22/37 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 22/230 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 3/233 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 191/424 variables, 233/288 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 54/478 variables, 18/306 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/478 variables, 4/310 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/478 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 2/480 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/480 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/480 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 28/508 variables, 28/341 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/508 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 0/508 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 508/508 variables, and 341 constraints, problems are : Problem set: 0 solved, 9 unsolved in 939 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 30/45 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-22 05:16:09] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/47 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 161/208 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 22/230 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-22 05:16:09] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 3/233 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 191/424 variables, 233/290 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/424 variables, 5/295 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-22 05:16:10] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-05-22 05:16:10] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/424 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-22 05:16:10] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:16:10] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/424 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-22 05:16:11] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/424 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/424 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 54/478 variables, 18/318 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/478 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/478 variables, 4/326 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-22 05:16:11] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-22 05:16:11] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/478 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/478 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (OVERLAPS) 2/480 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/480 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/480 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (OVERLAPS) 28/508 variables, 28/359 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-22 05:16:12] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-22 05:16:12] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/508 variables, 2/361 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/508 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (OVERLAPS) 0/508 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 508/508 variables, and 361 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3929 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 11/11 constraints]
After SMT, in 4878ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 0 properties in 13804 ms.
Support contains 15 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 227/227 transitions.
Applied a total of 0 rules in 9 ms. Remains 281 /281 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 281/281 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 227/227 transitions.
Applied a total of 0 rules in 12 ms. Remains 281 /281 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2024-05-22 05:16:27] [INFO ] Invariant cache hit.
[2024-05-22 05:16:27] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-22 05:16:27] [INFO ] Invariant cache hit.
[2024-05-22 05:16:27] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
[2024-05-22 05:16:27] [INFO ] Redundant transitions in 11 ms returned []
Running 221 sub problems to find dead transitions.
[2024-05-22 05:16:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 2/277 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 3/280 variables, 9/60 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 227/507 variables, 280/340 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-22 05:16:34] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-22 05:16:34] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2024-05-22 05:16:34] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:16:35] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-22 05:16:35] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-22 05:16:35] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-05-22 05:16:35] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:16:35] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-22 05:16:36] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:16:36] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/507 variables, 10/350 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-22 05:16:37] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:16:37] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-22 05:16:37] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:16:37] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:16:38] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/507 variables, 5/355 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-22 05:16:41] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/507 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/507 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 12 (OVERLAPS) 1/508 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/508 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-22 05:16:49] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/508 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/508 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 16 (OVERLAPS) 0/508 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 508/508 variables, and 358 constraints, problems are : Problem set: 0 solved, 221 unsolved in 29440 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 8/44 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 2/277 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 3/280 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 227/507 variables, 280/357 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/507 variables, 221/578 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-22 05:17:13] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/507 variables, 1/579 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 507/508 variables, and 579 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 280/281 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 18/18 constraints]
After SMT, in 59586ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 59591ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60057 ms. Remains : 281/281 places, 227/227 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 281 transition count 227
Applied a total of 1 rules in 15 ms. Remains 281 /281 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 227 rows 281 cols
[2024-05-22 05:17:27] [INFO ] Computed 60 invariants in 6 ms
[2024-05-22 05:17:27] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 05:17:27] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 05:17:27] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-22 05:17:27] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-22 05:17:27] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 22 ms returned sat
[2024-05-22 05:17:28] [INFO ] After 329ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
TRAPS : Iteration 0
[2024-05-22 05:17:28] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-22 05:17:28] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-22 05:17:28] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-05-22 05:17:28] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2024-05-22 05:17:28] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-22 05:17:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 225 ms
TRAPS : Iteration 1
[2024-05-22 05:17:28] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-22 05:17:28] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-22 05:17:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 105 ms
TRAPS : Iteration 2
[2024-05-22 05:17:29] [INFO ] After 1472ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
[2024-05-22 05:17:29] [INFO ] After 1830ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Over-approximation ignoring read arcs solved 0 properties in 1990 ms.
Computed a total of 217 stabilizing places and 209 stable transitions
Graph (complete) has 902 edges and 400 vertex of which 393 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(F(p0)))'
Support contains 1 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 344/344 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 394 transition count 338
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 393 transition count 334
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 393 transition count 333
Applied a total of 18 rules in 19 ms. Remains 393 /400 variables (removed 7) and now considering 333/344 (removed 11) transitions.
// Phase 1: matrix 333 rows 393 cols
[2024-05-22 05:17:29] [INFO ] Computed 62 invariants in 5 ms
[2024-05-22 05:17:29] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-22 05:17:29] [INFO ] Invariant cache hit.
[2024-05-22 05:17:30] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-22 05:17:30] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:17:35] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-22 05:17:35] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 3 ms to minimize.
[2024-05-22 05:17:35] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 2 ms to minimize.
[2024-05-22 05:17:36] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-05-22 05:17:36] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-22 05:17:36] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:17:36] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:17:36] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-22 05:17:36] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:17:37] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:17:37] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:17:37] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-05-22 05:17:38] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-22 05:17:38] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-22 05:17:39] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 15/470 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:17:43] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2024-05-22 05:17:44] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
[2024-05-22 05:17:44] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-05-22 05:17:44] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 2 ms to minimize.
[2024-05-22 05:17:44] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-05-22 05:17:44] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 2 ms to minimize.
[2024-05-22 05:17:44] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:17:44] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:17:44] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 9/479 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:17:48] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-22 05:17:48] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:17:48] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-22 05:17:48] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-05-22 05:17:48] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-22 05:17:48] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 2 ms to minimize.
[2024-05-22 05:17:48] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 2 ms to minimize.
[2024-05-22 05:17:48] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 2 ms to minimize.
[2024-05-22 05:17:50] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/726 variables, 9/488 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:17:54] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:17:57] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 2 ms to minimize.
[2024-05-22 05:17:58] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:17:58] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:17:58] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-22 05:17:58] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-22 05:17:58] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
[2024-05-22 05:17:58] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-22 05:17:58] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-22 05:17:58] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-22 05:17:58] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:17:58] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-22 05:17:58] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 501 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:18:03] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:18:03] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:18:03] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:18:03] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-22 05:18:03] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-22 05:18:03] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-22 05:18:04] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
[2024-05-22 05:18:04] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:18:04] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-22 05:18:05] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-22 05:18:06] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:18:06] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:18:06] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-22 05:18:07] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:18:09] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:18:11] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:18:12] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 1 ms to minimize.
[2024-05-22 05:18:12] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 10 (OVERLAPS) 333/726 variables, 393/519 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/726 variables, 332/851 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 851 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 64/64 constraints]
After SMT, in 60150ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60154ms
Starting structural reductions in LTL mode, iteration 1 : 393/400 places, 333/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60782 ms. Remains : 393/400 places, 333/344 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLCardinality-01
Stuttering criterion allowed to conclude after 98 steps with 0 reset in 2 ms.
FORMULA DES-PT-40b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLCardinality-01 finished in 61010 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)) U G(p1)))'
Support contains 3 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 344/344 transitions.
Graph (complete) has 902 edges and 400 vertex of which 393 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 392 transition count 325
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 378 transition count 325
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 29 place count 378 transition count 313
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 53 place count 366 transition count 313
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 56 place count 363 transition count 310
Iterating global reduction 2 with 3 rules applied. Total rules applied 59 place count 363 transition count 310
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 363 transition count 308
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 61 place count 363 transition count 307
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 63 place count 362 transition count 307
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 64 place count 361 transition count 306
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 361 transition count 306
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 66 place count 361 transition count 305
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 66 place count 361 transition count 304
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 68 place count 360 transition count 304
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 214 place count 287 transition count 231
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 216 place count 286 transition count 231
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 218 place count 284 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 219 place count 283 transition count 229
Applied a total of 219 rules in 95 ms. Remains 283 /400 variables (removed 117) and now considering 229/344 (removed 115) transitions.
// Phase 1: matrix 229 rows 283 cols
[2024-05-22 05:18:30] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 05:18:31] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-22 05:18:31] [INFO ] Invariant cache hit.
[2024-05-22 05:18:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 05:18:31] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
[2024-05-22 05:18:31] [INFO ] Redundant transitions in 13 ms returned []
Running 225 sub problems to find dead transitions.
[2024-05-22 05:18:31] [INFO ] Invariant cache hit.
[2024-05-22 05:18:31] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 2/281 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 1/282 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 229/511 variables, 282/340 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/511 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-22 05:18:40] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/511 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-22 05:18:41] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/511 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-22 05:18:44] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/511 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-22 05:18:47] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/511 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/511 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 15 (OVERLAPS) 1/512 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/512 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 17 (OVERLAPS) 0/512 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 347 constraints, problems are : Problem set: 0 solved, 225 unsolved in 26020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 283/283 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (OVERLAPS) 2/281 variables, 25/47 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 1/282 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (OVERLAPS) 229/511 variables, 282/344 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/511 variables, 2/346 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/511 variables, 225/571 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-22 05:19:12] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-22 05:19:12] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-22 05:19:13] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:19:19] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:19:20] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-22 05:19:23] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:19:23] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-22 05:19:23] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 511/512 variables, and 579 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 282/283 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 12/12 constraints]
After SMT, in 56153ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 56155ms
Starting structural reductions in SI_LTL mode, iteration 1 : 283/400 places, 229/344 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56769 ms. Remains : 283/400 places, 229/344 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : DES-PT-40b-LTLCardinality-02
Stuttering criterion allowed to conclude after 56 steps with 4 reset in 3 ms.
FORMULA DES-PT-40b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLCardinality-02 finished in 56930 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X((p1&&F(G(p1)))))))'
Support contains 4 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 344/344 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 394 transition count 338
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 393 transition count 334
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 393 transition count 333
Applied a total of 18 rules in 49 ms. Remains 393 /400 variables (removed 7) and now considering 333/344 (removed 11) transitions.
// Phase 1: matrix 333 rows 393 cols
[2024-05-22 05:19:27] [INFO ] Computed 62 invariants in 11 ms
[2024-05-22 05:19:27] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-22 05:19:27] [INFO ] Invariant cache hit.
[2024-05-22 05:19:28] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 707 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-22 05:19:28] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:19:33] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-22 05:19:33] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 2 ms to minimize.
[2024-05-22 05:19:33] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 3 ms to minimize.
[2024-05-22 05:19:34] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2024-05-22 05:19:34] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-22 05:19:34] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:19:34] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:19:34] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-22 05:19:34] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:19:35] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 2 ms to minimize.
[2024-05-22 05:19:35] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-22 05:19:35] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-05-22 05:19:36] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 2 ms to minimize.
[2024-05-22 05:19:36] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-22 05:19:37] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 15/470 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:19:41] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2024-05-22 05:19:42] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-05-22 05:19:42] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-22 05:19:42] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 2 ms to minimize.
[2024-05-22 05:19:42] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
[2024-05-22 05:19:42] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:19:42] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:19:42] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 2 ms to minimize.
[2024-05-22 05:19:42] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 9/479 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:19:46] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 ms to minimize.
[2024-05-22 05:19:46] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:19:46] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-22 05:19:46] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-22 05:19:46] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-22 05:19:46] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 2 ms to minimize.
[2024-05-22 05:19:46] [INFO ] Deduced a trap composed of 49 places in 88 ms of which 2 ms to minimize.
[2024-05-22 05:19:46] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 2 ms to minimize.
[2024-05-22 05:19:48] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/726 variables, 9/488 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:19:52] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:19:55] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 2 ms to minimize.
[2024-05-22 05:19:55] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:19:55] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:19:55] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-22 05:19:55] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-22 05:19:55] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-22 05:19:56] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-22 05:19:56] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-22 05:19:56] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-22 05:19:56] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-22 05:19:56] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 2 ms to minimize.
[2024-05-22 05:19:56] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 501 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:20:01] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:20:01] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:20:01] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:20:01] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
[2024-05-22 05:20:01] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-22 05:20:01] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-22 05:20:02] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 2 ms to minimize.
[2024-05-22 05:20:02] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:20:02] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-22 05:20:04] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-22 05:20:04] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:20:04] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-22 05:20:04] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 2 ms to minimize.
[2024-05-22 05:20:05] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:20:07] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2024-05-22 05:20:10] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:20:10] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-05-22 05:20:10] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 10 (OVERLAPS) 333/726 variables, 393/519 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/726 variables, 332/851 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 851 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 64/64 constraints]
After SMT, in 60149ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60152ms
Starting structural reductions in LTL mode, iteration 1 : 393/400 places, 333/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60909 ms. Remains : 393/400 places, 333/344 transitions.
Stuttering acceptance computed with spot in 254 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLCardinality-03
Product exploration explored 100000 steps with 896 reset in 227 ms.
Product exploration explored 100000 steps with 900 reset in 233 ms.
Computed a total of 216 stabilizing places and 208 stable transitions
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Computed a total of 216 stabilizing places and 208 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 84 ms. Reduced automaton from 8 states, 16 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
RANDOM walk for 11829 steps (106 resets) in 49 ms. (236 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 93 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 29 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Support contains 2 out of 393 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 393/393 places, 333/333 transitions.
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 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 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 386 transition count 316
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 373 transition count 315
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 372 transition count 315
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 29 place count 372 transition count 302
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 55 place count 359 transition count 302
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 3 with 146 rules applied. Total rules applied 201 place count 286 transition count 229
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 3 with 4 rules applied. Total rules applied 205 place count 284 transition count 231
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 207 place count 282 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 208 place count 281 transition count 229
Applied a total of 208 rules in 58 ms. Remains 281 /393 variables (removed 112) and now considering 229/333 (removed 104) transitions.
// Phase 1: matrix 229 rows 281 cols
[2024-05-22 05:20:29] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 05:20:29] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-22 05:20:29] [INFO ] Invariant cache hit.
[2024-05-22 05:20:30] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2024-05-22 05:20:30] [INFO ] Redundant transitions in 2 ms returned []
Running 225 sub problems to find dead transitions.
[2024-05-22 05:20:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 1/278 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 2/280 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 229/509 variables, 280/338 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-22 05:20:36] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:20:36] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-22 05:20:37] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-22 05:20:37] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:20:37] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 5/343 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-22 05:20:41] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:20:41] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-22 05:20:41] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/509 variables, 3/346 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/509 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 12 (OVERLAPS) 1/510 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/510 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 14 (OVERLAPS) 0/510 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 510/510 variables, and 347 constraints, problems are : Problem set: 0 solved, 225 unsolved in 20270 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (OVERLAPS) 1/278 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (OVERLAPS) 2/280 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (OVERLAPS) 229/509 variables, 280/346 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/509 variables, 225/571 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-22 05:21:00] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-22 05:21:08] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:21:08] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/509 variables, 3/574 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 509/510 variables, and 574 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 280/281 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 11/11 constraints]
After SMT, in 50410ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 50412ms
Starting structural reductions in SI_LTL mode, iteration 1 : 281/393 places, 229/333 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50919 ms. Remains : 281/393 places, 229/333 transitions.
Computed a total of 176 stabilizing places and 171 stable transitions
Computed a total of 176 stabilizing places and 171 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 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 p1)]
RANDOM walk for 1628 steps (72 resets) in 10 ms. (148 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
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 34 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Product exploration explored 100000 steps with 4389 reset in 199 ms.
Product exploration explored 100000 steps with 4414 reset in 228 ms.
Built C files in :
/tmp/ltsmin18294347193593986470
[2024-05-22 05:21:21] [INFO ] Computing symmetric may disable matrix : 229 transitions.
[2024-05-22 05:21:21] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:21:21] [INFO ] Computing symmetric may enable matrix : 229 transitions.
[2024-05-22 05:21:21] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:21:21] [INFO ] Computing Do-Not-Accords matrix : 229 transitions.
[2024-05-22 05:21:21] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:21:21] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18294347193593986470
Running compilation step : cd /tmp/ltsmin18294347193593986470;'/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 683 ms.
Running link step : cd /tmp/ltsmin18294347193593986470;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin18294347193593986470;'/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/stateBased16635052152054807776.hoa' '--buchi-type=spotba'
LTSmin run took 1628 ms.
FORMULA DES-PT-40b-LTLCardinality-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-40b-LTLCardinality-03 finished in 116116 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&(G(p1)||G(p2)))))'
Support contains 3 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 344/344 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 394 transition count 338
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 393 transition count 334
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 393 transition count 333
Applied a total of 18 rules in 18 ms. Remains 393 /400 variables (removed 7) and now considering 333/344 (removed 11) transitions.
// Phase 1: matrix 333 rows 393 cols
[2024-05-22 05:21:23] [INFO ] Computed 62 invariants in 7 ms
[2024-05-22 05:21:23] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-22 05:21:23] [INFO ] Invariant cache hit.
[2024-05-22 05:21:24] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-22 05:21:24] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:21:29] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2024-05-22 05:21:29] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 2 ms to minimize.
[2024-05-22 05:21:29] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
[2024-05-22 05:21:30] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-05-22 05:21:30] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:21:30] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:21:30] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:21:30] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:21:30] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:21:31] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:21:31] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-22 05:21:32] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-05-22 05:21:32] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 2 ms to minimize.
[2024-05-22 05:21:32] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-22 05:21:33] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 15/470 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:21:37] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-05-22 05:21:38] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 2 ms to minimize.
[2024-05-22 05:21:38] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-05-22 05:21:38] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:21:38] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 2 ms to minimize.
[2024-05-22 05:21:38] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:21:38] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:21:38] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 2 ms to minimize.
[2024-05-22 05:21:38] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 9/479 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:21:42] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-05-22 05:21:42] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:21:42] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-22 05:21:42] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-22 05:21:42] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-22 05:21:42] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 2 ms to minimize.
[2024-05-22 05:21:42] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 1 ms to minimize.
[2024-05-22 05:21:42] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 2 ms to minimize.
[2024-05-22 05:21:44] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/726 variables, 9/488 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:21:48] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:21:51] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 2 ms to minimize.
[2024-05-22 05:21:51] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 2 ms to minimize.
[2024-05-22 05:21:51] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:21:51] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-22 05:21:52] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-22 05:21:52] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-22 05:21:52] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-22 05:21:52] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-22 05:21:52] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-22 05:21:52] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:21:52] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 2 ms to minimize.
[2024-05-22 05:21:52] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 501 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:21:57] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 2 ms to minimize.
[2024-05-22 05:21:57] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:21:57] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:21:57] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-22 05:21:57] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-22 05:21:57] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-22 05:21:58] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-22 05:21:58] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:21:58] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-22 05:21:59] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-22 05:22:00] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:22:00] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:22:00] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-22 05:22:01] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:22:03] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-22 05:22:05] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:22:06] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2024-05-22 05:22:06] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 10 (OVERLAPS) 333/726 variables, 393/519 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/726 variables, 332/851 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 851 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 64/64 constraints]
After SMT, in 60154ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60159ms
Starting structural reductions in LTL mode, iteration 1 : 393/400 places, 333/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60802 ms. Remains : 393/400 places, 333/344 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-40b-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 56 steps with 4 reset in 1 ms.
FORMULA DES-PT-40b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLCardinality-04 finished in 61083 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 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 344/344 transitions.
Graph (complete) has 902 edges and 400 vertex of which 393 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 392 transition count 325
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 378 transition count 325
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 29 place count 378 transition count 313
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 53 place count 366 transition count 313
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 56 place count 363 transition count 310
Iterating global reduction 2 with 3 rules applied. Total rules applied 59 place count 363 transition count 310
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 363 transition count 308
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 62 place count 362 transition count 307
Iterating global reduction 3 with 1 rules applied. Total rules applied 63 place count 362 transition count 307
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 64 place count 362 transition count 306
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 64 place count 362 transition count 305
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 66 place count 361 transition count 305
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 216 place count 286 transition count 230
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 220 place count 284 transition count 232
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 222 place count 282 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 223 place count 281 transition count 230
Applied a total of 223 rules in 47 ms. Remains 281 /400 variables (removed 119) and now considering 230/344 (removed 114) transitions.
// Phase 1: matrix 230 rows 281 cols
[2024-05-22 05:22:24] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 05:22:25] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-22 05:22:25] [INFO ] Invariant cache hit.
[2024-05-22 05:22:25] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
[2024-05-22 05:22:25] [INFO ] Redundant transitions in 1 ms returned []
Running 226 sub problems to find dead transitions.
[2024-05-22 05:22:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 3/280 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (OVERLAPS) 230/510 variables, 280/338 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-22 05:22:29] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-22 05:22:33] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:22:33] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:22:34] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-22 05:22:34] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 4/343 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (OVERLAPS) 1/511 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/511 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (OVERLAPS) 0/511 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 511/511 variables, and 344 constraints, problems are : Problem set: 0 solved, 226 unsolved in 17435 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 12/61 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-22 05:22:45] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 230/510 variables, 280/344 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/510 variables, 226/570 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 226 unsolved
SMT process timed out in 47570ms, After SMT, problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 47572ms
Starting structural reductions in SI_LTL mode, iteration 1 : 281/400 places, 230/344 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48028 ms. Remains : 281/400 places, 230/344 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLCardinality-05
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA DES-PT-40b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLCardinality-05 finished in 48072 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(F(p0))||G(p1))))'
Support contains 4 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 344/344 transitions.
Graph (complete) has 902 edges and 400 vertex of which 393 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 392 transition count 325
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 378 transition count 325
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 29 place count 378 transition count 313
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 53 place count 366 transition count 313
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 57 place count 362 transition count 309
Iterating global reduction 2 with 4 rules applied. Total rules applied 61 place count 362 transition count 309
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 362 transition count 306
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 362 transition count 305
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 361 transition count 305
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 360 transition count 304
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 360 transition count 304
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 360 transition count 303
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 360 transition count 302
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 71 place count 359 transition count 302
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 223 place count 283 transition count 226
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 227 place count 281 transition count 228
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 229 place count 279 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 230 place count 278 transition count 226
Applied a total of 230 rules in 63 ms. Remains 278 /400 variables (removed 122) and now considering 226/344 (removed 118) transitions.
// Phase 1: matrix 226 rows 278 cols
[2024-05-22 05:23:12] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 05:23:13] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-22 05:23:13] [INFO ] Invariant cache hit.
[2024-05-22 05:23:13] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
[2024-05-22 05:23:13] [INFO ] Redundant transitions in 0 ms returned []
Running 222 sub problems to find dead transitions.
[2024-05-22 05:23:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 18/43 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (OVERLAPS) 1/275 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 2/277 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 226/503 variables, 277/335 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 05:23:21] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 10 (OVERLAPS) 1/504 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/504 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 05:23:27] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-05-22 05:23:27] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
[2024-05-22 05:23:27] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/504 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/504 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 14 (OVERLAPS) 0/504 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 340 constraints, problems are : Problem set: 0 solved, 222 unsolved in 22197 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 18/43 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 1/275 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 2/277 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (OVERLAPS) 226/503 variables, 277/339 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/503 variables, 222/561 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 05:23:58] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-05-22 05:23:58] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/503 variables, 2/563 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 503/504 variables, and 563 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 277/278 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 6/6 constraints]
After SMT, in 52326ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 52328ms
Starting structural reductions in SI_LTL mode, iteration 1 : 278/400 places, 226/344 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52839 ms. Remains : 278/400 places, 226/344 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-40b-LTLCardinality-06
Product exploration explored 100000 steps with 5124 reset in 236 ms.
Product exploration explored 100000 steps with 5226 reset in 264 ms.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Detected a total of 174/278 stabilizing places and 169/226 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 140 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2065 resets) in 173 ms. (229 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (385 resets) in 202 ms. (197 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (342 resets) in 202 ms. (197 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (383 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (349 resets) in 122 ms. (325 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 702225 steps, run timeout after 3001 ms. (steps per millisecond=233 ) properties seen :0 out of 4
Probabilistic random walk after 702225 steps, saw 99236 distinct states, run finished after 3001 ms. (steps per millisecond=233 ) properties seen :0
[2024-05-22 05:24:09] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 18/22 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 172/194 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 25/219 variables, 21/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 7/226 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 183/409 variables, 226/280 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 56/465 variables, 13/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/465 variables, 4/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/465 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 39/504 variables, 39/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/504 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/504 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 336 constraints, problems are : Problem set: 0 solved, 4 unsolved in 328 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 18/22 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 172/194 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 25/219 variables, 21/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 7/226 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 183/409 variables, 226/280 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/409 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 56/465 variables, 13/294 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/465 variables, 4/298 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/465 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/465 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 39/504 variables, 39/340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/504 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/504 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 504/504 variables, and 340 constraints, problems are : Problem set: 0 solved, 4 unsolved in 431 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 773ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 5654 ms.
Support contains 4 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 226/226 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 278 transition count 225
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 278 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 277 transition count 224
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 277 transition count 224
Applied a total of 4 rules in 26 ms. Remains 277 /278 variables (removed 1) and now considering 224/226 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 277/278 places, 224/226 transitions.
RANDOM walk for 40000 steps (1981 resets) in 228 ms. (174 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (372 resets) in 44 ms. (888 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (335 resets) in 136 ms. (291 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (361 resets) in 77 ms. (512 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (357 resets) in 64 ms. (615 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 753776 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :0 out of 4
Probabilistic random walk after 753776 steps, saw 105260 distinct states, run finished after 3001 ms. (steps per millisecond=251 ) properties seen :0
// Phase 1: matrix 224 rows 277 cols
[2024-05-22 05:24:19] [INFO ] Computed 59 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 18/22 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 172/194 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 29/223 variables, 23/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 3/226 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 181/407 variables, 226/281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 55/462 variables, 12/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 4/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 39/501 variables, 39/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/501 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/501 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 336 constraints, problems are : Problem set: 0 solved, 4 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 18/22 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 172/194 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 29/223 variables, 23/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 3/226 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 181/407 variables, 226/281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 55/462 variables, 12/294 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 4/298 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/462 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/462 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 39/501 variables, 39/340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/501 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/501 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 501/501 variables, and 340 constraints, problems are : Problem set: 0 solved, 4 unsolved in 411 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 715ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4482 ms.
Support contains 4 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 224/224 transitions.
Applied a total of 0 rules in 5 ms. Remains 277 /277 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 277/277 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 224/224 transitions.
Applied a total of 0 rules in 4 ms. Remains 277 /277 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-05-22 05:24:24] [INFO ] Invariant cache hit.
[2024-05-22 05:24:24] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-22 05:24:24] [INFO ] Invariant cache hit.
[2024-05-22 05:24:25] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
[2024-05-22 05:24:25] [INFO ] Redundant transitions in 1 ms returned []
Running 220 sub problems to find dead transitions.
[2024-05-22 05:24:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 1/274 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 2/276 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 220 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 224/500 variables, 276/335 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 05:24:31] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-22 05:24:32] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-22 05:24:33] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 2 ms to minimize.
[2024-05-22 05:24:33] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 4/339 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 10 (OVERLAPS) 1/501 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/501 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 05:24:39] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-22 05:24:39] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/501 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 05:24:41] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:24:41] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/501 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 05:24:44] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/501 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/501 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 16 (OVERLAPS) 0/501 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 345 constraints, problems are : Problem set: 0 solved, 220 unsolved in 24639 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 1/274 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 2/276 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (OVERLAPS) 224/500 variables, 276/344 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/500 variables, 220/564 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/500 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 220 unsolved
SMT process timed out in 54752ms, After SMT, problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 54759ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55176 ms. Remains : 277/277 places, 224/224 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 277 transition count 224
Applied a total of 1 rules in 26 ms. Remains 277 /277 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 224 rows 277 cols
[2024-05-22 05:25:20] [INFO ] Computed 59 invariants in 2 ms
[2024-05-22 05:25:20] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 05:25:20] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 05:25:20] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 05:25:20] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-22 05:25:20] [INFO ] After 260ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-22 05:25:20] [INFO ] After 418ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 516 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 136 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 226/226 transitions.
Applied a total of 0 rules in 13 ms. Remains 278 /278 variables (removed 0) and now considering 226/226 (removed 0) transitions.
// Phase 1: matrix 226 rows 278 cols
[2024-05-22 05:25:20] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 05:25:20] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-22 05:25:21] [INFO ] Invariant cache hit.
[2024-05-22 05:25:21] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
[2024-05-22 05:25:21] [INFO ] Redundant transitions in 1 ms returned []
Running 222 sub problems to find dead transitions.
[2024-05-22 05:25:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 18/43 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (OVERLAPS) 1/275 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 2/277 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 226/503 variables, 277/335 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 05:25:29] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 10 (OVERLAPS) 1/504 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/504 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 05:25:35] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 2 ms to minimize.
[2024-05-22 05:25:35] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-05-22 05:25:36] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/504 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/504 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 14 (OVERLAPS) 0/504 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 340 constraints, problems are : Problem set: 0 solved, 222 unsolved in 22736 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 18/43 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 1/275 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 2/277 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (OVERLAPS) 226/503 variables, 277/339 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/503 variables, 222/561 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 05:26:07] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
[2024-05-22 05:26:07] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/503 variables, 2/563 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 503/504 variables, and 563 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 277/278 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 6/6 constraints]
After SMT, in 52867ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 52869ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53314 ms. Remains : 278/278 places, 226/226 transitions.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Detected a total of 174/278 stabilizing places and 169/226 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 120 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2036 resets) in 164 ms. (242 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (372 resets) in 57 ms. (689 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (358 resets) in 64 ms. (615 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (365 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (348 resets) in 62 ms. (634 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 763659 steps, run timeout after 3001 ms. (steps per millisecond=254 ) properties seen :0 out of 4
Probabilistic random walk after 763659 steps, saw 107198 distinct states, run finished after 3001 ms. (steps per millisecond=254 ) properties seen :0
[2024-05-22 05:26:17] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 18/22 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 172/194 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 25/219 variables, 21/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 7/226 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 183/409 variables, 226/280 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 56/465 variables, 13/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/465 variables, 4/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/465 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 39/504 variables, 39/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/504 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/504 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 336 constraints, problems are : Problem set: 0 solved, 4 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 18/22 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 172/194 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 25/219 variables, 21/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 7/226 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 183/409 variables, 226/280 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/409 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 56/465 variables, 13/294 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/465 variables, 4/298 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/465 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/465 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 39/504 variables, 39/340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/504 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/504 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 504/504 variables, and 340 constraints, problems are : Problem set: 0 solved, 4 unsolved in 425 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 750ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 5735 ms.
Support contains 4 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 226/226 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 278 transition count 225
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 278 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 277 transition count 224
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 277 transition count 224
Applied a total of 4 rules in 20 ms. Remains 277 /278 variables (removed 1) and now considering 224/226 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 277/278 places, 224/226 transitions.
RANDOM walk for 40000 steps (2035 resets) in 278 ms. (143 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (362 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (341 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (351 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (331 resets) in 145 ms. (274 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 773150 steps, run timeout after 3001 ms. (steps per millisecond=257 ) properties seen :0 out of 4
Probabilistic random walk after 773150 steps, saw 108708 distinct states, run finished after 3001 ms. (steps per millisecond=257 ) properties seen :0
// Phase 1: matrix 224 rows 277 cols
[2024-05-22 05:26:27] [INFO ] Computed 59 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 18/22 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 172/194 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 29/223 variables, 23/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 3/226 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 181/407 variables, 226/281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 55/462 variables, 12/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 4/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 39/501 variables, 39/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/501 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/501 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 336 constraints, problems are : Problem set: 0 solved, 4 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 18/22 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 172/194 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 29/223 variables, 23/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 3/226 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 181/407 variables, 226/281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 55/462 variables, 12/294 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 4/298 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/462 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/462 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 39/501 variables, 39/340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/501 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/501 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 501/501 variables, and 340 constraints, problems are : Problem set: 0 solved, 4 unsolved in 427 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 720ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4133 ms.
Support contains 4 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 224/224 transitions.
Applied a total of 0 rules in 4 ms. Remains 277 /277 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 277/277 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 224/224 transitions.
Applied a total of 0 rules in 3 ms. Remains 277 /277 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-05-22 05:26:32] [INFO ] Invariant cache hit.
[2024-05-22 05:26:32] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-22 05:26:32] [INFO ] Invariant cache hit.
[2024-05-22 05:26:32] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
[2024-05-22 05:26:32] [INFO ] Redundant transitions in 0 ms returned []
Running 220 sub problems to find dead transitions.
[2024-05-22 05:26:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 1/274 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 2/276 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 220 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 224/500 variables, 276/335 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 05:26:38] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 2 ms to minimize.
[2024-05-22 05:26:39] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-22 05:26:40] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:26:40] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 4/339 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 10 (OVERLAPS) 1/501 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/501 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 05:26:46] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:26:46] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/501 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 05:26:48] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:26:48] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/501 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 05:26:50] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/501 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/501 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 16 (OVERLAPS) 0/501 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 345 constraints, problems are : Problem set: 0 solved, 220 unsolved in 23579 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 1/274 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 2/276 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (OVERLAPS) 224/500 variables, 276/344 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/500 variables, 220/564 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/500 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 220 unsolved
SMT process timed out in 53687ms, After SMT, problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 53690ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54129 ms. Remains : 277/277 places, 224/224 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 277 transition count 224
Applied a total of 1 rules in 7 ms. Remains 277 /277 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 224 rows 277 cols
[2024-05-22 05:27:26] [INFO ] Computed 59 invariants in 4 ms
[2024-05-22 05:27:26] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 05:27:26] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 05:27:26] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 19 ms returned sat
[2024-05-22 05:27:26] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-22 05:27:26] [INFO ] After 236ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-22 05:27:26] [INFO ] After 399ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 486 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 122 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5129 reset in 195 ms.
Product exploration explored 100000 steps with 5126 reset in 216 ms.
Built C files in :
/tmp/ltsmin9912544406816420275
[2024-05-22 05:27:27] [INFO ] Computing symmetric may disable matrix : 226 transitions.
[2024-05-22 05:27:27] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:27:27] [INFO ] Computing symmetric may enable matrix : 226 transitions.
[2024-05-22 05:27:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:27:27] [INFO ] Computing Do-Not-Accords matrix : 226 transitions.
[2024-05-22 05:27:27] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:27:27] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9912544406816420275
Running compilation step : cd /tmp/ltsmin9912544406816420275;'/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 557 ms.
Running link step : cd /tmp/ltsmin9912544406816420275;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin9912544406816420275;'/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/stateBased16079453100885232528.hoa' '--buchi-type=spotba'
LTSmin run took 11640 ms.
FORMULA DES-PT-40b-LTLCardinality-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-40b-LTLCardinality-06 finished in 266923 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(F((G(F(!p0))||(p1&&F(!p0)))))||(G(F(p1))&&F((G(F(!p0))||(p1&&F(!p0))))))))'
Support contains 3 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 344/344 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 395 transition count 339
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 395 transition count 339
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 395 transition count 337
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 394 transition count 336
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 394 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 394 transition count 335
Applied a total of 15 rules in 18 ms. Remains 394 /400 variables (removed 6) and now considering 335/344 (removed 9) transitions.
// Phase 1: matrix 335 rows 394 cols
[2024-05-22 05:27:39] [INFO ] Computed 62 invariants in 9 ms
[2024-05-22 05:27:40] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-22 05:27:40] [INFO ] Invariant cache hit.
[2024-05-22 05:27:40] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
Running 334 sub problems to find dead transitions.
[2024-05-22 05:27:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 1/394 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 334 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (OVERLAPS) 335/729 variables, 394/456 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-22 05:27:47] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 2 ms to minimize.
[2024-05-22 05:27:47] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 2 ms to minimize.
[2024-05-22 05:27:47] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 2 ms to minimize.
[2024-05-22 05:27:47] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-05-22 05:27:48] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2024-05-22 05:27:48] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:27:48] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:27:48] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:27:48] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-22 05:27:48] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
[2024-05-22 05:27:48] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-22 05:27:48] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:27:48] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-22 05:27:48] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:27:48] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:27:49] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-22 05:27:49] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-22 05:27:49] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-22 05:27:49] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:27:49] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/729 variables, 20/476 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-22 05:27:50] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:27:50] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-22 05:27:50] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:27:51] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 0 ms to minimize.
[2024-05-22 05:27:51] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-22 05:27:51] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-22 05:27:51] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-22 05:27:51] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:27:51] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/729 variables, 9/485 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-22 05:27:55] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 2 ms to minimize.
[2024-05-22 05:27:55] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:27:56] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-05-22 05:27:56] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:27:56] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-22 05:27:56] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-22 05:27:56] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-22 05:27:57] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:27:57] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:27:59] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2024-05-22 05:27:59] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/729 variables, 11/496 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-22 05:28:01] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:28:01] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:28:01] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:28:02] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-22 05:28:03] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/729 variables, 5/501 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-22 05:28:07] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-22 05:28:07] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 729/729 variables, and 503 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 394/394 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 1/394 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 47/109 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-22 05:28:13] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-22 05:28:13] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 2 ms to minimize.
[2024-05-22 05:28:13] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:28:13] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:28:13] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-22 05:28:14] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-22 05:28:14] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-22 05:28:14] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 8/117 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-22 05:28:16] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-22 05:28:16] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 8 (OVERLAPS) 335/729 variables, 394/513 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/729 variables, 334/847 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 729/729 variables, and 847 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 394/394 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 57/57 constraints]
After SMT, in 60151ms problems are : Problem set: 0 solved, 334 unsolved
Search for dead transitions found 0 dead transitions in 60156ms
Starting structural reductions in LTL mode, iteration 1 : 394/400 places, 335/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60777 ms. Remains : 394/400 places, 335/344 transitions.
Stuttering acceptance computed with spot in 249 ms :[p0, p0, p0, (AND (NOT p1) p0), p0, (AND (NOT p1) p0)]
Running random walk in product with property : DES-PT-40b-LTLCardinality-07
Stuttering criterion allowed to conclude after 199 steps with 1 reset in 2 ms.
FORMULA DES-PT-40b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLCardinality-07 finished in 61049 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 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 344/344 transitions.
Graph (complete) has 902 edges and 400 vertex of which 393 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 392 transition count 325
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 378 transition count 325
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 29 place count 378 transition count 313
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 53 place count 366 transition count 313
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 57 place count 362 transition count 309
Iterating global reduction 2 with 4 rules applied. Total rules applied 61 place count 362 transition count 309
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 362 transition count 306
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 362 transition count 305
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 361 transition count 305
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 360 transition count 304
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 360 transition count 304
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 360 transition count 303
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 360 transition count 302
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 359 transition count 302
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 223 place count 283 transition count 226
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 227 place count 281 transition count 228
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 229 place count 279 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 230 place count 278 transition count 226
Applied a total of 230 rules in 39 ms. Remains 278 /400 variables (removed 122) and now considering 226/344 (removed 118) transitions.
// Phase 1: matrix 226 rows 278 cols
[2024-05-22 05:28:40] [INFO ] Computed 58 invariants in 8 ms
[2024-05-22 05:28:41] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-22 05:28:41] [INFO ] Invariant cache hit.
[2024-05-22 05:28:41] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2024-05-22 05:28:41] [INFO ] Redundant transitions in 1 ms returned []
Running 223 sub problems to find dead transitions.
[2024-05-22 05:28:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (OVERLAPS) 2/277 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 226/503 variables, 277/335 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-22 05:28:46] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2024-05-22 05:28:46] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:28:46] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 3/338 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-22 05:28:49] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-22 05:28:49] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-22 05:28:52] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:28:52] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (OVERLAPS) 1/504 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-22 05:28:58] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/504 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-22 05:28:59] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/504 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/504 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 14 (OVERLAPS) 0/504 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 345 constraints, problems are : Problem set: 0 solved, 223 unsolved in 25957 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 2/277 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (OVERLAPS) 226/503 variables, 277/344 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 223/567 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 223 unsolved
SMT process timed out in 56068ms, After SMT, problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 56071ms
Starting structural reductions in SI_LTL mode, iteration 1 : 278/400 places, 226/344 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56533 ms. Remains : 278/400 places, 226/344 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLCardinality-09
Stuttering criterion allowed to conclude after 90 steps with 5 reset in 0 ms.
FORMULA DES-PT-40b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLCardinality-09 finished in 56587 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(p1)||p0)))'
Support contains 4 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 344/344 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 395 transition count 339
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 395 transition count 339
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 395 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 394 transition count 335
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 394 transition count 335
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 394 transition count 334
Applied a total of 16 rules in 21 ms. Remains 394 /400 variables (removed 6) and now considering 334/344 (removed 10) transitions.
// Phase 1: matrix 334 rows 394 cols
[2024-05-22 05:29:37] [INFO ] Computed 62 invariants in 8 ms
[2024-05-22 05:29:37] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-22 05:29:37] [INFO ] Invariant cache hit.
[2024-05-22 05:29:38] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
Running 333 sub problems to find dead transitions.
[2024-05-22 05:29:38] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (OVERLAPS) 1/394 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (OVERLAPS) 334/728 variables, 394/456 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-22 05:29:43] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-05-22 05:29:43] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 2 ms to minimize.
[2024-05-22 05:29:43] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 2 ms to minimize.
[2024-05-22 05:29:43] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:29:43] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-05-22 05:29:43] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:29:44] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 2 ms to minimize.
[2024-05-22 05:29:44] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:29:44] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:29:44] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-22 05:29:44] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-05-22 05:29:44] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-22 05:29:44] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 2 ms to minimize.
[2024-05-22 05:29:44] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:29:44] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-22 05:29:45] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-22 05:29:45] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-05-22 05:29:45] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
[2024-05-22 05:29:45] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2024-05-22 05:29:46] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/728 variables, 20/476 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-22 05:29:47] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:29:48] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-05-22 05:29:48] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-22 05:29:48] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
[2024-05-22 05:29:48] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-22 05:29:48] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-22 05:29:48] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 2 ms to minimize.
[2024-05-22 05:29:49] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
[2024-05-22 05:29:49] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/728 variables, 9/485 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-22 05:29:54] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:29:54] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-05-22 05:29:54] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-22 05:29:54] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-22 05:29:54] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:29:54] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-22 05:29:54] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-22 05:29:54] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-22 05:29:54] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-22 05:29:55] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 1 ms to minimize.
[2024-05-22 05:29:55] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:29:55] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-22 05:29:55] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-22 05:29:55] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-22 05:29:55] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-22 05:29:55] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-22 05:29:56] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/728 variables, 17/502 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-22 05:29:59] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-22 05:29:59] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-22 05:30:00] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/728 variables, 3/505 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-22 05:30:04] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/728 variables, 1/506 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/728 variables, and 506 constraints, problems are : Problem set: 0 solved, 333 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 394/394 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 333 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (OVERLAPS) 1/394 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 50/112 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-22 05:30:10] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:30:10] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-22 05:30:11] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-22 05:30:11] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-22 05:30:13] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:30:13] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:30:13] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-22 05:30:14] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-22 05:30:14] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 5/121 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-22 05:30:17] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:30:17] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-22 05:30:19] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-22 05:30:19] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-22 05:30:23] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 11 (OVERLAPS) 334/728 variables, 394/520 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/728 variables, 333/853 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/728 variables, and 853 constraints, problems are : Problem set: 0 solved, 333 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 394/394 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 64/64 constraints]
After SMT, in 60148ms problems are : Problem set: 0 solved, 333 unsolved
Search for dead transitions found 0 dead transitions in 60151ms
Starting structural reductions in LTL mode, iteration 1 : 394/400 places, 334/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60765 ms. Remains : 394/400 places, 334/344 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-40b-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 175 ms.
Product exploration explored 100000 steps with 50000 reset in 195 ms.
Computed a total of 217 stabilizing places and 209 stable transitions
Graph (complete) has 887 edges and 394 vertex of which 388 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 217 stabilizing places and 209 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-40b-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-40b-LTLCardinality-10 finished in 61277 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 344/344 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 394 transition count 338
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 393 transition count 334
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 393 transition count 333
Applied a total of 18 rules in 17 ms. Remains 393 /400 variables (removed 7) and now considering 333/344 (removed 11) transitions.
// Phase 1: matrix 333 rows 393 cols
[2024-05-22 05:30:38] [INFO ] Computed 62 invariants in 6 ms
[2024-05-22 05:30:38] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-22 05:30:38] [INFO ] Invariant cache hit.
[2024-05-22 05:30:39] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-22 05:30:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:30:44] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-22 05:30:44] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 2 ms to minimize.
[2024-05-22 05:30:44] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 3 ms to minimize.
[2024-05-22 05:30:45] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-05-22 05:30:45] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:30:45] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 2 ms to minimize.
[2024-05-22 05:30:45] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:30:45] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-22 05:30:45] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:30:46] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:30:46] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2024-05-22 05:30:46] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-05-22 05:30:47] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 2 ms to minimize.
[2024-05-22 05:30:47] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:30:48] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 15/470 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:30:52] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-05-22 05:30:52] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 2 ms to minimize.
[2024-05-22 05:30:53] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:30:53] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 2 ms to minimize.
[2024-05-22 05:30:53] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:30:53] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:30:53] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 2 ms to minimize.
[2024-05-22 05:30:53] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:30:53] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 9/479 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:30:56] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
[2024-05-22 05:30:56] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:30:57] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-22 05:30:57] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 5 ms to minimize.
[2024-05-22 05:30:57] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 0 ms to minimize.
[2024-05-22 05:30:57] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 1 ms to minimize.
[2024-05-22 05:30:57] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 2 ms to minimize.
[2024-05-22 05:30:57] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 1 ms to minimize.
[2024-05-22 05:30:59] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/726 variables, 9/488 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:31:03] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:31:06] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:31:06] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:31:06] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
[2024-05-22 05:31:06] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-22 05:31:06] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-22 05:31:06] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-22 05:31:06] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-22 05:31:06] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:31:06] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-22 05:31:06] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:31:06] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:31:07] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 501 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:31:12] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:31:12] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:31:12] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:31:12] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-22 05:31:12] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-22 05:31:12] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-22 05:31:13] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:31:13] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:31:13] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-22 05:31:14] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-22 05:31:14] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:31:15] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-22 05:31:15] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:31:16] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:31:18] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:31:20] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:31:21] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-22 05:31:21] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 10 (OVERLAPS) 333/726 variables, 393/519 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/726 variables, 332/851 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 851 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 64/64 constraints]
After SMT, in 60130ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60133ms
Starting structural reductions in LTL mode, iteration 1 : 393/400 places, 333/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60760 ms. Remains : 393/400 places, 333/344 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-40b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLCardinality-11 finished in 60866 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))'
Support contains 1 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 344/344 transitions.
Graph (complete) has 902 edges and 400 vertex of which 393 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 392 transition count 325
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 378 transition count 325
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 29 place count 378 transition count 313
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 53 place count 366 transition count 313
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 57 place count 362 transition count 309
Iterating global reduction 2 with 4 rules applied. Total rules applied 61 place count 362 transition count 309
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 362 transition count 306
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 362 transition count 305
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 361 transition count 305
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 360 transition count 304
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 360 transition count 304
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 360 transition count 303
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 360 transition count 302
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 359 transition count 302
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 282 transition count 225
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 229 place count 280 transition count 227
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 231 place count 278 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 232 place count 277 transition count 225
Applied a total of 232 rules in 54 ms. Remains 277 /400 variables (removed 123) and now considering 225/344 (removed 119) transitions.
// Phase 1: matrix 225 rows 277 cols
[2024-05-22 05:31:39] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 05:31:39] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-22 05:31:39] [INFO ] Invariant cache hit.
[2024-05-22 05:31:40] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
[2024-05-22 05:31:40] [INFO ] Redundant transitions in 1 ms returned []
Running 222 sub problems to find dead transitions.
[2024-05-22 05:31:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (OVERLAPS) 2/276 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 225/501 variables, 276/334 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 05:31:43] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:31:43] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:31:45] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 3/337 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (OVERLAPS) 1/502 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 05:31:49] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/502 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/502 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 05:31:55] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-22 05:31:56] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/502 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 05:31:58] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/502 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/502 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 14 (OVERLAPS) 0/502 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 502/502 variables, and 342 constraints, problems are : Problem set: 0 solved, 222 unsolved in 24934 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 2/276 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 225/501 variables, 276/341 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 222/563 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 222 unsolved
SMT process timed out in 55055ms, After SMT, problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 55057ms
Starting structural reductions in SI_LTL mode, iteration 1 : 277/400 places, 225/344 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55567 ms. Remains : 277/400 places, 225/344 transitions.
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLCardinality-12
Product exploration explored 100000 steps with 5382 reset in 191 ms.
Product exploration explored 100000 steps with 5451 reset in 212 ms.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Detected a total of 174/277 stabilizing places and 169/225 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 137 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (2146 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (421 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1673911 steps, run timeout after 3001 ms. (steps per millisecond=557 ) properties seen :0 out of 1
Probabilistic random walk after 1673911 steps, saw 232070 distinct states, run finished after 3001 ms. (steps per millisecond=557 ) properties seen :0
[2024-05-22 05:32:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 154/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/188 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/217 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/224 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 180/404 variables, 224/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/418 variables, 9/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 3/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 44/462 variables, 4/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/462 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/462 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 40/502 variables, 40/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/502 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/502 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 502/502 variables, and 335 constraints, problems are : Problem set: 0 solved, 1 unsolved in 223 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 154/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/188 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/217 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/224 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 180/404 variables, 224/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 05:32:39] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/404 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/418 variables, 9/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 3/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 05:32:39] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/418 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/418 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 44/462 variables, 4/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/462 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/462 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 40/502 variables, 40/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/502 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/502 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 502/502 variables, and 338 constraints, problems are : Problem set: 0 solved, 1 unsolved in 341 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 569ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 325 ms.
Support contains 1 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 225/225 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 277 transition count 224
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 277 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 276 transition count 223
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 276 transition count 223
Applied a total of 4 rules in 12 ms. Remains 276 /277 variables (removed 1) and now considering 223/225 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 276/277 places, 223/225 transitions.
RANDOM walk for 40000 steps (2068 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (400 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1668509 steps, run timeout after 3001 ms. (steps per millisecond=555 ) properties seen :0 out of 1
Probabilistic random walk after 1668509 steps, saw 231274 distinct states, run finished after 3001 ms. (steps per millisecond=555 ) properties seen :0
// Phase 1: matrix 223 rows 276 cols
[2024-05-22 05:32:42] [INFO ] Computed 59 invariants in 10 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 154/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/192 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/217 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/224 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 178/402 variables, 224/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/416 variables, 8/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 3/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/416 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 44/460 variables, 5/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/460 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/460 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 39/499 variables, 39/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/499 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/499 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 335 constraints, problems are : Problem set: 0 solved, 1 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 154/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/192 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/217 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/224 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 178/402 variables, 224/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/402 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 14/416 variables, 8/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/416 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/416 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 44/460 variables, 5/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/460 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/460 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 39/499 variables, 39/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/499 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/499 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 499/499 variables, and 336 constraints, problems are : Problem set: 0 solved, 1 unsolved in 239 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 473ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 564 ms.
Support contains 1 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 276 /276 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 276/276 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 276 /276 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-22 05:32:43] [INFO ] Invariant cache hit.
[2024-05-22 05:32:44] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-22 05:32:44] [INFO ] Invariant cache hit.
[2024-05-22 05:32:44] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
[2024-05-22 05:32:44] [INFO ] Redundant transitions in 1 ms returned []
Running 220 sub problems to find dead transitions.
[2024-05-22 05:32:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 220 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/275 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 223/498 variables, 275/334 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 05:32:48] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-22 05:32:48] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-22 05:32:48] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-22 05:32:48] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/498 variables, 4/338 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 05:32:50] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-22 05:32:50] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/498 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/498 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (OVERLAPS) 1/499 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 05:32:55] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/499 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/499 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 12 (OVERLAPS) 0/499 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 342 constraints, problems are : Problem set: 0 solved, 220 unsolved in 16688 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 2/275 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 223/498 variables, 275/341 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/498 variables, 220/561 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 05:33:14] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-22 05:33:17] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 2 ms to minimize.
[2024-05-22 05:33:17] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/498 variables, 3/564 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/499 variables, and 564 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 275/276 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 10/10 constraints]
After SMT, in 46819ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 46821ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47216 ms. Remains : 276/276 places, 223/223 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 276 transition count 223
Applied a total of 1 rules in 6 ms. Remains 276 /276 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 223 rows 276 cols
[2024-05-22 05:33:31] [INFO ] Computed 59 invariants in 3 ms
[2024-05-22 05:33:31] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 05:33:31] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 05:33:31] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 05:33:31] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 05:33:31] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 05:33:31] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 05:33:31] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 05:33:31] [INFO ] After 173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 259 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0)]
Support contains 1 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 225/225 transitions.
Applied a total of 0 rules in 5 ms. Remains 277 /277 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 277 cols
[2024-05-22 05:33:31] [INFO ] Computed 58 invariants in 6 ms
[2024-05-22 05:33:31] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-22 05:33:31] [INFO ] Invariant cache hit.
[2024-05-22 05:33:31] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2024-05-22 05:33:32] [INFO ] Redundant transitions in 0 ms returned []
Running 222 sub problems to find dead transitions.
[2024-05-22 05:33:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (OVERLAPS) 2/276 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 225/501 variables, 276/334 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 05:33:35] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:33:35] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:33:36] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 3/337 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (OVERLAPS) 1/502 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 05:33:41] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/502 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/502 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 05:33:47] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-22 05:33:47] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/502 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 05:33:49] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/502 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/502 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 14 (OVERLAPS) 0/502 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 502/502 variables, and 342 constraints, problems are : Problem set: 0 solved, 222 unsolved in 25031 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 2/276 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 225/501 variables, 276/341 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 222/563 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 222 unsolved
SMT process timed out in 55153ms, After SMT, problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 55156ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 55564 ms. Remains : 277/277 places, 225/225 transitions.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Detected a total of 174/277 stabilizing places and 169/225 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (2165 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (422 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1668938 steps, run timeout after 3001 ms. (steps per millisecond=556 ) properties seen :0 out of 1
Probabilistic random walk after 1668938 steps, saw 231406 distinct states, run finished after 3001 ms. (steps per millisecond=556 ) properties seen :0
[2024-05-22 05:34:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 154/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/188 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/217 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/224 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 180/404 variables, 224/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/418 variables, 9/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 3/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 44/462 variables, 4/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/462 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/462 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 40/502 variables, 40/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/502 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/502 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 502/502 variables, and 335 constraints, problems are : Problem set: 0 solved, 1 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 154/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/188 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/217 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/224 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 180/404 variables, 224/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 05:34:30] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/404 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/418 variables, 9/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 3/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 05:34:30] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/418 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/418 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 44/462 variables, 4/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/462 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/462 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 40/502 variables, 40/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/502 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/502 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 502/502 variables, and 338 constraints, problems are : Problem set: 0 solved, 1 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 549ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 327 ms.
Support contains 1 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 225/225 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 277 transition count 224
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 277 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 276 transition count 223
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 276 transition count 223
Applied a total of 4 rules in 25 ms. Remains 276 /277 variables (removed 1) and now considering 223/225 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 276/277 places, 223/225 transitions.
RANDOM walk for 40000 steps (2146 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (409 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1658046 steps, run timeout after 3001 ms. (steps per millisecond=552 ) properties seen :0 out of 1
Probabilistic random walk after 1658046 steps, saw 229722 distinct states, run finished after 3001 ms. (steps per millisecond=552 ) properties seen :0
// Phase 1: matrix 223 rows 276 cols
[2024-05-22 05:34:34] [INFO ] Computed 59 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 154/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/192 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/217 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/224 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 178/402 variables, 224/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/416 variables, 8/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 3/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/416 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 44/460 variables, 5/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/460 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/460 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 39/499 variables, 39/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/499 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/499 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 335 constraints, problems are : Problem set: 0 solved, 1 unsolved in 195 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 154/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/192 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/217 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/224 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 178/402 variables, 224/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/402 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 14/416 variables, 8/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/416 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/416 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 44/460 variables, 5/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/460 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/460 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 39/499 variables, 39/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/499 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/499 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 499/499 variables, and 336 constraints, problems are : Problem set: 0 solved, 1 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 470ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 581 ms.
Support contains 1 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 276 /276 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 276/276 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 276 /276 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-22 05:34:35] [INFO ] Invariant cache hit.
[2024-05-22 05:34:35] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-22 05:34:35] [INFO ] Invariant cache hit.
[2024-05-22 05:34:35] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2024-05-22 05:34:35] [INFO ] Redundant transitions in 1 ms returned []
Running 220 sub problems to find dead transitions.
[2024-05-22 05:34:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 220 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/275 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 223/498 variables, 275/334 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 05:34:39] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-22 05:34:39] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-22 05:34:40] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-22 05:34:40] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/498 variables, 4/338 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 05:34:42] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:34:42] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/498 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/498 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (OVERLAPS) 1/499 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 05:34:47] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/499 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/499 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 12 (OVERLAPS) 0/499 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 342 constraints, problems are : Problem set: 0 solved, 220 unsolved in 16449 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 2/275 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 223/498 variables, 275/341 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/498 variables, 220/561 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 05:35:05] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-22 05:35:08] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-22 05:35:08] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/498 variables, 3/564 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/499 variables, and 564 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 275/276 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 10/10 constraints]
After SMT, in 46586ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 46588ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46985 ms. Remains : 276/276 places, 223/223 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 276 transition count 223
Applied a total of 1 rules in 8 ms. Remains 276 /276 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 223 rows 276 cols
[2024-05-22 05:35:22] [INFO ] Computed 59 invariants in 2 ms
[2024-05-22 05:35:22] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 05:35:22] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 05:35:22] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 05:35:22] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 05:35:22] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 05:35:22] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 05:35:22] [INFO ] After 107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 05:35:22] [INFO ] After 188ms 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)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 5483 reset in 191 ms.
Product exploration explored 100000 steps with 5426 reset in 209 ms.
Built C files in :
/tmp/ltsmin5621690681264574312
[2024-05-22 05:35:23] [INFO ] Computing symmetric may disable matrix : 225 transitions.
[2024-05-22 05:35:23] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:35:23] [INFO ] Computing symmetric may enable matrix : 225 transitions.
[2024-05-22 05:35:23] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:35:23] [INFO ] Computing Do-Not-Accords matrix : 225 transitions.
[2024-05-22 05:35:23] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:35:23] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5621690681264574312
Running compilation step : cd /tmp/ltsmin5621690681264574312;'/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/ltsmin5621690681264574312;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin5621690681264574312;'/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/stateBased14378682608138546872.hoa' '--buchi-type=spotba'
LTSmin run took 7178 ms.
FORMULA DES-PT-40b-LTLCardinality-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-40b-LTLCardinality-12 finished in 231473 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 7 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 344/344 transitions.
Graph (complete) has 902 edges and 400 vertex of which 394 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 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 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 393 transition count 326
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 379 transition count 326
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 29 place count 379 transition count 314
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 53 place count 367 transition count 314
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 56 place count 364 transition count 311
Iterating global reduction 2 with 3 rules applied. Total rules applied 59 place count 364 transition count 311
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 62 place count 364 transition count 308
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 364 transition count 307
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 363 transition count 307
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 212 place count 289 transition count 233
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 220 place count 285 transition count 242
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 221 place count 285 transition count 242
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 223 place count 283 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 224 place count 282 transition count 240
Applied a total of 224 rules in 34 ms. Remains 282 /400 variables (removed 118) and now considering 240/344 (removed 104) transitions.
// Phase 1: matrix 240 rows 282 cols
[2024-05-22 05:35:31] [INFO ] Computed 58 invariants in 6 ms
[2024-05-22 05:35:31] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-22 05:35:31] [INFO ] Invariant cache hit.
[2024-05-22 05:35:31] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
[2024-05-22 05:35:31] [INFO ] Redundant transitions in 1 ms returned []
Running 236 sub problems to find dead transitions.
[2024-05-22 05:35:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 11/43 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 1/279 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (OVERLAPS) 2/281 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 8 (OVERLAPS) 240/521 variables, 281/339 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-22 05:35:37] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:35:39] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:35:39] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/521 variables, 3/342 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/521 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 11 (OVERLAPS) 1/522 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/522 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-22 05:35:47] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:35:47] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/522 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-22 05:35:50] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-05-22 05:35:51] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/522 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/522 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 16 (OVERLAPS) 0/522 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 522/522 variables, and 347 constraints, problems are : Problem set: 0 solved, 236 unsolved in 26973 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 11/43 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (OVERLAPS) 1/279 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 2/281 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 10 (OVERLAPS) 240/521 variables, 281/346 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/521 variables, 236/582 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/521 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 236 unsolved
SMT process timed out in 57094ms, After SMT, problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 57096ms
Starting structural reductions in SI_LTL mode, iteration 1 : 282/400 places, 240/344 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57540 ms. Remains : 282/400 places, 240/344 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLCardinality-13
Product exploration explored 100000 steps with 4917 reset in 237 ms.
Product exploration explored 100000 steps with 4976 reset in 258 ms.
Computed a total of 174 stabilizing places and 169 stable transitions
Graph (complete) has 912 edges and 282 vertex of which 280 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 174 stabilizing places and 169 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 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 37 ms :[(NOT p0)]
RANDOM walk for 2353 steps (119 resets) in 16 ms. (138 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 84 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 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Support contains 7 out of 282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 282/282 places, 240/240 transitions.
Applied a total of 0 rules in 7 ms. Remains 282 /282 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-22 05:36:29] [INFO ] Invariant cache hit.
[2024-05-22 05:36:29] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-22 05:36:29] [INFO ] Invariant cache hit.
[2024-05-22 05:36:29] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2024-05-22 05:36:29] [INFO ] Redundant transitions in 1 ms returned []
Running 236 sub problems to find dead transitions.
[2024-05-22 05:36:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 11/43 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 1/279 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (OVERLAPS) 2/281 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 8 (OVERLAPS) 240/521 variables, 281/339 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-22 05:36:36] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:36:37] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2024-05-22 05:36:37] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/521 variables, 3/342 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/521 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 11 (OVERLAPS) 1/522 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/522 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-22 05:36:46] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-22 05:36:46] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/522 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-22 05:36:48] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 2 ms to minimize.
[2024-05-22 05:36:49] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/522 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/522 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 16 (OVERLAPS) 0/522 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 522/522 variables, and 347 constraints, problems are : Problem set: 0 solved, 236 unsolved in 27488 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 11/43 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (OVERLAPS) 1/279 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 2/281 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 10 (OVERLAPS) 240/521 variables, 281/346 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/521 variables, 236/582 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/521 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 236 unsolved
SMT process timed out in 57633ms, After SMT, problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 57636ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 58037 ms. Remains : 282/282 places, 240/240 transitions.
Computed a total of 174 stabilizing places and 169 stable transitions
Graph (complete) has 912 edges and 282 vertex of which 280 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 174 stabilizing places and 169 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 1341 steps (60 resets) in 9 ms. (134 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4933 reset in 239 ms.
Product exploration explored 100000 steps with 4929 reset in 255 ms.
Built C files in :
/tmp/ltsmin4218844187495713003
[2024-05-22 05:37:28] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2024-05-22 05:37:28] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:37:28] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2024-05-22 05:37:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:37:28] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2024-05-22 05:37:28] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:37:28] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4218844187495713003
Running compilation step : cd /tmp/ltsmin4218844187495713003;'/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 598 ms.
Running link step : cd /tmp/ltsmin4218844187495713003;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4218844187495713003;'/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/stateBased14093237627315396457.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 282/282 places, 240/240 transitions.
Applied a total of 0 rules in 11 ms. Remains 282 /282 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-22 05:37:43] [INFO ] Invariant cache hit.
[2024-05-22 05:37:43] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-22 05:37:43] [INFO ] Invariant cache hit.
[2024-05-22 05:37:43] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2024-05-22 05:37:43] [INFO ] Redundant transitions in 1 ms returned []
Running 236 sub problems to find dead transitions.
[2024-05-22 05:37:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 11/43 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 1/279 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (OVERLAPS) 2/281 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 8 (OVERLAPS) 240/521 variables, 281/339 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-22 05:37:50] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:37:51] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-22 05:37:51] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/521 variables, 3/342 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/521 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 11 (OVERLAPS) 1/522 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/522 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-22 05:38:00] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-22 05:38:00] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/522 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-22 05:38:02] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 2 ms to minimize.
[2024-05-22 05:38:03] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/522 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/522 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 16 (OVERLAPS) 0/522 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 522/522 variables, and 347 constraints, problems are : Problem set: 0 solved, 236 unsolved in 27110 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 11/43 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (OVERLAPS) 1/279 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 2/281 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 10 (OVERLAPS) 240/521 variables, 281/346 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/521 variables, 236/582 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/521 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 236 unsolved
SMT process timed out in 57245ms, After SMT, problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 57248ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 57635 ms. Remains : 282/282 places, 240/240 transitions.
Built C files in :
/tmp/ltsmin11448793297838459674
[2024-05-22 05:38:41] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2024-05-22 05:38:41] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:38:41] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2024-05-22 05:38:41] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:38:41] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2024-05-22 05:38:41] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:38:41] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11448793297838459674
Running compilation step : cd /tmp/ltsmin11448793297838459674;'/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 600 ms.
Running link step : cd /tmp/ltsmin11448793297838459674;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin11448793297838459674;'/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/stateBased11249516732960200771.hoa' '--buchi-type=spotba'
LTSmin run took 11136 ms.
FORMULA DES-PT-40b-LTLCardinality-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-40b-LTLCardinality-13 finished in 201847 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(F(p1)))))'
Support contains 3 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 344/344 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 394 transition count 338
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 393 transition count 334
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 393 transition count 333
Applied a total of 18 rules in 17 ms. Remains 393 /400 variables (removed 7) and now considering 333/344 (removed 11) transitions.
// Phase 1: matrix 333 rows 393 cols
[2024-05-22 05:38:52] [INFO ] Computed 62 invariants in 12 ms
[2024-05-22 05:38:53] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-22 05:38:53] [INFO ] Invariant cache hit.
[2024-05-22 05:38:53] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-22 05:38:53] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:38:58] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2024-05-22 05:38:59] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 3 ms to minimize.
[2024-05-22 05:38:59] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 2 ms to minimize.
[2024-05-22 05:38:59] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-05-22 05:38:59] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:38:59] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:38:59] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:39:00] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:39:00] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:39:00] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-22 05:39:00] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-22 05:39:01] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-05-22 05:39:01] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-05-22 05:39:01] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-22 05:39:02] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 15/470 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:39:07] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-05-22 05:39:07] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-05-22 05:39:07] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:39:07] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 2 ms to minimize.
[2024-05-22 05:39:08] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:39:08] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 2 ms to minimize.
[2024-05-22 05:39:08] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2024-05-22 05:39:08] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:39:08] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 9/479 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:39:11] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 2 ms to minimize.
[2024-05-22 05:39:11] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 2 ms to minimize.
[2024-05-22 05:39:11] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:39:11] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-22 05:39:11] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-22 05:39:11] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 2 ms to minimize.
[2024-05-22 05:39:12] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 1 ms to minimize.
[2024-05-22 05:39:12] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 1 ms to minimize.
[2024-05-22 05:39:14] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/726 variables, 9/488 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:39:18] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:39:21] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:39:21] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 2 ms to minimize.
[2024-05-22 05:39:21] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:39:21] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-22 05:39:21] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-22 05:39:21] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-22 05:39:21] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-22 05:39:22] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-22 05:39:22] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-22 05:39:22] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:39:22] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-22 05:39:22] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 501 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:39:26] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:39:26] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 2 ms to minimize.
[2024-05-22 05:39:26] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:39:26] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-22 05:39:26] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-22 05:39:27] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-22 05:39:27] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:39:27] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:39:27] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-22 05:39:29] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-22 05:39:29] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:39:29] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:39:29] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:39:30] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:39:32] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:39:34] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:39:35] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2024-05-22 05:39:35] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 10 (OVERLAPS) 333/726 variables, 393/519 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/726 variables, 332/851 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 851 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 64/64 constraints]
After SMT, in 60146ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60150ms
Starting structural reductions in LTL mode, iteration 1 : 393/400 places, 333/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60800 ms. Remains : 393/400 places, 333/344 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : DES-PT-40b-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-40b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLCardinality-14 finished in 61032 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))'
Support contains 3 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 344/344 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 394 transition count 338
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 393 transition count 334
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 393 transition count 333
Applied a total of 18 rules in 28 ms. Remains 393 /400 variables (removed 7) and now considering 333/344 (removed 11) transitions.
[2024-05-22 05:39:54] [INFO ] Invariant cache hit.
[2024-05-22 05:39:54] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-22 05:39:54] [INFO ] Invariant cache hit.
[2024-05-22 05:39:54] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-22 05:39:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:39:59] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:40:00] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 3 ms to minimize.
[2024-05-22 05:40:00] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 2 ms to minimize.
[2024-05-22 05:40:00] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-05-22 05:40:00] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-22 05:40:00] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-22 05:40:00] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 2 ms to minimize.
[2024-05-22 05:40:01] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-22 05:40:01] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:40:01] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-22 05:40:01] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-22 05:40:02] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-05-22 05:40:02] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 2 ms to minimize.
[2024-05-22 05:40:02] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 2 ms to minimize.
[2024-05-22 05:40:03] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 15/470 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:40:08] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-05-22 05:40:08] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
[2024-05-22 05:40:08] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
[2024-05-22 05:40:08] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 2 ms to minimize.
[2024-05-22 05:40:09] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-22 05:40:09] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:40:09] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 2 ms to minimize.
[2024-05-22 05:40:09] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 2 ms to minimize.
[2024-05-22 05:40:09] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 9/479 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:40:12] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2024-05-22 05:40:12] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:40:12] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2024-05-22 05:40:12] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-22 05:40:12] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-22 05:40:12] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2024-05-22 05:40:13] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 2 ms to minimize.
[2024-05-22 05:40:13] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 2 ms to minimize.
[2024-05-22 05:40:15] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/726 variables, 9/488 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:40:18] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:40:22] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:40:22] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:40:22] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 2 ms to minimize.
[2024-05-22 05:40:22] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-22 05:40:22] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-22 05:40:22] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-22 05:40:22] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-22 05:40:22] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-22 05:40:22] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-22 05:40:22] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:40:22] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:40:22] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 501 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:40:27] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-22 05:40:27] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-22 05:40:27] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 2 ms to minimize.
[2024-05-22 05:40:27] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-05-22 05:40:27] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2024-05-22 05:40:28] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-22 05:40:28] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-22 05:40:28] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:40:28] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-22 05:40:30] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-22 05:40:30] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:40:31] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:40:31] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:40:31] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:40:34] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-22 05:40:36] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:40:37] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 0 ms to minimize.
[2024-05-22 05:40:37] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 10 (OVERLAPS) 333/726 variables, 393/519 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/726 variables, 332/851 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 851 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 64/64 constraints]
After SMT, in 60150ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Starting structural reductions in LTL mode, iteration 1 : 393/400 places, 333/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60869 ms. Remains : 393/400 places, 333/344 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DES-PT-40b-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 113 ms.
Product exploration explored 100000 steps with 50000 reset in 117 ms.
Computed a total of 216 stabilizing places and 208 stable transitions
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 216 stabilizing places and 208 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 22 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-40b-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-40b-LTLCardinality-15 finished in 61234 ms.
All properties solved by simple procedures.
Total runtime 1559862 ms.

BK_STOP 1716356455244

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

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

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-40b"
export BK_EXAMINATION="LTLCardinality"
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-40b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r092-tall-171624189900723"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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