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.r091-tall-171624188300705.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 greatspnxred
Input is DES-PT-30b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624188300705
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 12 08:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 08:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 08:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 103K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716320400121

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-30b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 19:40:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 19:40:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:40:01] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-05-21 19:40:01] [INFO ] Transformed 399 places.
[2024-05-21 19:40:01] [INFO ] Transformed 350 transitions.
[2024-05-21 19:40:01] [INFO ] Found NUPN structural information;
[2024-05-21 19:40:01] [INFO ] Parsed PT model containing 399 places and 350 transitions and 1143 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Initial state reduction rules removed 2 formulas.
FORMULA DES-PT-30b-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 84 out of 399 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 399/399 places, 350/350 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 396 transition count 350
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 19 place count 380 transition count 334
Iterating global reduction 1 with 16 rules applied. Total rules applied 35 place count 380 transition count 334
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 43 place count 372 transition count 326
Iterating global reduction 1 with 8 rules applied. Total rules applied 51 place count 372 transition count 326
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 57 place count 372 transition count 320
Applied a total of 57 rules in 96 ms. Remains 372 /399 variables (removed 27) and now considering 320/350 (removed 30) transitions.
// Phase 1: matrix 320 rows 372 cols
[2024-05-21 19:40:01] [INFO ] Computed 62 invariants in 34 ms
[2024-05-21 19:40:02] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-05-21 19:40:02] [INFO ] Invariant cache hit.
[2024-05-21 19:40:02] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 847 ms to find 0 implicit places.
Running 319 sub problems to find dead transitions.
[2024-05-21 19:40:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/371 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (OVERLAPS) 1/372 variables, 32/50 constraints. Problems are: Problem set: 0 solved, 319 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/372 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (OVERLAPS) 320/692 variables, 372/434 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-21 19:40:10] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 26 ms to minimize.
[2024-05-21 19:40:10] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 2 ms to minimize.
[2024-05-21 19:40:10] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-21 19:40:10] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 2 ms to minimize.
[2024-05-21 19:40:10] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-21 19:40:10] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-05-21 19:40:11] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 2 ms to minimize.
[2024-05-21 19:40:11] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-21 19:40:11] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-05-21 19:40:11] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 2 ms to minimize.
[2024-05-21 19:40:11] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 2 ms to minimize.
[2024-05-21 19:40:11] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-21 19:40:12] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-21 19:40:13] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/692 variables, 14/448 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-21 19:40:15] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 2 ms to minimize.
[2024-05-21 19:40:15] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2024-05-21 19:40:16] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 2 ms to minimize.
[2024-05-21 19:40:16] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-21 19:40:16] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 2 ms to minimize.
[2024-05-21 19:40:16] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2024-05-21 19:40:16] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-05-21 19:40:16] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-21 19:40:17] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-05-21 19:40:17] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/692 variables, 10/458 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-21 19:40:20] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-21 19:40:20] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-21 19:40:20] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-21 19:40:20] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-21 19:40:21] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-21 19:40:21] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-21 19:40:21] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-21 19:40:21] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-21 19:40:23] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
[2024-05-21 19:40:24] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/692 variables, 10/468 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-21 19:40:25] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
[2024-05-21 19:40:25] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-21 19:40:25] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-21 19:40:25] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-21 19:40:25] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-21 19:40:25] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 2 ms to minimize.
[2024-05-21 19:40:25] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-05-21 19:40:27] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/692 variables, 8/476 constraints. Problems are: Problem set: 0 solved, 319 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 692/692 variables, and 476 constraints, problems are : Problem set: 0 solved, 319 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 372/372 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 319 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/371 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (OVERLAPS) 1/372 variables, 32/50 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/372 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 42/104 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-21 19:40:35] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-21 19:40:35] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-21 19:40:35] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 2 ms to minimize.
[2024-05-21 19:40:35] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-21 19:40:35] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-21 19:40:36] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-21 19:40:36] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-21 19:40:36] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-21 19:40:36] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 9/113 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-21 19:40:38] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-21 19:40:38] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-21 19:40:38] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-21 19:40:38] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-21 19:40:41] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 3 ms to minimize.
[2024-05-21 19:40:41] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-21 19:40:41] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-21 19:40:41] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-21 19:40:41] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-21 19:40:41] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-05-21 19:40:41] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 7/124 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-21 19:40:43] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-21 19:40:46] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2024-05-21 19:40:46] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-21 19:40:50] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
[2024-05-21 19:40:50] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-21 19:40:50] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-21 19:40:54] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-21 19:40:55] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-21 19:40:55] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-21 19:40:59] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-21 19:40:59] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/692 variables, and 135 constraints, problems are : Problem set: 0 solved, 319 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/372 constraints, PredecessorRefiner: 0/319 constraints, Known Traps: 73/73 constraints]
After SMT, in 60217ms problems are : Problem set: 0 solved, 319 unsolved
Search for dead transitions found 0 dead transitions in 60233ms
Starting structural reductions in LTL mode, iteration 1 : 372/399 places, 320/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61195 ms. Remains : 372/399 places, 320/350 transitions.
Support contains 84 out of 372 places after structural reductions.
[2024-05-21 19:41:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 19:41:03] [INFO ] Flatten gal took : 55 ms
FORMULA DES-PT-30b-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 19:41:03] [INFO ] Flatten gal took : 22 ms
[2024-05-21 19:41:03] [INFO ] Input system was already deterministic with 320 transitions.
Support contains 73 out of 372 places (down from 84) after GAL structural reductions.
RANDOM walk for 40000 steps (354 resets) in 1990 ms. (20 steps per ms) remains 19/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
[2024-05-21 19:41:04] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 25/58 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 128/186 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 165/351 variables, 27/59 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 5/356 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp40 is UNSAT
At refinement iteration 9 (OVERLAPS) 306/662 variables, 356/418 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/662 variables, 0/418 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 18/680 variables, 10/428 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/680 variables, 0/428 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 6/686 variables, 3/431 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/686 variables, 0/431 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 4/690 variables, 2/433 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/690 variables, 0/433 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 2/692 variables, 1/434 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/692 variables, 0/434 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 19 (OVERLAPS) 0/692 variables, 0/434 constraints. Problems are: Problem set: 2 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 692/692 variables, and 434 constraints, problems are : Problem set: 2 solved, 17 unsolved in 3378 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 372/372 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 25/53 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 128/181 variables, 29/32 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 170/351 variables, 27/59 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/59 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 5/356 variables, 3/62 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 0/62 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 306/662 variables, 356/418 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/662 variables, 16/434 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-05-21 19:41:08] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 2 ms to minimize.
[2024-05-21 19:41:08] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-21 19:41:08] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-21 19:41:08] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 2 ms to minimize.
[2024-05-21 19:41:08] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 2 ms to minimize.
[2024-05-21 19:41:09] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/662 variables, 6/440 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-05-21 19:41:10] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-21 19:41:10] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
[2024-05-21 19:41:10] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/662 variables, 3/443 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-05-21 19:41:11] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 19:41:11] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-21 19:41:12] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/692 variables, and 446 constraints, problems are : Problem set: 2 solved, 17 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 356/372 constraints, PredecessorRefiner: 16/19 constraints, Known Traps: 12/12 constraints]
After SMT, in 8399ms problems are : Problem set: 2 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 28 out of 372 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 372/372 places, 320/320 transitions.
Graph (complete) has 807 edges and 372 vertex of which 369 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 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 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 369 transition count 299
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 36 place count 353 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 352 transition count 298
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 37 place count 352 transition count 292
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 49 place count 346 transition count 292
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 55 place count 340 transition count 286
Iterating global reduction 3 with 6 rules applied. Total rules applied 61 place count 340 transition count 286
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 64 place count 340 transition count 283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 65 place count 339 transition count 283
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 69 place count 335 transition count 279
Iterating global reduction 5 with 4 rules applied. Total rules applied 73 place count 335 transition count 279
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 76 place count 335 transition count 276
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 76 place count 335 transition count 274
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 80 place count 333 transition count 274
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 6 with 156 rules applied. Total rules applied 236 place count 255 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 237 place count 255 transition count 195
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 241 place count 253 transition count 200
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 244 place count 253 transition count 197
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 247 place count 250 transition count 197
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 248 place count 250 transition count 196
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 250 place count 250 transition count 196
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 251 place count 249 transition count 195
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 252 place count 248 transition count 195
Applied a total of 252 rules in 144 ms. Remains 248 /372 variables (removed 124) and now considering 195/320 (removed 125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 248/372 places, 195/320 transitions.
RANDOM walk for 40000 steps (1633 resets) in 563 ms. (70 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (21 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (26 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (27 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (26 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (33 resets) in 10 ms. (363 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (28 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (25 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (24 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (29 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (29 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (22 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (23 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (30 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (24 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (28 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (33 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 740266 steps, run timeout after 3001 ms. (steps per millisecond=246 ) properties seen :10 out of 16
Probabilistic random walk after 740266 steps, saw 118337 distinct states, run finished after 3005 ms. (steps per millisecond=246 ) properties seen :10
// Phase 1: matrix 195 rows 248 cols
[2024-05-21 19:41:15] [INFO ] Computed 63 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 18/31 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 152/183 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 31/214 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 22/236 variables, 15/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 6/242 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 195/437 variables, 242/302 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 6/443 variables, 6/308 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/443 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/443 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/443 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 443/443 variables, and 311 constraints, problems are : Problem set: 0 solved, 6 unsolved in 556 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 248/248 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/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 18/31 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 152/183 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 31/214 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 19:41:16] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 22/236 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 6/242 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 195/437 variables, 242/303 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 5/308 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 19:41:17] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/437 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/437 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 6/443 variables, 6/315 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/443 variables, 3/318 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/443 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/443 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/443 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 443/443 variables, and 319 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1369 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
After SMT, in 1945ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 9038 ms.
Support contains 13 out of 248 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 248/248 places, 195/195 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 248 transition count 194
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 247 transition count 194
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 246 transition count 193
Applied a total of 4 rules in 21 ms. Remains 246 /248 variables (removed 2) and now considering 193/195 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 246/248 places, 193/195 transitions.
RANDOM walk for 40000 steps (1642 resets) in 244 ms. (163 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (275 resets) in 131 ms. (303 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (295 resets) in 128 ms. (310 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (293 resets) in 119 ms. (333 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (253 resets) in 112 ms. (354 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (291 resets) in 111 ms. (357 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (289 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 95413 steps, run visited all 6 properties in 588 ms. (steps per millisecond=162 )
Probabilistic random walk after 95413 steps, saw 31556 distinct states, run finished after 591 ms. (steps per millisecond=161 ) properties seen :6
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA DES-PT-30b-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 19:41:27] [INFO ] Flatten gal took : 17 ms
[2024-05-21 19:41:27] [INFO ] Flatten gal took : 19 ms
[2024-05-21 19:41:27] [INFO ] Input system was already deterministic with 320 transitions.
Computed a total of 181 stabilizing places and 173 stable transitions
Graph (complete) has 807 edges and 372 vertex of which 365 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.11 ms
Starting structural reductions in LTL mode, iteration 0 : 372/372 places, 320/320 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 361 transition count 309
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 361 transition count 309
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 361 transition count 308
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 29 place count 355 transition count 302
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 355 transition count 302
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 40 place count 355 transition count 297
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 354 transition count 296
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 354 transition count 296
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 354 transition count 295
Applied a total of 43 rules in 30 ms. Remains 354 /372 variables (removed 18) and now considering 295/320 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 354/372 places, 295/320 transitions.
[2024-05-21 19:41:27] [INFO ] Flatten gal took : 16 ms
[2024-05-21 19:41:27] [INFO ] Flatten gal took : 15 ms
[2024-05-21 19:41:27] [INFO ] Input system was already deterministic with 295 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 372/372 places, 320/320 transitions.
Graph (complete) has 807 edges and 372 vertex of which 365 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
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 365 transition count 301
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 350 transition count 301
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 350 transition count 291
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 51 place count 340 transition count 291
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 59 place count 332 transition count 283
Iterating global reduction 2 with 8 rules applied. Total rules applied 67 place count 332 transition count 283
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 332 transition count 280
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 71 place count 331 transition count 280
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 76 place count 326 transition count 275
Iterating global reduction 4 with 5 rules applied. Total rules applied 81 place count 326 transition count 275
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 86 place count 326 transition count 270
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 88 place count 325 transition count 269
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 88 place count 325 transition count 267
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 92 place count 323 transition count 267
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 6 with 142 rules applied. Total rules applied 234 place count 252 transition count 196
Applied a total of 234 rules in 72 ms. Remains 252 /372 variables (removed 120) and now considering 196/320 (removed 124) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 73 ms. Remains : 252/372 places, 196/320 transitions.
[2024-05-21 19:41:28] [INFO ] Flatten gal took : 12 ms
[2024-05-21 19:41:28] [INFO ] Flatten gal took : 14 ms
[2024-05-21 19:41:28] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 372/372 places, 320/320 transitions.
Graph (complete) has 807 edges and 372 vertex of which 366 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 365 transition count 302
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 351 transition count 301
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 350 transition count 301
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 31 place count 350 transition count 291
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 51 place count 340 transition count 291
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 60 place count 331 transition count 282
Iterating global reduction 3 with 9 rules applied. Total rules applied 69 place count 331 transition count 282
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 72 place count 331 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 330 transition count 279
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 79 place count 324 transition count 273
Iterating global reduction 5 with 6 rules applied. Total rules applied 85 place count 324 transition count 273
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 6 rules applied. Total rules applied 91 place count 324 transition count 267
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 93 place count 323 transition count 266
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 93 place count 323 transition count 263
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 99 place count 320 transition count 263
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 7 with 134 rules applied. Total rules applied 233 place count 253 transition count 196
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 234 place count 253 transition count 196
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 236 place count 251 transition count 194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 237 place count 250 transition count 194
Applied a total of 237 rules in 88 ms. Remains 250 /372 variables (removed 122) and now considering 194/320 (removed 126) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 88 ms. Remains : 250/372 places, 194/320 transitions.
[2024-05-21 19:41:28] [INFO ] Flatten gal took : 11 ms
[2024-05-21 19:41:28] [INFO ] Flatten gal took : 12 ms
[2024-05-21 19:41:28] [INFO ] Input system was already deterministic with 194 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 372/372 places, 320/320 transitions.
Graph (complete) has 807 edges and 372 vertex of which 365 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 364 transition count 300
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 349 transition count 300
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 349 transition count 290
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 339 transition count 290
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 59 place count 331 transition count 282
Iterating global reduction 2 with 8 rules applied. Total rules applied 67 place count 331 transition count 282
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 331 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 71 place count 330 transition count 279
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 76 place count 325 transition count 274
Iterating global reduction 4 with 5 rules applied. Total rules applied 81 place count 325 transition count 274
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 86 place count 325 transition count 269
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 88 place count 324 transition count 268
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 88 place count 324 transition count 266
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 92 place count 322 transition count 266
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 6 with 142 rules applied. Total rules applied 234 place count 251 transition count 195
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 236 place count 249 transition count 193
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 237 place count 248 transition count 193
Applied a total of 237 rules in 71 ms. Remains 248 /372 variables (removed 124) and now considering 193/320 (removed 127) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 71 ms. Remains : 248/372 places, 193/320 transitions.
[2024-05-21 19:41:28] [INFO ] Flatten gal took : 11 ms
[2024-05-21 19:41:28] [INFO ] Flatten gal took : 12 ms
[2024-05-21 19:41:28] [INFO ] Input system was already deterministic with 193 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 372/372 places, 320/320 transitions.
Graph (complete) has 807 edges and 372 vertex of which 365 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 364 transition count 300
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 349 transition count 300
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 349 transition count 290
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 51 place count 339 transition count 290
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 60 place count 330 transition count 281
Iterating global reduction 2 with 9 rules applied. Total rules applied 69 place count 330 transition count 281
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 330 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 73 place count 329 transition count 278
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 79 place count 323 transition count 272
Iterating global reduction 4 with 6 rules applied. Total rules applied 85 place count 323 transition count 272
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 6 rules applied. Total rules applied 91 place count 323 transition count 266
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 93 place count 322 transition count 265
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 93 place count 322 transition count 262
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 99 place count 319 transition count 262
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 6 with 142 rules applied. Total rules applied 241 place count 248 transition count 191
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 243 place count 246 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 244 place count 245 transition count 189
Applied a total of 244 rules in 69 ms. Remains 245 /372 variables (removed 127) and now considering 189/320 (removed 131) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 69 ms. Remains : 245/372 places, 189/320 transitions.
[2024-05-21 19:41:28] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:41:28] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:41:28] [INFO ] Input system was already deterministic with 189 transitions.
RANDOM walk for 40000 steps (1303 resets) in 269 ms. (148 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (242 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1614583 steps, run timeout after 3001 ms. (steps per millisecond=538 ) properties seen :0 out of 1
Probabilistic random walk after 1614583 steps, saw 219812 distinct states, run finished after 3016 ms. (steps per millisecond=535 ) properties seen :0
// Phase 1: matrix 189 rows 245 cols
[2024-05-21 19:41:31] [INFO ] Computed 58 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 126/127 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 34/161 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/190 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/197 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 147/344 variables, 197/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/344 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 20/364 variables, 11/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/364 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/364 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/365 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/365 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/365 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 39/404 variables, 6/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/404 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/404 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 30/434 variables, 30/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/434 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/434 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 126/127 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/161 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 19:41:31] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 29/190 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/197 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 147/344 variables, 197/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/344 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/344 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 20/364 variables, 11/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/364 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/364 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/365 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/365 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/365 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 39/404 variables, 6/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/404 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/404 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 30/434 variables, 30/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/434 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/434 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 305 constraints, problems are : Problem set: 0 solved, 1 unsolved in 233 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 453ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 61 ms.
Support contains 1 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 189/189 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 245 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 243 transition count 185
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 239 transition count 181
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 18 place count 237 transition count 183
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 237 transition count 182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 236 transition count 182
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 21 place count 236 transition count 182
Applied a total of 21 rules in 22 ms. Remains 236 /245 variables (removed 9) and now considering 182/189 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 236/245 places, 182/189 transitions.
RANDOM walk for 4000000 steps (190916 resets) in 8605 ms. (464 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (36491 resets) in 3853 ms. (1037 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4921675 steps, run timeout after 9001 ms. (steps per millisecond=546 ) properties seen :0 out of 1
Probabilistic random walk after 4921675 steps, saw 676596 distinct states, run finished after 9001 ms. (steps per millisecond=546 ) properties seen :0
// Phase 1: matrix 182 rows 236 cols
[2024-05-21 19:41:44] [INFO ] Computed 60 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 124/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/162 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/187 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/194 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 148/342 variables, 194/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/355 variables, 8/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 3/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/355 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/357 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/357 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/357 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 32/389 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/389 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/389 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 29/418 variables, 29/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/418 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/418 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 296 constraints, problems are : Problem set: 0 solved, 1 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 124/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/162 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 19:41:44] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/187 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/194 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 148/342 variables, 194/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/355 variables, 8/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/357 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/357 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/357 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 32/389 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/389 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/389 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 29/418 variables, 29/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/418 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/418 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 298 constraints, problems are : Problem set: 0 solved, 1 unsolved in 232 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 417ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 62 ms.
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 5 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 236/236 places, 182/182 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2024-05-21 19:41:44] [INFO ] Invariant cache hit.
[2024-05-21 19:41:44] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-21 19:41:44] [INFO ] Invariant cache hit.
[2024-05-21 19:41:45] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2024-05-21 19:41:45] [INFO ] Redundant transitions in 6 ms returned []
Running 179 sub problems to find dead transitions.
[2024-05-21 19:41:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 179 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/235 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 182/417 variables, 235/295 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 19:41:47] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-21 19:41:47] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-21 19:41:48] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-05-21 19:41:48] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2024-05-21 19:41:48] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 5/300 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 1/418 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 19:41:51] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 11 (OVERLAPS) 0/418 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 302 constraints, problems are : Problem set: 0 solved, 179 unsolved in 10345 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 2/235 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 19:41:57] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 182/417 variables, 235/302 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 179/481 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (OVERLAPS) 1/418 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 19:42:25] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/418 variables, and 483 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 8/8 constraints]
After SMT, in 40445ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 40447ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40833 ms. Remains : 236/236 places, 182/182 transitions.
RANDOM walk for 400000 steps (19191 resets) in 2318 ms. (172 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-05-21 19:42:26] [INFO ] Invariant cache hit.
[2024-05-21 19:42:26] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-21 19:42:26] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-21 19:42:26] [INFO ] After 73ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 19:42:26] [INFO ] After 101ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-21 19:42:26] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (191080 resets) in 8766 ms. (456 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000001 steps (36374 resets) in 3722 ms. (1074 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4810602 steps, run timeout after 9001 ms. (steps per millisecond=534 ) properties seen :0 out of 1
Probabilistic random walk after 4810602 steps, saw 661298 distinct states, run finished after 9004 ms. (steps per millisecond=534 ) properties seen :0
[2024-05-21 19:42:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 124/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/162 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/187 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/194 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 148/342 variables, 194/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/355 variables, 8/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 3/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/355 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/357 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/357 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/357 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 32/389 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/389 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/389 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 29/418 variables, 29/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/418 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/418 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 296 constraints, problems are : Problem set: 0 solved, 1 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 124/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/162 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/187 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/194 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 148/342 variables, 194/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 13/355 variables, 8/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/355 variables, 3/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/357 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/357 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/357 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 32/389 variables, 3/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/389 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/389 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 29/418 variables, 29/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/418 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/418 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 297 constraints, problems are : Problem set: 0 solved, 1 unsolved in 238 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 426ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 67 ms.
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 236/236 places, 182/182 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2024-05-21 19:42:39] [INFO ] Invariant cache hit.
[2024-05-21 19:42:39] [INFO ] Implicit Places using invariants in 223 ms returned []
[2024-05-21 19:42:39] [INFO ] Invariant cache hit.
[2024-05-21 19:42:39] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
[2024-05-21 19:42:39] [INFO ] Redundant transitions in 7 ms returned []
Running 179 sub problems to find dead transitions.
[2024-05-21 19:42:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 179 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/235 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 182/417 variables, 235/295 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 19:42:42] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 2 ms to minimize.
[2024-05-21 19:42:42] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-21 19:42:42] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-21 19:42:43] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-21 19:42:43] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 5/300 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 1/418 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 19:42:45] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 11 (OVERLAPS) 0/418 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 302 constraints, problems are : Problem set: 0 solved, 179 unsolved in 10366 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 2/235 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 19:42:51] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 182/417 variables, 235/302 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 179/481 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (OVERLAPS) 1/418 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 19:43:20] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
SMT process timed out in 40486ms, After SMT, problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 40488ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40961 ms. Remains : 236/236 places, 182/182 transitions.
RANDOM walk for 400000 steps (19138 resets) in 1096 ms. (364 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-05-21 19:43:20] [INFO ] Invariant cache hit.
[2024-05-21 19:43:20] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 19:43:20] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-21 19:43:20] [INFO ] After 61ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 19:43:20] [INFO ] After 75ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-21 19:43:20] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
RANDOM walk for 40000 steps (1954 resets) in 137 ms. (289 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (340 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1575516 steps, run timeout after 3001 ms. (steps per millisecond=524 ) properties seen :0 out of 1
Probabilistic random walk after 1575516 steps, saw 218013 distinct states, run finished after 3001 ms. (steps per millisecond=524 ) properties seen :0
[2024-05-21 19:43:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 124/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/162 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/187 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/194 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 148/342 variables, 194/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/355 variables, 8/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 3/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/355 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/357 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/357 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/357 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 32/389 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/389 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/389 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 29/418 variables, 29/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/418 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/418 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 296 constraints, problems are : Problem set: 0 solved, 1 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 124/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/162 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/187 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/194 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 148/342 variables, 194/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 13/355 variables, 8/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/355 variables, 3/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/357 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/357 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/357 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 32/389 variables, 3/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/389 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/389 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 29/418 variables, 29/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/418 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/418 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 297 constraints, problems are : Problem set: 0 solved, 1 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 334ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 69 ms.
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 5 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 236/236 places, 182/182 transitions.
RANDOM walk for 40000 steps (1886 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (357 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1586474 steps, run timeout after 3001 ms. (steps per millisecond=528 ) properties seen :0 out of 1
Probabilistic random walk after 1586474 steps, saw 219458 distinct states, run finished after 3001 ms. (steps per millisecond=528 ) properties seen :0
[2024-05-21 19:43:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 124/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/162 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/187 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/194 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 148/342 variables, 194/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/355 variables, 8/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 3/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/355 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/357 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/357 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/357 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 32/389 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/389 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/389 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 29/418 variables, 29/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/418 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/418 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 296 constraints, problems are : Problem set: 0 solved, 1 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 124/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/162 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/187 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/194 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 148/342 variables, 194/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 13/355 variables, 8/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/355 variables, 3/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/357 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/357 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/357 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 32/389 variables, 3/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/389 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/389 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 29/418 variables, 29/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/418 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/418 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 297 constraints, problems are : Problem set: 0 solved, 1 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 379ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 69 ms.
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 236/236 places, 182/182 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2024-05-21 19:43:27] [INFO ] Invariant cache hit.
[2024-05-21 19:43:27] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-21 19:43:27] [INFO ] Invariant cache hit.
[2024-05-21 19:43:28] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2024-05-21 19:43:28] [INFO ] Redundant transitions in 1 ms returned []
Running 179 sub problems to find dead transitions.
[2024-05-21 19:43:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 179 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/235 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 182/417 variables, 235/295 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 19:43:30] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 19:43:30] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-21 19:43:31] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-21 19:43:31] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-21 19:43:31] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 5/300 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 1/418 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 19:43:34] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 11 (OVERLAPS) 0/418 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 302 constraints, problems are : Problem set: 0 solved, 179 unsolved in 10833 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 2/235 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 19:43:40] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 182/417 variables, 235/302 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 179/481 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (OVERLAPS) 1/418 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 19:44:08] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/418 variables, and 483 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 8/8 constraints]
After SMT, in 40919ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 40921ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41280 ms. Remains : 236/236 places, 182/182 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 236 transition count 182
Applied a total of 1 rules in 8 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 182 rows 236 cols
[2024-05-21 19:44:09] [INFO ] Computed 60 invariants in 2 ms
[2024-05-21 19:44:09] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-21 19:44:09] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-21 19:44:09] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 19:44:09] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 19:44:09] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-21 19:44:09] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 19:44:09] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 19:44:09] [INFO ] After 163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 262 ms.
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 236 transition count 182
Applied a total of 1 rules in 7 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-21 19:44:09] [INFO ] Invariant cache hit.
[2024-05-21 19:44:09] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-21 19:44:09] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-21 19:44:09] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 19:44:09] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-21 19:44:09] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-21 19:44:09] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 19:44:09] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 19:44:09] [INFO ] After 148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 243 ms.
Starting structural reductions in LTL mode, iteration 0 : 372/372 places, 320/320 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 362 transition count 310
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 362 transition count 310
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 362 transition count 309
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 356 transition count 303
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 356 transition count 303
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 38 place count 356 transition count 298
Applied a total of 38 rules in 14 ms. Remains 356 /372 variables (removed 16) and now considering 298/320 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 356/372 places, 298/320 transitions.
[2024-05-21 19:44:09] [INFO ] Flatten gal took : 12 ms
[2024-05-21 19:44:09] [INFO ] Flatten gal took : 12 ms
[2024-05-21 19:44:09] [INFO ] Input system was already deterministic with 298 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 372/372 places, 320/320 transitions.
Graph (complete) has 807 edges and 372 vertex of which 366 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 365 transition count 301
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 350 transition count 301
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 350 transition count 291
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 51 place count 340 transition count 291
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 60 place count 331 transition count 282
Iterating global reduction 2 with 9 rules applied. Total rules applied 69 place count 331 transition count 282
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 331 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 73 place count 330 transition count 279
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 79 place count 324 transition count 273
Iterating global reduction 4 with 6 rules applied. Total rules applied 85 place count 324 transition count 273
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 6 rules applied. Total rules applied 91 place count 324 transition count 267
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 93 place count 323 transition count 266
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 93 place count 323 transition count 263
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 99 place count 320 transition count 263
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 6 with 140 rules applied. Total rules applied 239 place count 250 transition count 193
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 240 place count 250 transition count 193
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 242 place count 248 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 243 place count 247 transition count 191
Applied a total of 243 rules in 44 ms. Remains 247 /372 variables (removed 125) and now considering 191/320 (removed 129) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44 ms. Remains : 247/372 places, 191/320 transitions.
[2024-05-21 19:44:09] [INFO ] Flatten gal took : 13 ms
[2024-05-21 19:44:09] [INFO ] Flatten gal took : 23 ms
[2024-05-21 19:44:09] [INFO ] Input system was already deterministic with 191 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 372/372 places, 320/320 transitions.
Graph (complete) has 807 edges and 372 vertex of which 365 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 364 transition count 300
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 349 transition count 300
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 349 transition count 290
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 51 place count 339 transition count 290
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 59 place count 331 transition count 282
Iterating global reduction 2 with 8 rules applied. Total rules applied 67 place count 331 transition count 282
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 331 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 71 place count 330 transition count 279
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 76 place count 325 transition count 274
Iterating global reduction 4 with 5 rules applied. Total rules applied 81 place count 325 transition count 274
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 86 place count 325 transition count 269
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 88 place count 324 transition count 268
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 88 place count 324 transition count 266
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 92 place count 322 transition count 266
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 6 with 136 rules applied. Total rules applied 228 place count 254 transition count 198
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 230 place count 252 transition count 196
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 231 place count 251 transition count 196
Applied a total of 231 rules in 39 ms. Remains 251 /372 variables (removed 121) and now considering 196/320 (removed 124) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 251/372 places, 196/320 transitions.
[2024-05-21 19:44:09] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:44:09] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:44:09] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 372/372 places, 320/320 transitions.
Graph (complete) has 807 edges and 372 vertex of which 366 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 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 365 transition count 302
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 351 transition count 301
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 350 transition count 301
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 31 place count 350 transition count 292
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 49 place count 341 transition count 292
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 57 place count 333 transition count 284
Iterating global reduction 3 with 8 rules applied. Total rules applied 65 place count 333 transition count 284
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 68 place count 333 transition count 281
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 69 place count 332 transition count 281
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 74 place count 327 transition count 276
Iterating global reduction 5 with 5 rules applied. Total rules applied 79 place count 327 transition count 276
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 83 place count 327 transition count 272
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 83 place count 327 transition count 269
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 89 place count 324 transition count 269
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 6 with 142 rules applied. Total rules applied 231 place count 253 transition count 198
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 232 place count 253 transition count 197
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 233 place count 253 transition count 197
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 235 place count 251 transition count 195
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 236 place count 250 transition count 195
Applied a total of 236 rules in 48 ms. Remains 250 /372 variables (removed 122) and now considering 195/320 (removed 125) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 49 ms. Remains : 250/372 places, 195/320 transitions.
[2024-05-21 19:44:09] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:44:09] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:44:09] [INFO ] Input system was already deterministic with 195 transitions.
Starting structural reductions in LTL mode, iteration 0 : 372/372 places, 320/320 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 363 transition count 311
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 363 transition count 311
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 363 transition count 309
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 359 transition count 305
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 359 transition count 305
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 32 place count 359 transition count 301
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 358 transition count 300
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 358 transition count 300
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 358 transition count 299
Applied a total of 35 rules in 16 ms. Remains 358 /372 variables (removed 14) and now considering 299/320 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 358/372 places, 299/320 transitions.
[2024-05-21 19:44:09] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:44:09] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:44:09] [INFO ] Input system was already deterministic with 299 transitions.
Starting structural reductions in LTL mode, iteration 0 : 372/372 places, 320/320 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 361 transition count 309
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 361 transition count 309
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 361 transition count 307
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 355 transition count 301
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 355 transition count 301
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 41 place count 355 transition count 296
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 354 transition count 295
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 354 transition count 295
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 354 transition count 294
Applied a total of 44 rules in 18 ms. Remains 354 /372 variables (removed 18) and now considering 294/320 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 354/372 places, 294/320 transitions.
[2024-05-21 19:44:09] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:44:09] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:44:09] [INFO ] Input system was already deterministic with 294 transitions.
[2024-05-21 19:44:09] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:44:09] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:44:09] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-21 19:44:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 372 places, 320 transitions and 1067 arcs took 3 ms.
Total runtime 248654 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DES-PT-30b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/405/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 372
TRANSITIONS: 320
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.004s, Sys 0.003s]


SAVING FILE /home/mcc/execution/405/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.001s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1016
MODEL NAME: /home/mcc/execution/405/model
372 places, 320 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DES-PT-30b-CTLCardinality-2024-02 CANNOT_COMPUTE
FORMULA DES-PT-30b-CTLCardinality-2024-03 CANNOT_COMPUTE
FORMULA DES-PT-30b-CTLCardinality-2024-04 CANNOT_COMPUTE
FORMULA DES-PT-30b-CTLCardinality-2024-05 CANNOT_COMPUTE
FORMULA DES-PT-30b-CTLCardinality-2024-06 CANNOT_COMPUTE
FORMULA DES-PT-30b-CTLCardinality-2024-08 CANNOT_COMPUTE
FORMULA DES-PT-30b-CTLCardinality-2024-09 CANNOT_COMPUTE
FORMULA DES-PT-30b-CTLCardinality-2024-11 CANNOT_COMPUTE
FORMULA DES-PT-30b-CTLCardinality-2023-13 CANNOT_COMPUTE
FORMULA DES-PT-30b-CTLCardinality-2023-14 CANNOT_COMPUTE
FORMULA DES-PT-30b-CTLCardinality-2023-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716321906979

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

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

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-30b"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is DES-PT-30b, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r091-tall-171624188300705"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-30b.tgz
mv DES-PT-30b execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;