MCC'2024- Execution of r092-tall-171624189900739

About the Execution of ITS-Tools for DES-PT-50b

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
8651.367	3600000.00	9862090.00	4266.30	TFFTFTFFTTFTTTT?	normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 08:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 204K Apr 12 08:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 12 08:05 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 127K 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-50b-LTLCardinality-00
FORMULA_NAME DES-PT-50b-LTLCardinality-01
FORMULA_NAME DES-PT-50b-LTLCardinality-02
FORMULA_NAME DES-PT-50b-LTLCardinality-03
FORMULA_NAME DES-PT-50b-LTLCardinality-04
FORMULA_NAME DES-PT-50b-LTLCardinality-05
FORMULA_NAME DES-PT-50b-LTLCardinality-06
FORMULA_NAME DES-PT-50b-LTLCardinality-07
FORMULA_NAME DES-PT-50b-LTLCardinality-08
FORMULA_NAME DES-PT-50b-LTLCardinality-09
FORMULA_NAME DES-PT-50b-LTLCardinality-10
FORMULA_NAME DES-PT-50b-LTLCardinality-11
FORMULA_NAME DES-PT-50b-LTLCardinality-12
FORMULA_NAME DES-PT-50b-LTLCardinality-13
FORMULA_NAME DES-PT-50b-LTLCardinality-14
FORMULA_NAME DES-PT-50b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716358999182

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-50b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-22 06:23:20] [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 06:23:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 06:23:20] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2024-05-22 06:23:20] [INFO ] Transformed 479 places.
[2024-05-22 06:23:20] [INFO ] Transformed 430 transitions.
[2024-05-22 06:23:20] [INFO ] Found NUPN structural information;
[2024-05-22 06:23:20] [INFO ] Parsed PT model containing 479 places and 430 transitions and 1463 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA DES-PT-50b-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 430/430 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 477 transition count 430
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 22 place count 457 transition count 410
Iterating global reduction 1 with 20 rules applied. Total rules applied 42 place count 457 transition count 410
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 53 place count 446 transition count 399
Iterating global reduction 1 with 11 rules applied. Total rules applied 64 place count 446 transition count 399
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 73 place count 446 transition count 390
Applied a total of 73 rules in 133 ms. Remains 446 /479 variables (removed 33) and now considering 390/430 (removed 40) transitions.
// Phase 1: matrix 390 rows 446 cols
[2024-05-22 06:23:20] [INFO ] Computed 63 invariants in 39 ms
[2024-05-22 06:23:21] [INFO ] Implicit Places using invariants in 399 ms returned []
[2024-05-22 06:23:21] [INFO ] Invariant cache hit.
[2024-05-22 06:23:21] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 885 ms to find 0 implicit places.
Running 389 sub problems to find dead transitions.
[2024-05-22 06:23:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/444 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (OVERLAPS) 2/446 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (OVERLAPS) 390/836 variables, 446/509 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-22 06:23:31] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 10 ms to minimize.
[2024-05-22 06:23:31] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 2 ms to minimize.
[2024-05-22 06:23:31] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2024-05-22 06:23:32] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 2 ms to minimize.
[2024-05-22 06:23:32] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-22 06:23:32] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 3 ms to minimize.
[2024-05-22 06:23:32] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
[2024-05-22 06:23:32] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:23:33] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 2 ms to minimize.
[2024-05-22 06:23:33] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:23:33] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:23:33] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:23:33] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:23:33] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:23:33] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:23:34] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-05-22 06:23:34] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:23:34] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:23:34] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/836 variables, 19/528 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-22 06:23:44] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 2 ms to minimize.
[2024-05-22 06:23:44] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:23:44] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 2 ms to minimize.
[2024-05-22 06:23:45] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 1 ms to minimize.
[2024-05-22 06:23:45] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-05-22 06:23:46] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 2 ms to minimize.
[2024-05-22 06:23:47] [INFO ] Deduced a trap composed of 61 places in 105 ms of which 2 ms to minimize.
[2024-05-22 06:23:47] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 3 ms to minimize.
[2024-05-22 06:23:47] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 2 ms to minimize.
[2024-05-22 06:23:47] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-05-22 06:23:48] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-22 06:23:49] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2024-05-22 06:23:49] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/836 variables, 13/541 constraints. Problems are: Problem set: 0 solved, 389 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 836/836 variables, and 541 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 446/446 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/444 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (OVERLAPS) 2/446 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 32/95 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-22 06:23:55] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 0 ms to minimize.
[2024-05-22 06:23:55] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 2 ms to minimize.
[2024-05-22 06:23:55] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:23:55] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:23:55] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 2 ms to minimize.
[2024-05-22 06:23:55] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:23:56] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:23:56] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 2 ms to minimize.
[2024-05-22 06:23:56] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
[2024-05-22 06:23:56] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 2 ms to minimize.
[2024-05-22 06:23:56] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 2 ms to minimize.
[2024-05-22 06:23:57] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-22 06:23:57] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 2 ms to minimize.
[2024-05-22 06:23:57] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-05-22 06:23:57] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:23:57] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2024-05-22 06:23:57] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-22 06:23:57] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 2 ms to minimize.
[2024-05-22 06:23:57] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 2 ms to minimize.
[2024-05-22 06:23:58] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-22 06:23:58] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 2 ms to minimize.
[2024-05-22 06:23:58] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-22 06:23:58] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:23:58] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:23:59] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 5/120 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-22 06:24:04] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:24:04] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:24:04] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 2 ms to minimize.
[2024-05-22 06:24:04] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-22 06:24:04] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-22 06:24:09] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-22 06:24:16] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 4 ms to minimize.
[2024-05-22 06:24:18] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/446 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 389 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/836 variables, and 128 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/446 constraints, PredecessorRefiner: 0/389 constraints, Known Traps: 65/65 constraints]
After SMT, in 60355ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 60380ms
Starting structural reductions in LTL mode, iteration 1 : 446/479 places, 390/430 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61417 ms. Remains : 446/479 places, 390/430 transitions.
Support contains 41 out of 446 places after structural reductions.
[2024-05-22 06:24:22] [INFO ] Flatten gal took : 107 ms
[2024-05-22 06:24:22] [INFO ] Flatten gal took : 45 ms
[2024-05-22 06:24:22] [INFO ] Input system was already deterministic with 390 transitions.
RANDOM walk for 40000 steps (342 resets) in 2183 ms. (18 steps per ms) remains 10/20 properties
BEST_FIRST walk for 40004 steps (49 resets) in 215 ms. (185 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (47 resets) in 194 ms. (205 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (49 resets) in 137 ms. (289 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (52 resets) in 191 ms. (208 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (49 resets) in 133 ms. (298 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (52 resets) in 119 ms. (333 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (50 resets) in 114 ms. (347 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (49 resets) in 137 ms. (289 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (52 resets) in 83 ms. (476 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (50 resets) in 122 ms. (325 steps per ms) remains 10/10 properties
[2024-05-22 06:24:24] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 49/70 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 138/208 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 229/437 variables, 28/63 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 383/820 variables, 437/500 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/820 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 10/830 variables, 6/506 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/830 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 2/832 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/832 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 2/834 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/834 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 2/836 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/836 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 0/836 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 836/836 variables, and 509 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1432 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 446/446 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 49/70 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 138/208 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 06:24:25] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:24:25] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 229/437 variables, 28/65 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 06:24:25] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 383/820 variables, 437/503 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/820 variables, 9/512 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 06:24:27] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2024-05-22 06:24:27] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:24:27] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:24:27] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:24:27] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:24:28] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 1 ms to minimize.
[2024-05-22 06:24:28] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:24:28] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/820 variables, 8/520 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 06:24:29] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/820 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 06:24:29] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:24:30] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:24:30] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:24:30] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-05-22 06:24:30] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
SMT process timed out in 6476ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 21 out of 446 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 446/446 places, 390/390 transitions.
Graph (complete) has 1032 edges and 446 vertex of which 444 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 444 transition count 370
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 427 transition count 369
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 37 place count 427 transition count 359
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 57 place count 417 transition count 359
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 61 place count 413 transition count 355
Iterating global reduction 2 with 4 rules applied. Total rules applied 65 place count 413 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 413 transition count 354
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 69 place count 410 transition count 351
Iterating global reduction 3 with 3 rules applied. Total rules applied 72 place count 410 transition count 351
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 410 transition count 349
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 74 place count 410 transition count 347
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 78 place count 408 transition count 347
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 222 place count 336 transition count 275
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 4 with 8 rules applied. Total rules applied 230 place count 332 transition count 284
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 232 place count 332 transition count 282
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 234 place count 330 transition count 282
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 235 place count 329 transition count 281
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 236 place count 328 transition count 281
Applied a total of 236 rules in 189 ms. Remains 328 /446 variables (removed 118) and now considering 281/390 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 328/446 places, 281/390 transitions.
RANDOM walk for 40000 steps (1612 resets) in 555 ms. (71 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (276 resets) in 135 ms. (294 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (268 resets) in 136 ms. (291 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (256 resets) in 109 ms. (363 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (264 resets) in 109 ms. (363 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (264 resets) in 127 ms. (312 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (289 resets) in 128 ms. (310 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (268 resets) in 58 ms. (678 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (273 resets) in 104 ms. (380 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (265 resets) in 66 ms. (597 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (252 resets) in 66 ms. (597 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 396559 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :0 out of 10
Probabilistic random walk after 396559 steps, saw 84648 distinct states, run finished after 3005 ms. (steps per millisecond=131 ) properties seen :0
// Phase 1: matrix 281 rows 328 cols
[2024-05-22 06:24:34] [INFO ] Computed 63 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 19/40 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 252/292 variables, 26/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 28/320 variables, 25/58 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 2/322 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 281/603 variables, 322/382 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/603 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 6/609 variables, 6/388 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/609 variables, 3/391 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/609 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 0/609 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 609/609 variables, and 391 constraints, problems are : Problem set: 0 solved, 10 unsolved in 762 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 328/328 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 19/40 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 252/292 variables, 26/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 28/320 variables, 25/58 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 06:24:35] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 2/322 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 281/603 variables, 322/383 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/603 variables, 8/391 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 06:24:36] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/603 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 06:24:37] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:24:37] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/603 variables, 2/394 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/603 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 6/609 variables, 6/400 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/609 variables, 3/403 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/609 variables, 2/405 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 06:24:39] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/609 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/609 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (OVERLAPS) 0/609 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 609/609 variables, and 406 constraints, problems are : Problem set: 0 solved, 10 unsolved in 6476 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 328/328 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 5/5 constraints]
After SMT, in 7260ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 32949 ms.
Support contains 21 out of 328 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 328/328 places, 281/281 transitions.
Applied a total of 0 rules in 12 ms. Remains 328 /328 variables (removed 0) and now considering 281/281 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 328/328 places, 281/281 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 328/328 places, 281/281 transitions.
Applied a total of 0 rules in 10 ms. Remains 328 /328 variables (removed 0) and now considering 281/281 (removed 0) transitions.
[2024-05-22 06:25:14] [INFO ] Invariant cache hit.
[2024-05-22 06:25:14] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-22 06:25:14] [INFO ] Invariant cache hit.
[2024-05-22 06:25:15] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
[2024-05-22 06:25:15] [INFO ] Redundant transitions in 14 ms returned []
Running 277 sub problems to find dead transitions.
[2024-05-22 06:25:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (OVERLAPS) 2/325 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (OVERLAPS) 3/328 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 277 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (OVERLAPS) 281/609 variables, 328/391 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2024-05-22 06:25:24] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-22 06:25:25] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:25:26] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2024-05-22 06:25:26] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:25:26] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/609 variables, 5/396 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2024-05-22 06:25:28] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/609 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2024-05-22 06:25:32] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-05-22 06:25:33] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-05-22 06:25:33] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/609 variables, 3/400 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/609 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2024-05-22 06:25:37] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-22 06:25:37] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/609 variables, 2/402 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/609 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 277 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 609/609 variables, and 402 constraints, problems are : Problem set: 0 solved, 277 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 328/328 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 277 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (OVERLAPS) 2/325 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (OVERLAPS) 3/328 variables, 11/72 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 10 (OVERLAPS) 281/609 variables, 328/402 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/609 variables, 277/679 constraints. Problems are: Problem set: 0 solved, 277 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 609/609 variables, and 679 constraints, problems are : Problem set: 0 solved, 277 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 328/328 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 11/11 constraints]
After SMT, in 60240ms problems are : Problem set: 0 solved, 277 unsolved
Search for dead transitions found 0 dead transitions in 60244ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60822 ms. Remains : 328/328 places, 281/281 transitions.
Computed a total of 258 stabilizing places and 250 stable transitions
Graph (complete) has 1032 edges and 446 vertex of which 437 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.17 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U X(p1))||X(X(X(G(p2)))))))'
Support contains 7 out of 446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 390/390 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 445 transition count 390
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 439 transition count 384
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 439 transition count 384
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 439 transition count 382
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 19 place count 435 transition count 378
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 435 transition count 378
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 25 place count 435 transition count 376
Applied a total of 25 rules in 46 ms. Remains 435 /446 variables (removed 11) and now considering 376/390 (removed 14) transitions.
// Phase 1: matrix 376 rows 435 cols
[2024-05-22 06:26:15] [INFO ] Computed 62 invariants in 10 ms
[2024-05-22 06:26:15] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-22 06:26:15] [INFO ] Invariant cache hit.
[2024-05-22 06:26:16] [INFO ] Implicit Places using invariants and state equation in 616 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
Running 375 sub problems to find dead transitions.
[2024-05-22 06:26:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 1/435 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/435 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (OVERLAPS) 376/811 variables, 435/497 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:26:25] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 2 ms to minimize.
[2024-05-22 06:26:26] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 2 ms to minimize.
[2024-05-22 06:26:27] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
[2024-05-22 06:26:29] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-22 06:26:29] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:26:29] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:26:29] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:26:30] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-22 06:26:30] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
[2024-05-22 06:26:30] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/811 variables, 10/507 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/811 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:26:44] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/811 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 1.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 timeout
0.0)
(s342 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 811/811 variables, and 508 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 435/435 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 1/435 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/435 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 11/73 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:26:49] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:26:49] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:26:50] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:26:50] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:26:50] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:26:50] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 2 ms to minimize.
[2024-05-22 06:26:50] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-05-22 06:26:50] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:26:50] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:26:50] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:26:50] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-22 06:26:51] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2024-05-22 06:26:51] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 2 ms to minimize.
[2024-05-22 06:26:51] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2024-05-22 06:26:51] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-22 06:26:51] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:26:51] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-22 06:26:52] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2024-05-22 06:26:52] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/435 variables, 19/92 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:26:54] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:26:54] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
[2024-05-22 06:26:54] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:26:54] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-22 06:26:55] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 5/97 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:26:58] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-05-22 06:26:58] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:27:02] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
[2024-05-22 06:27:02] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2024-05-22 06:27:02] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:27:02] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-22 06:27:02] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
[2024-05-22 06:27:02] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 2 ms to minimize.
[2024-05-22 06:27:02] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-05-22 06:27:03] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 3 ms to minimize.
[2024-05-22 06:27:03] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 9/108 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 10 (OVERLAPS) 376/811 variables, 435/543 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/811 variables, 375/918 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 811/811 variables, and 918 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 435/435 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 46/46 constraints]
After SMT, in 60207ms problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 60212ms
Starting structural reductions in LTL mode, iteration 1 : 435/446 places, 376/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61087 ms. Remains : 435/446 places, 376/390 transitions.
Stuttering acceptance computed with spot in 676 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-50b-LTLCardinality-00
Product exploration explored 100000 steps with 33333 reset in 218 ms.
Product exploration explored 100000 steps with 33333 reset in 171 ms.
Computed a total of 256 stabilizing places and 248 stable transitions
Graph (complete) has 1011 edges and 435 vertex of which 429 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.7 ms
Computed a total of 256 stabilizing places and 248 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 16 ms. Reduced automaton from 13 states, 22 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-50b-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-50b-LTLCardinality-00 finished in 62261 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 4 out of 446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 390/390 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 445 transition count 390
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 438 transition count 383
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 438 transition count 383
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 438 transition count 381
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 22 place count 433 transition count 376
Iterating global reduction 2 with 5 rules applied. Total rules applied 27 place count 433 transition count 376
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 433 transition count 373
Applied a total of 30 rules in 28 ms. Remains 433 /446 variables (removed 13) and now considering 373/390 (removed 17) transitions.
// Phase 1: matrix 373 rows 433 cols
[2024-05-22 06:27:17] [INFO ] Computed 62 invariants in 12 ms
[2024-05-22 06:27:18] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-22 06:27:18] [INFO ] Invariant cache hit.
[2024-05-22 06:27:18] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2024-05-22 06:27:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 373/806 variables, 433/495 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:27:25] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-22 06:27:25] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
[2024-05-22 06:27:25] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
[2024-05-22 06:27:25] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:27:26] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
[2024-05-22 06:27:26] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-05-22 06:27:26] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
[2024-05-22 06:27:26] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2024-05-22 06:27:26] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2024-05-22 06:27:26] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-22 06:27:26] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:27:26] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 2 ms to minimize.
[2024-05-22 06:27:26] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:27:27] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-05-22 06:27:27] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-22 06:27:27] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:27:27] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:27:27] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:27:28] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 2 ms to minimize.
[2024-05-22 06:27:28] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 20/515 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:27:30] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:27:30] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-05-22 06:27:31] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:27:35] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 1 ms to minimize.
[2024-05-22 06:27:38] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 3 ms to minimize.
[2024-05-22 06:27:38] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 2 ms to minimize.
[2024-05-22 06:27:39] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 2 ms to minimize.
[2024-05-22 06:27:39] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 1 ms to minimize.
[2024-05-22 06:27:39] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2024-05-22 06:27:39] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/806 variables, 7/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/806 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/806 variables, and 525 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 30/92 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:27:52] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
[2024-05-22 06:27:52] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:27:52] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:27:52] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:27:52] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:27:52] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 2 ms to minimize.
[2024-05-22 06:27:52] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:27:52] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:27:52] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-22 06:27:53] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 2 ms to minimize.
[2024-05-22 06:27:53] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 2 ms to minimize.
[2024-05-22 06:27:53] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:27:53] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-22 06:27:53] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-22 06:27:53] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:27:53] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:27:53] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:27:54] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:27:54] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-22 06:27:54] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:27:54] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-05-22 06:27:54] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 2 ms to minimize.
[2024-05-22 06:27:54] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:27:54] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:27:54] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:27:54] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:27:54] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:27:54] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:27:55] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:27:55] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:27:55] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:27:55] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:27:55] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:27:57] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 14/126 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:27:58] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:27:59] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2024-05-22 06:27:59] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:27:59] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:27:59] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:28:02] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-22 06:28:02] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-22 06:28:03] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:28:05] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 11 (OVERLAPS) 373/806 variables, 433/568 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/806 variables, 372/940 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/806 variables, and 940 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 73/73 constraints]
After SMT, in 60230ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 60234ms
Starting structural reductions in LTL mode, iteration 1 : 433/446 places, 373/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60947 ms. Remains : 433/446 places, 373/390 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLCardinality-01
Stuttering criterion allowed to conclude after 115 steps with 0 reset in 1 ms.
FORMULA DES-PT-50b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLCardinality-01 finished in 61046 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' '!((!p0 U (F(G(p1))||((!p0||F(G(p1)))&&X(!p2))||G(!p0))))'
Support contains 6 out of 446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 390/390 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 445 transition count 390
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 439 transition count 384
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 439 transition count 384
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 439 transition count 382
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 19 place count 435 transition count 378
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 435 transition count 378
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 25 place count 435 transition count 376
Applied a total of 25 rules in 27 ms. Remains 435 /446 variables (removed 11) and now considering 376/390 (removed 14) transitions.
// Phase 1: matrix 376 rows 435 cols
[2024-05-22 06:28:18] [INFO ] Computed 62 invariants in 13 ms
[2024-05-22 06:28:19] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-05-22 06:28:19] [INFO ] Invariant cache hit.
[2024-05-22 06:28:19] [INFO ] Implicit Places using invariants and state equation in 581 ms returned []
Implicit Place search using SMT with State Equation took 817 ms to find 0 implicit places.
Running 375 sub problems to find dead transitions.
[2024-05-22 06:28:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 1/435 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 375 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/435 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (OVERLAPS) 376/811 variables, 435/497 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:28:29] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 2 ms to minimize.
[2024-05-22 06:28:29] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:28:29] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 2 ms to minimize.
[2024-05-22 06:28:29] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-05-22 06:28:30] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 2 ms to minimize.
[2024-05-22 06:28:30] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:28:30] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 2 ms to minimize.
[2024-05-22 06:28:30] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:28:30] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 2 ms to minimize.
[2024-05-22 06:28:30] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-22 06:28:30] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:28:30] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:28:30] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:28:31] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:28:31] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 2 ms to minimize.
[2024-05-22 06:28:31] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
[2024-05-22 06:28:31] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 2 ms to minimize.
[2024-05-22 06:28:31] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 2 ms to minimize.
[2024-05-22 06:28:32] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2024-05-22 06:28:32] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/811 variables, 20/517 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:28:34] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 2 ms to minimize.
[2024-05-22 06:28:34] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 2 ms to minimize.
[2024-05-22 06:28:34] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 2 ms to minimize.
[2024-05-22 06:28:34] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-05-22 06:28:34] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 1 ms to minimize.
[2024-05-22 06:28:35] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 2 ms to minimize.
[2024-05-22 06:28:35] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
[2024-05-22 06:28:35] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:28:37] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:28:37] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-22 06:28:38] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/811 variables, 11/528 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:28:41] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 4 ms to minimize.
[2024-05-22 06:28:41] [INFO ] Deduced a trap composed of 48 places in 94 ms of which 2 ms to minimize.
[2024-05-22 06:28:42] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 3 ms to minimize.
[2024-05-22 06:28:42] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
[2024-05-22 06:28:42] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2024-05-22 06:28:42] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 2 ms to minimize.
[2024-05-22 06:28:43] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/811 variables, 7/535 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 811/811 variables, and 535 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 435/435 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 1/435 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/435 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 38/100 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:28:53] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 3 ms to minimize.
[2024-05-22 06:28:53] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:28:53] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:28:53] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:28:53] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-22 06:28:54] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:28:54] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/435 variables, 7/107 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 7 (OVERLAPS) 376/811 variables, 435/542 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/811 variables, 375/917 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 811/811 variables, and 917 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 435/435 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 45/45 constraints]
After SMT, in 60223ms problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 60228ms
Starting structural reductions in LTL mode, iteration 1 : 435/446 places, 376/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61075 ms. Remains : 435/446 places, 376/390 transitions.
Stuttering acceptance computed with spot in 142 ms :[(AND p0 (NOT p1)), (NOT p1), (AND (NOT p1) p0 p2)]
Running random walk in product with property : DES-PT-50b-LTLCardinality-02
Product exploration explored 100000 steps with 886 reset in 304 ms.
Product exploration explored 100000 steps with 894 reset in 244 ms.
Computed a total of 256 stabilizing places and 248 stable transitions
Graph (complete) has 1011 edges and 435 vertex of which 429 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Computed a total of 256 stabilizing places and 248 stable transitions
Detected a total of 256/435 stabilizing places and 248/376 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (AND p0 p2)), (X (NOT (AND (NOT p0) p2))), (X p0), (X p1), (X (X p2)), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 270 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
RANDOM walk for 40000 steps (345 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (52 resets) in 150 ms. (264 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1246803 steps, run timeout after 3001 ms. (steps per millisecond=415 ) properties seen :0 out of 1
Probabilistic random walk after 1246803 steps, saw 201088 distinct states, run finished after 3001 ms. (steps per millisecond=415 ) properties seen :0
[2024-05-22 06:29:24] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 238/240 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 100/340 variables, 33/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 80/420 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 363/783 variables, 420/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/783 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 18/801 variables, 10/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/801 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/807 variables, 3/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/807 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/809 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/809 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/811 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/811 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/811 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 811/811 variables, and 497 constraints, problems are : Problem set: 0 solved, 1 unsolved in 297 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 435/435 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 238/240 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 100/340 variables, 33/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 80/420 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 363/783 variables, 420/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/783 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 06:29:24] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/783 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/783 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/801 variables, 10/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/801 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/807 variables, 3/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 06:29:24] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/807 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/807 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/809 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/809 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/811 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/811 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/811 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 811/811 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 576 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 435/435 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 881ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 365 ms.
Support contains 2 out of 435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 376/376 transitions.
Graph (complete) has 1011 edges and 435 vertex of which 429 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 429 transition count 354
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 412 transition count 354
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 37 place count 412 transition count 343
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 59 place count 401 transition count 343
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 400 transition count 342
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 400 transition count 342
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 399 transition count 341
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 399 transition count 341
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 399 transition count 340
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 399 transition count 339
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 398 transition count 339
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 3 with 154 rules applied. Total rules applied 220 place count 321 transition count 262
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 224 place count 319 transition count 264
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 225 place count 319 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 226 place count 318 transition count 263
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 227 place count 318 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 228 place count 317 transition count 262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 229 place count 316 transition count 262
Applied a total of 229 rules in 86 ms. Remains 316 /435 variables (removed 119) and now considering 262/376 (removed 114) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 316/435 places, 262/376 transitions.
RANDOM walk for 40000 steps (1955 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (361 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1620076 steps, run timeout after 3001 ms. (steps per millisecond=539 ) properties seen :0 out of 1
Probabilistic random walk after 1620076 steps, saw 224281 distinct states, run finished after 3001 ms. (steps per millisecond=539 ) properties seen :0
// Phase 1: matrix 262 rows 316 cols
[2024-05-22 06:29:28] [INFO ] Computed 60 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 183/185 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/222 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/247 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/254 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 208/462 variables, 254/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/475 variables, 8/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/475 variables, 3/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/475 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/477 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/477 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/477 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 52/529 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/529 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/529 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 49/578 variables, 49/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/578 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/578 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 578/578 variables, and 376 constraints, problems are : Problem set: 0 solved, 1 unsolved in 235 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 183/185 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/222 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 06:29:28] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/247 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/254 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 208/462 variables, 254/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/475 variables, 8/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/475 variables, 3/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/475 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/477 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/477 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/477 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 52/529 variables, 3/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/529 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/529 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 49/578 variables, 49/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/578 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/578 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 578/578 variables, and 378 constraints, problems are : Problem set: 0 solved, 1 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 572ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 149 ms.
Support contains 2 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 8 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 316/316 places, 262/262 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 7 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-05-22 06:29:29] [INFO ] Invariant cache hit.
[2024-05-22 06:29:29] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-22 06:29:29] [INFO ] Invariant cache hit.
[2024-05-22 06:29:29] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
[2024-05-22 06:29:29] [INFO ] Redundant transitions in 3 ms returned []
Running 259 sub problems to find dead transitions.
[2024-05-22 06:29:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 259 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/315 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 262/577 variables, 315/375 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-22 06:29:35] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2024-05-22 06:29:36] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 2 ms to minimize.
[2024-05-22 06:29:36] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-22 06:29:36] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 4/379 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-22 06:29:40] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-22 06:29:42] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-22 06:29:44] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-05-22 06:29:44] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:29:45] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-22 06:29:45] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:29:45] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:29:45] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:29:45] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:29:45] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/577 variables, 8/389 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-22 06:29:46] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/577 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/577 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 12 (OVERLAPS) 1/578 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/578 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 14 (OVERLAPS) 0/578 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 578/578 variables, and 391 constraints, problems are : Problem set: 0 solved, 259 unsolved in 28967 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 9/62 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 2/315 variables, 7/69 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 6/75 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (OVERLAPS) 262/577 variables, 315/390 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 259/649 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 577/578 variables, and 649 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 315/316 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 15/15 constraints]
After SMT, in 59172ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 59175ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59726 ms. Remains : 316/316 places, 262/262 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 316 transition count 262
Applied a total of 1 rules in 12 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 262 rows 316 cols
[2024-05-22 06:30:29] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 06:30:29] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 06:30:29] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 06:30:29] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 06:30:29] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 06:30:29] [INFO ] After 130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 06:30:29] [INFO ] After 235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 355 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (AND p0 p2)), (X (NOT (AND (NOT p0) p2))), (X p0), (X p1), (X (X p2)), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 454 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
Support contains 2 out of 435 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 : 435/435 places, 376/376 transitions.
Graph (complete) has 1011 edges and 435 vertex of which 429 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 428 transition count 357
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 413 transition count 357
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 413 transition count 346
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 402 transition count 346
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 2 with 150 rules applied. Total rules applied 203 place count 327 transition count 271
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 211 place count 323 transition count 280
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 213 place count 321 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 214 place count 320 transition count 278
Applied a total of 214 rules in 46 ms. Remains 320 /435 variables (removed 115) and now considering 278/376 (removed 98) transitions.
// Phase 1: matrix 278 rows 320 cols
[2024-05-22 06:30:29] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 06:30:30] [INFO ] Implicit Places using invariants in 866 ms returned []
[2024-05-22 06:30:30] [INFO ] Invariant cache hit.
[2024-05-22 06:30:31] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 1246 ms to find 0 implicit places.
[2024-05-22 06:30:31] [INFO ] Redundant transitions in 6 ms returned []
Running 275 sub problems to find dead transitions.
[2024-05-22 06:30:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 2/319 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (OVERLAPS) 278/597 variables, 319/377 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-05-22 06:30:39] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/597 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-05-22 06:30:44] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/597 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-05-22 06:30:46] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/597 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/597 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 10 (OVERLAPS) 1/598 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-05-22 06:30:54] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
[2024-05-22 06:30:55] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/598 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-05-22 06:30:59] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2024-05-22 06:30:59] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/598 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/598 variables, and 385 constraints, problems are : Problem set: 0 solved, 275 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 2/319 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (OVERLAPS) 278/597 variables, 319/384 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/597 variables, 275/659 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 597/598 variables, and 659 constraints, problems are : Problem set: 0 solved, 275 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 319/320 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 7/7 constraints]
After SMT, in 60242ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 60245ms
Starting structural reductions in SI_LTL mode, iteration 1 : 320/435 places, 278/376 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61554 ms. Remains : 320/435 places, 278/376 transitions.
Computed a total of 214 stabilizing places and 209 stable transitions
Computed a total of 214 stabilizing places and 209 stable transitions
Detected a total of 214/320 stabilizing places and 209/278 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 113 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 40000 steps (2076 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (325 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1579009 steps, run timeout after 3001 ms. (steps per millisecond=526 ) properties seen :0 out of 1
Probabilistic random walk after 1579009 steps, saw 220723 distinct states, run finished after 3001 ms. (steps per millisecond=526 ) properties seen :0
[2024-05-22 06:31:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 185/187 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/221 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/250 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/257 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 223/480 variables, 257/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/480 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/494 variables, 9/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/494 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/494 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 54/548 variables, 4/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/548 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/548 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 50/598 variables, 50/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/598 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/598 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 598/598 variables, and 378 constraints, problems are : Problem set: 0 solved, 1 unsolved in 329 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 185/187 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/221 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 06:31:35] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 29/250 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/257 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 223/480 variables, 257/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/480 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 06:31:35] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/480 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/480 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/494 variables, 9/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/494 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/494 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 54/548 variables, 4/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/548 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/548 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 50/598 variables, 50/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/598 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/598 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 598/598 variables, and 381 constraints, problems are : Problem set: 0 solved, 1 unsolved in 447 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 782ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 334 ms.
Support contains 2 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 278/278 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 320 transition count 277
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 1 with 4 rules applied. Total rules applied 5 place count 318 transition count 275
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 317 transition count 272
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 317 transition count 272
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 317 transition count 264
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 317 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 316 transition count 263
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 316 transition count 263
Applied a total of 18 rules in 29 ms. Remains 316 /320 variables (removed 4) and now considering 263/278 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 316/320 places, 263/278 transitions.
RANDOM walk for 40000 steps (2053 resets) in 112 ms. (353 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (400 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1647761 steps, run timeout after 3001 ms. (steps per millisecond=549 ) properties seen :0 out of 1
Probabilistic random walk after 1647761 steps, saw 228318 distinct states, run finished after 3002 ms. (steps per millisecond=548 ) properties seen :0
// Phase 1: matrix 263 rows 316 cols
[2024-05-22 06:31:38] [INFO ] Computed 59 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 183/185 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/222 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/247 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/254 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 208/462 variables, 254/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/476 variables, 8/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/476 variables, 3/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/476 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 54/530 variables, 5/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/530 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/530 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 49/579 variables, 49/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/579 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/579 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 579/579 variables, and 375 constraints, problems are : Problem set: 0 solved, 1 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 183/185 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/222 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 06:31:39] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/247 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/254 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 208/462 variables, 254/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/476 variables, 8/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/476 variables, 3/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/476 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 54/530 variables, 5/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/530 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/530 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 49/579 variables, 49/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 06:31:39] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/579 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/579 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/579 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 579/579 variables, and 378 constraints, problems are : Problem set: 0 solved, 1 unsolved in 382 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 600ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 143 ms.
Support contains 2 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 263/263 transitions.
Applied a total of 0 rules in 6 ms. Remains 316 /316 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 316/316 places, 263/263 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 263/263 transitions.
Applied a total of 0 rules in 6 ms. Remains 316 /316 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2024-05-22 06:31:39] [INFO ] Invariant cache hit.
[2024-05-22 06:31:39] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-22 06:31:39] [INFO ] Invariant cache hit.
[2024-05-22 06:31:40] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 557 ms to find 0 implicit places.
[2024-05-22 06:31:40] [INFO ] Redundant transitions in 6 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-22 06:31:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 260 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/315 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 263/578 variables, 315/374 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 06:31:45] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-05-22 06:31:46] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-22 06:31:46] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 3/377 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 06:31:50] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-22 06:31:50] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-05-22 06:31:50] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 3/380 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 06:31:52] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:31:52] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2024-05-22 06:31:53] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:31:53] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:31:53] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 5/385 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 1/579 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/579 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 12 (OVERLAPS) 0/579 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 579/579 variables, and 386 constraints, problems are : Problem set: 0 solved, 260 unsolved in 23781 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 2/315 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 263/578 variables, 315/385 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 260/645 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 578/579 variables, and 645 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 315/316 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 11/11 constraints]
After SMT, in 54030ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 54033ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54609 ms. Remains : 316/316 places, 263/263 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 316 transition count 263
Applied a total of 1 rules in 14 ms. Remains 316 /316 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 263 rows 316 cols
[2024-05-22 06:32:34] [INFO ] Computed 59 invariants in 7 ms
[2024-05-22 06:32:34] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 06:32:34] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 06:32:34] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 06:32:34] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 06:32:34] [INFO ] After 122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 06:32:34] [INFO ] After 202ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 282 ms.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 91 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 28 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Product exploration explored 100000 steps with 5207 reset in 210 ms.
Product exploration explored 100000 steps with 5143 reset in 233 ms.
Built C files in :
/tmp/ltsmin9393164751606989556
[2024-05-22 06:32:35] [INFO ] Computing symmetric may disable matrix : 278 transitions.
[2024-05-22 06:32:35] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:32:35] [INFO ] Computing symmetric may enable matrix : 278 transitions.
[2024-05-22 06:32:35] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:32:35] [INFO ] Computing Do-Not-Accords matrix : 278 transitions.
[2024-05-22 06:32:35] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:32:35] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9393164751606989556
Running compilation step : cd /tmp/ltsmin9393164751606989556;'/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 859 ms.
Running link step : cd /tmp/ltsmin9393164751606989556;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin9393164751606989556;'/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/stateBased13079425993192674495.hoa' '--buchi-type=spotba'
LTSmin run took 3819 ms.
FORMULA DES-PT-50b-LTLCardinality-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-50b-LTLCardinality-02 finished in 261087 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 446/446 places, 390/390 transitions.
Graph (complete) has 1032 edges and 446 vertex of which 441 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 440 transition count 370
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 425 transition count 369
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 32 place count 425 transition count 359
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 52 place count 415 transition count 359
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 57 place count 410 transition count 354
Iterating global reduction 2 with 5 rules applied. Total rules applied 62 place count 410 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 410 transition count 353
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 67 place count 406 transition count 349
Iterating global reduction 3 with 4 rules applied. Total rules applied 71 place count 406 transition count 349
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 74 place count 406 transition count 346
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 74 place count 406 transition count 343
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 80 place count 403 transition count 343
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 232 place count 327 transition count 267
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 236 place count 325 transition count 269
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 238 place count 323 transition count 267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 239 place count 322 transition count 267
Applied a total of 239 rules in 57 ms. Remains 322 /446 variables (removed 124) and now considering 267/390 (removed 123) transitions.
// Phase 1: matrix 267 rows 322 cols
[2024-05-22 06:32:40] [INFO ] Computed 61 invariants in 11 ms
[2024-05-22 06:32:40] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-05-22 06:32:40] [INFO ] Invariant cache hit.
[2024-05-22 06:32:40] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
[2024-05-22 06:32:40] [INFO ] Redundant transitions in 2 ms returned []
Running 263 sub problems to find dead transitions.
[2024-05-22 06:32:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/318 variables, 16/48 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 4/322 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (OVERLAPS) 267/589 variables, 322/383 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/589 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 06:32:53] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/589 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 06:32:54] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2024-05-22 06:32:55] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-22 06:32:56] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/589 variables, 3/387 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 06:32:59] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/589 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (OVERLAPS) 0/589 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 589/589 variables, and 388 constraints, problems are : Problem set: 0 solved, 263 unsolved in 26944 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/318 variables, 16/48 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 4/322 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 267/589 variables, 322/388 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/589 variables, 263/651 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 589/589 variables, and 651 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 5/5 constraints]
After SMT, in 57130ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 57134ms
Starting structural reductions in SI_LTL mode, iteration 1 : 322/446 places, 267/390 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57812 ms. Remains : 322/446 places, 267/390 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLCardinality-04
Product exploration explored 100000 steps with 11404 reset in 195 ms.
Product exploration explored 100000 steps with 11355 reset in 271 ms.
Computed a total of 218 stabilizing places and 210 stable transitions
Graph (complete) has 1105 edges and 322 vertex of which 318 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Computed a total of 218 stabilizing places and 210 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 227 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 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 19 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 202 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 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
[2024-05-22 06:33:39] [INFO ] Invariant cache hit.
[2024-05-22 06:33:39] [INFO ] [Real]Absence check using 32 positive place invariants in 7 ms returned sat
[2024-05-22 06:33:39] [INFO ] [Real]Absence check using 32 positive and 29 generalized place invariants in 37 ms returned sat
[2024-05-22 06:33:40] [INFO ] [Real]Absence check using state equation in 1068 ms returned sat
[2024-05-22 06:33:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 06:33:40] [INFO ] [Nat]Absence check using 32 positive place invariants in 7 ms returned sat
[2024-05-22 06:33:40] [INFO ] [Nat]Absence check using 32 positive and 29 generalized place invariants in 25 ms returned sat
[2024-05-22 06:33:43] [INFO ] [Nat]Absence check using state equation in 3076 ms returned sat
[2024-05-22 06:33:43] [INFO ] Computed and/alt/rep : 252/451/252 causal constraints (skipped 11 transitions) in 21 ms.
[2024-05-22 06:33:46] [INFO ] Added : 163 causal constraints over 33 iterations in 3036 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 322/322 places, 267/267 transitions.
Applied a total of 0 rules in 9 ms. Remains 322 /322 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-05-22 06:33:46] [INFO ] Invariant cache hit.
[2024-05-22 06:33:47] [INFO ] Implicit Places using invariants in 308 ms returned []
[2024-05-22 06:33:47] [INFO ] Invariant cache hit.
[2024-05-22 06:33:47] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 701 ms to find 0 implicit places.
[2024-05-22 06:33:47] [INFO ] Redundant transitions in 1 ms returned []
Running 263 sub problems to find dead transitions.
[2024-05-22 06:33:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/318 variables, 16/48 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 4/322 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (OVERLAPS) 267/589 variables, 322/383 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/589 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 06:34:00] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/589 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 06:34:01] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-22 06:34:02] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
[2024-05-22 06:34:03] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/589 variables, 3/387 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 06:34:05] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/589 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (OVERLAPS) 0/589 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 589/589 variables, and 388 constraints, problems are : Problem set: 0 solved, 263 unsolved in 26998 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/318 variables, 16/48 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 4/322 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 267/589 variables, 322/388 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/589 variables, 263/651 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 589/589 variables, and 651 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 5/5 constraints]
After SMT, in 57194ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 57198ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 57920 ms. Remains : 322/322 places, 267/267 transitions.
Computed a total of 218 stabilizing places and 210 stable transitions
Graph (complete) has 1105 edges and 322 vertex of which 318 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Computed a total of 218 stabilizing places and 210 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 281 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 78 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 11 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 165 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 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
[2024-05-22 06:34:45] [INFO ] Invariant cache hit.
[2024-05-22 06:34:45] [INFO ] [Real]Absence check using 32 positive place invariants in 7 ms returned sat
[2024-05-22 06:34:45] [INFO ] [Real]Absence check using 32 positive and 29 generalized place invariants in 35 ms returned sat
[2024-05-22 06:34:46] [INFO ] [Real]Absence check using state equation in 1038 ms returned sat
[2024-05-22 06:34:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 06:34:46] [INFO ] [Nat]Absence check using 32 positive place invariants in 6 ms returned sat
[2024-05-22 06:34:46] [INFO ] [Nat]Absence check using 32 positive and 29 generalized place invariants in 25 ms returned sat
[2024-05-22 06:34:49] [INFO ] [Nat]Absence check using state equation in 3164 ms returned sat
[2024-05-22 06:34:49] [INFO ] Computed and/alt/rep : 252/451/252 causal constraints (skipped 11 transitions) in 18 ms.
[2024-05-22 06:34:53] [INFO ] Added : 163 causal constraints over 33 iterations in 3080 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 11329 reset in 214 ms.
Product exploration explored 100000 steps with 11459 reset in 237 ms.
Built C files in :
/tmp/ltsmin12623350339367189933
[2024-05-22 06:34:53] [INFO ] Computing symmetric may disable matrix : 267 transitions.
[2024-05-22 06:34:53] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:34:53] [INFO ] Computing symmetric may enable matrix : 267 transitions.
[2024-05-22 06:34:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:34:53] [INFO ] Computing Do-Not-Accords matrix : 267 transitions.
[2024-05-22 06:34:53] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:34:53] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12623350339367189933
Running compilation step : cd /tmp/ltsmin12623350339367189933;'/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 714 ms.
Running link step : cd /tmp/ltsmin12623350339367189933;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin12623350339367189933;'/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/stateBased12523642302114047800.hoa' '--buchi-type=spotba'
LTSmin run took 13532 ms.
FORMULA DES-PT-50b-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-50b-LTLCardinality-04 finished in 147898 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 446/446 places, 390/390 transitions.
Graph (complete) has 1032 edges and 446 vertex of which 437 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 436 transition count 369
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 421 transition count 368
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 32 place count 421 transition count 358
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 52 place count 411 transition count 358
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 55 place count 408 transition count 355
Iterating global reduction 2 with 3 rules applied. Total rules applied 58 place count 408 transition count 355
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 61 place count 405 transition count 352
Iterating global reduction 2 with 3 rules applied. Total rules applied 64 place count 405 transition count 352
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 67 place count 405 transition count 349
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 67 place count 405 transition count 346
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 73 place count 402 transition count 346
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 3 with 154 rules applied. Total rules applied 227 place count 325 transition count 269
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 3 with 2 rules applied. Total rules applied 229 place count 324 transition count 269
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 231 place count 322 transition count 267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 232 place count 321 transition count 267
Applied a total of 232 rules in 53 ms. Remains 321 /446 variables (removed 125) and now considering 267/390 (removed 123) transitions.
// Phase 1: matrix 267 rows 321 cols
[2024-05-22 06:35:07] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 06:35:08] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-22 06:35:08] [INFO ] Invariant cache hit.
[2024-05-22 06:35:08] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
[2024-05-22 06:35:08] [INFO ] Redundant transitions in 1 ms returned []
Running 264 sub problems to find dead transitions.
[2024-05-22 06:35:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/318 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 2/320 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (OVERLAPS) 267/587 variables, 320/378 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-22 06:35:15] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2024-05-22 06:35:15] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 2 ms to minimize.
[2024-05-22 06:35:15] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:35:15] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/587 variables, 4/382 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-22 06:35:20] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/587 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-22 06:35:22] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/587 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/587 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 10 (OVERLAPS) 1/588 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-22 06:35:30] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 1 ms to minimize.
[2024-05-22 06:35:32] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/588 variables, 2/387 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/588 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 588/588 variables, and 387 constraints, problems are : Problem set: 0 solved, 264 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/318 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (OVERLAPS) 2/320 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 267/587 variables, 320/386 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/587 variables, 264/650 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-22 06:35:56] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 587/588 variables, and 651 constraints, problems are : Problem set: 0 solved, 264 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 320/321 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 9/9 constraints]
After SMT, in 60207ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 60211ms
Starting structural reductions in SI_LTL mode, iteration 1 : 321/446 places, 267/390 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60776 ms. Remains : 321/446 places, 267/390 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLCardinality-06
Stuttering criterion allowed to conclude after 30 steps with 2 reset in 1 ms.
FORMULA DES-PT-50b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLCardinality-06 finished in 60871 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&G(p1))))'
Support contains 6 out of 446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 446/446 places, 390/390 transitions.
Graph (complete) has 1032 edges and 446 vertex of which 441 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 440 transition count 370
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 425 transition count 369
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 32 place count 425 transition count 359
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 52 place count 415 transition count 359
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 56 place count 411 transition count 355
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 411 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 411 transition count 354
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 64 place count 408 transition count 351
Iterating global reduction 3 with 3 rules applied. Total rules applied 67 place count 408 transition count 351
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 69 place count 408 transition count 349
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 69 place count 408 transition count 347
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 73 place count 406 transition count 347
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 225 place count 330 transition count 271
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 4 with 8 rules applied. Total rules applied 233 place count 326 transition count 280
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 235 place count 324 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 236 place count 323 transition count 278
Applied a total of 236 rules in 53 ms. Remains 323 /446 variables (removed 123) and now considering 278/390 (removed 112) transitions.
// Phase 1: matrix 278 rows 323 cols
[2024-05-22 06:36:08] [INFO ] Computed 61 invariants in 14 ms
[2024-05-22 06:36:09] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-05-22 06:36:09] [INFO ] Invariant cache hit.
[2024-05-22 06:36:09] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 758 ms to find 0 implicit places.
[2024-05-22 06:36:09] [INFO ] Redundant transitions in 1 ms returned []
Running 275 sub problems to find dead transitions.
[2024-05-22 06:36:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 3/323 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (OVERLAPS) 278/601 variables, 323/384 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-05-22 06:36:17] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/601 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/601 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 8 (OVERLAPS) 0/601 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 601/601 variables, and 385 constraints, problems are : Problem set: 0 solved, 275 unsolved in 17227 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 3/323 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (OVERLAPS) 278/601 variables, 323/385 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/601 variables, 275/660 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 601/601 variables, and 660 constraints, problems are : Problem set: 0 solved, 275 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 1/1 constraints]
After SMT, in 47425ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 47429ms
Starting structural reductions in SI_LTL mode, iteration 1 : 323/446 places, 278/390 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48252 ms. Remains : 323/446 places, 278/390 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-50b-LTLCardinality-07
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 1 ms.
FORMULA DES-PT-50b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLCardinality-07 finished in 48390 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((X(p0) U p0))))))'
Support contains 2 out of 446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 390/390 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 445 transition count 390
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 438 transition count 383
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 438 transition count 383
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 438 transition count 381
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 22 place count 433 transition count 376
Iterating global reduction 2 with 5 rules applied. Total rules applied 27 place count 433 transition count 376
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 433 transition count 373
Applied a total of 30 rules in 18 ms. Remains 433 /446 variables (removed 13) and now considering 373/390 (removed 17) transitions.
// Phase 1: matrix 373 rows 433 cols
[2024-05-22 06:36:57] [INFO ] Computed 62 invariants in 9 ms
[2024-05-22 06:36:57] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-22 06:36:57] [INFO ] Invariant cache hit.
[2024-05-22 06:36:57] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2024-05-22 06:36:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 373/806 variables, 433/495 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:37:05] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-05-22 06:37:05] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-05-22 06:37:05] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 2 ms to minimize.
[2024-05-22 06:37:05] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:37:05] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
[2024-05-22 06:37:05] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-05-22 06:37:05] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
[2024-05-22 06:37:05] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2024-05-22 06:37:06] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 2 ms to minimize.
[2024-05-22 06:37:06] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-22 06:37:06] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:37:06] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 3 ms to minimize.
[2024-05-22 06:37:06] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:37:06] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-22 06:37:06] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:37:06] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:37:07] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
[2024-05-22 06:37:07] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:37:07] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 2 ms to minimize.
[2024-05-22 06:37:07] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 20/515 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:37:10] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:37:10] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-22 06:37:11] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:37:14] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 2 ms to minimize.
[2024-05-22 06:37:18] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 2 ms to minimize.
[2024-05-22 06:37:18] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 2 ms to minimize.
[2024-05-22 06:37:19] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 2 ms to minimize.
[2024-05-22 06:37:19] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 2 ms to minimize.
[2024-05-22 06:37:19] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2024-05-22 06:37:19] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/806 variables, 7/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/806 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/806 variables, and 525 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 30/92 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:37:31] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:37:31] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-05-22 06:37:31] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:37:31] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:37:32] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 2 ms to minimize.
[2024-05-22 06:37:32] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:37:32] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:37:32] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:37:32] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-22 06:37:32] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-22 06:37:32] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:37:32] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:37:32] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:37:33] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-22 06:37:33] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-22 06:37:33] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-22 06:37:33] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-22 06:37:33] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:37:33] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-22 06:37:33] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:37:33] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 2 ms to minimize.
[2024-05-22 06:37:34] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
[2024-05-22 06:37:34] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:37:34] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:37:34] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-05-22 06:37:34] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:37:34] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:37:34] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:37:34] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:37:34] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 0 ms to minimize.
[2024-05-22 06:37:34] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:37:34] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:37:34] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:37:37] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 14/126 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:37:38] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-05-22 06:37:39] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:37:39] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:37:39] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:37:39] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:37:42] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-22 06:37:42] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-22 06:37:42] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:37:45] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 11 (OVERLAPS) 373/806 variables, 433/568 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/806 variables, 372/940 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/806 variables, and 940 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 73/73 constraints]
After SMT, in 60237ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 60243ms
Starting structural reductions in LTL mode, iteration 1 : 433/446 places, 373/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61042 ms. Remains : 433/446 places, 373/390 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLCardinality-09
Product exploration explored 100000 steps with 25000 reset in 143 ms.
Product exploration explored 100000 steps with 25000 reset in 147 ms.
Computed a total of 256 stabilizing places and 248 stable transitions
Graph (complete) has 1006 edges and 433 vertex of which 427 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 256 stabilizing places and 248 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 68 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (338 resets) in 247 ms. (161 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (55 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1350445 steps, run timeout after 3001 ms. (steps per millisecond=449 ) properties seen :0 out of 1
Probabilistic random walk after 1350445 steps, saw 216627 distinct states, run finished after 3002 ms. (steps per millisecond=449 ) properties seen :0
[2024-05-22 06:38:02] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 233/235 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 104/339 variables, 33/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 80/419 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 361/780 variables, 419/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/780 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 16/796 variables, 9/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/796 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/802 variables, 3/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/802 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/804 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/804 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/806 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/806 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/806 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 806/806 variables, and 495 constraints, problems are : Problem set: 0 solved, 1 unsolved in 352 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 233/235 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 104/339 variables, 33/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 80/419 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 361/780 variables, 419/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 06:38:02] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 2 ms to minimize.
[2024-05-22 06:38:03] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/780 variables, 2/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/780 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/796 variables, 9/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/796 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/796 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/802 variables, 3/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/802 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/804 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/804 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/806 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/806 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/806 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 806/806 variables, and 498 constraints, problems are : Problem set: 0 solved, 1 unsolved in 759 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1142ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1050 ms.
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 373/373 transitions.
Graph (complete) has 1006 edges and 433 vertex of which 427 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
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 427 transition count 351
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 410 transition count 351
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 37 place count 410 transition count 339
Deduced a syphon composed of 12 places in 10 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 61 place count 398 transition count 339
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 2 with 150 rules applied. Total rules applied 211 place count 323 transition count 264
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 215 place count 321 transition count 266
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 216 place count 321 transition count 265
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 217 place count 320 transition count 265
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 218 place count 320 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 219 place count 319 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 220 place count 318 transition count 264
Applied a total of 220 rules in 57 ms. Remains 318 /433 variables (removed 115) and now considering 264/373 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 318/433 places, 264/373 transitions.
RANDOM walk for 40000 steps (1760 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (369 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1650332 steps, run timeout after 3001 ms. (steps per millisecond=549 ) properties seen :0 out of 1
Probabilistic random walk after 1650332 steps, saw 212552 distinct states, run finished after 3002 ms. (steps per millisecond=549 ) properties seen :0
// Phase 1: matrix 264 rows 318 cols
[2024-05-22 06:38:07] [INFO ] Computed 60 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/13 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 184/197 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/230 variables, 22/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 23/253 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/260 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/260 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 215/475 variables, 260/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/475 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 58/533 variables, 9/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/533 variables, 4/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/533 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 49/582 variables, 49/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/582 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/582 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 582/582 variables, and 378 constraints, problems are : Problem set: 0 solved, 1 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/13 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 184/197 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/230 variables, 22/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 23/253 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/260 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/260 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 215/475 variables, 260/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/475 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 58/533 variables, 9/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/533 variables, 4/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/533 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 06:38:07] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/533 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/533 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 49/582 variables, 49/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/582 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/582 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 582/582 variables, and 380 constraints, problems are : Problem set: 0 solved, 1 unsolved in 345 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 565ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 377 ms.
Support contains 2 out of 318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 264/264 transitions.
Applied a total of 0 rules in 5 ms. Remains 318 /318 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 318/318 places, 264/264 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 264/264 transitions.
Applied a total of 0 rules in 4 ms. Remains 318 /318 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2024-05-22 06:38:08] [INFO ] Invariant cache hit.
[2024-05-22 06:38:08] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-22 06:38:08] [INFO ] Invariant cache hit.
[2024-05-22 06:38:08] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
[2024-05-22 06:38:08] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-22 06:38:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 1/315 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 2/317 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 264/581 variables, 317/377 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 06:38:18] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-22 06:38:19] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 2/379 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 06:38:23] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/581 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 06:38:27] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-22 06:38:27] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 06:38:30] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/581 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 06:38:34] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/581 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/581 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 260 unsolved
SMT process timed out in 30183ms, After SMT, problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 30186ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30672 ms. Remains : 318/318 places, 264/264 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 318 transition count 264
Applied a total of 1 rules in 9 ms. Remains 318 /318 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 264 rows 318 cols
[2024-05-22 06:38:39] [INFO ] Computed 60 invariants in 9 ms
[2024-05-22 06:38:39] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 06:38:39] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 06:38:39] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 06:38:39] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 06:38:39] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2024-05-22 06:38:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
TRAPS : Iteration 1
[2024-05-22 06:38:39] [INFO ] After 255ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 06:38:39] [INFO ] After 355ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 432 ms.
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 373/373 transitions.
Applied a total of 0 rules in 17 ms. Remains 433 /433 variables (removed 0) and now considering 373/373 (removed 0) transitions.
// Phase 1: matrix 373 rows 433 cols
[2024-05-22 06:38:39] [INFO ] Computed 62 invariants in 6 ms
[2024-05-22 06:38:40] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-22 06:38:40] [INFO ] Invariant cache hit.
[2024-05-22 06:38:40] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 724 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2024-05-22 06:38:40] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 373/806 variables, 433/495 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:38:47] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-05-22 06:38:47] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-05-22 06:38:47] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-05-22 06:38:47] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:38:48] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2024-05-22 06:38:48] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
[2024-05-22 06:38:48] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
[2024-05-22 06:38:48] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 2 ms to minimize.
[2024-05-22 06:38:48] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2024-05-22 06:38:48] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-05-22 06:38:48] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:38:48] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-05-22 06:38:49] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:38:49] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:38:49] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:38:49] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:38:49] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:38:49] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:38:50] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 2 ms to minimize.
[2024-05-22 06:38:50] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 20/515 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:38:52] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:38:52] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:38:53] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:38:57] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 2 ms to minimize.
[2024-05-22 06:39:00] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 3 ms to minimize.
[2024-05-22 06:39:00] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 2 ms to minimize.
[2024-05-22 06:39:01] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 2 ms to minimize.
[2024-05-22 06:39:01] [INFO ] Deduced a trap composed of 55 places in 89 ms of which 2 ms to minimize.
[2024-05-22 06:39:01] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 2 ms to minimize.
[2024-05-22 06:39:01] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/806 variables, 7/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/806 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/806 variables, and 525 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 30/92 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:39:14] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:39:14] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2024-05-22 06:39:14] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:39:14] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:39:14] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 2 ms to minimize.
[2024-05-22 06:39:14] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 2 ms to minimize.
[2024-05-22 06:39:14] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-22 06:39:14] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:39:14] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-22 06:39:15] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 2 ms to minimize.
[2024-05-22 06:39:15] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:39:15] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:39:15] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:39:15] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:39:15] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:39:15] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:39:15] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:39:15] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:39:15] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:39:15] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:39:16] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2024-05-22 06:39:16] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 2 ms to minimize.
[2024-05-22 06:39:16] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:39:16] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:39:16] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2024-05-22 06:39:16] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:39:16] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:39:16] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-05-22 06:39:16] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:39:16] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:39:17] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:39:17] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:39:17] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:39:19] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 14/126 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:39:20] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:39:21] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:39:21] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:39:21] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:39:21] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:39:24] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-05-22 06:39:24] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-22 06:39:24] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:39:27] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 11 (OVERLAPS) 373/806 variables, 433/568 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/806 variables, 372/940 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/806 variables, and 940 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 73/73 constraints]
After SMT, in 60199ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 60204ms
Finished structural reductions in LTL mode , in 1 iterations and 60949 ms. Remains : 433/433 places, 373/373 transitions.
Computed a total of 256 stabilizing places and 248 stable transitions
Graph (complete) has 1006 edges and 433 vertex of which 427 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Computed a total of 256 stabilizing places and 248 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 71 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (344 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (54 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1340502 steps, run timeout after 3001 ms. (steps per millisecond=446 ) properties seen :0 out of 1
Probabilistic random walk after 1340502 steps, saw 215158 distinct states, run finished after 3001 ms. (steps per millisecond=446 ) properties seen :0
[2024-05-22 06:39:44] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 233/235 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 104/339 variables, 33/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 80/419 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 361/780 variables, 419/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/780 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 16/796 variables, 9/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/796 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/802 variables, 3/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/802 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/804 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/804 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/806 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/806 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/806 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 806/806 variables, and 495 constraints, problems are : Problem set: 0 solved, 1 unsolved in 364 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 233/235 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 104/339 variables, 33/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 80/419 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 361/780 variables, 419/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 06:39:44] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 2 ms to minimize.
[2024-05-22 06:39:45] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/780 variables, 2/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/780 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/796 variables, 9/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/796 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/796 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/802 variables, 3/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/802 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/804 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/804 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/806 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/806 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/806 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 806/806 variables, and 498 constraints, problems are : Problem set: 0 solved, 1 unsolved in 743 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1113ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 962 ms.
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 373/373 transitions.
Graph (complete) has 1006 edges and 433 vertex of which 427 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 427 transition count 351
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 410 transition count 351
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 37 place count 410 transition count 339
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 61 place count 398 transition count 339
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 2 with 150 rules applied. Total rules applied 211 place count 323 transition count 264
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 215 place count 321 transition count 266
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 216 place count 321 transition count 265
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 217 place count 320 transition count 265
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 218 place count 320 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 219 place count 319 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 220 place count 318 transition count 264
Applied a total of 220 rules in 33 ms. Remains 318 /433 variables (removed 115) and now considering 264/373 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 318/433 places, 264/373 transitions.
RANDOM walk for 40000 steps (1764 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (342 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1662689 steps, run timeout after 3001 ms. (steps per millisecond=554 ) properties seen :0 out of 1
Probabilistic random walk after 1662689 steps, saw 213935 distinct states, run finished after 3001 ms. (steps per millisecond=554 ) properties seen :0
// Phase 1: matrix 264 rows 318 cols
[2024-05-22 06:39:49] [INFO ] Computed 60 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/13 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 184/197 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/230 variables, 22/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 23/253 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/260 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/260 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 215/475 variables, 260/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/475 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 58/533 variables, 9/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/533 variables, 4/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/533 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 49/582 variables, 49/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/582 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/582 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 582/582 variables, and 378 constraints, problems are : Problem set: 0 solved, 1 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/13 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 184/197 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/230 variables, 22/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 23/253 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/260 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/260 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 215/475 variables, 260/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/475 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 58/533 variables, 9/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/533 variables, 4/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/533 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 06:39:49] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/533 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/533 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 49/582 variables, 49/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/582 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/582 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 582/582 variables, and 380 constraints, problems are : Problem set: 0 solved, 1 unsolved in 319 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 520ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 371 ms.
Support contains 2 out of 318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 264/264 transitions.
Applied a total of 0 rules in 4 ms. Remains 318 /318 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 318/318 places, 264/264 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 264/264 transitions.
Applied a total of 0 rules in 5 ms. Remains 318 /318 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2024-05-22 06:39:50] [INFO ] Invariant cache hit.
[2024-05-22 06:39:50] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-22 06:39:50] [INFO ] Invariant cache hit.
[2024-05-22 06:39:50] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
[2024-05-22 06:39:50] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-22 06:39:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 1/315 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 2/317 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 264/581 variables, 317/377 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 06:40:00] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-22 06:40:01] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 2/379 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 06:40:04] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/581 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 06:40:08] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-22 06:40:09] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 06:40:12] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/581 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 06:40:15] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/581 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/581 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 14 (OVERLAPS) 1/582 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 582/582 variables, and 385 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 1/315 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 2/317 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 264/581 variables, 317/384 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/581 variables, 260/644 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 06:40:43] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:40:43] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:40:43] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:40:43] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:40:49] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/582 variables, and 649 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 317/318 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 12/12 constraints]
After SMT, in 60186ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60189ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60687 ms. Remains : 318/318 places, 264/264 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 318 transition count 264
Applied a total of 1 rules in 9 ms. Remains 318 /318 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 264 rows 318 cols
[2024-05-22 06:40:50] [INFO ] Computed 60 invariants in 9 ms
[2024-05-22 06:40:51] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 06:40:51] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 06:40:51] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2024-05-22 06:40:51] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 06:40:51] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:40:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
TRAPS : Iteration 1
[2024-05-22 06:40:51] [INFO ] After 254ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 06:40:51] [INFO ] After 350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 434 ms.
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 117 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 122 ms.
Product exploration explored 100000 steps with 25000 reset in 122 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 373/373 transitions.
Graph (complete) has 1006 edges and 433 vertex of which 427 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 427 transition count 370
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 16 place count 427 transition count 372
Deduced a syphon composed of 23 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 427 transition count 372
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 422 transition count 367
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 422 transition count 367
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 94 places in 0 ms
Iterating global reduction 1 with 76 rules applied. Total rules applied 110 place count 422 transition count 370
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 120 place count 412 transition count 360
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 130 place count 412 transition count 360
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 136 place count 412 transition count 388
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 410 transition count 382
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 410 transition count 382
Deduced a syphon composed of 88 places in 0 ms
Applied a total of 140 rules in 88 ms. Remains 410 /433 variables (removed 23) and now considering 382/373 (removed -9) transitions.
[2024-05-22 06:40:52] [INFO ] Redundant transitions in 2 ms returned []
Running 381 sub problems to find dead transitions.
// Phase 1: matrix 382 rows 410 cols
[2024-05-22 06:40:52] [INFO ] Computed 59 invariants in 3 ms
[2024-05-22 06:40:52] [INFO ] State equation strengthened by 16 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 2 (OVERLAPS) 1/410 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 381 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
At refinement iteration 5 (OVERLAPS) 382/792 variables, 410/469 constraints. Problems are: Problem set: 113 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/792 variables, 16/485 constraints. Problems are: Problem set: 113 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/792 variables, 0/485 constraints. Problems are: Problem set: 113 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 0/792 variables, 0/485 constraints. Problems are: Problem set: 113 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 792/792 variables, and 485 constraints, problems are : Problem set: 113 solved, 268 unsolved in 18303 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 410/410 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 381/381 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 113 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 13/13 constraints. Problems are: Problem set: 113 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 0/13 constraints. Problems are: Problem set: 113 solved, 268 unsolved
At refinement iteration 2 (OVERLAPS) 69/390 variables, 32/45 constraints. Problems are: Problem set: 113 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/390 variables, 0/45 constraints. Problems are: Problem set: 113 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 14/404 variables, 14/59 constraints. Problems are: Problem set: 113 solved, 268 unsolved
[2024-05-22 06:41:16] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:41:16] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2024-05-22 06:41:16] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-22 06:41:16] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 4/63 constraints. Problems are: Problem set: 113 solved, 268 unsolved
[2024-05-22 06:41:17] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:41:18] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 2/65 constraints. Problems are: Problem set: 113 solved, 268 unsolved
[2024-05-22 06:41:20] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:41:20] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 2/67 constraints. Problems are: Problem set: 113 solved, 268 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 0/67 constraints. Problems are: Problem set: 113 solved, 268 unsolved
At refinement iteration 9 (OVERLAPS) 378/782 variables, 404/471 constraints. Problems are: Problem set: 113 solved, 268 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/782 variables, 16/487 constraints. Problems are: Problem set: 113 solved, 268 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/782 variables, 268/755 constraints. Problems are: Problem set: 113 solved, 268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 782/792 variables, and 755 constraints, problems are : Problem set: 113 solved, 268 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 404/410 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 268/381 constraints, Known Traps: 8/8 constraints]
After SMT, in 48582ms problems are : Problem set: 113 solved, 268 unsolved
Search for dead transitions found 113 dead transitions in 48590ms
Found 113 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 113 transitions
Dead transitions reduction (with SMT) removed 113 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 410/433 places, 269/373 transitions.
Graph (complete) has 1114 edges and 410 vertex of which 322 are kept as prefixes of interest. Removing 88 places using SCC suffix rule.1 ms
Discarding 88 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 322 /410 variables (removed 88) and now considering 269/269 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 322/433 places, 269/373 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 48710 ms. Remains : 322/433 places, 269/373 transitions.
Built C files in :
/tmp/ltsmin3975172048318087401
[2024-05-22 06:41:41] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3975172048318087401
Running compilation step : cd /tmp/ltsmin3975172048318087401;'/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 691 ms.
Running link step : cd /tmp/ltsmin3975172048318087401;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin3975172048318087401;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13028517086350593595.hoa' '--buchi-type=spotba'
LTSmin run took 248 ms.
FORMULA DES-PT-50b-LTLCardinality-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-50b-LTLCardinality-09 finished in 285124 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 p1))&&X(p0)))'
Support contains 4 out of 446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 390/390 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 445 transition count 390
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 438 transition count 383
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 438 transition count 383
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 438 transition count 381
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 22 place count 433 transition count 376
Iterating global reduction 2 with 5 rules applied. Total rules applied 27 place count 433 transition count 376
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 433 transition count 373
Applied a total of 30 rules in 23 ms. Remains 433 /446 variables (removed 13) and now considering 373/390 (removed 17) transitions.
// Phase 1: matrix 373 rows 433 cols
[2024-05-22 06:41:42] [INFO ] Computed 62 invariants in 18 ms
[2024-05-22 06:41:42] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-05-22 06:41:42] [INFO ] Invariant cache hit.
[2024-05-22 06:41:43] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 709 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2024-05-22 06:41:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 373/806 variables, 433/495 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:41:49] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-05-22 06:41:49] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-05-22 06:41:50] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-05-22 06:41:50] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:41:50] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 3 ms to minimize.
[2024-05-22 06:41:50] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-05-22 06:41:50] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 1 ms to minimize.
[2024-05-22 06:41:50] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2024-05-22 06:41:50] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 3 ms to minimize.
[2024-05-22 06:41:50] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-05-22 06:41:50] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 2 ms to minimize.
[2024-05-22 06:41:51] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
[2024-05-22 06:41:51] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2024-05-22 06:41:51] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-22 06:41:51] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:41:51] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-22 06:41:51] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-22 06:41:52] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:41:52] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 2 ms to minimize.
[2024-05-22 06:41:52] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 20/515 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:41:54] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:41:54] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:41:55] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:41:59] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2024-05-22 06:42:02] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 2 ms to minimize.
[2024-05-22 06:42:03] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 3 ms to minimize.
[2024-05-22 06:42:03] [INFO ] Deduced a trap composed of 51 places in 134 ms of which 2 ms to minimize.
[2024-05-22 06:42:03] [INFO ] Deduced a trap composed of 55 places in 97 ms of which 2 ms to minimize.
[2024-05-22 06:42:04] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 1 ms to minimize.
[2024-05-22 06:42:04] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/806 variables, 7/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/806 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/806 variables, and 525 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 30/92 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:42:16] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 2 ms to minimize.
[2024-05-22 06:42:16] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
[2024-05-22 06:42:16] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:42:16] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:42:16] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:42:16] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:42:17] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:42:17] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:42:17] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-22 06:42:17] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:42:17] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:42:17] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:42:17] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-22 06:42:17] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-22 06:42:18] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-22 06:42:18] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:42:18] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:42:18] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:42:18] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:42:18] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:42:18] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
[2024-05-22 06:42:18] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 1 ms to minimize.
[2024-05-22 06:42:18] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:42:18] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2024-05-22 06:42:18] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:42:18] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-05-22 06:42:19] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 0 ms to minimize.
[2024-05-22 06:42:19] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
[2024-05-22 06:42:19] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:42:19] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-22 06:42:19] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:42:19] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 0 ms to minimize.
[2024-05-22 06:42:19] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-22 06:42:22] [INFO ] Deduced a trap composed of 35 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 14/126 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:42:23] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:42:23] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2024-05-22 06:42:23] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:42:23] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:42:23] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:42:26] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-22 06:42:26] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-22 06:42:27] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:42:29] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 11 (OVERLAPS) 373/806 variables, 433/568 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/806 variables, 372/940 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/806 variables, and 940 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 73/73 constraints]
After SMT, in 60216ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 60221ms
Starting structural reductions in LTL mode, iteration 1 : 433/446 places, 373/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60957 ms. Remains : 433/446 places, 373/390 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p1) (NOT p0)), true, (AND p1 (NOT p0)), (NOT p1), (NOT p1)]
Running random walk in product with property : DES-PT-50b-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-50b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLCardinality-10 finished in 61147 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)||X(p1)))'
Support contains 3 out of 446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 390/390 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 445 transition count 390
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 438 transition count 383
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 438 transition count 383
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 438 transition count 381
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 22 place count 433 transition count 376
Iterating global reduction 2 with 5 rules applied. Total rules applied 27 place count 433 transition count 376
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 433 transition count 373
Applied a total of 30 rules in 22 ms. Remains 433 /446 variables (removed 13) and now considering 373/390 (removed 17) transitions.
[2024-05-22 06:42:43] [INFO ] Invariant cache hit.
[2024-05-22 06:42:43] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-22 06:42:43] [INFO ] Invariant cache hit.
[2024-05-22 06:42:44] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2024-05-22 06:42:44] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 373/806 variables, 433/495 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:42:50] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-05-22 06:42:51] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
[2024-05-22 06:42:51] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-05-22 06:42:51] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 2 ms to minimize.
[2024-05-22 06:42:51] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 2 ms to minimize.
[2024-05-22 06:42:51] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 1 ms to minimize.
[2024-05-22 06:42:51] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
[2024-05-22 06:42:51] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-05-22 06:42:52] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 1 ms to minimize.
[2024-05-22 06:42:52] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2024-05-22 06:42:52] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:42:52] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 2 ms to minimize.
[2024-05-22 06:42:52] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2024-05-22 06:42:52] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-05-22 06:42:52] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-05-22 06:42:52] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-22 06:42:53] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:42:53] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:42:53] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 2 ms to minimize.
[2024-05-22 06:42:53] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 20/515 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:42:56] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:42:56] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:42:57] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:43:00] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2024-05-22 06:43:04] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 3 ms to minimize.
[2024-05-22 06:43:04] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 2 ms to minimize.
[2024-05-22 06:43:05] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 2 ms to minimize.
[2024-05-22 06:43:05] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 2 ms to minimize.
[2024-05-22 06:43:05] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 2 ms to minimize.
[2024-05-22 06:43:05] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/806 variables, 7/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/806 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/806 variables, and 525 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 30/92 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:43:17] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2024-05-22 06:43:17] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:43:18] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:43:18] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:43:18] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2024-05-22 06:43:18] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 2 ms to minimize.
[2024-05-22 06:43:18] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:43:18] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:43:18] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-22 06:43:18] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-05-22 06:43:19] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:43:19] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:43:19] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2024-05-22 06:43:19] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-22 06:43:19] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
[2024-05-22 06:43:19] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:43:19] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:43:19] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:43:19] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-22 06:43:19] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:43:20] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-22 06:43:20] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2024-05-22 06:43:20] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 0 ms to minimize.
[2024-05-22 06:43:20] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:43:20] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2024-05-22 06:43:20] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:43:20] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:43:20] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-05-22 06:43:20] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 2 ms to minimize.
[2024-05-22 06:43:20] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:43:20] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:43:21] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:43:21] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:43:23] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 14/126 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:43:24] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:43:25] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-05-22 06:43:25] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:43:25] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-22 06:43:25] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:43:28] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-22 06:43:28] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-22 06:43:28] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:43:31] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 11 (OVERLAPS) 373/806 variables, 433/568 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/806 variables, 372/940 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/806 variables, and 940 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 73/73 constraints]
After SMT, in 60191ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 60196ms
Starting structural reductions in LTL mode, iteration 1 : 433/446 places, 373/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60956 ms. Remains : 433/446 places, 373/390 transitions.
Stuttering acceptance computed with spot in 207 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 127 ms.
Product exploration explored 100000 steps with 50000 reset in 135 ms.
Computed a total of 256 stabilizing places and 248 stable transitions
Graph (complete) has 1006 edges and 433 vertex of which 427 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 256 stabilizing places and 248 stable transitions
Detected a total of 256/433 stabilizing places and 248/373 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 17 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-50b-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-50b-LTLCardinality-13 finished in 61470 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((F(p1)&&(!p2 U (p3||G(!p2))))))))'
Support contains 6 out of 446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 446/446 places, 390/390 transitions.
Graph (complete) has 1032 edges and 446 vertex of which 444 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 443 transition count 372
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 428 transition count 372
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 31 place count 428 transition count 362
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 51 place count 418 transition count 362
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 413 transition count 357
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 413 transition count 357
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 413 transition count 356
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 66 place count 409 transition count 352
Iterating global reduction 3 with 4 rules applied. Total rules applied 70 place count 409 transition count 352
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 73 place count 409 transition count 349
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 73 place count 409 transition count 346
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 79 place count 406 transition count 346
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 4 with 148 rules applied. Total rules applied 227 place count 332 transition count 272
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 229 place count 331 transition count 272
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 231 place count 329 transition count 270
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 232 place count 328 transition count 270
Applied a total of 232 rules in 45 ms. Remains 328 /446 variables (removed 118) and now considering 270/390 (removed 120) transitions.
// Phase 1: matrix 270 rows 328 cols
[2024-05-22 06:43:44] [INFO ] Computed 62 invariants in 8 ms
[2024-05-22 06:43:45] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-22 06:43:45] [INFO ] Invariant cache hit.
[2024-05-22 06:43:45] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
[2024-05-22 06:43:45] [INFO ] Redundant transitions in 1 ms returned []
Running 266 sub problems to find dead transitions.
[2024-05-22 06:43:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 2/325 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (OVERLAPS) 3/328 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 266 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (OVERLAPS) 270/598 variables, 328/390 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-22 06:43:56] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-22 06:43:57] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/598 variables, 2/392 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/598 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-22 06:44:03] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/598 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/598 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-22 06:44:07] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-05-22 06:44:07] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
[2024-05-22 06:44:07] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 2 ms to minimize.
[2024-05-22 06:44:07] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
[2024-05-22 06:44:07] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:44:08] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/598 variables, 6/399 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/598 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-22 06:44:15] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/598 variables, and 400 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 328/328 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (OVERLAPS) 2/325 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (OVERLAPS) 3/328 variables, 11/68 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 10 (OVERLAPS) 270/598 variables, 328/400 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/598 variables, 266/666 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-22 06:44:34] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/598 variables, and 667 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 328/328 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 11/11 constraints]
After SMT, in 60223ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 60227ms
Starting structural reductions in SI_LTL mode, iteration 1 : 328/446 places, 270/390 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60847 ms. Remains : 328/446 places, 270/390 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p3))]
Running random walk in product with property : DES-PT-50b-LTLCardinality-15
Product exploration explored 100000 steps with 5217 reset in 255 ms.
Product exploration explored 100000 steps with 5313 reset in 270 ms.
Computed a total of 219 stabilizing places and 211 stable transitions
Graph (complete) has 1118 edges and 328 vertex of which 322 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 219 stabilizing places and 211 stable transitions
Detected a total of 219/328 stabilizing places and 211/270 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) p2), (X p2), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p2))))), (X p0), (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) (NOT p2))))), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p2)))))), (X (X p0)), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) (NOT p2)))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 163 ms. Reduced automaton from 4 states, 11 edges and 4 AP (stutter insensitive) to 4 states, 11 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 233 ms :[(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p3))]
RANDOM walk for 40000 steps (1672 resets) in 174 ms. (228 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40003 steps (333 resets) in 259 ms. (153 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (301 resets) in 425 ms. (93 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (300 resets) in 640 ms. (62 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (322 resets) in 639 ms. (62 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (315 resets) in 512 ms. (77 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (304 resets) in 478 ms. (83 steps per ms) remains 6/6 properties
[2024-05-22 06:44:47] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 14/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 238/258 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 30/288 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 23/311 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 7/318 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 266/584 variables, 318/377 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/584 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 13/597 variables, 9/386 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/597 variables, 3/389 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/597 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 1/598 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/598 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/598 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 598/598 variables, and 390 constraints, problems are : Problem set: 0 solved, 6 unsolved in 629 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 328/328 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 14/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 238/258 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 30/288 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 06:44:48] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 23/311 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 7/318 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf4 is UNSAT
Problem apf5 is UNSAT
At refinement iteration 12 (OVERLAPS) 266/584 variables, 318/378 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/584 variables, 1/379 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/584 variables, 0/379 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 13/597 variables, 9/388 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/597 variables, 3/391 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/597 variables, 3/394 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/597 variables, 0/394 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 1/598 variables, 1/395 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/598 variables, 0/395 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/598 variables, 0/395 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 598/598 variables, and 395 constraints, problems are : Problem set: 2 solved, 4 unsolved in 957 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 328/328 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 1591ms problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 12032 ms.
Support contains 6 out of 328 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 328/328 places, 270/270 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 328 transition count 269
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 328 transition count 267
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 326 transition count 267
Applied a total of 5 rules in 16 ms. Remains 326 /328 variables (removed 2) and now considering 267/270 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 326/328 places, 267/270 transitions.
RANDOM walk for 40000 steps (1662 resets) in 718 ms. (55 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (339 resets) in 326 ms. (122 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (312 resets) in 337 ms. (118 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (311 resets) in 322 ms. (123 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (335 resets) in 301 ms. (132 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 650901 steps, run timeout after 3005 ms. (steps per millisecond=216 ) properties seen :0 out of 4
Probabilistic random walk after 650901 steps, saw 87679 distinct states, run finished after 3005 ms. (steps per millisecond=216 ) properties seen :0
// Phase 1: matrix 267 rows 326 cols
[2024-05-22 06:45:05] [INFO ] Computed 62 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 238/256 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 30/286 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 23/309 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 7/316 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 263/579 variables, 316/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 13/592 variables, 9/384 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/592 variables, 3/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/592 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 1/593 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/593 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/593 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 593/593 variables, and 388 constraints, problems are : Problem set: 0 solved, 4 unsolved in 500 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 326/326 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 238/256 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 30/286 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 06:45:05] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 23/309 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 7/316 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/316 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 263/579 variables, 316/376 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/579 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 13/592 variables, 9/386 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/592 variables, 3/389 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/592 variables, 3/392 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 06:45:06] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/592 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/592 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 1/593 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/593 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/593 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 593/593 variables, and 394 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1040 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 326/326 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 1555ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 12810 ms.
Support contains 6 out of 326 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 326/326 places, 267/267 transitions.
Applied a total of 0 rules in 7 ms. Remains 326 /326 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 326/326 places, 267/267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 326/326 places, 267/267 transitions.
Applied a total of 0 rules in 4 ms. Remains 326 /326 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-05-22 06:45:19] [INFO ] Invariant cache hit.
[2024-05-22 06:45:19] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-22 06:45:19] [INFO ] Invariant cache hit.
[2024-05-22 06:45:20] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
[2024-05-22 06:45:20] [INFO ] Redundant transitions in 2 ms returned []
Running 263 sub problems to find dead transitions.
[2024-05-22 06:45:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 2/323 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (OVERLAPS) 3/326 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 263 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 267/593 variables, 326/388 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 06:45:29] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-22 06:45:29] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-05-22 06:45:29] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-05-22 06:45:30] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:45:30] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/593 variables, 5/393 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 06:45:34] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/593 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 06:45:37] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/593 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 06:45:39] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 2 ms to minimize.
[2024-05-22 06:45:40] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/593 variables, 2/397 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/593 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 13 (OVERLAPS) 0/593 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 593/593 variables, and 397 constraints, problems are : Problem set: 0 solved, 263 unsolved in 27019 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 326/326 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 2/323 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 3/326 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 267/593 variables, 326/397 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/593 variables, 263/660 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 06:46:03] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-22 06:46:04] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-22 06:46:04] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/593 variables, and 663 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 326/326 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 12/12 constraints]
After SMT, in 57213ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 57216ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57860 ms. Remains : 326/326 places, 267/267 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 7 ms. Remains 326 /326 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-22 06:46:17] [INFO ] Invariant cache hit.
[2024-05-22 06:46:17] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 06:46:17] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2024-05-22 06:46:17] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 25 ms returned sat
[2024-05-22 06:46:17] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-22 06:46:17] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-22 06:46:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
TRAPS : Iteration 1
[2024-05-22 06:46:18] [INFO ] After 437ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-22 06:46:18] [INFO ] After 636ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 722 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) p2), (X p2), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p2))))), (X p0), (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) (NOT p2))))), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p2)))))), (X (X p0)), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) (NOT p2)))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (G (OR p0 p1)), (G (AND (OR p0 p2 p1) (OR p0 (NOT p3) p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (OR p0 (NOT p2) p3)))]
Knowledge based reduction with 22 factoid took 315 ms. Reduced automaton from 4 states, 11 edges and 4 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3))]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3))]
Support contains 6 out of 328 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 328/328 places, 270/270 transitions.
Applied a total of 0 rules in 8 ms. Remains 328 /328 variables (removed 0) and now considering 270/270 (removed 0) transitions.
// Phase 1: matrix 270 rows 328 cols
[2024-05-22 06:46:18] [INFO ] Computed 62 invariants in 9 ms
[2024-05-22 06:46:18] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-22 06:46:18] [INFO ] Invariant cache hit.
[2024-05-22 06:46:19] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
[2024-05-22 06:46:19] [INFO ] Redundant transitions in 1 ms returned []
Running 266 sub problems to find dead transitions.
[2024-05-22 06:46:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 2/325 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (OVERLAPS) 3/328 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 266 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (OVERLAPS) 270/598 variables, 328/390 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-22 06:46:30] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-22 06:46:30] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/598 variables, 2/392 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/598 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-22 06:46:36] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/598 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/598 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-22 06:46:40] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-05-22 06:46:40] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
[2024-05-22 06:46:40] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 2 ms to minimize.
[2024-05-22 06:46:40] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-05-22 06:46:40] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:46:41] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/598 variables, 6/399 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/598 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-22 06:46:48] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/598 variables, and 400 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 328/328 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (OVERLAPS) 2/325 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (OVERLAPS) 3/328 variables, 11/68 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 10 (OVERLAPS) 270/598 variables, 328/400 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/598 variables, 266/666 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-22 06:47:08] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/598 variables, and 667 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 328/328 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 11/11 constraints]
After SMT, in 60177ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 60181ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60773 ms. Remains : 328/328 places, 270/270 transitions.
Computed a total of 219 stabilizing places and 211 stable transitions
Graph (complete) has 1118 edges and 328 vertex of which 322 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 219 stabilizing places and 211 stable transitions
Detected a total of 219/328 stabilizing places and 211/270 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p3)), (X p2), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3)))), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X p0), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 187 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3))]
RANDOM walk for 40000 steps (1675 resets) in 1547 ms. (25 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40003 steps (305 resets) in 315 ms. (126 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (310 resets) in 207 ms. (192 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (326 resets) in 277 ms. (143 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (317 resets) in 281 ms. (141 steps per ms) remains 4/4 properties
[2024-05-22 06:47:20] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 14/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 238/258 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 30/288 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 23/311 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 7/318 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 266/584 variables, 318/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/584 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 13/597 variables, 9/386 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/597 variables, 3/389 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/597 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 1/598 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/598 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/598 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 598/598 variables, and 390 constraints, problems are : Problem set: 0 solved, 4 unsolved in 420 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 328/328 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 14/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 238/258 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 30/288 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 23/311 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 7/318 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 266/584 variables, 318/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/584 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/584 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 13/597 variables, 9/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/597 variables, 3/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/597 variables, 3/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 06:47:21] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/597 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/597 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 1/598 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 06:47:21] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/598 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/598 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/598 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 598/598 variables, and 396 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1094 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 328/328 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 1520ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 8698 ms.
Support contains 6 out of 328 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 328/328 places, 270/270 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 328 transition count 269
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 328 transition count 267
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 326 transition count 267
Applied a total of 5 rules in 14 ms. Remains 326 /328 variables (removed 2) and now considering 267/270 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 326/328 places, 267/270 transitions.
RANDOM walk for 40000 steps (1672 resets) in 1545 ms. (25 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (302 resets) in 307 ms. (129 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (293 resets) in 369 ms. (108 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (331 resets) in 322 ms. (123 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (324 resets) in 283 ms. (140 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 576008 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :0 out of 4
Probabilistic random walk after 576008 steps, saw 77604 distinct states, run finished after 3001 ms. (steps per millisecond=191 ) properties seen :0
// Phase 1: matrix 267 rows 326 cols
[2024-05-22 06:47:34] [INFO ] Computed 62 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 238/256 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 30/286 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 23/309 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 7/316 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 263/579 variables, 316/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 13/592 variables, 9/384 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/592 variables, 3/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/592 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 1/593 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/593 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/593 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 593/593 variables, and 388 constraints, problems are : Problem set: 0 solved, 4 unsolved in 508 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 326/326 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 238/256 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 30/286 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 23/309 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 7/316 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 263/579 variables, 316/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 06:47:35] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/579 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 13/592 variables, 9/386 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/592 variables, 3/389 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/592 variables, 3/392 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/592 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 1/593 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/593 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/593 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 593/593 variables, and 393 constraints, problems are : Problem set: 0 solved, 4 unsolved in 849 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 326/326 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 1370ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 7202 ms.
Support contains 6 out of 326 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 326/326 places, 267/267 transitions.
Applied a total of 0 rules in 6 ms. Remains 326 /326 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 326/326 places, 267/267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 326/326 places, 267/267 transitions.
Applied a total of 0 rules in 6 ms. Remains 326 /326 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-05-22 06:47:43] [INFO ] Invariant cache hit.
[2024-05-22 06:47:43] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-22 06:47:43] [INFO ] Invariant cache hit.
[2024-05-22 06:47:43] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
[2024-05-22 06:47:43] [INFO ] Redundant transitions in 1 ms returned []
Running 263 sub problems to find dead transitions.
[2024-05-22 06:47:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 2/323 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (OVERLAPS) 3/326 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 263 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 267/593 variables, 326/388 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 06:47:53] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:47:53] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2024-05-22 06:47:53] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-22 06:47:54] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-22 06:47:55] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/593 variables, 5/393 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 06:47:58] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/593 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 06:48:02] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/593 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 06:48:04] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 2 ms to minimize.
[2024-05-22 06:48:05] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/593 variables, 2/397 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/593 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 13 (OVERLAPS) 0/593 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 593/593 variables, and 397 constraints, problems are : Problem set: 0 solved, 263 unsolved in 28350 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 326/326 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 2/323 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 3/326 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 267/593 variables, 326/397 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/593 variables, 263/660 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-22 06:48:28] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-22 06:48:30] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-22 06:48:30] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/593 variables, and 663 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 326/326 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 12/12 constraints]
After SMT, in 58527ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 58531ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59197 ms. Remains : 326/326 places, 267/267 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 9 ms. Remains 326 /326 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-22 06:48:42] [INFO ] Invariant cache hit.
[2024-05-22 06:48:42] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 06:48:42] [INFO ] [Nat]Absence check using 34 positive place invariants in 6 ms returned sat
[2024-05-22 06:48:42] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 27 ms returned sat
[2024-05-22 06:48:42] [INFO ] After 209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-22 06:48:43] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-22 06:48:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
TRAPS : Iteration 1
[2024-05-22 06:48:43] [INFO ] After 455ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-22 06:48:43] [INFO ] After 688ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 783 ms.
Knowledge obtained : [(AND p0 p2 (NOT p3)), (X p2), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3)))), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X p0), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p2) p3 p0)))]
Knowledge based reduction with 14 factoid took 289 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3))]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3))]
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3))]
Product exploration explored 100000 steps with 5212 reset in 214 ms.
Product exploration explored 100000 steps with 5291 reset in 230 ms.
Built C files in :
/tmp/ltsmin10247530947770869234
[2024-05-22 06:48:44] [INFO ] Computing symmetric may disable matrix : 270 transitions.
[2024-05-22 06:48:44] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:48:44] [INFO ] Computing symmetric may enable matrix : 270 transitions.
[2024-05-22 06:48:44] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:48:44] [INFO ] Computing Do-Not-Accords matrix : 270 transitions.
[2024-05-22 06:48:44] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:48:44] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10247530947770869234
Running compilation step : cd /tmp/ltsmin10247530947770869234;'/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 777 ms.
Running link step : cd /tmp/ltsmin10247530947770869234;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin10247530947770869234;'/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/stateBased2365161202125898054.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 328 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 328/328 places, 270/270 transitions.
Applied a total of 0 rules in 13 ms. Remains 328 /328 variables (removed 0) and now considering 270/270 (removed 0) transitions.
// Phase 1: matrix 270 rows 328 cols
[2024-05-22 06:48:59] [INFO ] Computed 62 invariants in 10 ms
[2024-05-22 06:48:59] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-22 06:48:59] [INFO ] Invariant cache hit.
[2024-05-22 06:49:00] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
[2024-05-22 06:49:00] [INFO ] Redundant transitions in 2 ms returned []
Running 266 sub problems to find dead transitions.
[2024-05-22 06:49:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 2/325 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (OVERLAPS) 3/328 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 266 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (OVERLAPS) 270/598 variables, 328/390 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-22 06:49:11] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-22 06:49:11] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/598 variables, 2/392 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/598 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-22 06:49:17] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/598 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/598 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-22 06:49:21] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-22 06:49:22] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-05-22 06:49:22] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2024-05-22 06:49:22] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
[2024-05-22 06:49:22] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:49:22] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/598 variables, 6/399 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/598 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-22 06:49:29] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/598 variables, and 400 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 328/328 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (OVERLAPS) 2/325 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (OVERLAPS) 3/328 variables, 11/68 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 10 (OVERLAPS) 270/598 variables, 328/400 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/598 variables, 266/666 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-22 06:49:49] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/598 variables, and 667 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 328/328 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 11/11 constraints]
After SMT, in 60189ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 60193ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60803 ms. Remains : 328/328 places, 270/270 transitions.
Built C files in :
/tmp/ltsmin5536765555499472245
[2024-05-22 06:50:00] [INFO ] Computing symmetric may disable matrix : 270 transitions.
[2024-05-22 06:50:00] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:50:00] [INFO ] Computing symmetric may enable matrix : 270 transitions.
[2024-05-22 06:50:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:50:00] [INFO ] Computing Do-Not-Accords matrix : 270 transitions.
[2024-05-22 06:50:00] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:50:00] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5536765555499472245
Running compilation step : cd /tmp/ltsmin5536765555499472245;'/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 699 ms.
Running link step : cd /tmp/ltsmin5536765555499472245;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin5536765555499472245;'/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/stateBased18143408481542323542.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 06:50:15] [INFO ] Flatten gal took : 20 ms
[2024-05-22 06:50:15] [INFO ] Flatten gal took : 19 ms
[2024-05-22 06:50:15] [INFO ] Time to serialize gal into /tmp/LTL18332086818737337081.gal : 5 ms
[2024-05-22 06:50:15] [INFO ] Time to serialize properties into /tmp/LTL9406596645788144057.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18332086818737337081.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18135112936815122164.hoa' '-atoms' '/tmp/LTL9406596645788144057.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL9406596645788144057.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18135112936815122164.hoa
Detected timeout of ITS tools.
[2024-05-22 06:50:30] [INFO ] Flatten gal took : 20 ms
[2024-05-22 06:50:30] [INFO ] Flatten gal took : 17 ms
[2024-05-22 06:50:30] [INFO ] Time to serialize gal into /tmp/LTL14346931777035568384.gal : 4 ms
[2024-05-22 06:50:30] [INFO ] Time to serialize properties into /tmp/LTL14048784219689970732.ltl : 17 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14346931777035568384.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14048784219689970732.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((p241==0)||(p168==1))")))||(G((F("((p168==0)&&(p241==1))"))&&((!("((p68==0)||(p56==1))"))U(("((!((p305==0)||(p290==1)))&&(...219
Formula 0 simplified : G(FG!"((p241==0)||(p168==1))" & F(G!"((p168==0)&&(p241==1))" | ("((p68==0)||(p56==1))" M !"((!((p305==0)||(p290==1)))&&(!((p68==0)||...170
Detected timeout of ITS tools.
[2024-05-22 06:50:45] [INFO ] Flatten gal took : 27 ms
[2024-05-22 06:50:45] [INFO ] Applying decomposition
[2024-05-22 06:50:45] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12547335841122567087.txt' '-o' '/tmp/graph12547335841122567087.bin' '-w' '/tmp/graph12547335841122567087.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12547335841122567087.bin' '-l' '-1' '-v' '-w' '/tmp/graph12547335841122567087.weights' '-q' '0' '-e' '0.001'
[2024-05-22 06:50:46] [INFO ] Decomposing Gal with order
[2024-05-22 06:50:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 06:50:46] [INFO ] Removed a total of 30 redundant transitions.
[2024-05-22 06:50:46] [INFO ] Flatten gal took : 74 ms
[2024-05-22 06:50:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 5 ms.
[2024-05-22 06:50:46] [INFO ] Time to serialize gal into /tmp/LTL2223370115168832034.gal : 5 ms
[2024-05-22 06:50:46] [INFO ] Time to serialize properties into /tmp/LTL12519401974855052714.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2223370115168832034.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12519401974855052714.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((i2.u3.p241==0)||(u2.p168==1))")))||(G((F("((u2.p168==0)&&(i2.u3.p241==1))"))&&((!("((u48.p68==0)||(u48.p56==1))"))U(("((!...274
Formula 0 simplified : G(FG!"((i2.u3.p241==0)||(u2.p168==1))" & F(G!"((u2.p168==0)&&(i2.u3.p241==1))" | ("((u48.p68==0)||(u48.p56==1))" M !"((!((i2.u12.p30...217
Detected timeout of ITS tools.
Treatment of property DES-PT-50b-LTLCardinality-15 finished in 436341 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((F(p1)&&(!p2 U (p3||G(!p2))))))))'
[2024-05-22 06:51:01] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10804278756449410771
[2024-05-22 06:51:01] [INFO ] Computing symmetric may disable matrix : 390 transitions.
[2024-05-22 06:51:01] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:51:01] [INFO ] Computing symmetric may enable matrix : 390 transitions.
[2024-05-22 06:51:01] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:51:01] [INFO ] Applying decomposition
[2024-05-22 06:51:01] [INFO ] Computing Do-Not-Accords matrix : 390 transitions.
[2024-05-22 06:51:01] [INFO ] Flatten gal took : 49 ms
[2024-05-22 06:51:01] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:51:01] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10804278756449410771
Running compilation step : cd /tmp/ltsmin10804278756449410771;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17596128250704941047.txt' '-o' '/tmp/graph17596128250704941047.bin' '-w' '/tmp/graph17596128250704941047.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17596128250704941047.bin' '-l' '-1' '-v' '-w' '/tmp/graph17596128250704941047.weights' '-q' '0' '-e' '0.001'
[2024-05-22 06:51:01] [INFO ] Decomposing Gal with order
[2024-05-22 06:51:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 06:51:01] [INFO ] Removed a total of 17 redundant transitions.
[2024-05-22 06:51:01] [INFO ] Flatten gal took : 26 ms
[2024-05-22 06:51:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2024-05-22 06:51:01] [INFO ] Time to serialize gal into /tmp/LTLCardinality7859666243133275802.gal : 4 ms
[2024-05-22 06:51:01] [INFO ] Time to serialize properties into /tmp/LTLCardinality8066832928028005151.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7859666243133275802.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8066832928028005151.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((i5.u10.p241==0)||(u9.p168==1))")))||(G((F("((u9.p168==0)&&(i5.u10.p241==1))"))&&((!("((i11.u79.p68==0)||(i11.u79.p56==1))...301
Formula 0 simplified : G(FG!"((i5.u10.p241==0)||(u9.p168==1))" & F(G!"((u9.p168==0)&&(i5.u10.p241==1))" | ("((i11.u79.p68==0)||(i11.u79.p56==1))" M !"((!((...236
Compilation finished in 1126 ms.
Running link step : cd /tmp/ltsmin10804278756449410771;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin10804278756449410771;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([](<>((LTLAPp0==true)))||[]((<>((LTLAPp1==true))&&(!(LTLAPp2==true) U ((LTLAPp3==true)||[](!(LTLAPp2==true))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t59, t90, t123, t129, t288, t348, t349, t382, u9.t243, u9.t244, u9.t245, u9.t246, u9.t247...1161
Computing Next relation with stutter on 9.05564e+08 deadlock states
Detected timeout of ITS tools.
[2024-05-22 07:20:15] [INFO ] Applying decomposition
[2024-05-22 07:20:15] [INFO ] Flatten gal took : 39 ms
[2024-05-22 07:20:15] [INFO ] Decomposing Gal with order
[2024-05-22 07:20:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 07:20:15] [INFO ] Removed a total of 208 redundant transitions.
[2024-05-22 07:20:15] [INFO ] Flatten gal took : 96 ms
[2024-05-22 07:20:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 700 labels/synchronizations in 95 ms.
[2024-05-22 07:20:15] [INFO ] Time to serialize gal into /tmp/LTLCardinality14163585191972274028.gal : 15 ms
[2024-05-22 07:20:15] [INFO ] Time to serialize properties into /tmp/LTLCardinality7487317469883819327.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14163585191972274028.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7487317469883819327.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((i1.i0.i0.i0.i0.i0.u17.p241==0)||(i0.u7.p168==1))")))||(G((F("((i0.u7.p168==0)&&(i1.i0.i0.i0.i0.i0.u17.p241==1))"))&&((!("...396
Formula 0 simplified : G(FG!"((i1.i0.i0.i0.i0.i0.u17.p241==0)||(i0.u7.p168==1))" & F(G!"((i0.u7.p168==0)&&(i1.i0.i0.i0.i0.i0.u17.p241==1))" | ("((i0.i0.i0....323

BK_TIME_CONFINEMENT_REACHED

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

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

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-50b"
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-50b, 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-171624189900739"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-50b.tgz
mv DES-PT-50b 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 ;