MCC'2024- Execution of r480-tall-171624189900722

About the Execution of LTSMin+red for DES-PT-40b

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
840.119	503925.00	605681.00	1365.10	????T???????????	normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r480-tall-171624189900722.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 ltsminxred
Input is DES-PT-40b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189900722
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 08:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 08:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 12 08:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 08:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 115K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717196215797

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-40b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:56:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 22:56:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:56:57] [INFO ] Load time of PNML (sax parser for PT used): 134 ms
[2024-05-31 22:56:57] [INFO ] Transformed 439 places.
[2024-05-31 22:56:57] [INFO ] Transformed 390 transitions.
[2024-05-31 22:56:57] [INFO ] Found NUPN structural information;
[2024-05-31 22:56:57] [INFO ] Parsed PT model containing 439 places and 390 transitions and 1303 arcs in 291 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 23 ms.
Support contains 119 out of 439 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 390/390 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 436 transition count 390
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 21 place count 418 transition count 372
Iterating global reduction 1 with 18 rules applied. Total rules applied 39 place count 418 transition count 372
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 47 place count 410 transition count 364
Iterating global reduction 1 with 8 rules applied. Total rules applied 55 place count 410 transition count 364
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 60 place count 410 transition count 359
Applied a total of 60 rules in 113 ms. Remains 410 /439 variables (removed 29) and now considering 359/390 (removed 31) transitions.
// Phase 1: matrix 359 rows 410 cols
[2024-05-31 22:56:57] [INFO ] Computed 62 invariants in 37 ms
[2024-05-31 22:56:58] [INFO ] Implicit Places using invariants in 569 ms returned []
[2024-05-31 22:56:58] [INFO ] Invariant cache hit.
[2024-05-31 22:56:58] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 1036 ms to find 0 implicit places.
Running 358 sub problems to find dead transitions.
[2024-05-31 22:56:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (OVERLAPS) 1/410 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 358 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 5 (OVERLAPS) 359/769 variables, 410/472 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-05-31 22:57:08] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 31 ms to minimize.
[2024-05-31 22:57:08] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 4 ms to minimize.
[2024-05-31 22:57:09] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
[2024-05-31 22:57:09] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:57:12] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 5/477 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-05-31 22:57:16] [INFO ] Deduced a trap composed of 45 places in 116 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/769 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-05-31 22:57:19] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 2 ms to minimize.
[2024-05-31 22:57:22] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 2 ms to minimize.
[2024-05-31 22:57:22] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:57:22] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
[2024-05-31 22:57:22] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:57:22] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:57:22] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:57:22] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:57:23] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/769 variables, 9/487 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-05-31 22:57:25] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:57:26] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 2 ms to minimize.
[2024-05-31 22:57:27] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 2 ms to minimize.
[2024-05-31 22:57:27] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 2 ms to minimize.
[2024-05-31 22:57:27] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 2 ms to minimize.
[2024-05-31 22:57:27] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:57:27] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 15 ms to minimize.
[2024-05-31 22:57:28] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 769/769 variables, and 495 constraints, problems are : Problem set: 0 solved, 358 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 358/358 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 358 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (OVERLAPS) 1/410 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-05-31 22:57:32] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 2 ms to minimize.
[2024-05-31 22:57:32] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:57:32] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 1 ms to minimize.
[2024-05-31 22:57:32] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 1 ms to minimize.
[2024-05-31 22:57:33] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2024-05-31 22:57:33] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:57:33] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-05-31 22:57:33] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:57:33] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:57:33] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:57:33] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:57:33] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 3 ms to minimize.
[2024-05-31 22:57:34] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:57:34] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2024-05-31 22:57:36] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:57:36] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:57:36] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:57:36] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:57:36] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:57:36] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-05-31 22:57:37] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 2 ms to minimize.
[2024-05-31 22:57:37] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-05-31 22:57:37] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 2 ms to minimize.
[2024-05-31 22:57:37] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 2 ms to minimize.
[2024-05-31 22:57:38] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-05-31 22:57:38] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 2 ms to minimize.
[2024-05-31 22:57:38] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 2 ms to minimize.
[2024-05-31 22:57:38] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 2 ms to minimize.
[2024-05-31 22:57:40] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 9/114 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-05-31 22:57:41] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:57:42] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 2 ms to minimize.
[2024-05-31 22:57:43] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 2 ms to minimize.
[2024-05-31 22:57:43] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 2 ms to minimize.
[2024-05-31 22:57:43] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-05-31 22:57:43] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-05-31 22:57:45] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:57:45] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:57:45] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 9/123 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-05-31 22:57:46] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:57:46] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:57:46] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-05-31 22:57:51] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:57:52] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:57:52] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 3/129 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-05-31 22:57:57] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:57:58] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:57:58] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:57:58] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 2 ms to minimize.
[2024-05-31 22:57:58] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 5 ms to minimize.
[2024-05-31 22:57:58] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/769 variables, and 135 constraints, problems are : Problem set: 0 solved, 358 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/410 constraints, PredecessorRefiner: 0/358 constraints, Known Traps: 73/73 constraints]
After SMT, in 60300ms problems are : Problem set: 0 solved, 358 unsolved
Search for dead transitions found 0 dead transitions in 60323ms
Starting structural reductions in LTL mode, iteration 1 : 410/439 places, 359/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61496 ms. Remains : 410/439 places, 359/390 transitions.
Support contains 119 out of 410 places after structural reductions.
[2024-05-31 22:57:59] [INFO ] Flatten gal took : 59 ms
[2024-05-31 22:57:59] [INFO ] Flatten gal took : 27 ms
[2024-05-31 22:57:59] [INFO ] Input system was already deterministic with 359 transitions.
Reduction of identical properties reduced properties to check from 96 to 94
RANDOM walk for 40000 steps (334 resets) in 2452 ms. (16 steps per ms) remains 44/94 properties
BEST_FIRST walk for 4003 steps (8 resets) in 70 ms. (56 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 44/44 properties
[2024-05-31 22:58:00] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 102/163 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 55/218 variables, 17/33 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 171/389 variables, 27/60 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 4/393 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Problem AtomicPropp26 is UNSAT
At refinement iteration 9 (OVERLAPS) 345/738 variables, 393/455 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/738 variables, 0/455 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 11 (OVERLAPS) 22/760 variables, 12/467 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/760 variables, 0/467 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 13 (OVERLAPS) 5/765 variables, 3/470 constraints. Problems are: Problem set: 1 solved, 43 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/769 variables, and 470 constraints, problems are : Problem set: 1 solved, 43 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 408/410 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 102/161 variables, 16/16 constraints. Problems are: Problem set: 1 solved, 43 unsolved
[2024-05-31 22:58:06] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:58:06] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 2/18 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 55/216 variables, 17/35 constraints. Problems are: Problem set: 1 solved, 43 unsolved
[2024-05-31 22:58:06] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 1/36 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 173/389 variables, 27/63 constraints. Problems are: Problem set: 1 solved, 43 unsolved
[2024-05-31 22:58:07] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:58:07] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 2/65 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 10 (OVERLAPS) 4/393 variables, 2/67 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/393 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 12 (OVERLAPS) 345/738 variables, 393/460 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/738 variables, 42/502 constraints. Problems are: Problem set: 1 solved, 43 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 738/769 variables, and 502 constraints, problems are : Problem set: 1 solved, 43 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/410 constraints, PredecessorRefiner: 42/44 constraints, Known Traps: 5/5 constraints]
After SMT, in 10083ms problems are : Problem set: 1 solved, 43 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 59 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 359/359 transitions.
Graph (complete) has 922 edges and 410 vertex of which 404 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.9 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 404 transition count 345
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 394 transition count 344
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 393 transition count 344
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 24 place count 393 transition count 335
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 42 place count 384 transition count 335
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 50 place count 376 transition count 327
Iterating global reduction 3 with 8 rules applied. Total rules applied 58 place count 376 transition count 327
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 62 place count 376 transition count 323
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 64 place count 374 transition count 321
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 374 transition count 321
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 70 place count 374 transition count 317
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 73 place count 372 transition count 316
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 6 with 128 rules applied. Total rules applied 201 place count 308 transition count 252
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
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 207 place count 305 transition count 255
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 208 place count 305 transition count 254
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 209 place count 304 transition count 254
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 210 place count 304 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 211 place count 303 transition count 253
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 213 place count 303 transition count 253
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 214 place count 302 transition count 252
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 215 place count 301 transition count 252
Applied a total of 215 rules in 181 ms. Remains 301 /410 variables (removed 109) and now considering 252/359 (removed 107) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 301/410 places, 252/359 transitions.
RANDOM walk for 40000 steps (1168 resets) in 1183 ms. (33 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (22 resets) in 30 ms. (129 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (17 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (18 resets) in 29 ms. (133 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (26 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (18 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (20 resets) in 25 ms. (153 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (28 resets) in 22 ms. (174 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (20 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (25 resets) in 25 ms. (153 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (20 resets) in 22 ms. (174 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (23 resets) in 25 ms. (154 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (21 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (21 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (21 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (28 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (21 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (18 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (19 resets) in 29 ms. (133 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (26 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (18 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (22 resets) in 15 ms. (250 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4003 steps (24 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (19 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (23 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (21 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (22 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (20 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (23 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (22 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (21 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (20 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (19 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (18 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (19 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (17 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (23 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (26 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (18 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (19 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (20 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (19 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (19 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
Interrupted probabilistic random walk after 499661 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :0 out of 42
Probabilistic random walk after 499661 steps, saw 72906 distinct states, run finished after 3009 ms. (steps per millisecond=166 ) properties seen :0
// Phase 1: matrix 252 rows 301 cols
[2024-05-31 22:58:14] [INFO ] Computed 59 invariants in 13 ms
[2024-05-31 22:58:14] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 52/108 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 43/151 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 117/268 variables, 24/58 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 1/269 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (OVERLAPS) 252/521 variables, 269/328 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/521 variables, 4/332 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/521 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 12 (OVERLAPS) 32/553 variables, 32/364 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/553 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-31 22:58:18] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/553 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/553 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 16 (OVERLAPS) 0/553 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 365 constraints, problems are : Problem set: 0 solved, 42 unsolved in 6669 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 301/301 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 52/108 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-31 22:58:21] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 43/151 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 117/268 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-31 22:58:22] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (OVERLAPS) 1/269 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 11 (OVERLAPS) 252/521 variables, 269/330 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/521 variables, 4/334 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/521 variables, 28/362 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-31 22:58:29] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 4 ms to minimize.
[2024-05-31 22:58:30] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 2 ms to minimize.
[2024-05-31 22:58:30] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:58:30] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:58:31] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:58:32] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
[2024-05-31 22:58:32] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:58:33] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/521 variables, 8/370 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-31 22:58:39] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:58:40] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/521 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-31 22:58:50] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/521 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/521 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 42 unsolved
SMT process timed out in 51737ms, After SMT, problems are : Problem set: 0 solved, 42 unsolved
Fused 42 Parikh solutions to 31 different solutions.
Parikh walk visited 1 properties in 6862 ms.
Support contains 55 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 252/252 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 298 transition count 249
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 298 transition count 248
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 297 transition count 245
Applied a total of 11 rules in 22 ms. Remains 297 /301 variables (removed 4) and now considering 245/252 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 297/301 places, 245/252 transitions.
RANDOM walk for 40000 steps (1246 resets) in 574 ms. (69 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (20 resets) in 13 ms. (285 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (26 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (24 resets) in 13 ms. (286 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (20 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (16 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (20 resets) in 13 ms. (286 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (26 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (26 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (28 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (21 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (28 resets) in 13 ms. (286 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (21 resets) in 13 ms. (285 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (24 resets) in 13 ms. (285 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (24 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (24 resets) in 13 ms. (285 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (21 resets) in 13 ms. (286 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (20 resets) in 13 ms. (285 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (27 resets) in 20 ms. (190 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (23 resets) in 13 ms. (286 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (24 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (28 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (23 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (26 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (26 resets) in 13 ms. (286 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (22 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (23 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (24 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (23 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (25 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (18 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (24 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (24 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (26 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (29 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (25 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (24 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (24 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (24 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (22 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (20 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (18 resets) in 13 ms. (286 steps per ms) remains 41/41 properties
Interrupted probabilistic random walk after 577926 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :0 out of 41
Probabilistic random walk after 577926 steps, saw 81408 distinct states, run finished after 3001 ms. (steps per millisecond=192 ) properties seen :0
// Phase 1: matrix 245 rows 297 cols
[2024-05-31 22:59:16] [INFO ] Computed 59 invariants in 4 ms
[2024-05-31 22:59:16] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 50/105 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (OVERLAPS) 42/147 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 117/264 variables, 24/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 1/265 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (OVERLAPS) 245/510 variables, 265/324 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 4/328 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/510 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 12 (OVERLAPS) 32/542 variables, 32/360 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-31 22:59:19] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/542 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/542 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 15 (OVERLAPS) 0/542 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 542/542 variables, and 361 constraints, problems are : Problem set: 0 solved, 41 unsolved in 5942 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 297/297 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 50/105 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (OVERLAPS) 42/147 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 117/264 variables, 24/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-31 22:59:23] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (OVERLAPS) 1/265 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (OVERLAPS) 245/510 variables, 265/326 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 4/330 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/510 variables, 27/357 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-31 22:59:27] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2024-05-31 22:59:28] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 2 ms to minimize.
[2024-05-31 22:59:28] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:59:28] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:59:29] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2024-05-31 22:59:29] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:59:30] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-05-31 22:59:31] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/510 variables, 8/365 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-31 22:59:39] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-05-31 22:59:39] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/510 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-31 22:59:50] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-31 22:59:50] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/510 variables, 2/369 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/510 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 18 (OVERLAPS) 32/542 variables, 32/401 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/542 variables, 14/415 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-31 23:00:21] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:00:21] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-31 23:00:21] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/542 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-31 23:00:34] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-31 23:00:35] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/542 variables, 2/420 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 542/542 variables, and 420 constraints, problems are : Problem set: 0 solved, 41 unsolved in 75013 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 297/297 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 19/19 constraints]
After SMT, in 81005ms problems are : Problem set: 0 solved, 41 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 55 out of 297 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 297/297 places, 245/245 transitions.
Applied a total of 0 rules in 8 ms. Remains 297 /297 variables (removed 0) and now considering 245/245 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 297/297 places, 245/245 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 297/297 places, 245/245 transitions.
Applied a total of 0 rules in 7 ms. Remains 297 /297 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-05-31 23:00:37] [INFO ] Invariant cache hit.
[2024-05-31 23:00:38] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-31 23:00:38] [INFO ] Invariant cache hit.
[2024-05-31 23:00:38] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 23:00:38] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
[2024-05-31 23:00:38] [INFO ] Redundant transitions in 8 ms returned []
Running 242 sub problems to find dead transitions.
[2024-05-31 23:00:38] [INFO ] Invariant cache hit.
[2024-05-31 23:00:38] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 3/297 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 14/59 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 245/542 variables, 297/356 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 4/360 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-31 23:00:48] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-31 23:00:48] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/542 variables, 2/362 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/542 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-31 23:00:54] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/542 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-31 23:00:56] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/542 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/542 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 13 (OVERLAPS) 0/542 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 542/542 variables, and 364 constraints, problems are : Problem set: 0 solved, 242 unsolved in 26669 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 297/297 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (OVERLAPS) 3/297 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (OVERLAPS) 245/542 variables, 297/360 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/542 variables, 4/364 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/542 variables, 242/606 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-31 23:01:15] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2024-05-31 23:01:15] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-31 23:01:15] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-31 23:01:15] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-31 23:01:15] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-31 23:01:16] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-31 23:01:18] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:01:18] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 2 ms to minimize.
[2024-05-31 23:01:26] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/542 variables, 9/615 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 542/542 variables, and 615 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 297/297 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 13/13 constraints]
After SMT, in 56816ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 56818ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57421 ms. Remains : 297/297 places, 245/245 transitions.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-05-31 23:01:35] [INFO ] Flatten gal took : 21 ms
[2024-05-31 23:01:35] [INFO ] Flatten gal took : 22 ms
[2024-05-31 23:01:35] [INFO ] Input system was already deterministic with 359 transitions.
Computed a total of 219 stabilizing places and 211 stable transitions
Graph (complete) has 922 edges and 410 vertex of which 402 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.12 ms
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 359/359 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 398 transition count 347
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 398 transition count 347
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 29 place count 398 transition count 342
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 394 transition count 338
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 40 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 393 transition count 334
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 393 transition count 334
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 393 transition count 333
Applied a total of 43 rules in 30 ms. Remains 393 /410 variables (removed 17) and now considering 333/359 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 393/410 places, 333/359 transitions.
[2024-05-31 23:01:35] [INFO ] Flatten gal took : 16 ms
[2024-05-31 23:01:35] [INFO ] Flatten gal took : 17 ms
[2024-05-31 23:01:35] [INFO ] Input system was already deterministic with 333 transitions.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 359/359 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 398 transition count 347
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 398 transition count 347
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 29 place count 398 transition count 342
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 394 transition count 338
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 40 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 393 transition count 334
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 393 transition count 334
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 393 transition count 333
Applied a total of 43 rules in 54 ms. Remains 393 /410 variables (removed 17) and now considering 333/359 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54 ms. Remains : 393/410 places, 333/359 transitions.
[2024-05-31 23:01:35] [INFO ] Flatten gal took : 16 ms
[2024-05-31 23:01:35] [INFO ] Flatten gal took : 17 ms
[2024-05-31 23:01:35] [INFO ] Input system was already deterministic with 333 transitions.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 359/359 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 398 transition count 347
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 398 transition count 347
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 29 place count 398 transition count 342
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 394 transition count 338
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 40 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 393 transition count 334
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 393 transition count 334
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 393 transition count 333
Applied a total of 43 rules in 51 ms. Remains 393 /410 variables (removed 17) and now considering 333/359 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51 ms. Remains : 393/410 places, 333/359 transitions.
[2024-05-31 23:01:35] [INFO ] Flatten gal took : 15 ms
[2024-05-31 23:01:35] [INFO ] Flatten gal took : 15 ms
[2024-05-31 23:01:35] [INFO ] Input system was already deterministic with 333 transitions.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 359/359 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 400 transition count 349
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 400 transition count 349
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 400 transition count 345
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 396 transition count 341
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 396 transition count 341
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 35 place count 396 transition count 338
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 395 transition count 337
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 395 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 395 transition count 336
Applied a total of 38 rules in 48 ms. Remains 395 /410 variables (removed 15) and now considering 336/359 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48 ms. Remains : 395/410 places, 336/359 transitions.
[2024-05-31 23:01:35] [INFO ] Flatten gal took : 13 ms
[2024-05-31 23:01:35] [INFO ] Flatten gal took : 14 ms
[2024-05-31 23:01:35] [INFO ] Input system was already deterministic with 336 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 410/410 places, 359/359 transitions.
Graph (complete) has 922 edges and 410 vertex of which 402 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 401 transition count 338
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 386 transition count 338
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 386 transition count 327
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 375 transition count 327
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 63 place count 365 transition count 317
Iterating global reduction 2 with 10 rules applied. Total rules applied 73 place count 365 transition count 317
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 78 place count 365 transition count 312
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 78 place count 365 transition count 311
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 364 transition count 311
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 83 place count 361 transition count 308
Iterating global reduction 3 with 3 rules applied. Total rules applied 86 place count 361 transition count 308
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 rules applied. Total rules applied 90 place count 361 transition count 304
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 92 place count 360 transition count 303
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 92 place count 360 transition count 302
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 94 place count 359 transition count 302
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 5 with 140 rules applied. Total rules applied 234 place count 289 transition count 232
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 236 place count 287 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 237 place count 286 transition count 230
Applied a total of 237 rules in 88 ms. Remains 286 /410 variables (removed 124) and now considering 230/359 (removed 129) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 88 ms. Remains : 286/410 places, 230/359 transitions.
[2024-05-31 23:01:35] [INFO ] Flatten gal took : 11 ms
[2024-05-31 23:01:35] [INFO ] Flatten gal took : 12 ms
[2024-05-31 23:01:35] [INFO ] Input system was already deterministic with 230 transitions.
RANDOM walk for 1917 steps (58 resets) in 14 ms. (127 steps per ms) remains 0/1 properties
FORMULA DES-PT-40b-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 410/410 places, 359/359 transitions.
Graph (complete) has 922 edges and 410 vertex of which 402 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 401 transition count 338
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 386 transition count 338
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 386 transition count 327
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 375 transition count 327
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 63 place count 365 transition count 317
Iterating global reduction 2 with 10 rules applied. Total rules applied 73 place count 365 transition count 317
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 78 place count 365 transition count 312
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 78 place count 365 transition count 311
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 364 transition count 311
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 83 place count 361 transition count 308
Iterating global reduction 3 with 3 rules applied. Total rules applied 86 place count 361 transition count 308
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 rules applied. Total rules applied 90 place count 361 transition count 304
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 92 place count 360 transition count 303
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 92 place count 360 transition count 302
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 94 place count 359 transition count 302
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 5 with 134 rules applied. Total rules applied 228 place count 292 transition count 235
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 230 place count 290 transition count 233
Applied a total of 230 rules in 73 ms. Remains 290 /410 variables (removed 120) and now considering 233/359 (removed 126) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 74 ms. Remains : 290/410 places, 233/359 transitions.
[2024-05-31 23:01:36] [INFO ] Flatten gal took : 12 ms
[2024-05-31 23:01:36] [INFO ] Flatten gal took : 12 ms
[2024-05-31 23:01:36] [INFO ] Input system was already deterministic with 233 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 410/410 places, 359/359 transitions.
Graph (complete) has 922 edges and 410 vertex of which 402 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 401 transition count 338
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 386 transition count 338
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 386 transition count 328
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 376 transition count 328
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 61 place count 366 transition count 318
Iterating global reduction 2 with 10 rules applied. Total rules applied 71 place count 366 transition count 318
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 76 place count 366 transition count 313
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 76 place count 366 transition count 312
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 365 transition count 312
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 81 place count 362 transition count 309
Iterating global reduction 3 with 3 rules applied. Total rules applied 84 place count 362 transition count 309
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 rules applied. Total rules applied 88 place count 362 transition count 305
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 90 place count 361 transition count 304
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 90 place count 361 transition count 303
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 92 place count 360 transition count 303
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 5 with 142 rules applied. Total rules applied 234 place count 289 transition count 232
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 236 place count 289 transition count 232
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 238 place count 287 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 239 place count 286 transition count 230
Applied a total of 239 rules in 65 ms. Remains 286 /410 variables (removed 124) and now considering 230/359 (removed 129) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 65 ms. Remains : 286/410 places, 230/359 transitions.
[2024-05-31 23:01:36] [INFO ] Flatten gal took : 11 ms
[2024-05-31 23:01:36] [INFO ] Flatten gal took : 11 ms
[2024-05-31 23:01:36] [INFO ] Input system was already deterministic with 230 transitions.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 359/359 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 398 transition count 347
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 398 transition count 347
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 29 place count 398 transition count 342
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 394 transition count 338
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 40 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 393 transition count 334
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 393 transition count 334
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 393 transition count 333
Applied a total of 43 rules in 26 ms. Remains 393 /410 variables (removed 17) and now considering 333/359 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 393/410 places, 333/359 transitions.
[2024-05-31 23:01:36] [INFO ] Flatten gal took : 11 ms
[2024-05-31 23:01:36] [INFO ] Flatten gal took : 12 ms
[2024-05-31 23:01:36] [INFO ] Input system was already deterministic with 333 transitions.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 359/359 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 401 transition count 350
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 401 transition count 350
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 401 transition count 346
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 398 transition count 343
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 398 transition count 343
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 398 transition count 341
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 397 transition count 340
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 397 transition count 340
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 397 transition count 339
Applied a total of 33 rules in 25 ms. Remains 397 /410 variables (removed 13) and now considering 339/359 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 397/410 places, 339/359 transitions.
[2024-05-31 23:01:36] [INFO ] Flatten gal took : 11 ms
[2024-05-31 23:01:36] [INFO ] Flatten gal took : 12 ms
[2024-05-31 23:01:36] [INFO ] Input system was already deterministic with 339 transitions.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 359/359 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 398 transition count 347
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 398 transition count 347
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 29 place count 398 transition count 342
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 394 transition count 338
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 40 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 393 transition count 334
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 393 transition count 334
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 393 transition count 333
Applied a total of 43 rules in 22 ms. Remains 393 /410 variables (removed 17) and now considering 333/359 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 393/410 places, 333/359 transitions.
[2024-05-31 23:01:36] [INFO ] Flatten gal took : 11 ms
[2024-05-31 23:01:36] [INFO ] Flatten gal took : 12 ms
[2024-05-31 23:01:36] [INFO ] Input system was already deterministic with 333 transitions.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 359/359 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 400 transition count 349
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 400 transition count 349
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 25 place count 400 transition count 344
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 397 transition count 341
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 397 transition count 341
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 34 place count 397 transition count 338
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 396 transition count 337
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 396 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 396 transition count 336
Applied a total of 37 rules in 21 ms. Remains 396 /410 variables (removed 14) and now considering 336/359 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 396/410 places, 336/359 transitions.
[2024-05-31 23:01:36] [INFO ] Flatten gal took : 12 ms
[2024-05-31 23:01:36] [INFO ] Flatten gal took : 13 ms
[2024-05-31 23:01:36] [INFO ] Input system was already deterministic with 336 transitions.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 359/359 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 399 transition count 348
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 399 transition count 348
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 27 place count 399 transition count 343
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 397 transition count 341
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 397 transition count 341
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 397 transition count 340
Applied a total of 32 rules in 15 ms. Remains 397 /410 variables (removed 13) and now considering 340/359 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 397/410 places, 340/359 transitions.
[2024-05-31 23:01:36] [INFO ] Flatten gal took : 12 ms
[2024-05-31 23:01:36] [INFO ] Flatten gal took : 12 ms
[2024-05-31 23:01:36] [INFO ] Input system was already deterministic with 340 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 410/410 places, 359/359 transitions.
Graph (complete) has 922 edges and 410 vertex of which 402 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 401 transition count 339
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 387 transition count 339
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 29 place count 387 transition count 327
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 53 place count 375 transition count 327
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 63 place count 365 transition count 317
Iterating global reduction 2 with 10 rules applied. Total rules applied 73 place count 365 transition count 317
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 78 place count 365 transition count 312
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 78 place count 365 transition count 311
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 364 transition count 311
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 83 place count 361 transition count 308
Iterating global reduction 3 with 3 rules applied. Total rules applied 86 place count 361 transition count 308
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 rules applied. Total rules applied 90 place count 361 transition count 304
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 92 place count 360 transition count 303
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 92 place count 360 transition count 302
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 94 place count 359 transition count 302
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 5 with 140 rules applied. Total rules applied 234 place count 289 transition count 232
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 236 place count 287 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 237 place count 286 transition count 230
Applied a total of 237 rules in 60 ms. Remains 286 /410 variables (removed 124) and now considering 230/359 (removed 129) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60 ms. Remains : 286/410 places, 230/359 transitions.
[2024-05-31 23:01:36] [INFO ] Flatten gal took : 25 ms
[2024-05-31 23:01:36] [INFO ] Flatten gal took : 10 ms
[2024-05-31 23:01:36] [INFO ] Input system was already deterministic with 230 transitions.
RANDOM walk for 40000 steps (1244 resets) in 410 ms. (97 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (239 resets) in 137 ms. (289 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1431265 steps, run timeout after 3001 ms. (steps per millisecond=476 ) properties seen :0 out of 1
Probabilistic random walk after 1431265 steps, saw 193624 distinct states, run finished after 3001 ms. (steps per millisecond=476 ) properties seen :0
// Phase 1: matrix 230 rows 286 cols
[2024-05-31 23:01:39] [INFO ] Computed 58 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 61/68 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 148/216 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/222 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/228 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 178/406 variables, 228/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 20/426 variables, 11/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/426 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/427 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/427 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/427 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 49/476 variables, 6/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/476 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/476 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 40/516 variables, 40/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/516 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/516 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 516/516 variables, and 344 constraints, problems are : Problem set: 0 solved, 1 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 61/68 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 148/216 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:01:40] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/222 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/228 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 178/406 variables, 228/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 20/426 variables, 11/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/426 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/427 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/427 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/427 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 49/476 variables, 6/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/476 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/476 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 40/516 variables, 40/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/516 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/516 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 516/516 variables, and 346 constraints, problems are : Problem set: 0 solved, 1 unsolved in 368 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 599ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 135 ms.
Support contains 2 out of 286 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 286/286 places, 230/230 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 286 transition count 226
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 284 transition count 226
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 280 transition count 222
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 278 transition count 224
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 278 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 277 transition count 223
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 277 transition count 223
Applied a total of 21 rules in 32 ms. Remains 277 /286 variables (removed 9) and now considering 223/230 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 277/286 places, 223/230 transitions.
RANDOM walk for 4000000 steps (182439 resets) in 15658 ms. (255 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (35277 resets) in 5149 ms. (776 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 7450582 steps, run timeout after 15001 ms. (steps per millisecond=496 ) properties seen :0 out of 1
Probabilistic random walk after 7450582 steps, saw 1022736 distinct states, run finished after 15002 ms. (steps per millisecond=496 ) properties seen :0
// Phase 1: matrix 223 rows 277 cols
[2024-05-31 23:02:00] [INFO ] Computed 60 invariants in 15 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/66 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 148/214 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/223 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/225 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 179/404 variables, 225/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/417 variables, 8/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/417 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/419 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/419 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/419 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 42/461 variables, 3/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/461 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/461 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 39/500 variables, 39/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/500 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/500 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 337 constraints, problems are : Problem set: 0 solved, 1 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/66 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 148/214 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/223 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/225 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 179/404 variables, 225/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/404 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 13/417 variables, 8/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 3/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:02:01] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/417 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/417 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/419 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/419 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/419 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 42/461 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/461 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/461 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 39/500 variables, 39/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/500 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/500 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 339 constraints, problems are : Problem set: 0 solved, 1 unsolved in 320 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 584ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 111 ms.
Support contains 2 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 223/223 transitions.
Applied a total of 0 rules in 6 ms. Remains 277 /277 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 277/277 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 223/223 transitions.
Applied a total of 0 rules in 5 ms. Remains 277 /277 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-31 23:02:01] [INFO ] Invariant cache hit.
[2024-05-31 23:02:01] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-31 23:02:01] [INFO ] Invariant cache hit.
[2024-05-31 23:02:02] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2024-05-31 23:02:02] [INFO ] Redundant transitions in 12 ms returned []
Running 220 sub problems to find dead transitions.
[2024-05-31 23:02:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 1/275 variables, 25/46 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 220 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/276 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 223/499 variables, 276/336 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-31 23:02:07] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:02:08] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-31 23:02:08] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
[2024-05-31 23:02:09] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-31 23:02:11] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/499 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-31 23:02:13] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-31 23:02:13] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/499 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/499 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 13 (OVERLAPS) 1/500 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-31 23:02:17] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/500 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/500 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-31 23:02:21] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/500 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/500 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-31 23:02:26] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/500 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/500 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 20 (OVERLAPS) 0/500 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 347 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 1/275 variables, 25/54 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 1/276 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 11 (OVERLAPS) 223/499 variables, 276/346 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/499 variables, 220/566 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/499 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 220 unsolved
SMT process timed out in 60142ms, After SMT, problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 60146ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60626 ms. Remains : 277/277 places, 223/223 transitions.
RANDOM walk for 400000 steps (18244 resets) in 2295 ms. (174 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2024-05-31 23:03:02] [INFO ] Invariant cache hit.
[2024-05-31 23:03:02] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-31 23:03:02] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-31 23:03:03] [INFO ] After 82ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 23:03:03] [INFO ] After 109ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-31 23:03:03] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (182598 resets) in 15386 ms. (259 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000002 steps (35259 resets) in 5100 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 7343116 steps, run timeout after 15001 ms. (steps per millisecond=489 ) properties seen :0 out of 1
Probabilistic random walk after 7343116 steps, saw 1007729 distinct states, run finished after 15001 ms. (steps per millisecond=489 ) properties seen :0
[2024-05-31 23:03:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/66 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 148/214 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/223 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/225 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 179/404 variables, 225/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/417 variables, 8/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/417 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/419 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/419 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/419 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 42/461 variables, 3/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/461 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/461 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 39/500 variables, 39/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/500 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/500 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 337 constraints, problems are : Problem set: 0 solved, 1 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/66 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 148/214 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/223 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/225 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 179/404 variables, 225/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/404 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 13/417 variables, 8/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 3/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/417 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/419 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/419 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/419 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 42/461 variables, 3/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/461 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/461 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 39/500 variables, 39/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/500 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/500 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 338 constraints, problems are : Problem set: 0 solved, 1 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 516ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 110 ms.
Support contains 2 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 223/223 transitions.
Applied a total of 0 rules in 6 ms. Remains 277 /277 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 277/277 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 277 /277 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-31 23:03:23] [INFO ] Invariant cache hit.
[2024-05-31 23:03:24] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-31 23:03:24] [INFO ] Invariant cache hit.
[2024-05-31 23:03:24] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
[2024-05-31 23:03:24] [INFO ] Redundant transitions in 2 ms returned []
Running 220 sub problems to find dead transitions.
[2024-05-31 23:03:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 1/275 variables, 25/46 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 220 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/276 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 223/499 variables, 276/336 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-31 23:03:30] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:03:30] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-31 23:03:31] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-31 23:03:31] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-31 23:03:33] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/499 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-31 23:03:35] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-31 23:03:35] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/499 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/499 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 13 (OVERLAPS) 1/500 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-31 23:03:39] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/500 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/500 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-31 23:03:43] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/500 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/500 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-31 23:03:48] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 2 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/500 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/500 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 20 (OVERLAPS) 0/500 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 347 constraints, problems are : Problem set: 0 solved, 220 unsolved in 29957 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 1/275 variables, 25/54 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 1/276 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 11 (OVERLAPS) 223/499 variables, 276/346 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/499 variables, 220/566 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/499 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 220 unsolved
SMT process timed out in 60102ms, After SMT, problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 60105ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60607 ms. Remains : 277/277 places, 223/223 transitions.
RANDOM walk for 400000 steps (18288 resets) in 1515 ms. (263 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2024-05-31 23:04:24] [INFO ] Invariant cache hit.
[2024-05-31 23:04:24] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-31 23:04:25] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-31 23:04:25] [INFO ] After 89ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 23:04:25] [INFO ] After 108ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-31 23:04:25] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
RANDOM walk for 40000 steps (1823 resets) in 166 ms. (239 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (365 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1433473 steps, run timeout after 3001 ms. (steps per millisecond=477 ) properties seen :0 out of 1
Probabilistic random walk after 1433473 steps, saw 199052 distinct states, run finished after 3002 ms. (steps per millisecond=477 ) properties seen :0
[2024-05-31 23:04:28] [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) 155/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 51/207 variables, 31/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/225 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 179/404 variables, 225/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 13/417 variables, 8/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/419 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/419 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/419 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 42/461 variables, 3/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/461 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/461 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 39/500 variables, 39/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/500 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/500 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 337 constraints, problems are : Problem set: 0 solved, 1 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 155/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/207 variables, 31/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/225 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 179/404 variables, 225/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:04:28] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/404 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/417 variables, 8/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 3/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/417 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/419 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/419 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/419 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 42/461 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/461 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/461 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 39/500 variables, 39/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/500 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/500 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 339 constraints, problems are : Problem set: 0 solved, 1 unsolved in 319 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 533ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 93 ms.
Support contains 1 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 223/223 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 276 transition count 222
Applied a total of 1 rules in 9 ms. Remains 276 /277 variables (removed 1) and now considering 222/223 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 276/277 places, 222/223 transitions.
RANDOM walk for 40000 steps (1951 resets) in 281 ms. (141 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (363 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1428283 steps, run timeout after 3001 ms. (steps per millisecond=475 ) properties seen :0 out of 1
Probabilistic random walk after 1428283 steps, saw 198351 distinct states, run finished after 3001 ms. (steps per millisecond=475 ) properties seen :0
// Phase 1: matrix 222 rows 276 cols
[2024-05-31 23:04:31] [INFO ] Computed 60 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 154/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/192 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/217 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/224 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 178/402 variables, 224/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/415 variables, 8/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/415 variables, 3/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/415 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/417 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/417 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 42/459 variables, 3/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/459 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/459 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 39/498 variables, 39/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/498 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/498 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 336 constraints, problems are : Problem set: 0 solved, 1 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 154/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/192 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/217 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/224 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 178/402 variables, 224/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/402 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 13/415 variables, 8/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/415 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/415 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/417 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/417 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/417 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 42/459 variables, 3/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/459 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/459 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 39/498 variables, 39/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/498 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/498 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 498/498 variables, and 337 constraints, problems are : Problem set: 0 solved, 1 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 440ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 91 ms.
Support contains 1 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 276/276 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2024-05-31 23:04:32] [INFO ] Invariant cache hit.
[2024-05-31 23:04:32] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-31 23:04:32] [INFO ] Invariant cache hit.
[2024-05-31 23:04:33] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
[2024-05-31 23:04:33] [INFO ] Redundant transitions in 2 ms returned []
Running 219 sub problems to find dead transitions.
[2024-05-31 23:04:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 219 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/275 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 222/497 variables, 275/335 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-31 23:04:36] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-31 23:04:36] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-31 23:04:37] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-31 23:04:38] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 4/339 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 1/498 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-31 23:04:41] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-31 23:04:41] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-31 23:04:42] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-31 23:04:42] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/498 variables, 4/344 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/498 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 11 (OVERLAPS) 0/498 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 344 constraints, problems are : Problem set: 0 solved, 219 unsolved in 15223 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 2/275 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-31 23:04:50] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 222/497 variables, 275/344 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 219/563 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/497 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 219 unsolved
SMT process timed out in 45352ms, After SMT, problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 45355ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45867 ms. Remains : 276/276 places, 222/222 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 276 transition count 222
Applied a total of 1 rules in 10 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 276 cols
[2024-05-31 23:05:18] [INFO ] Computed 60 invariants in 3 ms
[2024-05-31 23:05:18] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-31 23:05:18] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-31 23:05:18] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 23:05:18] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-31 23:05:18] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-31 23:05:18] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 23:05:18] [INFO ] After 123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 23:05:18] [INFO ] After 202ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 297 ms.
RANDOM walk for 17 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 277 transition count 223
Applied a total of 1 rules in 8 ms. Remains 277 /277 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 223 rows 277 cols
[2024-05-31 23:05:18] [INFO ] Computed 60 invariants in 4 ms
[2024-05-31 23:05:18] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-31 23:05:18] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2024-05-31 23:05:18] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 23:05:18] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-31 23:05:18] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-31 23:05:18] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 23:05:19] [INFO ] After 141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 23:05:19] [INFO ] After 238ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 338 ms.
Starting structural reductions in SI_CTL mode, iteration 0 : 410/410 places, 359/359 transitions.
Graph (complete) has 922 edges and 410 vertex of which 402 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 401 transition count 338
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 386 transition count 338
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 31 place count 386 transition count 329
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 49 place count 377 transition count 329
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 58 place count 368 transition count 320
Iterating global reduction 2 with 9 rules applied. Total rules applied 67 place count 368 transition count 320
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 72 place count 368 transition count 315
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 74 place count 366 transition count 313
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 366 transition count 313
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 78 place count 366 transition count 311
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 78 place count 366 transition count 310
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 80 place count 365 transition count 310
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 4 with 140 rules applied. Total rules applied 220 place count 295 transition count 240
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 221 place count 295 transition count 239
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 223 place count 293 transition count 237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 224 place count 292 transition count 237
Applied a total of 224 rules in 51 ms. Remains 292 /410 variables (removed 118) and now considering 237/359 (removed 122) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51 ms. Remains : 292/410 places, 237/359 transitions.
[2024-05-31 23:05:19] [INFO ] Flatten gal took : 9 ms
[2024-05-31 23:05:19] [INFO ] Flatten gal took : 9 ms
[2024-05-31 23:05:19] [INFO ] Input system was already deterministic with 237 transitions.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 359/359 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 399 transition count 348
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 399 transition count 348
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 27 place count 399 transition count 343
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 396 transition count 340
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 396 transition count 340
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 35 place count 396 transition count 338
Applied a total of 35 rules in 16 ms. Remains 396 /410 variables (removed 14) and now considering 338/359 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 396/410 places, 338/359 transitions.
[2024-05-31 23:05:19] [INFO ] Flatten gal took : 10 ms
[2024-05-31 23:05:19] [INFO ] Flatten gal took : 10 ms
[2024-05-31 23:05:19] [INFO ] Input system was already deterministic with 338 transitions.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 359/359 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 402 transition count 351
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 402 transition count 351
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 402 transition count 349
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 398 transition count 345
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 398 transition count 345
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 29 place count 398 transition count 342
Applied a total of 29 rules in 15 ms. Remains 398 /410 variables (removed 12) and now considering 342/359 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 398/410 places, 342/359 transitions.
[2024-05-31 23:05:19] [INFO ] Flatten gal took : 10 ms
[2024-05-31 23:05:19] [INFO ] Flatten gal took : 14 ms
[2024-05-31 23:05:19] [INFO ] Input system was already deterministic with 342 transitions.
[2024-05-31 23:05:19] [INFO ] Flatten gal took : 11 ms
[2024-05-31 23:05:19] [INFO ] Flatten gal took : 12 ms
[2024-05-31 23:05:19] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-05-31 23:05:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 410 places, 359 transitions and 1224 arcs took 5 ms.
Total runtime 502127 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : DES-PT-40b-CTLFireability-2024-00
Could not compute solution for formula : DES-PT-40b-CTLFireability-2024-01
Could not compute solution for formula : DES-PT-40b-CTLFireability-2024-02
Could not compute solution for formula : DES-PT-40b-CTLFireability-2024-03
Could not compute solution for formula : DES-PT-40b-CTLFireability-2024-05
Could not compute solution for formula : DES-PT-40b-CTLFireability-2024-06
Could not compute solution for formula : DES-PT-40b-CTLFireability-2024-07
Could not compute solution for formula : DES-PT-40b-CTLFireability-2024-08
Could not compute solution for formula : DES-PT-40b-CTLFireability-2024-09
Could not compute solution for formula : DES-PT-40b-CTLFireability-2024-10
Could not compute solution for formula : DES-PT-40b-CTLFireability-2024-11
Could not compute solution for formula : DES-PT-40b-CTLFireability-2023-12
Could not compute solution for formula : DES-PT-40b-CTLFireability-2023-13
Could not compute solution for formula : DES-PT-40b-CTLFireability-2023-14
Could not compute solution for formula : DES-PT-40b-CTLFireability-2023-15

BK_STOP 1717196719722

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name DES-PT-40b-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1152/ctl_0_
ctl formula name DES-PT-40b-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1152/ctl_1_
ctl formula name DES-PT-40b-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1152/ctl_2_
ctl formula name DES-PT-40b-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1152/ctl_3_
ctl formula name DES-PT-40b-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1152/ctl_4_
ctl formula name DES-PT-40b-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1152/ctl_5_
ctl formula name DES-PT-40b-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1152/ctl_6_
ctl formula name DES-PT-40b-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1152/ctl_7_
ctl formula name DES-PT-40b-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1152/ctl_8_
ctl formula name DES-PT-40b-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1152/ctl_9_
ctl formula name DES-PT-40b-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1152/ctl_10_
ctl formula name DES-PT-40b-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/1152/ctl_11_
ctl formula name DES-PT-40b-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/1152/ctl_12_
ctl formula name DES-PT-40b-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/1152/ctl_13_
ctl formula name DES-PT-40b-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/1152/ctl_14_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

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