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.r355-tall-171683759600810.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is ShieldRVs-PT-020B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683759600810
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 12 17:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 12 17:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 244K May 18 16:43 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 ShieldRVs-PT-020B-CTLFireability-2024-00
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-2024-01
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-2024-02
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-2024-03
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-2024-04
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-2024-05
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-2024-06
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-2024-07
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-2024-08
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-2024-09
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-2024-10
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-2024-11
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-2023-12
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-2023-13
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-2023-14
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717048467136

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-020B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 05:54:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 05:54:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 05:54:28] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2024-05-30 05:54:28] [INFO ] Transformed 803 places.
[2024-05-30 05:54:28] [INFO ] Transformed 903 transitions.
[2024-05-30 05:54:28] [INFO ] Found NUPN structural information;
[2024-05-30 05:54:28] [INFO ] Parsed PT model containing 803 places and 903 transitions and 2880 arcs in 243 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 199 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 903/903 transitions.
Discarding 109 places :
Symmetric choice reduction at 0 with 109 rule applications. Total rules 109 place count 694 transition count 794
Iterating global reduction 0 with 109 rules applied. Total rules applied 218 place count 694 transition count 794
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 219 place count 693 transition count 793
Iterating global reduction 0 with 1 rules applied. Total rules applied 220 place count 693 transition count 793
Applied a total of 220 rules in 120 ms. Remains 693 /803 variables (removed 110) and now considering 793/903 (removed 110) transitions.
// Phase 1: matrix 793 rows 693 cols
[2024-05-30 05:54:28] [INFO ] Computed 81 invariants in 24 ms
[2024-05-30 05:54:29] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-05-30 05:54:29] [INFO ] Invariant cache hit.
[2024-05-30 05:54:29] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 915 ms to find 0 implicit places.
Running 792 sub problems to find dead transitions.
[2024-05-30 05:54:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/692 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 1 (OVERLAPS) 1/693 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 792 unsolved
[2024-05-30 05:54:45] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 20 ms to minimize.
[2024-05-30 05:54:45] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 1 ms to minimize.
[2024-05-30 05:54:45] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 3 ms to minimize.
[2024-05-30 05:54:45] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-05-30 05:54:45] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2024-05-30 05:54:45] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 2 ms to minimize.
[2024-05-30 05:54:45] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 0 ms to minimize.
[2024-05-30 05:54:46] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 3 ms to minimize.
[2024-05-30 05:54:46] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 3 ms to minimize.
[2024-05-30 05:54:46] [INFO ] Deduced a trap composed of 46 places in 149 ms of which 3 ms to minimize.
[2024-05-30 05:54:46] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 3 ms to minimize.
[2024-05-30 05:54:46] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 2 ms to minimize.
[2024-05-30 05:54:47] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 2 ms to minimize.
[2024-05-30 05:54:47] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-05-30 05:54:47] [INFO ] Deduced a trap composed of 43 places in 126 ms of which 3 ms to minimize.
[2024-05-30 05:54:47] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 2 ms to minimize.
[2024-05-30 05:54:47] [INFO ] Deduced a trap composed of 56 places in 164 ms of which 3 ms to minimize.
[2024-05-30 05:54:47] [INFO ] Deduced a trap composed of 57 places in 132 ms of which 2 ms to minimize.
[2024-05-30 05:54:47] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2024-05-30 05:54:48] [INFO ] Deduced a trap composed of 50 places in 152 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/693 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 792 unsolved
[2024-05-30 05:54:48] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 3 ms to minimize.
[2024-05-30 05:54:48] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 3 ms to minimize.
[2024-05-30 05:54:48] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 2 ms to minimize.
[2024-05-30 05:54:49] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 3 ms to minimize.
[2024-05-30 05:54:49] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 2 ms to minimize.
[2024-05-30 05:54:49] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2024-05-30 05:54:49] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-30 05:54:49] [INFO ] Deduced a trap composed of 48 places in 155 ms of which 3 ms to minimize.
[2024-05-30 05:54:50] [INFO ] Deduced a trap composed of 45 places in 147 ms of which 3 ms to minimize.
[2024-05-30 05:54:50] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 3 ms to minimize.
[2024-05-30 05:54:50] [INFO ] Deduced a trap composed of 57 places in 152 ms of which 3 ms to minimize.
[2024-05-30 05:54:50] [INFO ] Deduced a trap composed of 45 places in 153 ms of which 3 ms to minimize.
[2024-05-30 05:54:50] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
[2024-05-30 05:54:51] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 3 ms to minimize.
[2024-05-30 05:54:51] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-30 05:54:51] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2024-05-30 05:54:51] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 1 ms to minimize.
[2024-05-30 05:54:51] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 1 ms to minimize.
[2024-05-30 05:54:51] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 0 ms to minimize.
[2024-05-30 05:54:51] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 792 unsolved
[2024-05-30 05:54:59] [INFO ] Deduced a trap composed of 74 places in 150 ms of which 3 ms to minimize.
[2024-05-30 05:54:59] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 2 ms to minimize.
[2024-05-30 05:54:59] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 2 ms to minimize.
SMT process timed out in 30270ms, After SMT, problems are : Problem set: 0 solved, 792 unsolved
Search for dead transitions found 0 dead transitions in 30293ms
Starting structural reductions in LTL mode, iteration 1 : 693/803 places, 793/903 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31352 ms. Remains : 693/803 places, 793/903 transitions.
Support contains 199 out of 693 places after structural reductions.
[2024-05-30 05:55:00] [INFO ] Flatten gal took : 97 ms
[2024-05-30 05:55:00] [INFO ] Flatten gal took : 48 ms
[2024-05-30 05:55:00] [INFO ] Input system was already deterministic with 793 transitions.
Support contains 195 out of 693 places (down from 199) after GAL structural reductions.
RANDOM walk for 40000 steps (44 resets) in 2502 ms. (15 steps per ms) remains 10/102 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 279 ms. (142 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 8/8 properties
[2024-05-30 05:55:01] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp34 is UNSAT
At refinement iteration 1 (OVERLAPS) 254/291 variables, 27/27 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 402/693 variables, 54/81 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/693 variables, 0/81 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 793/1486 variables, 693/774 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1486 variables, 0/774 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/1486 variables, 0/774 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1486/1486 variables, and 774 constraints, problems are : Problem set: 1 solved, 7 unsolved in 697 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 693/693 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 234/265 variables, 24/24 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-30 05:55:02] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 1/25 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 428/693 variables, 57/82 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-30 05:55:03] [INFO ] Deduced a trap composed of 17 places in 554 ms of which 2 ms to minimize.
[2024-05-30 05:55:03] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 2 ms to minimize.
[2024-05-30 05:55:03] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 2 ms to minimize.
[2024-05-30 05:55:03] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2024-05-30 05:55:03] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 2 ms to minimize.
[2024-05-30 05:55:03] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 3 ms to minimize.
[2024-05-30 05:55:04] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 2 ms to minimize.
[2024-05-30 05:55:04] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-05-30 05:55:04] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2024-05-30 05:55:04] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 2 ms to minimize.
[2024-05-30 05:55:04] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2024-05-30 05:55:04] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 8 ms to minimize.
[2024-05-30 05:55:04] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 2 ms to minimize.
[2024-05-30 05:55:04] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-05-30 05:55:04] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-05-30 05:55:04] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-30 05:55:04] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2024-05-30 05:55:04] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-30 05:55:05] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-30 05:55:05] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/693 variables, 20/102 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-30 05:55:05] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/693 variables, 1/103 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/693 variables, 0/103 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 793/1486 variables, 693/796 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1486 variables, 7/803 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-30 05:55:05] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 3 ms to minimize.
[2024-05-30 05:55:06] [INFO ] Deduced a trap composed of 21 places in 154 ms of which 3 ms to minimize.
[2024-05-30 05:55:06] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 3 ms to minimize.
[2024-05-30 05:55:06] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 3 ms to minimize.
[2024-05-30 05:55:06] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 2 ms to minimize.
[2024-05-30 05:55:06] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 2 ms to minimize.
[2024-05-30 05:55:06] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
[2024-05-30 05:55:06] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 3 ms to minimize.
[2024-05-30 05:55:06] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2024-05-30 05:55:07] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 2 ms to minimize.
[2024-05-30 05:55:07] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 1 ms to minimize.
[2024-05-30 05:55:07] [INFO ] Deduced a trap composed of 45 places in 92 ms of which 1 ms to minimize.
[2024-05-30 05:55:07] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2024-05-30 05:55:07] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 1 ms to minimize.
SMT process timed out in 5777ms, After SMT, problems are : Problem set: 1 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 31 out of 693 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 693/693 places, 793/793 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 693 transition count 718
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 150 place count 618 transition count 718
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 150 place count 618 transition count 620
Deduced a syphon composed of 98 places in 1 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 196 rules applied. Total rules applied 346 place count 520 transition count 620
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 371 place count 495 transition count 595
Iterating global reduction 2 with 25 rules applied. Total rules applied 396 place count 495 transition count 595
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 396 place count 495 transition count 589
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 408 place count 489 transition count 589
Performed 185 Post agglomeration using F-continuation condition.Transition count delta: 185
Deduced a syphon composed of 185 places in 1 ms
Reduce places removed 185 places and 0 transitions.
Iterating global reduction 2 with 370 rules applied. Total rules applied 778 place count 304 transition count 404
Partial Free-agglomeration rule applied 40 times.
Drop transitions (Partial Free agglomeration) removed 40 transitions
Iterating global reduction 2 with 40 rules applied. Total rules applied 818 place count 304 transition count 404
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 819 place count 303 transition count 403
Applied a total of 819 rules in 148 ms. Remains 303 /693 variables (removed 390) and now considering 403/793 (removed 390) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 303/693 places, 403/793 transitions.
RANDOM walk for 40000 steps (139 resets) in 659 ms. (60 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (12 resets) in 123 ms. (322 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (16 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
// Phase 1: matrix 403 rows 303 cols
[2024-05-30 05:55:08] [INFO ] Computed 81 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/64 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 113/177 variables, 42/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 15/192 variables, 6/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 6/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 109/301 variables, 45/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/301 variables, 9/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 05:55:08] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/301 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/301 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/307 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/307 variables, 6/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/307 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 124/431 variables, 48/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/431 variables, 11/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/431 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 10/441 variables, 5/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/441 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/441 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 115/556 variables, 51/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/556 variables, 12/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 05:55:08] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-30 05:55:08] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-30 05:55:08] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/556 variables, 3/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/556 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 10/566 variables, 4/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/566 variables, 5/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/566 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 83/649 variables, 38/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/649 variables, 6/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 05:55:08] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 33 (INCLUDED_ONLY) 0/649 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/649 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 8/657 variables, 5/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/657 variables, 6/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/657 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 44/701 variables, 24/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/701 variables, 5/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/701 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 3/704 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/704 variables, 3/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/704 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 2/706 variables, 2/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/706 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/706 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 0/706 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 706/706 variables, and 389 constraints, problems are : Problem set: 0 solved, 1 unsolved in 537 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 303/303 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/64 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 113/177 variables, 42/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/192 variables, 6/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 6/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 109/301 variables, 45/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/301 variables, 9/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/301 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/301 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/307 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/307 variables, 6/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/307 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 124/431 variables, 48/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/431 variables, 11/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 05:55:08] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/431 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/431 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 10/441 variables, 5/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/441 variables, 8/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/441 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 115/556 variables, 51/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/556 variables, 12/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/556 variables, 4/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/556 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 10/566 variables, 4/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/566 variables, 5/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/566 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 83/649 variables, 38/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/649 variables, 6/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/649 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 8/657 variables, 5/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/657 variables, 6/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/657 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 44/701 variables, 24/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/701 variables, 5/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 05:55:08] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/701 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/701 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 3/704 variables, 2/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/704 variables, 3/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 05:55:08] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
At refinement iteration 45 (INCLUDED_ONLY) 0/704 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/704 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 2/706 variables, 2/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/706 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/706 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 0/706 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 706/706 variables, and 393 constraints, problems are : Problem set: 0 solved, 1 unsolved in 504 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 303/303 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 1051ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 84 ms.
Support contains 4 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 403/403 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 2 rules applied. Total rules applied 2 place count 303 transition count 401
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 301 transition count 401
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 4 place count 301 transition count 393
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 20 place count 293 transition count 393
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 292 transition count 392
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 292 transition count 392
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 38 place count 284 transition count 384
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 284 transition count 384
Applied a total of 42 rules in 44 ms. Remains 284 /303 variables (removed 19) and now considering 384/403 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 284/303 places, 384/403 transitions.
RANDOM walk for 40000 steps (158 resets) in 286 ms. (139 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (19 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 831869 steps, run timeout after 3001 ms. (steps per millisecond=277 ) properties seen :0 out of 1
Probabilistic random walk after 831869 steps, saw 159197 distinct states, run finished after 3004 ms. (steps per millisecond=276 ) properties seen :0
// Phase 1: matrix 384 rows 284 cols
[2024-05-30 05:55:12] [INFO ] Computed 81 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/64 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 122/186 variables, 42/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 10/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/194 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 8/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 124/318 variables, 48/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 12/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/326 variables, 4/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/326 variables, 8/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/326 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 121/447 variables, 48/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/447 variables, 12/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 05:55:12] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-05-30 05:55:12] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-30 05:55:12] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/447 variables, 3/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/447 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 8/455 variables, 4/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/455 variables, 8/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/455 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 97/552 variables, 40/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/552 variables, 11/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 05:55:12] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-30 05:55:12] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/552 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/552 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 6/558 variables, 3/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/558 variables, 6/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/558 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 76/634 variables, 33/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/634 variables, 9/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/634 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 4/638 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/638 variables, 4/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/638 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 30/668 variables, 20/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/668 variables, 6/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 05:55:12] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2024-05-30 05:55:12] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/668 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/668 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 0/668 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 668/668 variables, and 372 constraints, problems are : Problem set: 0 solved, 1 unsolved in 659 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/64 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 122/186 variables, 42/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 10/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/194 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 8/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 124/318 variables, 48/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 12/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 05:55:13] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-05-30 05:55:13] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/318 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/326 variables, 4/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/326 variables, 8/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/326 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 121/447 variables, 48/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/447 variables, 12/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/447 variables, 4/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 05:55:13] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-30 05:55:13] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/447 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/447 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 8/455 variables, 4/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/455 variables, 8/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/455 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 97/552 variables, 40/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/552 variables, 11/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/552 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 05:55:13] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/552 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/552 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 6/558 variables, 3/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/558 variables, 6/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/558 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 76/634 variables, 33/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/634 variables, 9/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 05:55:13] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/634 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/634 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 4/638 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/638 variables, 4/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/638 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 30/668 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/668 variables, 6/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/668 variables, 2/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/668 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 0/668 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 668/668 variables, and 379 constraints, problems are : Problem set: 0 solved, 1 unsolved in 562 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 1232ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 75 ms.
Support contains 4 out of 284 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 284/284 places, 384/384 transitions.
Applied a total of 0 rules in 10 ms. Remains 284 /284 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 284/284 places, 384/384 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 284/284 places, 384/384 transitions.
Applied a total of 0 rules in 9 ms. Remains 284 /284 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2024-05-30 05:55:13] [INFO ] Invariant cache hit.
[2024-05-30 05:55:13] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-30 05:55:13] [INFO ] Invariant cache hit.
[2024-05-30 05:55:14] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
[2024-05-30 05:55:14] [INFO ] Redundant transitions in 74 ms returned []
Running 382 sub problems to find dead transitions.
[2024-05-30 05:55:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-30 05:55:16] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-30 05:55:16] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-05-30 05:55:16] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2024-05-30 05:55:16] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-30 05:55:16] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-30 05:55:16] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-05-30 05:55:16] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-30 05:55:16] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-30 05:55:16] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-30 05:55:16] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-30 05:55:16] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-30 05:55:16] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-30 05:55:16] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-30 05:55:16] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-30 05:55:16] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-30 05:55:16] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-30 05:55:16] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-30 05:55:16] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-30 05:55:16] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2024-05-30 05:55:16] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-30 05:55:16] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-30 05:55:17] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-30 05:55:17] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-30 05:55:17] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-30 05:55:17] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-30 05:55:17] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-30 05:55:17] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2024-05-30 05:55:17] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-30 05:55:17] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2024-05-30 05:55:17] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-30 05:55:17] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-30 05:55:17] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2024-05-30 05:55:17] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-30 05:55:17] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-30 05:55:17] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-30 05:55:17] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-30 05:55:17] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-30 05:55:17] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-30 05:55:17] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-30 05:55:18] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-30 05:55:18] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-30 05:55:18] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-30 05:55:18] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-30 05:55:18] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
[2024-05-30 05:55:18] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-30 05:55:18] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-30 05:55:18] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-05-30 05:55:18] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2024-05-30 05:55:18] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-05-30 05:55:18] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-30 05:55:18] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-30 05:55:18] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2024-05-30 05:55:18] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-30 05:55:18] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-30 05:55:19] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-30 05:55:19] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-30 05:55:19] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-30 05:55:19] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-30 05:55:19] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-30 05:55:19] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-30 05:55:21] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-30 05:55:21] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2024-05-30 05:55:21] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-30 05:55:21] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-30 05:55:21] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-30 05:55:21] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2024-05-30 05:55:21] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-30 05:55:21] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-30 05:55:21] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-30 05:55:21] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
[2024-05-30 05:55:22] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-30 05:55:22] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 9 ms to minimize.
[2024-05-30 05:55:22] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 1 ms to minimize.
[2024-05-30 05:55:22] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-30 05:55:22] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-30 05:55:22] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-30 05:55:22] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 2 ms to minimize.
[2024-05-30 05:55:22] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-05-30 05:55:22] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-05-30 05:55:22] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-30 05:55:23] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-30 05:55:23] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-30 05:55:23] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-30 05:55:23] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2024-05-30 05:55:23] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-30 05:55:23] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-30 05:55:23] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 2 ms to minimize.
[2024-05-30 05:55:23] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
[2024-05-30 05:55:23] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
[2024-05-30 05:55:24] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
[2024-05-30 05:55:24] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-30 05:55:24] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 2 ms to minimize.
[2024-05-30 05:55:24] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-30 05:55:24] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-30 05:55:24] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-30 05:55:24] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-30 05:55:24] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2024-05-30 05:55:24] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-30 05:55:24] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-30 05:55:24] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 20/180 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-30 05:55:25] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-30 05:55:25] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-30 05:55:25] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-05-30 05:55:25] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-30 05:55:25] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-30 05:55:25] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-30 05:55:26] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-30 05:55:26] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-30 05:55:26] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-30 05:55:26] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2024-05-30 05:55:26] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-30 05:55:26] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-30 05:55:26] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-30 05:55:26] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-30 05:55:26] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-30 05:55:26] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-30 05:55:26] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-05-30 05:55:26] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-30 05:55:27] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-30 05:55:27] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-30 05:55:29] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-05-30 05:55:29] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-05-30 05:55:29] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-30 05:55:29] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-30 05:55:29] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2024-05-30 05:55:30] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-30 05:55:30] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-30 05:55:30] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-30 05:55:30] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-30 05:55:30] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-30 05:55:30] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-30 05:55:31] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 2 ms to minimize.
[2024-05-30 05:55:31] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
[2024-05-30 05:55:31] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-30 05:55:31] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-30 05:55:31] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-30 05:55:31] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-30 05:55:31] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 18/218 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-30 05:55:32] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-30 05:55:32] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-30 05:55:32] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-30 05:55:32] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-30 05:55:32] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-30 05:55:32] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-30 05:55:32] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-30 05:55:32] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-30 05:55:32] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-30 05:55:32] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-30 05:55:33] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 2 ms to minimize.
[2024-05-30 05:55:33] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-30 05:55:33] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-30 05:55:33] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-30 05:55:33] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-30 05:55:33] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-30 05:55:33] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 17/235 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-30 05:55:34] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-30 05:55:34] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-30 05:55:35] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 2 ms to minimize.
[2024-05-30 05:55:35] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 1 ms to minimize.
[2024-05-30 05:55:35] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-30 05:55:35] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-05-30 05:55:35] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-30 05:55:37] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 8/243 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-30 05:55:39] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-30 05:55:39] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-30 05:55:39] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
[2024-05-30 05:55:39] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-30 05:55:40] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-30 05:55:40] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-30 05:55:40] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-30 05:55:41] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-30 05:55:41] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 9/252 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-30 05:55:41] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-30 05:55:41] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-05-30 05:55:41] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-30 05:55:41] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-05-30 05:55:42] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-30 05:55:42] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-30 05:55:42] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2024-05-30 05:55:42] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-30 05:55:42] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-05-30 05:55:42] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-30 05:55:42] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-30 05:55:42] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 2 ms to minimize.
[2024-05-30 05:55:42] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-05-30 05:55:42] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-30 05:55:42] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-30 05:55:44] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 283/668 variables, and 268 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 80/81 constraints, State Equation: 0/284 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 188/188 constraints]
Escalating to Integer solving :Problem set: 0 solved, 382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 188/268 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-30 05:55:44] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-30 05:55:44] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-30 05:55:44] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-30 05:55:44] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2024-05-30 05:55:45] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2024-05-30 05:55:45] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2024-05-30 05:55:45] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-30 05:55:45] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-30 05:55:45] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-30 05:55:45] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-05-30 05:55:45] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-30 05:55:45] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-05-30 05:55:45] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-30 05:55:45] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-30 05:55:45] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-05-30 05:55:45] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-30 05:55:45] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-05-30 05:55:46] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-05-30 05:55:46] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-05-30 05:55:46] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 20/288 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-30 05:55:46] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-30 05:55:46] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-30 05:55:46] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-30 05:55:46] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2024-05-30 05:55:46] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-05-30 05:55:46] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-30 05:55:46] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-30 05:55:47] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-05-30 05:55:47] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-30 05:55:47] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-30 05:55:47] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-30 05:55:47] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-30 05:55:47] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-30 05:55:47] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-30 05:55:48] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 15/303 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-30 05:55:49] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-30 05:55:50] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-30 05:55:51] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-30 05:55:51] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-30 05:55:54] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-30 05:55:55] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-30 05:55:55] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-30 05:55:55] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-30 05:55:55] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-30 05:55:55] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-30 05:55:55] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 7/314 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-30 05:55:56] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-30 05:55:56] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-30 05:55:56] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-30 05:55:57] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 4/318 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 9 (OVERLAPS) 1/284 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-30 05:56:00] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-30 05:56:01] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-05-30 05:56:01] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-05-30 05:56:01] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-30 05:56:01] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2024-05-30 05:56:01] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-05-30 05:56:01] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-30 05:56:01] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-05-30 05:56:02] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 9/328 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-30 05:56:03] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-30 05:56:03] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-30 05:56:04] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-30 05:56:04] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-30 05:56:04] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2024-05-30 05:56:04] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-30 05:56:04] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-30 05:56:04] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-30 05:56:04] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-30 05:56:04] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2024-05-30 05:56:04] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-30 05:56:04] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2024-05-30 05:56:04] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-30 05:56:04] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-30 05:56:04] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-30 05:56:04] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-30 05:56:05] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-05-30 05:56:05] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-05-30 05:56:05] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-30 05:56:05] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/284 variables, 20/348 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-30 05:56:05] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-30 05:56:05] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-30 05:56:05] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-30 05:56:06] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-30 05:56:06] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-30 05:56:06] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-30 05:56:06] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-30 05:56:06] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-30 05:56:06] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-30 05:56:06] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-30 05:56:06] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-30 05:56:06] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-30 05:56:06] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-30 05:56:06] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-30 05:56:06] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-30 05:56:06] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-30 05:56:07] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-30 05:56:07] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-30 05:56:07] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/284 variables, 19/367 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-30 05:56:08] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-30 05:56:08] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-30 05:56:08] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-30 05:56:08] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-30 05:56:08] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-30 05:56:09] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-30 05:56:09] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-30 05:56:09] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-30 05:56:09] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-30 05:56:09] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-05-30 05:56:09] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-30 05:56:09] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-30 05:56:09] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 1 ms to minimize.
[2024-05-30 05:56:09] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-30 05:56:09] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-30 05:56:09] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-30 05:56:09] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-30 05:56:09] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2024-05-30 05:56:09] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-05-30 05:56:09] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 20/387 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-30 05:56:10] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2024-05-30 05:56:10] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-30 05:56:10] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-30 05:56:10] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-30 05:56:10] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-30 05:56:11] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-30 05:56:11] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-30 05:56:12] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-30 05:56:12] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 9/396 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-30 05:56:13] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-30 05:56:13] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-30 05:56:13] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-30 05:56:13] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-30 05:56:13] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-30 05:56:13] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-30 05:56:13] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
[2024-05-30 05:56:13] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-30 05:56:13] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-30 05:56:13] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-30 05:56:14] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 1)
(s11 0)
(s12 0)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 1)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 1)
(s25 0)
(s26 0)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 1)
(s50 1)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 0)
(s60 1)
(s61 0)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(s73 0)
(s74 1)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 1)
(s80 1)
(s81 0)
(s82 0)
(s83 0)
(s84 1)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 1)
(s93 0)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 1)
(s104 0)
(s105 0)
(s106 1)
(s107 0)
(s108 1)
(s109 0)
(s110 0)
(s111 0)
(s112 1)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 1)
(s118 0)
(s119 0)
(s120 1)
(s121 0)
(s122 1)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 0)
(s129 0)
(s130 1)
(s131 0)
(s132 0)
(s133 0)
(s134 1)
(s135 0)
(s136 1)
(s137 0)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 284/668 variables, and 407 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/284 constraints, PredecessorRefiner: 0/382 constraints, Known Traps: 326/326 constraints]
After SMT, in 60138ms problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 60142ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60673 ms. Remains : 284/284 places, 384/384 transitions.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-05-30 05:56:14] [INFO ] Flatten gal took : 37 ms
[2024-05-30 05:56:14] [INFO ] Flatten gal took : 41 ms
[2024-05-30 05:56:14] [INFO ] Input system was already deterministic with 793 transitions.
Computed a total of 175 stabilizing places and 175 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 692 transition count 715
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 154 place count 615 transition count 715
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 154 place count 615 transition count 613
Deduced a syphon composed of 102 places in 0 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 358 place count 513 transition count 613
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 388 place count 483 transition count 583
Iterating global reduction 2 with 30 rules applied. Total rules applied 418 place count 483 transition count 583
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 418 place count 483 transition count 574
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 436 place count 474 transition count 574
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 796 place count 294 transition count 394
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 798 place count 292 transition count 392
Applied a total of 798 rules in 71 ms. Remains 292 /693 variables (removed 401) and now considering 392/793 (removed 401) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 73 ms. Remains : 292/693 places, 392/793 transitions.
[2024-05-30 05:56:14] [INFO ] Flatten gal took : 19 ms
[2024-05-30 05:56:14] [INFO ] Flatten gal took : 19 ms
[2024-05-30 05:56:14] [INFO ] Input system was already deterministic with 392 transitions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 662 transition count 762
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 662 transition count 762
Applied a total of 62 rules in 18 ms. Remains 662 /693 variables (removed 31) and now considering 762/793 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 662/693 places, 762/793 transitions.
[2024-05-30 05:56:14] [INFO ] Flatten gal took : 26 ms
[2024-05-30 05:56:14] [INFO ] Flatten gal took : 24 ms
[2024-05-30 05:56:14] [INFO ] Input system was already deterministic with 762 transitions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 663 transition count 763
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 663 transition count 763
Applied a total of 60 rules in 22 ms. Remains 663 /693 variables (removed 30) and now considering 763/793 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 663/693 places, 763/793 transitions.
[2024-05-30 05:56:14] [INFO ] Flatten gal took : 22 ms
[2024-05-30 05:56:14] [INFO ] Flatten gal took : 23 ms
[2024-05-30 05:56:14] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 666 transition count 766
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 666 transition count 766
Applied a total of 54 rules in 18 ms. Remains 666 /693 variables (removed 27) and now considering 766/793 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 666/693 places, 766/793 transitions.
[2024-05-30 05:56:14] [INFO ] Flatten gal took : 22 ms
[2024-05-30 05:56:14] [INFO ] Flatten gal took : 23 ms
[2024-05-30 05:56:15] [INFO ] Input system was already deterministic with 766 transitions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 663 transition count 763
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 663 transition count 763
Applied a total of 60 rules in 18 ms. Remains 663 /693 variables (removed 30) and now considering 763/793 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 663/693 places, 763/793 transitions.
[2024-05-30 05:56:15] [INFO ] Flatten gal took : 21 ms
[2024-05-30 05:56:15] [INFO ] Flatten gal took : 22 ms
[2024-05-30 05:56:15] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 663 transition count 763
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 663 transition count 763
Applied a total of 60 rules in 18 ms. Remains 663 /693 variables (removed 30) and now considering 763/793 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 663/693 places, 763/793 transitions.
[2024-05-30 05:56:15] [INFO ] Flatten gal took : 21 ms
[2024-05-30 05:56:15] [INFO ] Flatten gal took : 22 ms
[2024-05-30 05:56:15] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 693 transition count 719
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 148 place count 619 transition count 719
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 148 place count 619 transition count 618
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 350 place count 518 transition count 618
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 378 place count 490 transition count 590
Iterating global reduction 2 with 28 rules applied. Total rules applied 406 place count 490 transition count 590
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 406 place count 490 transition count 581
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 424 place count 481 transition count 581
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Deduced a syphon composed of 177 places in 0 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 2 with 354 rules applied. Total rules applied 778 place count 304 transition count 404
Applied a total of 778 rules in 51 ms. Remains 304 /693 variables (removed 389) and now considering 404/793 (removed 389) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52 ms. Remains : 304/693 places, 404/793 transitions.
[2024-05-30 05:56:15] [INFO ] Flatten gal took : 20 ms
[2024-05-30 05:56:15] [INFO ] Flatten gal took : 15 ms
[2024-05-30 05:56:15] [INFO ] Input system was already deterministic with 404 transitions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 664 transition count 764
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 664 transition count 764
Applied a total of 58 rules in 17 ms. Remains 664 /693 variables (removed 29) and now considering 764/793 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 664/693 places, 764/793 transitions.
[2024-05-30 05:56:15] [INFO ] Flatten gal took : 21 ms
[2024-05-30 05:56:15] [INFO ] Flatten gal took : 21 ms
[2024-05-30 05:56:15] [INFO ] Input system was already deterministic with 764 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 692 transition count 711
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 162 place count 611 transition count 711
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 162 place count 611 transition count 611
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 362 place count 511 transition count 611
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 391 place count 482 transition count 582
Iterating global reduction 2 with 29 rules applied. Total rules applied 420 place count 482 transition count 582
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 420 place count 482 transition count 573
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 438 place count 473 transition count 573
Performed 186 Post agglomeration using F-continuation condition.Transition count delta: 186
Deduced a syphon composed of 186 places in 0 ms
Reduce places removed 186 places and 0 transitions.
Iterating global reduction 2 with 372 rules applied. Total rules applied 810 place count 287 transition count 387
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 812 place count 285 transition count 385
Applied a total of 812 rules in 61 ms. Remains 285 /693 variables (removed 408) and now considering 385/793 (removed 408) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62 ms. Remains : 285/693 places, 385/793 transitions.
[2024-05-30 05:56:15] [INFO ] Flatten gal took : 13 ms
[2024-05-30 05:56:15] [INFO ] Flatten gal took : 13 ms
[2024-05-30 05:56:15] [INFO ] Input system was already deterministic with 385 transitions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 663 transition count 763
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 663 transition count 763
Applied a total of 60 rules in 18 ms. Remains 663 /693 variables (removed 30) and now considering 763/793 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 663/693 places, 763/793 transitions.
[2024-05-30 05:56:15] [INFO ] Flatten gal took : 20 ms
[2024-05-30 05:56:15] [INFO ] Flatten gal took : 21 ms
[2024-05-30 05:56:15] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 669 transition count 769
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 669 transition count 769
Applied a total of 48 rules in 18 ms. Remains 669 /693 variables (removed 24) and now considering 769/793 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 669/693 places, 769/793 transitions.
[2024-05-30 05:56:15] [INFO ] Flatten gal took : 20 ms
[2024-05-30 05:56:15] [INFO ] Flatten gal took : 19 ms
[2024-05-30 05:56:15] [INFO ] Input system was already deterministic with 769 transitions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 665 transition count 765
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 665 transition count 765
Applied a total of 56 rules in 18 ms. Remains 665 /693 variables (removed 28) and now considering 765/793 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 665/693 places, 765/793 transitions.
[2024-05-30 05:56:15] [INFO ] Flatten gal took : 18 ms
[2024-05-30 05:56:15] [INFO ] Flatten gal took : 19 ms
[2024-05-30 05:56:16] [INFO ] Input system was already deterministic with 765 transitions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 662 transition count 762
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 662 transition count 762
Applied a total of 62 rules in 18 ms. Remains 662 /693 variables (removed 31) and now considering 762/793 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 662/693 places, 762/793 transitions.
[2024-05-30 05:56:16] [INFO ] Flatten gal took : 18 ms
[2024-05-30 05:56:16] [INFO ] Flatten gal took : 19 ms
[2024-05-30 05:56:16] [INFO ] Input system was already deterministic with 762 transitions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 663 transition count 763
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 663 transition count 763
Applied a total of 60 rules in 25 ms. Remains 663 /693 variables (removed 30) and now considering 763/793 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 663/693 places, 763/793 transitions.
[2024-05-30 05:56:16] [INFO ] Flatten gal took : 18 ms
[2024-05-30 05:56:16] [INFO ] Flatten gal took : 19 ms
[2024-05-30 05:56:16] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 76 place count 692 transition count 716
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 1 with 76 rules applied. Total rules applied 152 place count 616 transition count 716
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 152 place count 616 transition count 619
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 346 place count 519 transition count 619
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 374 place count 491 transition count 591
Iterating global reduction 2 with 28 rules applied. Total rules applied 402 place count 491 transition count 591
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 402 place count 491 transition count 585
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 414 place count 485 transition count 585
Performed 186 Post agglomeration using F-continuation condition.Transition count delta: 186
Deduced a syphon composed of 186 places in 1 ms
Reduce places removed 186 places and 0 transitions.
Iterating global reduction 2 with 372 rules applied. Total rules applied 786 place count 299 transition count 399
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 788 place count 297 transition count 397
Applied a total of 788 rules in 56 ms. Remains 297 /693 variables (removed 396) and now considering 397/793 (removed 396) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56 ms. Remains : 297/693 places, 397/793 transitions.
[2024-05-30 05:56:16] [INFO ] Flatten gal took : 10 ms
[2024-05-30 05:56:16] [INFO ] Flatten gal took : 11 ms
[2024-05-30 05:56:16] [INFO ] Input system was already deterministic with 397 transitions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 664 transition count 764
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 664 transition count 764
Applied a total of 58 rules in 19 ms. Remains 664 /693 variables (removed 29) and now considering 764/793 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 664/693 places, 764/793 transitions.
[2024-05-30 05:56:16] [INFO ] Flatten gal took : 19 ms
[2024-05-30 05:56:16] [INFO ] Flatten gal took : 20 ms
[2024-05-30 05:56:16] [INFO ] Input system was already deterministic with 764 transitions.
[2024-05-30 05:56:16] [INFO ] Flatten gal took : 20 ms
[2024-05-30 05:56:16] [INFO ] Flatten gal took : 20 ms
[2024-05-30 05:56:16] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2024-05-30 05:56:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 693 places, 793 transitions and 2660 arcs took 5 ms.
Total runtime 108260 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldRVs-PT-020B

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/409/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 693
TRANSITIONS: 793
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.017s, Sys 0.000s]


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


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

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

Process ID: 1868
MODEL NAME: /home/mcc/execution/409/model
693 places, 793 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-020B"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ShieldRVs-PT-020B, 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 r355-tall-171683759600810"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-020B.tgz
mv ShieldRVs-PT-020B 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 ;