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-171683759700842.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-040B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683759700842
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 960K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 17:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 12 17:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K 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 498K 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-040B-CTLFireability-2024-00
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-2024-01
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-2024-02
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-2024-03
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-2024-04
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-2024-05
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-2024-06
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-2024-07
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-2024-08
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-2024-09
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-2024-10
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-2024-11
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-2023-12
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-2023-13
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-2023-14
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717059064134

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-040B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 08:51:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 08:51:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 08:51:05] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2024-05-30 08:51:05] [INFO ] Transformed 1603 places.
[2024-05-30 08:51:05] [INFO ] Transformed 1803 transitions.
[2024-05-30 08:51:05] [INFO ] Found NUPN structural information;
[2024-05-30 08:51:05] [INFO ] Parsed PT model containing 1603 places and 1803 transitions and 5760 arcs in 281 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 187 out of 1603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1603/1603 places, 1803/1803 transitions.
Discarding 243 places :
Symmetric choice reduction at 0 with 243 rule applications. Total rules 243 place count 1360 transition count 1560
Iterating global reduction 0 with 243 rules applied. Total rules applied 486 place count 1360 transition count 1560
Applied a total of 486 rules in 218 ms. Remains 1360 /1603 variables (removed 243) and now considering 1560/1803 (removed 243) transitions.
// Phase 1: matrix 1560 rows 1360 cols
[2024-05-30 08:51:05] [INFO ] Computed 161 invariants in 26 ms
[2024-05-30 08:51:06] [INFO ] Implicit Places using invariants in 534 ms returned []
[2024-05-30 08:51:06] [INFO ] Invariant cache hit.
[2024-05-30 08:51:07] [INFO ] Implicit Places using invariants and state equation in 1061 ms returned []
Implicit Place search using SMT with State Equation took 1621 ms to find 0 implicit places.
Running 1559 sub problems to find dead transitions.
[2024-05-30 08:51:07] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1359 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1559 unsolved
SMT process timed out in 30500ms, After SMT, problems are : Problem set: 0 solved, 1559 unsolved
Search for dead transitions found 0 dead transitions in 30528ms
Starting structural reductions in LTL mode, iteration 1 : 1360/1603 places, 1560/1803 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32396 ms. Remains : 1360/1603 places, 1560/1803 transitions.
Support contains 187 out of 1360 places after structural reductions.
[2024-05-30 08:51:38] [INFO ] Flatten gal took : 133 ms
[2024-05-30 08:51:38] [INFO ] Flatten gal took : 84 ms
[2024-05-30 08:51:38] [INFO ] Input system was already deterministic with 1560 transitions.
Support contains 184 out of 1360 places (down from 187) after GAL structural reductions.
RANDOM walk for 40000 steps (20 resets) in 2166 ms. (18 steps per ms) remains 10/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 10/10 properties
[2024-05-30 08:51:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 349/384 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 976/1360 variables, 128/161 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1360 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1560/2920 variables, 1360/1521 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2920 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/2920 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2920/2920 variables, and 1521 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1605 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 1360/1360 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 349/384 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-30 08:51:41] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 28 ms to minimize.
[2024-05-30 08:51:41] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 2 ms to minimize.
[2024-05-30 08:51:41] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 1 ms to minimize.
[2024-05-30 08:51:41] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
Problem AtomicPropp22 is UNSAT
[2024-05-30 08:51:41] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 1 ms to minimize.
[2024-05-30 08:51:42] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
[2024-05-30 08:51:42] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 7/40 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-30 08:51:42] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 1/41 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-30 08:51:42] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-30 08:51:42] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 2/43 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 976/1360 variables, 128/171 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-30 08:51:42] [INFO ] Deduced a trap composed of 30 places in 218 ms of which 5 ms to minimize.
[2024-05-30 08:51:43] [INFO ] Deduced a trap composed of 28 places in 212 ms of which 4 ms to minimize.
[2024-05-30 08:51:43] [INFO ] Deduced a trap composed of 18 places in 227 ms of which 4 ms to minimize.
[2024-05-30 08:51:43] [INFO ] Deduced a trap composed of 42 places in 214 ms of which 4 ms to minimize.
[2024-05-30 08:51:43] [INFO ] Deduced a trap composed of 25 places in 226 ms of which 4 ms to minimize.
[2024-05-30 08:51:44] [INFO ] Deduced a trap composed of 37 places in 215 ms of which 4 ms to minimize.
[2024-05-30 08:51:44] [INFO ] Deduced a trap composed of 33 places in 208 ms of which 4 ms to minimize.
[2024-05-30 08:51:44] [INFO ] Deduced a trap composed of 27 places in 189 ms of which 4 ms to minimize.
[2024-05-30 08:51:44] [INFO ] Deduced a trap composed of 34 places in 185 ms of which 4 ms to minimize.
[2024-05-30 08:51:44] [INFO ] Deduced a trap composed of 26 places in 181 ms of which 4 ms to minimize.
[2024-05-30 08:51:45] [INFO ] Deduced a trap composed of 32 places in 192 ms of which 3 ms to minimize.
[2024-05-30 08:51:45] [INFO ] Deduced a trap composed of 46 places in 165 ms of which 3 ms to minimize.
[2024-05-30 08:51:45] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 4 ms to minimize.
[2024-05-30 08:51:45] [INFO ] Deduced a trap composed of 38 places in 144 ms of which 3 ms to minimize.
[2024-05-30 08:51:45] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 3 ms to minimize.
[2024-05-30 08:51:46] [INFO ] Deduced a trap composed of 53 places in 147 ms of which 3 ms to minimize.
[2024-05-30 08:51:46] [INFO ] Deduced a trap composed of 60 places in 145 ms of which 3 ms to minimize.
[2024-05-30 08:51:46] [INFO ] Deduced a trap composed of 46 places in 133 ms of which 3 ms to minimize.
SMT process timed out in 6715ms, After SMT, problems are : Problem set: 1 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 33 out of 1360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1360/1360 places, 1560/1560 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 155 transitions
Trivial Post-agglo rules discarded 155 transitions
Performed 155 trivial Post agglomeration. Transition count delta: 155
Iterating post reduction 0 with 155 rules applied. Total rules applied 155 place count 1360 transition count 1405
Reduce places removed 155 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 157 rules applied. Total rules applied 312 place count 1205 transition count 1403
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 314 place count 1203 transition count 1403
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 314 place count 1203 transition count 1204
Deduced a syphon composed of 199 places in 2 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 712 place count 1004 transition count 1204
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 737 place count 979 transition count 1179
Iterating global reduction 3 with 25 rules applied. Total rules applied 762 place count 979 transition count 1179
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 762 place count 979 transition count 1170
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 780 place count 970 transition count 1170
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 379
Deduced a syphon composed of 379 places in 4 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 3 with 758 rules applied. Total rules applied 1538 place count 591 transition count 791
Partial Free-agglomeration rule applied 79 times.
Drop transitions (Partial Free agglomeration) removed 79 transitions
Iterating global reduction 3 with 79 rules applied. Total rules applied 1617 place count 591 transition count 791
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1618 place count 590 transition count 790
Applied a total of 1618 rules in 370 ms. Remains 590 /1360 variables (removed 770) and now considering 790/1560 (removed 770) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 373 ms. Remains : 590/1360 places, 790/1560 transitions.
RANDOM walk for 40000 steps (77 resets) in 512 ms. (77 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 188 ms. (211 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 157 ms. (253 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 140 ms. (283 steps per ms) remains 4/4 properties
// Phase 1: matrix 790 rows 590 cols
[2024-05-30 08:51:47] [INFO ] Computed 161 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 62/75 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 248/323 variables, 70/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 08:51:47] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-30 08:51:47] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-30 08:51:47] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-30 08:51:47] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2024-05-30 08:51:47] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-30 08:51:47] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-30 08:51:47] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-30 08:51:47] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-30 08:51:47] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-30 08:51:47] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-30 08:51:47] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 11/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 481/804 variables, 323/419 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/804 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 275/1079 variables, 99/518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1079 variables, 22/540 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1079 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 16/1095 variables, 9/549 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1095 variables, 16/565 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1095 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 217/1312 variables, 102/667 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1312 variables, 27/694 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1312 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 13/1325 variables, 6/700 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1325 variables, 11/711 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1325 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 55/1380 variables, 39/750 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1380 variables, 12/762 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1380 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/1380 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1380/1380 variables, and 762 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1259 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 590/590 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 62/75 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 248/323 variables, 70/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 11/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 08:51:48] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 2 ms to minimize.
[2024-05-30 08:51:48] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-30 08:51:48] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-30 08:51:48] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-30 08:51:48] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-30 08:51:48] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-30 08:51:48] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-30 08:51:49] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 8/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 481/804 variables, 323/427 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/804 variables, 3/430 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 08:51:49] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-30 08:51:49] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-30 08:51:49] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-30 08:51:49] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 2 ms to minimize.
[2024-05-30 08:51:49] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/804 variables, 5/435 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/804 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 275/1079 variables, 99/534 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1079 variables, 22/556 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1079 variables, 1/557 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 08:51:49] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-30 08:51:49] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-30 08:51:49] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-05-30 08:51:50] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-30 08:51:50] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-30 08:51:50] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-30 08:51:50] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-30 08:51:50] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1079 variables, 8/565 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1079 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 16/1095 variables, 9/574 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1095 variables, 16/590 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 08:51:50] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-30 08:51:50] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-30 08:51:50] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1095 variables, 3/593 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1095 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 217/1312 variables, 102/695 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1312 variables, 27/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 08:51:50] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 2 ms to minimize.
[2024-05-30 08:51:50] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-30 08:51:51] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1312 variables, 3/725 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 08:51:51] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1312 variables, 1/726 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1312 variables, 0/726 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 13/1325 variables, 6/732 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1325 variables, 11/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 08:51:51] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1325 variables, 1/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 08:51:51] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/1325 variables, 1/745 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1325 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 55/1380 variables, 39/784 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1380 variables, 12/796 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 08:51:51] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2024-05-30 08:51:52] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/1380 variables, 2/798 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1380 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 08:51:52] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2024-05-30 08:51:52] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 0 ms to minimize.
At refinement iteration 34 (OVERLAPS) 0/1380 variables, 2/800 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1380 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 08:51:52] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
At refinement iteration 36 (OVERLAPS) 0/1380 variables, 1/801 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 08:51:52] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/1380 variables, 1/802 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 08:51:52] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/1380 variables, 1/803 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 08:51:53] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/1380 variables, 1/804 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1380 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (OVERLAPS) 0/1380 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1380/1380 variables, and 804 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4857 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 590/590 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 49/49 constraints]
After SMT, in 6128ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 3285 ms.
Support contains 13 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 790/790 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 590 transition count 785
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 585 transition count 785
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 26 place count 577 transition count 777
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 29 place count 577 transition count 777
Applied a total of 29 rules in 75 ms. Remains 577 /590 variables (removed 13) and now considering 777/790 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 577/590 places, 777/790 transitions.
RANDOM walk for 40000 steps (81 resets) in 316 ms. (126 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 3/3 properties
// Phase 1: matrix 777 rows 577 cols
[2024-05-30 08:51:57] [INFO ] Computed 161 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 57/68 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 238/306 variables, 69/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 08:51:57] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-30 08:51:57] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-30 08:51:57] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-30 08:51:57] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-30 08:51:57] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-30 08:51:57] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 6/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 453/759 variables, 306/395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 08:51:57] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-30 08:51:57] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2024-05-30 08:51:57] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-05-30 08:51:57] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2024-05-30 08:51:58] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 2 ms to minimize.
[2024-05-30 08:51:58] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 2 ms to minimize.
[2024-05-30 08:51:58] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 2 ms to minimize.
[2024-05-30 08:51:58] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/759 variables, 8/403 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/759 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 218/977 variables, 81/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/977 variables, 20/504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 08:51:58] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/977 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/977 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 12/989 variables, 6/511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/989 variables, 12/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 08:51:58] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/989 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/989 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 186/1175 variables, 78/602 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1175 variables, 20/622 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1175 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 12/1187 variables, 6/628 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1187 variables, 12/640 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1187 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 96/1283 variables, 48/688 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1283 variables, 14/702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 08:51:59] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1283 variables, 1/703 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1283 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 27 (OVERLAPS) 4/1287 variables, 2/705 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1287 variables, 4/709 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1287 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 52/1339 variables, 24/733 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1339 variables, 4/737 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1339 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (OVERLAPS) 6/1345 variables, 4/741 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1345 variables, 6/747 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1345 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (OVERLAPS) 9/1354 variables, 6/753 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1354 variables, 2/755 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1354 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (OVERLAPS) 0/1354 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1354/1354 variables, and 755 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2451 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 577/577 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 57/68 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 238/306 variables, 69/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 14/97 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 08:51:59] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-30 08:51:59] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-30 08:51:59] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-30 08:51:59] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-05-30 08:51:59] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-30 08:52:00] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-30 08:52:00] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-30 08:52:00] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-30 08:52:00] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2024-05-30 08:52:00] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2024-05-30 08:52:00] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 11/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 453/759 variables, 306/414 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/759 variables, 2/416 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 08:52:00] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-05-30 08:52:00] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-30 08:52:00] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-30 08:52:00] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-30 08:52:00] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-30 08:52:00] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-05-30 08:52:01] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-30 08:52:01] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-30 08:52:01] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-30 08:52:01] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-05-30 08:52:01] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-30 08:52:01] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-30 08:52:01] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-30 08:52:01] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-30 08:52:01] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-30 08:52:01] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-30 08:52:01] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-05-30 08:52:01] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-30 08:52:01] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-30 08:52:01] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/759 variables, 20/436 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 08:52:02] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 2 ms to minimize.
[2024-05-30 08:52:02] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-30 08:52:02] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2024-05-30 08:52:02] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 5 ms to minimize.
[2024-05-30 08:52:02] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-30 08:52:02] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-30 08:52:02] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-30 08:52:02] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-30 08:52:02] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-05-30 08:52:02] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-30 08:52:02] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-05-30 08:52:02] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-30 08:52:02] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-30 08:52:02] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-30 08:52:03] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-30 08:52:03] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-05-30 08:52:03] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-30 08:52:03] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-05-30 08:52:03] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-30 08:52:03] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/759 variables, 20/456 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 08:52:03] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-30 08:52:03] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-30 08:52:03] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/759 variables, 3/459 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/759 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 218/977 variables, 81/540 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/977 variables, 20/560 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/977 variables, 1/561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/977 variables, 2/563 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 08:52:03] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-30 08:52:03] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2024-05-30 08:52:03] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-30 08:52:03] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/977 variables, 4/567 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/977 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 12/989 variables, 6/573 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/989 variables, 12/585 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 08:52:03] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/989 variables, 1/586 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/989 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 186/1175 variables, 78/664 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1175 variables, 20/684 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1175 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 12/1187 variables, 6/690 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1187 variables, 12/702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 08:52:04] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-30 08:52:04] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/1187 variables, 2/704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 08:52:04] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/1187 variables, 1/705 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 08:52:04] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 0 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/1187 variables, 1/706 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1187 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 96/1283 variables, 48/754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1283 variables, 14/768 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1283 variables, 1/769 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 08:52:05] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/1283 variables, 1/770 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1283 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 4/1287 variables, 2/772 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1287 variables, 4/776 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1287 variables, 0/776 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 52/1339 variables, 24/800 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1339 variables, 4/804 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 08:52:05] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-30 08:52:05] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/1339 variables, 2/806 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1339 variables, 0/806 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (OVERLAPS) 6/1345 variables, 4/810 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1345 variables, 6/816 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 08:52:05] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
At refinement iteration 46 (INCLUDED_ONLY) 0/1345 variables, 1/817 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1345 variables, 0/817 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (OVERLAPS) 9/1354 variables, 6/823 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1354 variables, 2/825 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1354 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (OVERLAPS) 0/1354 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1354/1354 variables, and 825 constraints, problems are : Problem set: 0 solved, 3 unsolved in 6519 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 577/577 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 84/84 constraints]
After SMT, in 8989ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 942 ms.
Support contains 11 out of 577 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 577/577 places, 777/777 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 575 transition count 775
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 574 transition count 774
Applied a total of 5 rules in 45 ms. Remains 574 /577 variables (removed 3) and now considering 774/777 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 574/577 places, 774/777 transitions.
RANDOM walk for 40000 steps (81 resets) in 308 ms. (129 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 202508 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 3
Probabilistic random walk after 202508 steps, saw 49507 distinct states, run finished after 3004 ms. (steps per millisecond=67 ) properties seen :0
// Phase 1: matrix 774 rows 574 cols
[2024-05-30 08:52:10] [INFO ] Computed 161 invariants in 9 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 56/67 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 238/305 variables, 69/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 08:52:10] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-30 08:52:10] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-30 08:52:10] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-30 08:52:10] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-30 08:52:10] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-30 08:52:10] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-30 08:52:10] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-30 08:52:10] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 8/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 452/757 variables, 305/396 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 08:52:11] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-30 08:52:11] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-30 08:52:11] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-30 08:52:11] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2024-05-30 08:52:11] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/757 variables, 5/401 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/757 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 218/975 variables, 81/482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/975 variables, 20/502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 08:52:11] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/975 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/975 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 12/987 variables, 6/509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/987 variables, 12/521 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/987 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 186/1173 variables, 78/599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1173 variables, 20/619 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/1173 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 12/1185 variables, 6/625 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1185 variables, 12/637 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1185 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 96/1281 variables, 48/685 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1281 variables, 14/699 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1281 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 4/1285 variables, 2/701 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1285 variables, 4/705 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1285 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 50/1335 variables, 24/729 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1335 variables, 6/735 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1335 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 4/1339 variables, 2/737 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1339 variables, 4/741 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1339 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 9/1348 variables, 6/747 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1348 variables, 2/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1348 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 0/1348 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1348/1348 variables, and 749 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1752 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 574/574 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 56/67 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 238/305 variables, 69/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 13/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 08:52:12] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-30 08:52:12] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-30 08:52:12] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-05-30 08:52:12] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-30 08:52:12] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-05-30 08:52:12] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-30 08:52:12] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-30 08:52:12] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-30 08:52:12] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-30 08:52:12] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 10/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 452/757 variables, 305/411 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/757 variables, 2/413 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 08:52:12] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-30 08:52:13] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-30 08:52:13] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-30 08:52:13] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-30 08:52:13] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.
[2024-05-30 08:52:13] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-30 08:52:13] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-30 08:52:13] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-30 08:52:13] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-30 08:52:13] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-30 08:52:13] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-30 08:52:13] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-05-30 08:52:13] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-30 08:52:13] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/757 variables, 14/427 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/757 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 218/975 variables, 81/508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/975 variables, 20/528 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/975 variables, 1/529 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/975 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 08:52:13] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-30 08:52:14] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-05-30 08:52:14] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-30 08:52:14] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-30 08:52:14] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-30 08:52:14] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/975 variables, 6/536 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/975 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 12/987 variables, 6/542 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/987 variables, 12/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 08:52:14] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/987 variables, 1/555 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/987 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 186/1173 variables, 78/633 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1173 variables, 20/653 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1173 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 12/1185 variables, 6/659 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1185 variables, 12/671 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1185 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 96/1281 variables, 48/719 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1281 variables, 14/733 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 08:52:14] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-30 08:52:14] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-30 08:52:14] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-30 08:52:15] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-30 08:52:15] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-05-30 08:52:15] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2024-05-30 08:52:15] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2024-05-30 08:52:15] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 2 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/1281 variables, 8/741 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1281 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 4/1285 variables, 2/743 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1285 variables, 4/747 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1285 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 50/1335 variables, 24/771 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1335 variables, 6/777 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1335 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 4/1339 variables, 2/779 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1339 variables, 4/783 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1339 variables, 0/783 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 9/1348 variables, 6/789 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1348 variables, 2/791 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1348 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (OVERLAPS) 0/1348 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1348/1348 variables, and 791 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3874 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 574/574 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 53/53 constraints]
After SMT, in 5644ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 905 ms.
Support contains 11 out of 574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 774/774 transitions.
Applied a total of 0 rules in 17 ms. Remains 574 /574 variables (removed 0) and now considering 774/774 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 574/574 places, 774/774 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 774/774 transitions.
Applied a total of 0 rules in 16 ms. Remains 574 /574 variables (removed 0) and now considering 774/774 (removed 0) transitions.
[2024-05-30 08:52:16] [INFO ] Invariant cache hit.
[2024-05-30 08:52:17] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-30 08:52:17] [INFO ] Invariant cache hit.
[2024-05-30 08:52:17] [INFO ] Implicit Places using invariants and state equation in 583 ms returned []
Implicit Place search using SMT with State Equation took 820 ms to find 0 implicit places.
[2024-05-30 08:52:17] [INFO ] Redundant transitions in 87 ms returned []
Running 770 sub problems to find dead transitions.
[2024-05-30 08:52:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 770 unsolved
[2024-05-30 08:52:25] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-05-30 08:52:25] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-30 08:52:25] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-30 08:52:25] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-30 08:52:25] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-30 08:52:25] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-30 08:52:25] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-30 08:52:25] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-30 08:52:25] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-30 08:52:25] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-30 08:52:25] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-30 08:52:25] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-30 08:52:25] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-30 08:52:26] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-05-30 08:52:26] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-05-30 08:52:26] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-30 08:52:26] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-30 08:52:26] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-30 08:52:26] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-30 08:52:26] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 770 unsolved
[2024-05-30 08:52:27] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-30 08:52:27] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2024-05-30 08:52:27] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-30 08:52:27] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2024-05-30 08:52:27] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 1 ms to minimize.
[2024-05-30 08:52:27] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-05-30 08:52:27] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-05-30 08:52:28] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-05-30 08:52:28] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 1 ms to minimize.
[2024-05-30 08:52:28] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
[2024-05-30 08:52:28] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 1 ms to minimize.
[2024-05-30 08:52:28] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2024-05-30 08:52:28] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 1 ms to minimize.
[2024-05-30 08:52:28] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 1 ms to minimize.
[2024-05-30 08:52:28] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 2 ms to minimize.
[2024-05-30 08:52:28] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 1 ms to minimize.
[2024-05-30 08:52:28] [INFO ] Deduced a trap composed of 67 places in 79 ms of which 1 ms to minimize.
[2024-05-30 08:52:29] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 1 ms to minimize.
[2024-05-30 08:52:30] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-05-30 08:52:30] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/571 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 770 unsolved
[2024-05-30 08:52:31] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 2 ms to minimize.
[2024-05-30 08:52:31] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 4 ms to minimize.
[2024-05-30 08:52:31] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-05-30 08:52:31] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-30 08:52:31] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-30 08:52:31] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-30 08:52:31] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-30 08:52:31] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-05-30 08:52:31] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-05-30 08:52:32] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
[2024-05-30 08:52:32] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-05-30 08:52:32] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 1 ms to minimize.
[2024-05-30 08:52:32] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-05-30 08:52:32] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 1 ms to minimize.
[2024-05-30 08:52:32] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 1 ms to minimize.
[2024-05-30 08:52:32] [INFO ] Deduced a trap composed of 67 places in 80 ms of which 1 ms to minimize.
[2024-05-30 08:52:32] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 1 ms to minimize.
[2024-05-30 08:52:32] [INFO ] Deduced a trap composed of 69 places in 77 ms of which 1 ms to minimize.
[2024-05-30 08:52:33] [INFO ] Deduced a trap composed of 72 places in 83 ms of which 1 ms to minimize.
[2024-05-30 08:52:33] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 770 unsolved
[2024-05-30 08:52:40] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-30 08:52:40] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2024-05-30 08:52:40] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-30 08:52:40] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2024-05-30 08:52:40] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-30 08:52:40] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-05-30 08:52:40] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-30 08:52:40] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2024-05-30 08:52:40] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2024-05-30 08:52:40] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-30 08:52:40] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-05-30 08:52:41] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-30 08:52:41] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 0 ms to minimize.
[2024-05-30 08:52:41] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 1 ms to minimize.
[2024-05-30 08:52:41] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 1 ms to minimize.
[2024-05-30 08:52:41] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 1 ms to minimize.
[2024-05-30 08:52:41] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 1 ms to minimize.
[2024-05-30 08:52:41] [INFO ] Deduced a trap composed of 60 places in 58 ms of which 2 ms to minimize.
[2024-05-30 08:52:41] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 1 ms to minimize.
[2024-05-30 08:52:41] [INFO ] Deduced a trap composed of 69 places in 72 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 770 unsolved
[2024-05-30 08:52:43] [INFO ] Deduced a trap composed of 79 places in 79 ms of which 1 ms to minimize.
[2024-05-30 08:52:43] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 2 ms to minimize.
[2024-05-30 08:52:43] [INFO ] Deduced a trap composed of 77 places in 78 ms of which 2 ms to minimize.
[2024-05-30 08:52:43] [INFO ] Deduced a trap composed of 75 places in 82 ms of which 2 ms to minimize.
[2024-05-30 08:52:43] [INFO ] Deduced a trap composed of 76 places in 75 ms of which 1 ms to minimize.
[2024-05-30 08:52:43] [INFO ] Deduced a trap composed of 75 places in 82 ms of which 1 ms to minimize.
[2024-05-30 08:52:43] [INFO ] Deduced a trap composed of 76 places in 77 ms of which 1 ms to minimize.
[2024-05-30 08:52:44] [INFO ] Deduced a trap composed of 75 places in 70 ms of which 1 ms to minimize.
[2024-05-30 08:52:44] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 1 ms to minimize.
[2024-05-30 08:52:44] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 1 ms to minimize.
[2024-05-30 08:52:44] [INFO ] Deduced a trap composed of 77 places in 74 ms of which 2 ms to minimize.
[2024-05-30 08:52:44] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 1 ms to minimize.
[2024-05-30 08:52:44] [INFO ] Deduced a trap composed of 78 places in 80 ms of which 1 ms to minimize.
[2024-05-30 08:52:44] [INFO ] Deduced a trap composed of 77 places in 78 ms of which 1 ms to minimize.
[2024-05-30 08:52:44] [INFO ] Deduced a trap composed of 81 places in 83 ms of which 1 ms to minimize.
[2024-05-30 08:52:44] [INFO ] Deduced a trap composed of 91 places in 87 ms of which 2 ms to minimize.
[2024-05-30 08:52:44] [INFO ] Deduced a trap composed of 87 places in 77 ms of which 2 ms to minimize.
[2024-05-30 08:52:45] [INFO ] Deduced a trap composed of 87 places in 80 ms of which 1 ms to minimize.
[2024-05-30 08:52:45] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 1 ms to minimize.
[2024-05-30 08:52:45] [INFO ] Deduced a trap composed of 85 places in 84 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 770 unsolved
[2024-05-30 08:52:46] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2024-05-30 08:52:46] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2024-05-30 08:52:46] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
[2024-05-30 08:52:46] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 0 ms to minimize.
[2024-05-30 08:52:46] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 1 ms to minimize.
[2024-05-30 08:52:46] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-05-30 08:52:46] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2024-05-30 08:52:46] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-05-30 08:52:46] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-05-30 08:52:47] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-30 08:52:47] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 1 ms to minimize.
[2024-05-30 08:52:47] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 1 ms to minimize.
[2024-05-30 08:52:47] [INFO ] Deduced a trap composed of 70 places in 80 ms of which 1 ms to minimize.
[2024-05-30 08:52:47] [INFO ] Deduced a trap composed of 75 places in 84 ms of which 1 ms to minimize.
[2024-05-30 08:52:47] [INFO ] Deduced a trap composed of 73 places in 78 ms of which 1 ms to minimize.
[2024-05-30 08:52:47] [INFO ] Deduced a trap composed of 71 places in 84 ms of which 2 ms to minimize.
[2024-05-30 08:52:48] [INFO ] Deduced a trap composed of 77 places in 86 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/1348 variables, and 199 constraints, problems are : Problem set: 0 solved, 770 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 82/161 constraints, State Equation: 0/574 constraints, PredecessorRefiner: 770/770 constraints, Known Traps: 117/117 constraints]
Escalating to Integer solving :Problem set: 0 solved, 770 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 770 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 117/199 constraints. Problems are: Problem set: 0 solved, 770 unsolved
[2024-05-30 08:52:49] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-30 08:52:49] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-30 08:52:49] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2024-05-30 08:52:49] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 0 ms to minimize.
[2024-05-30 08:52:49] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-05-30 08:52:49] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-30 08:52:49] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-30 08:52:50] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2024-05-30 08:52:50] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-05-30 08:52:50] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-05-30 08:52:50] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-05-30 08:52:50] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 0 ms to minimize.
[2024-05-30 08:52:50] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-05-30 08:52:50] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-30 08:52:50] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-05-30 08:52:50] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-30 08:52:50] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-05-30 08:52:50] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-05-30 08:52:50] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-05-30 08:52:50] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/571 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 770 unsolved
[2024-05-30 08:52:52] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-30 08:52:52] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-30 08:52:52] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-30 08:52:52] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-30 08:52:52] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 0 ms to minimize.
[2024-05-30 08:52:52] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 0 ms to minimize.
[2024-05-30 08:52:52] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-30 08:52:52] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-30 08:52:52] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-30 08:52:52] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 0 ms to minimize.
[2024-05-30 08:52:52] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-30 08:52:52] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-05-30 08:52:52] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-30 08:52:52] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-30 08:52:52] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-30 08:52:52] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-30 08:52:53] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-30 08:52:53] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2024-05-30 08:52:53] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-30 08:52:53] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 20/239 constraints. Problems are: Problem set: 0 solved, 770 unsolved
[2024-05-30 08:52:54] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 1 ms to minimize.
[2024-05-30 08:52:54] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 1 ms to minimize.
[2024-05-30 08:52:55] [INFO ] Deduced a trap composed of 71 places in 77 ms of which 2 ms to minimize.
[2024-05-30 08:52:55] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 2 ms to minimize.
[2024-05-30 08:52:55] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-05-30 08:52:55] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 2 ms to minimize.
[2024-05-30 08:52:55] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 1 ms to minimize.
[2024-05-30 08:52:55] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2024-05-30 08:52:55] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 2 ms to minimize.
[2024-05-30 08:52:55] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 2 ms to minimize.
[2024-05-30 08:52:55] [INFO ] Deduced a trap composed of 79 places in 83 ms of which 1 ms to minimize.
[2024-05-30 08:52:55] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 1 ms to minimize.
[2024-05-30 08:52:55] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 1 ms to minimize.
[2024-05-30 08:52:56] [INFO ] Deduced a trap composed of 75 places in 83 ms of which 2 ms to minimize.
[2024-05-30 08:52:56] [INFO ] Deduced a trap composed of 87 places in 87 ms of which 2 ms to minimize.
[2024-05-30 08:52:56] [INFO ] Deduced a trap composed of 88 places in 89 ms of which 2 ms to minimize.
[2024-05-30 08:52:57] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 2 ms to minimize.
[2024-05-30 08:52:57] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-05-30 08:52:57] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 2 ms to minimize.
[2024-05-30 08:52:57] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 770 unsolved
[2024-05-30 08:52:58] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-30 08:52:58] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-30 08:52:59] [INFO ] Deduced a trap composed of 71 places in 81 ms of which 1 ms to minimize.
[2024-05-30 08:52:59] [INFO ] Deduced a trap composed of 72 places in 83 ms of which 1 ms to minimize.
[2024-05-30 08:52:59] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 1 ms to minimize.
[2024-05-30 08:52:59] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 2 ms to minimize.
[2024-05-30 08:52:59] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 1 ms to minimize.
[2024-05-30 08:52:59] [INFO ] Deduced a trap composed of 71 places in 78 ms of which 2 ms to minimize.
[2024-05-30 08:52:59] [INFO ] Deduced a trap composed of 71 places in 78 ms of which 1 ms to minimize.
[2024-05-30 08:52:59] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 1 ms to minimize.
[2024-05-30 08:52:59] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 1 ms to minimize.
[2024-05-30 08:52:59] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 1 ms to minimize.
[2024-05-30 08:53:00] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 1 ms to minimize.
[2024-05-30 08:53:00] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 2 ms to minimize.
[2024-05-30 08:53:00] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 2 ms to minimize.
[2024-05-30 08:53:00] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 1 ms to minimize.
[2024-05-30 08:53:00] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 2 ms to minimize.
[2024-05-30 08:53:00] [INFO ] Deduced a trap composed of 68 places in 73 ms of which 1 ms to minimize.
[2024-05-30 08:53:00] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 1 ms to minimize.
[2024-05-30 08:53:00] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 20/279 constraints. Problems are: Problem set: 0 solved, 770 unsolved
[2024-05-30 08:53:01] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-30 08:53:01] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2024-05-30 08:53:01] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-30 08:53:02] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-05-30 08:53:02] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-05-30 08:53:02] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-30 08:53:02] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-05-30 08:53:02] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-05-30 08:53:02] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 1 ms to minimize.
[2024-05-30 08:53:02] [INFO ] Deduced a trap composed of 68 places in 73 ms of which 2 ms to minimize.
[2024-05-30 08:53:02] [INFO ] Deduced a trap composed of 69 places in 81 ms of which 1 ms to minimize.
[2024-05-30 08:53:03] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 1 ms to minimize.
[2024-05-30 08:53:03] [INFO ] Deduced a trap composed of 68 places in 81 ms of which 2 ms to minimize.
[2024-05-30 08:53:03] [INFO ] Deduced a trap composed of 69 places in 75 ms of which 1 ms to minimize.
[2024-05-30 08:53:03] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 1 ms to minimize.
[2024-05-30 08:53:03] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 1 ms to minimize.
[2024-05-30 08:53:03] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 2 ms to minimize.
[2024-05-30 08:53:03] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 1 ms to minimize.
[2024-05-30 08:53:03] [INFO ] Deduced a trap composed of 70 places in 78 ms of which 1 ms to minimize.
[2024-05-30 08:53:03] [INFO ] Deduced a trap composed of 69 places in 72 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/571 variables, 20/299 constraints. Problems are: Problem set: 0 solved, 770 unsolved
[2024-05-30 08:53:05] [INFO ] Deduced a trap composed of 71 places in 78 ms of which 2 ms to minimize.
[2024-05-30 08:53:05] [INFO ] Deduced a trap composed of 69 places in 76 ms of which 1 ms to minimize.
[2024-05-30 08:53:05] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 2 ms to minimize.
[2024-05-30 08:53:05] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 2 ms to minimize.
[2024-05-30 08:53:05] [INFO ] Deduced a trap composed of 69 places in 80 ms of which 1 ms to minimize.
[2024-05-30 08:53:05] [INFO ] Deduced a trap composed of 67 places in 81 ms of which 2 ms to minimize.
[2024-05-30 08:53:06] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 2 ms to minimize.
[2024-05-30 08:53:06] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 1 ms to minimize.
[2024-05-30 08:53:06] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 1 ms to minimize.
[2024-05-30 08:53:07] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-05-30 08:53:07] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2024-05-30 08:53:07] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-05-30 08:53:07] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-05-30 08:53:07] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-05-30 08:53:07] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2024-05-30 08:53:07] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-30 08:53:07] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-30 08:53:07] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2024-05-30 08:53:07] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 1 ms to minimize.
[2024-05-30 08:53:08] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/571 variables, 20/319 constraints. Problems are: Problem set: 0 solved, 770 unsolved
[2024-05-30 08:53:09] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-05-30 08:53:09] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 1 ms to minimize.
[2024-05-30 08:53:09] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2024-05-30 08:53:09] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-30 08:53:09] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-05-30 08:53:09] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
[2024-05-30 08:53:09] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-05-30 08:53:09] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-05-30 08:53:10] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-05-30 08:53:10] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-05-30 08:53:10] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 1 ms to minimize.
[2024-05-30 08:53:10] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-30 08:53:10] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-05-30 08:53:10] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 1 ms to minimize.
[2024-05-30 08:53:10] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 1 ms to minimize.
[2024-05-30 08:53:10] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-05-30 08:53:10] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 1 ms to minimize.
[2024-05-30 08:53:10] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 1 ms to minimize.
[2024-05-30 08:53:10] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-05-30 08:53:10] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 20/339 constraints. Problems are: Problem set: 0 solved, 770 unsolved
[2024-05-30 08:53:12] [INFO ] Deduced a trap composed of 61 places in 81 ms of which 1 ms to minimize.
[2024-05-30 08:53:12] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 1 ms to minimize.
[2024-05-30 08:53:12] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 2 ms to minimize.
[2024-05-30 08:53:12] [INFO ] Deduced a trap composed of 75 places in 85 ms of which 1 ms to minimize.
[2024-05-30 08:53:13] [INFO ] Deduced a trap composed of 85 places in 90 ms of which 1 ms to minimize.
[2024-05-30 08:53:13] [INFO ] Deduced a trap composed of 85 places in 87 ms of which 2 ms to minimize.
[2024-05-30 08:53:13] [INFO ] Deduced a trap composed of 81 places in 88 ms of which 1 ms to minimize.
[2024-05-30 08:53:13] [INFO ] Deduced a trap composed of 81 places in 82 ms of which 1 ms to minimize.
[2024-05-30 08:53:13] [INFO ] Deduced a trap composed of 80 places in 85 ms of which 1 ms to minimize.
[2024-05-30 08:53:13] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 2 ms to minimize.
[2024-05-30 08:53:13] [INFO ] Deduced a trap composed of 81 places in 85 ms of which 2 ms to minimize.
[2024-05-30 08:53:13] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 2 ms to minimize.
[2024-05-30 08:53:13] [INFO ] Deduced a trap composed of 80 places in 82 ms of which 2 ms to minimize.
[2024-05-30 08:53:13] [INFO ] Deduced a trap composed of 83 places in 81 ms of which 2 ms to minimize.
[2024-05-30 08:53:14] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 2 ms to minimize.
[2024-05-30 08:53:14] [INFO ] Deduced a trap composed of 82 places in 90 ms of which 1 ms to minimize.
[2024-05-30 08:53:14] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 1 ms to minimize.
[2024-05-30 08:53:15] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 1 ms to minimize.
[2024-05-30 08:53:15] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 2 ms to minimize.
[2024-05-30 08:53:15] [INFO ] Deduced a trap composed of 70 places in 83 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/571 variables, 20/359 constraints. Problems are: Problem set: 0 solved, 770 unsolved
[2024-05-30 08:53:16] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-30 08:53:16] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-30 08:53:16] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2024-05-30 08:53:16] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-30 08:53:16] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-30 08:53:16] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
[2024-05-30 08:53:17] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 1 ms to minimize.
[2024-05-30 08:53:17] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
[2024-05-30 08:53:17] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-05-30 08:53:17] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-05-30 08:53:17] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
[2024-05-30 08:53:17] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
[2024-05-30 08:53:17] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2024-05-30 08:53:17] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
[2024-05-30 08:53:18] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 2 ms to minimize.
[2024-05-30 08:53:18] [INFO ] Deduced a trap composed of 71 places in 91 ms of which 1 ms to minimize.
SMT process timed out in 60310ms, After SMT, problems are : Problem set: 0 solved, 770 unsolved
Search for dead transitions found 0 dead transitions in 60318ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61250 ms. Remains : 574/574 places, 774/774 transitions.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-05-30 08:53:18] [INFO ] Flatten gal took : 65 ms
[2024-05-30 08:53:18] [INFO ] Flatten gal took : 56 ms
[2024-05-30 08:53:18] [INFO ] Input system was already deterministic with 1560 transitions.
Support contains 181 out of 1360 places (down from 182) after GAL structural reductions.
Computed a total of 344 stabilizing places and 344 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1360/1360 places, 1560/1560 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 1359 transition count 1398
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 1 with 161 rules applied. Total rules applied 322 place count 1198 transition count 1398
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 322 place count 1198 transition count 1199
Deduced a syphon composed of 199 places in 2 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 720 place count 999 transition count 1199
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 757 place count 962 transition count 1162
Iterating global reduction 2 with 37 rules applied. Total rules applied 794 place count 962 transition count 1162
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 794 place count 962 transition count 1144
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 830 place count 944 transition count 1144
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 379
Deduced a syphon composed of 379 places in 1 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 2 with 758 rules applied. Total rules applied 1588 place count 565 transition count 765
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1590 place count 563 transition count 763
Applied a total of 1590 rules in 149 ms. Remains 563 /1360 variables (removed 797) and now considering 763/1560 (removed 797) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 149 ms. Remains : 563/1360 places, 763/1560 transitions.
[2024-05-30 08:53:18] [INFO ] Flatten gal took : 24 ms
[2024-05-30 08:53:18] [INFO ] Flatten gal took : 25 ms
[2024-05-30 08:53:18] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1360/1360 places, 1560/1560 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 155 transitions
Trivial Post-agglo rules discarded 155 transitions
Performed 155 trivial Post agglomeration. Transition count delta: 155
Iterating post reduction 0 with 155 rules applied. Total rules applied 155 place count 1359 transition count 1404
Reduce places removed 155 places and 0 transitions.
Iterating post reduction 1 with 155 rules applied. Total rules applied 310 place count 1204 transition count 1404
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 310 place count 1204 transition count 1203
Deduced a syphon composed of 201 places in 1 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 712 place count 1003 transition count 1203
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 746 place count 969 transition count 1169
Iterating global reduction 2 with 34 rules applied. Total rules applied 780 place count 969 transition count 1169
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 780 place count 969 transition count 1153
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 812 place count 953 transition count 1153
Performed 371 Post agglomeration using F-continuation condition.Transition count delta: 371
Deduced a syphon composed of 371 places in 1 ms
Reduce places removed 371 places and 0 transitions.
Iterating global reduction 2 with 742 rules applied. Total rules applied 1554 place count 582 transition count 782
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1556 place count 580 transition count 780
Applied a total of 1556 rules in 144 ms. Remains 580 /1360 variables (removed 780) and now considering 780/1560 (removed 780) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 144 ms. Remains : 580/1360 places, 780/1560 transitions.
[2024-05-30 08:53:18] [INFO ] Flatten gal took : 27 ms
[2024-05-30 08:53:18] [INFO ] Flatten gal took : 29 ms
[2024-05-30 08:53:18] [INFO ] Input system was already deterministic with 780 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1360/1360 places, 1560/1560 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 1330 transition count 1530
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 1330 transition count 1530
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1329 transition count 1529
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1329 transition count 1529
Applied a total of 62 rules in 89 ms. Remains 1329 /1360 variables (removed 31) and now considering 1529/1560 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90 ms. Remains : 1329/1360 places, 1529/1560 transitions.
[2024-05-30 08:53:19] [INFO ] Flatten gal took : 43 ms
[2024-05-30 08:53:19] [INFO ] Flatten gal took : 46 ms
[2024-05-30 08:53:19] [INFO ] Input system was already deterministic with 1529 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1360/1360 places, 1560/1560 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 1326 transition count 1526
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 1326 transition count 1526
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1325 transition count 1525
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1325 transition count 1525
Applied a total of 70 rules in 91 ms. Remains 1325 /1360 variables (removed 35) and now considering 1525/1560 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92 ms. Remains : 1325/1360 places, 1525/1560 transitions.
[2024-05-30 08:53:19] [INFO ] Flatten gal took : 44 ms
[2024-05-30 08:53:19] [INFO ] Flatten gal took : 46 ms
[2024-05-30 08:53:19] [INFO ] Input system was already deterministic with 1525 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1360/1360 places, 1560/1560 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 1359 transition count 1398
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 1 with 161 rules applied. Total rules applied 322 place count 1198 transition count 1398
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 322 place count 1198 transition count 1199
Deduced a syphon composed of 199 places in 1 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 720 place count 999 transition count 1199
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 757 place count 962 transition count 1162
Iterating global reduction 2 with 37 rules applied. Total rules applied 794 place count 962 transition count 1162
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 794 place count 962 transition count 1144
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 830 place count 944 transition count 1144
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 379
Deduced a syphon composed of 379 places in 1 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 2 with 758 rules applied. Total rules applied 1588 place count 565 transition count 765
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1590 place count 563 transition count 763
Applied a total of 1590 rules in 137 ms. Remains 563 /1360 variables (removed 797) and now considering 763/1560 (removed 797) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 138 ms. Remains : 563/1360 places, 763/1560 transitions.
[2024-05-30 08:53:19] [INFO ] Flatten gal took : 23 ms
[2024-05-30 08:53:19] [INFO ] Flatten gal took : 24 ms
[2024-05-30 08:53:19] [INFO ] Input system was already deterministic with 763 transitions.
RANDOM walk for 1158 steps (0 resets) in 13 ms. (82 steps per ms) remains 0/1 properties
FORMULA ShieldRVs-PT-040B-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 1360/1360 places, 1560/1560 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 1324 transition count 1524
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 1324 transition count 1524
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 1323 transition count 1523
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 1323 transition count 1523
Applied a total of 74 rules in 99 ms. Remains 1323 /1360 variables (removed 37) and now considering 1523/1560 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101 ms. Remains : 1323/1360 places, 1523/1560 transitions.
[2024-05-30 08:53:19] [INFO ] Flatten gal took : 44 ms
[2024-05-30 08:53:19] [INFO ] Flatten gal took : 47 ms
[2024-05-30 08:53:20] [INFO ] Input system was already deterministic with 1523 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1360/1360 places, 1560/1560 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 1328 transition count 1528
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 1328 transition count 1528
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1327 transition count 1527
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1327 transition count 1527
Applied a total of 66 rules in 98 ms. Remains 1327 /1360 variables (removed 33) and now considering 1527/1560 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 99 ms. Remains : 1327/1360 places, 1527/1560 transitions.
[2024-05-30 08:53:20] [INFO ] Flatten gal took : 40 ms
[2024-05-30 08:53:20] [INFO ] Flatten gal took : 41 ms
[2024-05-30 08:53:20] [INFO ] Input system was already deterministic with 1527 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1360/1360 places, 1560/1560 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 1324 transition count 1524
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 1324 transition count 1524
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 1323 transition count 1523
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 1323 transition count 1523
Applied a total of 74 rules in 97 ms. Remains 1323 /1360 variables (removed 37) and now considering 1523/1560 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98 ms. Remains : 1323/1360 places, 1523/1560 transitions.
[2024-05-30 08:53:20] [INFO ] Flatten gal took : 37 ms
[2024-05-30 08:53:20] [INFO ] Flatten gal took : 39 ms
[2024-05-30 08:53:20] [INFO ] Input system was already deterministic with 1523 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1360/1360 places, 1560/1560 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 157 transitions
Trivial Post-agglo rules discarded 157 transitions
Performed 157 trivial Post agglomeration. Transition count delta: 157
Iterating post reduction 0 with 157 rules applied. Total rules applied 157 place count 1359 transition count 1402
Reduce places removed 157 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 158 rules applied. Total rules applied 315 place count 1202 transition count 1401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 316 place count 1201 transition count 1401
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 316 place count 1201 transition count 1201
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 716 place count 1001 transition count 1201
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 750 place count 967 transition count 1167
Iterating global reduction 3 with 34 rules applied. Total rules applied 784 place count 967 transition count 1167
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 784 place count 967 transition count 1151
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 816 place count 951 transition count 1151
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 379
Deduced a syphon composed of 379 places in 0 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 3 with 758 rules applied. Total rules applied 1574 place count 572 transition count 772
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1576 place count 570 transition count 770
Applied a total of 1576 rules in 140 ms. Remains 570 /1360 variables (removed 790) and now considering 770/1560 (removed 790) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 140 ms. Remains : 570/1360 places, 770/1560 transitions.
[2024-05-30 08:53:20] [INFO ] Flatten gal took : 21 ms
[2024-05-30 08:53:20] [INFO ] Flatten gal took : 23 ms
[2024-05-30 08:53:20] [INFO ] Input system was already deterministic with 770 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1360/1360 places, 1560/1560 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 159 rules applied. Total rules applied 159 place count 1359 transition count 1400
Reduce places removed 159 places and 0 transitions.
Iterating post reduction 1 with 159 rules applied. Total rules applied 318 place count 1200 transition count 1400
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 318 place count 1200 transition count 1201
Deduced a syphon composed of 199 places in 2 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 716 place count 1001 transition count 1201
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 752 place count 965 transition count 1165
Iterating global reduction 2 with 36 rules applied. Total rules applied 788 place count 965 transition count 1165
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 788 place count 965 transition count 1147
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 824 place count 947 transition count 1147
Performed 377 Post agglomeration using F-continuation condition.Transition count delta: 377
Deduced a syphon composed of 377 places in 1 ms
Reduce places removed 377 places and 0 transitions.
Iterating global reduction 2 with 754 rules applied. Total rules applied 1578 place count 570 transition count 770
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1580 place count 568 transition count 768
Applied a total of 1580 rules in 124 ms. Remains 568 /1360 variables (removed 792) and now considering 768/1560 (removed 792) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 124 ms. Remains : 568/1360 places, 768/1560 transitions.
[2024-05-30 08:53:20] [INFO ] Flatten gal took : 19 ms
[2024-05-30 08:53:20] [INFO ] Flatten gal took : 21 ms
[2024-05-30 08:53:21] [INFO ] Input system was already deterministic with 768 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1360/1360 places, 1560/1560 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 157 transitions
Trivial Post-agglo rules discarded 157 transitions
Performed 157 trivial Post agglomeration. Transition count delta: 157
Iterating post reduction 0 with 157 rules applied. Total rules applied 157 place count 1359 transition count 1402
Reduce places removed 157 places and 0 transitions.
Iterating post reduction 1 with 157 rules applied. Total rules applied 314 place count 1202 transition count 1402
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 314 place count 1202 transition count 1203
Deduced a syphon composed of 199 places in 1 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 712 place count 1003 transition count 1203
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 749 place count 966 transition count 1166
Iterating global reduction 2 with 37 rules applied. Total rules applied 786 place count 966 transition count 1166
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 786 place count 966 transition count 1149
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 820 place count 949 transition count 1149
Performed 378 Post agglomeration using F-continuation condition.Transition count delta: 378
Deduced a syphon composed of 378 places in 0 ms
Reduce places removed 378 places and 0 transitions.
Iterating global reduction 2 with 756 rules applied. Total rules applied 1576 place count 571 transition count 771
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1578 place count 569 transition count 769
Applied a total of 1578 rules in 144 ms. Remains 569 /1360 variables (removed 791) and now considering 769/1560 (removed 791) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 145 ms. Remains : 569/1360 places, 769/1560 transitions.
[2024-05-30 08:53:21] [INFO ] Flatten gal took : 21 ms
[2024-05-30 08:53:21] [INFO ] Flatten gal took : 22 ms
[2024-05-30 08:53:21] [INFO ] Input system was already deterministic with 769 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1360/1360 places, 1560/1560 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 1325 transition count 1525
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 1325 transition count 1525
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 1324 transition count 1524
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 1324 transition count 1524
Applied a total of 72 rules in 96 ms. Remains 1324 /1360 variables (removed 36) and now considering 1524/1560 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97 ms. Remains : 1324/1360 places, 1524/1560 transitions.
[2024-05-30 08:53:21] [INFO ] Flatten gal took : 38 ms
[2024-05-30 08:53:21] [INFO ] Flatten gal took : 41 ms
[2024-05-30 08:53:21] [INFO ] Input system was already deterministic with 1524 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1360/1360 places, 1560/1560 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 1326 transition count 1526
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 1326 transition count 1526
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1325 transition count 1525
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1325 transition count 1525
Applied a total of 70 rules in 91 ms. Remains 1325 /1360 variables (removed 35) and now considering 1525/1560 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92 ms. Remains : 1325/1360 places, 1525/1560 transitions.
[2024-05-30 08:53:21] [INFO ] Flatten gal took : 36 ms
[2024-05-30 08:53:21] [INFO ] Flatten gal took : 37 ms
[2024-05-30 08:53:21] [INFO ] Input system was already deterministic with 1525 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1360/1360 places, 1560/1560 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 1326 transition count 1526
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 1326 transition count 1526
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1325 transition count 1525
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1325 transition count 1525
Applied a total of 70 rules in 71 ms. Remains 1325 /1360 variables (removed 35) and now considering 1525/1560 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72 ms. Remains : 1325/1360 places, 1525/1560 transitions.
[2024-05-30 08:53:21] [INFO ] Flatten gal took : 35 ms
[2024-05-30 08:53:21] [INFO ] Flatten gal took : 36 ms
[2024-05-30 08:53:22] [INFO ] Input system was already deterministic with 1525 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1360/1360 places, 1560/1560 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 1325 transition count 1525
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 1325 transition count 1525
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 1324 transition count 1524
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 1324 transition count 1524
Applied a total of 72 rules in 73 ms. Remains 1324 /1360 variables (removed 36) and now considering 1524/1560 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73 ms. Remains : 1324/1360 places, 1524/1560 transitions.
[2024-05-30 08:53:22] [INFO ] Flatten gal took : 35 ms
[2024-05-30 08:53:22] [INFO ] Flatten gal took : 36 ms
[2024-05-30 08:53:22] [INFO ] Input system was already deterministic with 1524 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1360/1360 places, 1560/1560 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 1326 transition count 1526
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 1326 transition count 1526
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1325 transition count 1525
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1325 transition count 1525
Applied a total of 70 rules in 74 ms. Remains 1325 /1360 variables (removed 35) and now considering 1525/1560 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74 ms. Remains : 1325/1360 places, 1525/1560 transitions.
[2024-05-30 08:53:22] [INFO ] Flatten gal took : 34 ms
[2024-05-30 08:53:22] [INFO ] Flatten gal took : 35 ms
[2024-05-30 08:53:22] [INFO ] Input system was already deterministic with 1525 transitions.
[2024-05-30 08:53:22] [INFO ] Flatten gal took : 37 ms
[2024-05-30 08:53:22] [INFO ] Flatten gal took : 37 ms
[2024-05-30 08:53:22] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2024-05-30 08:53:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1360 places, 1560 transitions and 5274 arcs took 7 ms.
Total runtime 137379 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldRVs-PT-040B

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1360
TRANSITIONS: 1560
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.023s, Sys 0.007s]


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


----------------------------------------------------------------------
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: 2127
MODEL NAME: /home/mcc/execution/412/model
1360 places, 1560 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...
FORMULA ShieldRVs-PT-040B-CTLFireability-2024-00 CANNOT_COMPUTE
FORMULA ShieldRVs-PT-040B-CTLFireability-2024-01 CANNOT_COMPUTE
FORMULA ShieldRVs-PT-040B-CTLFireability-2024-02 CANNOT_COMPUTE
FORMULA ShieldRVs-PT-040B-CTLFireability-2024-03 CANNOT_COMPUTE
FORMULA ShieldRVs-PT-040B-CTLFireability-2024-05 CANNOT_COMPUTE
FORMULA ShieldRVs-PT-040B-CTLFireability-2024-06 CANNOT_COMPUTE
FORMULA ShieldRVs-PT-040B-CTLFireability-2024-07 CANNOT_COMPUTE
FORMULA ShieldRVs-PT-040B-CTLFireability-2024-08 CANNOT_COMPUTE
FORMULA ShieldRVs-PT-040B-CTLFireability-2024-09 CANNOT_COMPUTE
FORMULA ShieldRVs-PT-040B-CTLFireability-2024-10 CANNOT_COMPUTE
FORMULA ShieldRVs-PT-040B-CTLFireability-2024-11 CANNOT_COMPUTE
FORMULA ShieldRVs-PT-040B-CTLFireability-2023-12 CANNOT_COMPUTE
FORMULA ShieldRVs-PT-040B-CTLFireability-2023-13 CANNOT_COMPUTE
FORMULA ShieldRVs-PT-040B-CTLFireability-2023-14 CANNOT_COMPUTE
FORMULA ShieldRVs-PT-040B-CTLFireability-2023-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717061390205

--------------------
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

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-040B"
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-040B, 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-171683759700842"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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