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-171683758500297.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 ShieldIIPt-PT-030B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683758500297
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 928K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 20:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 12 20:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 20:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 20:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 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 512K 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 ShieldIIPt-PT-030B-CTLCardinality-2024-00
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-2024-01
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-2024-02
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-2024-03
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-2024-04
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-2024-05
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-2024-06
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-2024-07
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-2024-08
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-2024-09
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-2024-10
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-2024-11
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-2023-12
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-2023-13
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-2023-14
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716935536164

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-030B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 22:32:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 22:32:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 22:32:17] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2024-05-28 22:32:17] [INFO ] Transformed 2103 places.
[2024-05-28 22:32:17] [INFO ] Transformed 1953 transitions.
[2024-05-28 22:32:17] [INFO ] Found NUPN structural information;
[2024-05-28 22:32:17] [INFO ] Parsed PT model containing 2103 places and 1953 transitions and 4866 arcs in 338 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPt-PT-030B-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 95 out of 2103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2103/2103 places, 1953/1953 transitions.
Discarding 301 places :
Symmetric choice reduction at 0 with 301 rule applications. Total rules 301 place count 1802 transition count 1652
Iterating global reduction 0 with 301 rules applied. Total rules applied 602 place count 1802 transition count 1652
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 603 place count 1801 transition count 1651
Iterating global reduction 0 with 1 rules applied. Total rules applied 604 place count 1801 transition count 1651
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 605 place count 1800 transition count 1650
Iterating global reduction 0 with 1 rules applied. Total rules applied 606 place count 1800 transition count 1650
Applied a total of 606 rules in 807 ms. Remains 1800 /2103 variables (removed 303) and now considering 1650/1953 (removed 303) transitions.
// Phase 1: matrix 1650 rows 1800 cols
[2024-05-28 22:32:18] [INFO ] Computed 271 invariants in 33 ms
[2024-05-28 22:32:19] [INFO ] Implicit Places using invariants in 880 ms returned []
[2024-05-28 22:32:19] [INFO ] Invariant cache hit.
[2024-05-28 22:32:20] [INFO ] Implicit Places using invariants and state equation in 1319 ms returned []
Implicit Place search using SMT with State Equation took 2229 ms to find 0 implicit places.
Running 1649 sub problems to find dead transitions.
[2024-05-28 22:32:20] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1799/3450 variables, and 0 constraints, problems are : Problem set: 0 solved, 1649 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1800 constraints, PredecessorRefiner: 1649/1649 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1649 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1799/3450 variables, and 0 constraints, problems are : Problem set: 0 solved, 1649 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/271 constraints, State Equation: 0/1800 constraints, PredecessorRefiner: 0/1649 constraints, Known Traps: 0/0 constraints]
After SMT, in 60558ms problems are : Problem set: 0 solved, 1649 unsolved
Search for dead transitions found 0 dead transitions in 60592ms
Starting structural reductions in LTL mode, iteration 1 : 1800/2103 places, 1650/1953 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63656 ms. Remains : 1800/2103 places, 1650/1953 transitions.
Support contains 95 out of 1800 places after structural reductions.
[2024-05-28 22:33:21] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-28 22:33:21] [INFO ] Flatten gal took : 130 ms
[2024-05-28 22:33:21] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldIIPt-PT-030B-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 22:33:21] [INFO ] Flatten gal took : 72 ms
[2024-05-28 22:33:22] [INFO ] Input system was already deterministic with 1650 transitions.
Support contains 83 out of 1800 places (down from 95) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2825 ms. (14 steps per ms) remains 19/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
[2024-05-28 22:33:23] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 602/654 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/654 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 1146/1800 variables, 196/271 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1800 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 1650/3450 variables, 1800/2071 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3450 variables, 0/2071 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 0/3450 variables, 0/2071 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3450/3450 variables, and 2071 constraints, problems are : Problem set: 0 solved, 19 unsolved in 3169 ms.
Refiners :[Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 1800/1800 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 602/654 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-28 22:33:26] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 16 ms to minimize.
[2024-05-28 22:33:26] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 3 ms to minimize.
[2024-05-28 22:33:26] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 4 ms to minimize.
[2024-05-28 22:33:26] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/654 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/654 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 1146/1800 variables, 196/275 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-28 22:33:27] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 4 ms to minimize.
[2024-05-28 22:33:27] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 4 ms to minimize.
[2024-05-28 22:33:27] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 4 ms to minimize.
[2024-05-28 22:33:28] [INFO ] Deduced a trap composed of 34 places in 143 ms of which 3 ms to minimize.
[2024-05-28 22:33:28] [INFO ] Deduced a trap composed of 20 places in 154 ms of which 4 ms to minimize.
[2024-05-28 22:33:28] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 4 ms to minimize.
[2024-05-28 22:33:28] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 3 ms to minimize.
[2024-05-28 22:33:28] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 3 ms to minimize.
[2024-05-28 22:33:28] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 3 ms to minimize.
[2024-05-28 22:33:29] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 3 ms to minimize.
[2024-05-28 22:33:29] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 3 ms to minimize.
[2024-05-28 22:33:29] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 3 ms to minimize.
[2024-05-28 22:33:29] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 3 ms to minimize.
[2024-05-28 22:33:29] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 2 ms to minimize.
[2024-05-28 22:33:29] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 2 ms to minimize.
[2024-05-28 22:33:30] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 3 ms to minimize.
[2024-05-28 22:33:30] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 2 ms to minimize.
[2024-05-28 22:33:30] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 2 ms to minimize.
[2024-05-28 22:33:30] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 2 ms to minimize.
[2024-05-28 22:33:30] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1800 variables, 20/295 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-28 22:33:30] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 2 ms to minimize.
[2024-05-28 22:33:30] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 2 ms to minimize.
[2024-05-28 22:33:30] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 3 ms to minimize.
[2024-05-28 22:33:31] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 2 ms to minimize.
[2024-05-28 22:33:31] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 2 ms to minimize.
SMT process timed out in 8225ms, After SMT, problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 52 out of 1800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1800/1800 places, 1650/1650 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 335 transitions
Trivial Post-agglo rules discarded 335 transitions
Performed 335 trivial Post agglomeration. Transition count delta: 335
Iterating post reduction 0 with 335 rules applied. Total rules applied 335 place count 1800 transition count 1315
Reduce places removed 335 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 340 rules applied. Total rules applied 675 place count 1465 transition count 1310
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 680 place count 1460 transition count 1310
Performed 221 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 221 Pre rules applied. Total rules applied 680 place count 1460 transition count 1089
Deduced a syphon composed of 221 places in 2 ms
Reduce places removed 221 places and 0 transitions.
Iterating global reduction 3 with 442 rules applied. Total rules applied 1122 place count 1239 transition count 1089
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1131 place count 1230 transition count 1080
Iterating global reduction 3 with 9 rules applied. Total rules applied 1140 place count 1230 transition count 1080
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 1140 place count 1230 transition count 1074
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1152 place count 1224 transition count 1074
Performed 502 Post agglomeration using F-continuation condition.Transition count delta: 502
Deduced a syphon composed of 502 places in 2 ms
Reduce places removed 502 places and 0 transitions.
Iterating global reduction 3 with 1004 rules applied. Total rules applied 2156 place count 722 transition count 572
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2157 place count 722 transition count 571
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2159 place count 721 transition count 570
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 4 with 156 rules applied. Total rules applied 2315 place count 643 transition count 615
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2316 place count 643 transition count 614
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2320 place count 643 transition count 610
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2324 place count 639 transition count 610
Partial Free-agglomeration rule applied 26 times.
Drop transitions (Partial Free agglomeration) removed 26 transitions
Iterating global reduction 6 with 26 rules applied. Total rules applied 2350 place count 639 transition count 610
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2351 place count 638 transition count 609
Applied a total of 2351 rules in 490 ms. Remains 638 /1800 variables (removed 1162) and now considering 609/1650 (removed 1041) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 491 ms. Remains : 638/1800 places, 609/1650 transitions.
RANDOM walk for 40000 steps (8 resets) in 1026 ms. (38 steps per ms) remains 15/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
// Phase 1: matrix 609 rows 638 cols
[2024-05-28 22:33:32] [INFO ] Computed 271 invariants in 3 ms
[2024-05-28 22:33:32] [INFO ] State equation strengthened by 46 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 136/172 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 26/198 variables, 12/70 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 244/442 variables, 198/268 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 28/296 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 308/750 variables, 156/452 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/750 variables, 69/521 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 3/524 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/750 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 10/760 variables, 8/532 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/760 variables, 6/538 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/760 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 28/788 variables, 12/550 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/788 variables, 2/552 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/788 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (OVERLAPS) 249/1037 variables, 150/702 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1037 variables, 45/747 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1037 variables, 8/755 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1037 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 22 (OVERLAPS) 12/1049 variables, 14/769 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1049 variables, 10/779 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1049 variables, 0/779 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 25 (OVERLAPS) 23/1072 variables, 11/790 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1072 variables, 2/792 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1072 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 28 (OVERLAPS) 94/1166 variables, 69/861 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1166 variables, 19/880 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1166 variables, 7/887 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1166 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 32 (OVERLAPS) 2/1168 variables, 4/891 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1168 variables, 2/893 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1168 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 35 (OVERLAPS) 36/1204 variables, 17/910 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1204 variables, 7/917 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1204 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 38 (OVERLAPS) 2/1206 variables, 1/918 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1206 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 40 (OVERLAPS) 4/1210 variables, 2/920 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1210 variables, 0/920 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 42 (OVERLAPS) 27/1237 variables, 19/939 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1237 variables, 5/944 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1237 variables, 0/944 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 45 (OVERLAPS) 1/1238 variables, 1/945 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1238 variables, 1/946 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1238 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 48 (OVERLAPS) 2/1240 variables, 1/947 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1240 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 50 (OVERLAPS) 7/1247 variables, 6/953 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1247 variables, 2/955 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1247 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 53 (OVERLAPS) 0/1247 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1247/1247 variables, and 955 constraints, problems are : Problem set: 0 solved, 15 unsolved in 4622 ms.
Refiners :[Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 638/638 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 136/172 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 26/198 variables, 12/70 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-28 22:33:37] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 244/442 variables, 198/269 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 28/297 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 7/304 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 308/750 variables, 156/460 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/750 variables, 69/529 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/750 variables, 3/532 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/750 variables, 8/540 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-28 22:33:37] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-28 22:33:37] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-28 22:33:37] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2024-05-28 22:33:37] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/750 variables, 4/544 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/750 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (OVERLAPS) 10/760 variables, 8/552 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/760 variables, 6/558 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-28 22:33:38] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/760 variables, 1/559 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/760 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 20 (OVERLAPS) 28/788 variables, 12/571 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/788 variables, 2/573 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/788 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 23 (OVERLAPS) 249/1037 variables, 150/723 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1037 variables, 45/768 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1037 variables, 8/776 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-28 22:33:39] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-28 22:33:39] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1037 variables, 2/778 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1037 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 28 (OVERLAPS) 12/1049 variables, 14/792 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1049 variables, 10/802 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1049 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 31 (OVERLAPS) 23/1072 variables, 11/813 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1072 variables, 2/815 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1072 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 34 (OVERLAPS) 94/1166 variables, 69/884 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1166 variables, 19/903 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1166 variables, 7/910 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1166 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 38 (OVERLAPS) 2/1168 variables, 4/914 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1168 variables, 2/916 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1168 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 41 (OVERLAPS) 36/1204 variables, 17/933 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1204 variables, 7/940 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-28 22:33:41] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/1204 variables, 1/941 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1204 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 45 (OVERLAPS) 2/1206 variables, 1/942 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1206 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 47 (OVERLAPS) 4/1210 variables, 2/944 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1210 variables, 0/944 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 49 (OVERLAPS) 27/1237 variables, 19/963 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1237 variables, 5/968 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1237 variables, 0/968 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 52 (OVERLAPS) 1/1238 variables, 1/969 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1238 variables, 1/970 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1238 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 55 (OVERLAPS) 2/1240 variables, 1/971 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1240 variables, 0/971 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 57 (OVERLAPS) 7/1247 variables, 6/977 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1247 variables, 2/979 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1247 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 60 (OVERLAPS) 0/1247 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1247/1247 variables, and 979 constraints, problems are : Problem set: 0 solved, 15 unsolved in 8819 ms.
Refiners :[Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 638/638 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 9/9 constraints]
After SMT, in 13465ms problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 9646 ms.
Support contains 36 out of 638 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 638/638 places, 609/609 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 638 transition count 604
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 633 transition count 604
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 633 transition count 603
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 632 transition count 603
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 30 place count 623 transition count 594
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 620 transition count 596
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 620 transition count 596
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 42 place count 615 transition count 591
Applied a total of 42 rules in 147 ms. Remains 615 /638 variables (removed 23) and now considering 591/609 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 615/638 places, 591/609 transitions.
RANDOM walk for 40000 steps (8 resets) in 533 ms. (74 steps per ms) remains 10/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 231 ms. (172 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 161 ms. (246 steps per ms) remains 10/10 properties
// Phase 1: matrix 591 rows 615 cols
[2024-05-28 22:33:56] [INFO ] Computed 271 invariants in 2 ms
[2024-05-28 22:33:56] [INFO ] State equation strengthened by 27 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 122/152 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 11/163 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 212/375 variables, 163/222 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 24/246 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 323/698 variables, 162/408 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/698 variables, 72/480 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/698 variables, 3/483 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/698 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 12/710 variables, 8/491 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/710 variables, 6/497 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/710 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 8/718 variables, 4/501 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/718 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 255/973 variables, 146/647 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/973 variables, 56/703 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/973 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (OVERLAPS) 7/980 variables, 10/713 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/980 variables, 7/720 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/980 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (OVERLAPS) 8/988 variables, 4/724 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/988 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (OVERLAPS) 116/1104 variables, 70/794 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1104 variables, 23/817 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1104 variables, 0/817 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 28 (OVERLAPS) 5/1109 variables, 8/825 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1109 variables, 5/830 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1109 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 31 (OVERLAPS) 4/1113 variables, 2/832 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1113 variables, 0/832 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 33 (OVERLAPS) 54/1167 variables, 32/864 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1167 variables, 13/877 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1167 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 36 (OVERLAPS) 1/1168 variables, 1/878 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1168 variables, 1/879 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1168 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 39 (OVERLAPS) 2/1170 variables, 1/880 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1170 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 41 (OVERLAPS) 26/1196 variables, 16/896 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1196 variables, 6/902 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1196 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 44 (OVERLAPS) 1/1197 variables, 1/903 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1197 variables, 1/904 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1197 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 47 (OVERLAPS) 2/1199 variables, 1/905 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1199 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 49 (OVERLAPS) 7/1206 variables, 6/911 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1206 variables, 2/913 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1206 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 52 (OVERLAPS) 0/1206 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1206/1206 variables, and 913 constraints, problems are : Problem set: 0 solved, 10 unsolved in 3085 ms.
Refiners :[Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 615/615 constraints, ReadFeed: 27/27 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/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 122/152 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 11/163 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-28 22:33:59] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 212/375 variables, 163/223 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 24/247 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 4/251 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 323/698 variables, 162/413 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/698 variables, 72/485 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/698 variables, 3/488 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/698 variables, 6/494 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-28 22:33:59] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 2 ms to minimize.
[2024-05-28 22:34:00] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/698 variables, 2/496 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/698 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 12/710 variables, 8/504 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/710 variables, 6/510 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/710 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 8/718 variables, 4/514 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/718 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 255/973 variables, 146/660 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/973 variables, 56/716 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/973 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (OVERLAPS) 7/980 variables, 10/726 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/980 variables, 7/733 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/980 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 27 (OVERLAPS) 8/988 variables, 4/737 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/988 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 29 (OVERLAPS) 116/1104 variables, 70/807 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1104 variables, 23/830 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1104 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 32 (OVERLAPS) 5/1109 variables, 8/838 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1109 variables, 5/843 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1109 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 35 (OVERLAPS) 4/1113 variables, 2/845 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1113 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 37 (OVERLAPS) 54/1167 variables, 32/877 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1167 variables, 13/890 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1167 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 40 (OVERLAPS) 1/1168 variables, 1/891 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1168 variables, 1/892 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1168 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 43 (OVERLAPS) 2/1170 variables, 1/893 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1170 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 45 (OVERLAPS) 26/1196 variables, 16/909 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1196 variables, 6/915 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1196 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 48 (OVERLAPS) 1/1197 variables, 1/916 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1197 variables, 1/917 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1197 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 51 (OVERLAPS) 2/1199 variables, 1/918 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1199 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 53 (OVERLAPS) 7/1206 variables, 6/924 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1206 variables, 2/926 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1206 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 56 (OVERLAPS) 0/1206 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1206/1206 variables, and 926 constraints, problems are : Problem set: 0 solved, 10 unsolved in 4694 ms.
Refiners :[Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 615/615 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 3/3 constraints]
After SMT, in 7793ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 4453 ms.
Support contains 30 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 591/591 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 615 transition count 590
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 614 transition count 590
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 614 transition count 588
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 612 transition count 588
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 609 transition count 585
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 607 transition count 587
Applied a total of 16 rules in 52 ms. Remains 607 /615 variables (removed 8) and now considering 587/591 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 607/615 places, 587/591 transitions.
RANDOM walk for 40000 steps (8 resets) in 516 ms. (77 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 270 ms. (147 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 240 ms. (165 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 231 ms. (172 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 215 ms. (185 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 166 ms. (239 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 136298 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 10
Probabilistic random walk after 136298 steps, saw 87314 distinct states, run finished after 3005 ms. (steps per millisecond=45 ) properties seen :0
// Phase 1: matrix 587 rows 607 cols
[2024-05-28 22:34:12] [INFO ] Computed 271 invariants in 4 ms
[2024-05-28 22:34:12] [INFO ] State equation strengthened by 28 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 122/152 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 11/163 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 216/379 variables, 163/222 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 24/246 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 318/697 variables, 162/408 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/697 variables, 76/484 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/697 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/697 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 4/701 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/701 variables, 4/496 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/701 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 8/709 variables, 4/500 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/709 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 256/965 variables, 142/642 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/965 variables, 57/699 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/965 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (OVERLAPS) 7/972 variables, 10/709 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/972 variables, 7/716 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/972 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (OVERLAPS) 8/980 variables, 4/720 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/980 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (OVERLAPS) 112/1092 variables, 68/788 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1092 variables, 22/810 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1092 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 28 (OVERLAPS) 5/1097 variables, 8/818 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1097 variables, 5/823 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1097 variables, 0/823 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 31 (OVERLAPS) 4/1101 variables, 2/825 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1101 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 33 (OVERLAPS) 54/1155 variables, 32/857 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1155 variables, 13/870 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1155 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 36 (OVERLAPS) 1/1156 variables, 1/871 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1156 variables, 1/872 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1156 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 39 (OVERLAPS) 2/1158 variables, 1/873 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1158 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 41 (OVERLAPS) 26/1184 variables, 16/889 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1184 variables, 6/895 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1184 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 44 (OVERLAPS) 1/1185 variables, 1/896 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1185 variables, 1/897 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1185 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 47 (OVERLAPS) 2/1187 variables, 1/898 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1187 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 49 (OVERLAPS) 7/1194 variables, 6/904 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1194 variables, 2/906 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1194 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 52 (OVERLAPS) 0/1194 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1194/1194 variables, and 906 constraints, problems are : Problem set: 0 solved, 10 unsolved in 3133 ms.
Refiners :[Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 607/607 constraints, ReadFeed: 28/28 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/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 122/152 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 11/163 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-28 22:34:15] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-28 22:34:15] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 216/379 variables, 163/224 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 24/248 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 4/252 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 318/697 variables, 162/414 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/697 variables, 76/490 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/697 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/697 variables, 6/500 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-28 22:34:16] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/697 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/697 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 4/701 variables, 4/505 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 4/509 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/701 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (OVERLAPS) 8/709 variables, 4/513 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/709 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (OVERLAPS) 256/965 variables, 142/655 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/965 variables, 57/712 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/965 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (OVERLAPS) 7/972 variables, 10/722 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/972 variables, 7/729 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/972 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 28 (OVERLAPS) 8/980 variables, 4/733 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/980 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 30 (OVERLAPS) 112/1092 variables, 68/801 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1092 variables, 22/823 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1092 variables, 0/823 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 33 (OVERLAPS) 5/1097 variables, 8/831 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1097 variables, 5/836 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1097 variables, 0/836 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 36 (OVERLAPS) 4/1101 variables, 2/838 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1101 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 38 (OVERLAPS) 54/1155 variables, 32/870 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1155 variables, 13/883 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1155 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 41 (OVERLAPS) 1/1156 variables, 1/884 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1156 variables, 1/885 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1156 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 44 (OVERLAPS) 2/1158 variables, 1/886 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1158 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 46 (OVERLAPS) 26/1184 variables, 16/902 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1184 variables, 6/908 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1184 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 49 (OVERLAPS) 1/1185 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1185 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1185 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 52 (OVERLAPS) 2/1187 variables, 1/911 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1187 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 54 (OVERLAPS) 7/1194 variables, 6/917 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1194 variables, 2/919 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1194 variables, 0/919 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 57 (OVERLAPS) 0/1194 variables, 0/919 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1194/1194 variables, and 919 constraints, problems are : Problem set: 0 solved, 10 unsolved in 4777 ms.
Refiners :[Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 607/607 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 3/3 constraints]
After SMT, in 7936ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 6079 ms.
Support contains 30 out of 607 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 607/607 places, 587/587 transitions.
Applied a total of 0 rules in 22 ms. Remains 607 /607 variables (removed 0) and now considering 587/587 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 607/607 places, 587/587 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 607/607 places, 587/587 transitions.
Applied a total of 0 rules in 13 ms. Remains 607 /607 variables (removed 0) and now considering 587/587 (removed 0) transitions.
[2024-05-28 22:34:26] [INFO ] Invariant cache hit.
[2024-05-28 22:34:26] [INFO ] Implicit Places using invariants in 280 ms returned [599, 600]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 282 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 605/607 places, 587/587 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 605 transition count 586
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 604 transition count 586
Applied a total of 2 rules in 29 ms. Remains 604 /605 variables (removed 1) and now considering 586/587 (removed 1) transitions.
// Phase 1: matrix 586 rows 604 cols
[2024-05-28 22:34:26] [INFO ] Computed 269 invariants in 2 ms
[2024-05-28 22:34:27] [INFO ] Implicit Places using invariants in 326 ms returned [593]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 328 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 603/607 places, 586/587 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 602 transition count 585
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 602 transition count 585
Applied a total of 2 rules in 30 ms. Remains 602 /603 variables (removed 1) and now considering 585/586 (removed 1) transitions.
// Phase 1: matrix 585 rows 602 cols
[2024-05-28 22:34:27] [INFO ] Computed 268 invariants in 4 ms
[2024-05-28 22:34:27] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-05-28 22:34:27] [INFO ] Invariant cache hit.
[2024-05-28 22:34:27] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 22:34:28] [INFO ] Implicit Places using invariants and state equation in 709 ms returned []
Implicit Place search using SMT with State Equation took 1020 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 602/607 places, 585/587 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1702 ms. Remains : 602/607 places, 585/587 transitions.
RANDOM walk for 40000 steps (8 resets) in 418 ms. (95 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 181 ms. (219 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 163 ms. (243 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 160 ms. (248 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 8/8 properties
[2024-05-28 22:34:28] [INFO ] Invariant cache hit.
[2024-05-28 22:34:28] [INFO ] State equation strengthened by 25 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 85/109 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 11/120 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 166/286 variables, 120/163 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 14/177 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 278/564 variables, 140/317 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/564 variables, 64/381 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/564 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 6/570 variables, 5/386 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/570 variables, 4/390 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/570 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 4/574 variables, 2/392 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/574 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 276/850 variables, 142/534 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/850 variables, 56/590 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/850 variables, 2/592 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/850 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 10/860 variables, 12/604 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/860 variables, 8/612 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/860 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 10/870 variables, 5/617 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/870 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (OVERLAPS) 157/1027 variables, 92/709 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1027 variables, 31/740 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1027 variables, 2/742 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1027 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (OVERLAPS) 9/1036 variables, 9/751 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1036 variables, 7/758 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1036 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (OVERLAPS) 22/1058 variables, 10/768 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1058 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (OVERLAPS) 87/1145 variables, 62/830 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1145 variables, 16/846 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1145 variables, 7/853 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1145 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 38 (OVERLAPS) 2/1147 variables, 3/856 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1147 variables, 2/858 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1147 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 41 (OVERLAPS) 2/1149 variables, 1/859 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1149 variables, 0/859 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 43 (OVERLAPS) 28/1177 variables, 18/877 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1177 variables, 7/884 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1177 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 46 (OVERLAPS) 1/1178 variables, 1/885 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1178 variables, 1/886 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1178 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 49 (OVERLAPS) 2/1180 variables, 1/887 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1180 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 51 (OVERLAPS) 7/1187 variables, 6/893 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1187 variables, 2/895 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1187 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 54 (OVERLAPS) 0/1187 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1187/1187 variables, and 895 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2256 ms.
Refiners :[Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 602/602 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 85/109 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 11/120 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 166/286 variables, 120/163 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 14/177 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 278/564 variables, 140/319 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/564 variables, 64/383 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 6/389 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-28 22:34:31] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-05-28 22:34:31] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 2/391 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/564 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 6/570 variables, 5/396 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/570 variables, 4/400 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/570 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 4/574 variables, 2/402 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/574 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 276/850 variables, 142/544 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/850 variables, 56/600 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/850 variables, 2/602 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/850 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 10/860 variables, 12/614 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/860 variables, 8/622 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/860 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (OVERLAPS) 10/870 variables, 5/627 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/870 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (OVERLAPS) 157/1027 variables, 92/719 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1027 variables, 31/750 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1027 variables, 2/752 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1027 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (OVERLAPS) 9/1036 variables, 9/761 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1036 variables, 7/768 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1036 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (OVERLAPS) 22/1058 variables, 10/778 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1058 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (OVERLAPS) 87/1145 variables, 62/840 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1145 variables, 16/856 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1145 variables, 7/863 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1145 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 41 (OVERLAPS) 2/1147 variables, 3/866 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1147 variables, 2/868 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1147 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 44 (OVERLAPS) 2/1149 variables, 1/869 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1149 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 46 (OVERLAPS) 28/1177 variables, 18/887 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1177 variables, 7/894 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1177 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 49 (OVERLAPS) 1/1178 variables, 1/895 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1178 variables, 1/896 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1178 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 52 (OVERLAPS) 2/1180 variables, 1/897 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1180 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 54 (OVERLAPS) 7/1187 variables, 6/903 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1187 variables, 2/905 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1187 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 57 (OVERLAPS) 0/1187 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1187/1187 variables, and 905 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3473 ms.
Refiners :[Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 602/602 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 2/2 constraints]
After SMT, in 5739ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1828 ms.
Support contains 24 out of 602 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 602/602 places, 585/585 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 602 transition count 584
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 601 transition count 584
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 601 transition count 581
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 598 transition count 581
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 2 with 4 rules applied. Total rules applied 12 place count 596 transition count 579
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 594 transition count 580
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 592 transition count 578
Applied a total of 18 rules in 42 ms. Remains 592 /602 variables (removed 10) and now considering 578/585 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 592/602 places, 578/585 transitions.
RANDOM walk for 40000 steps (8 resets) in 695 ms. (57 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 187 ms. (212 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 231 ms. (172 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 138225 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :0 out of 8
Probabilistic random walk after 138225 steps, saw 86874 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
// Phase 1: matrix 578 rows 592 cols
[2024-05-28 22:34:40] [INFO ] Computed 268 invariants in 3 ms
[2024-05-28 22:34:40] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 85/109 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 11/120 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 167/287 variables, 120/163 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 14/177 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 276/563 variables, 141/318 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 67/385 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/563 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 2/565 variables, 2/387 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/565 variables, 2/389 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/565 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 4/569 variables, 2/391 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/569 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 275/844 variables, 140/531 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/844 variables, 57/588 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/844 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 8/852 variables, 11/599 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/852 variables, 8/607 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/852 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (OVERLAPS) 10/862 variables, 5/612 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/862 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (OVERLAPS) 153/1015 variables, 90/702 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1015 variables, 33/735 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1015 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (OVERLAPS) 5/1020 variables, 7/742 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1020 variables, 5/747 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1020 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (OVERLAPS) 6/1026 variables, 3/750 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1026 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (OVERLAPS) 89/1115 variables, 50/800 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1115 variables, 18/818 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1115 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (OVERLAPS) 3/1118 variables, 4/822 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1118 variables, 3/825 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1118 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 38 (OVERLAPS) 4/1122 variables, 2/827 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1122 variables, 0/827 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 40 (OVERLAPS) 38/1160 variables, 26/853 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1160 variables, 10/863 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1160 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 43 (OVERLAPS) 1/1161 variables, 1/864 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1161 variables, 1/865 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1161 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 46 (OVERLAPS) 2/1163 variables, 1/866 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1163 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 48 (OVERLAPS) 7/1170 variables, 6/872 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1170 variables, 2/874 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1170 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 51 (OVERLAPS) 0/1170 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1170/1170 variables, and 874 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2218 ms.
Refiners :[Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 592/592 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 85/109 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 11/120 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 167/287 variables, 120/163 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 14/177 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 276/563 variables, 141/320 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/563 variables, 67/387 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/563 variables, 6/393 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/563 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 2/565 variables, 2/395 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/565 variables, 2/397 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/565 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 4/569 variables, 2/399 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/569 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 275/844 variables, 140/539 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/844 variables, 57/596 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/844 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 8/852 variables, 11/607 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/852 variables, 8/615 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/852 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (OVERLAPS) 10/862 variables, 5/620 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/862 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (OVERLAPS) 153/1015 variables, 90/710 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1015 variables, 33/743 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1015 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (OVERLAPS) 5/1020 variables, 7/750 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1020 variables, 5/755 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1020 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (OVERLAPS) 6/1026 variables, 3/758 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1026 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (OVERLAPS) 89/1115 variables, 50/808 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1115 variables, 18/826 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1115 variables, 0/826 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (OVERLAPS) 3/1118 variables, 4/830 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1118 variables, 3/833 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1118 variables, 0/833 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 40 (OVERLAPS) 4/1122 variables, 2/835 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1122 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 42 (OVERLAPS) 38/1160 variables, 26/861 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1160 variables, 10/871 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1160 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 45 (OVERLAPS) 1/1161 variables, 1/872 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1161 variables, 1/873 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1161 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 48 (OVERLAPS) 2/1163 variables, 1/874 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1163 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 50 (OVERLAPS) 7/1170 variables, 6/880 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1170 variables, 2/882 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1170 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 53 (OVERLAPS) 0/1170 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1170/1170 variables, and 882 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3117 ms.
Refiners :[Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 592/592 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 5349ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 3193 ms.
Support contains 24 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 578/578 transitions.
Applied a total of 0 rules in 10 ms. Remains 592 /592 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 592/592 places, 578/578 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 578/578 transitions.
Applied a total of 0 rules in 9 ms. Remains 592 /592 variables (removed 0) and now considering 578/578 (removed 0) transitions.
[2024-05-28 22:34:48] [INFO ] Invariant cache hit.
[2024-05-28 22:34:49] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-05-28 22:34:49] [INFO ] Invariant cache hit.
[2024-05-28 22:34:49] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-28 22:34:49] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 864 ms to find 0 implicit places.
[2024-05-28 22:34:49] [INFO ] Redundant transitions in 35 ms returned []
Running 572 sub problems to find dead transitions.
[2024-05-28 22:34:49] [INFO ] Invariant cache hit.
[2024-05-28 22:34:49] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 247/247 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 2 (OVERLAPS) 6/592 variables, 21/268 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2024-05-28 22:35:01] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 2 ms to minimize.
[2024-05-28 22:35:04] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-28 22:35:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 3/271 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/592 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 5 (OVERLAPS) 578/1170 variables, 592/863 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1170 variables, 14/877 constraints. Problems are: Problem set: 0 solved, 572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1170/1170 variables, and 877 constraints, problems are : Problem set: 0 solved, 572 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 592/592 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 572/572 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 572 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 247/247 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 3 (OVERLAPS) 6/592 variables, 21/270 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/592 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/592 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 6 (OVERLAPS) 578/1170 variables, 592/863 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1170 variables, 14/877 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1170 variables, 572/1449 constraints. Problems are: Problem set: 0 solved, 572 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1170/1170 variables, and 1449 constraints, problems are : Problem set: 0 solved, 572 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 592/592 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 572/572 constraints, Known Traps: 3/3 constraints]
After SMT, in 60162ms problems are : Problem set: 0 solved, 572 unsolved
Search for dead transitions found 0 dead transitions in 60168ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61090 ms. Remains : 592/592 places, 578/578 transitions.
[2024-05-28 22:35:50] [INFO ] Flatten gal took : 57 ms
[2024-05-28 22:35:50] [INFO ] Flatten gal took : 53 ms
[2024-05-28 22:35:50] [INFO ] Input system was already deterministic with 1650 transitions.
Computed a total of 486 stabilizing places and 486 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1800/1800 places, 1650/1650 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1777 transition count 1627
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1777 transition count 1627
Applied a total of 46 rules in 140 ms. Remains 1777 /1800 variables (removed 23) and now considering 1627/1650 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 142 ms. Remains : 1777/1800 places, 1627/1650 transitions.
[2024-05-28 22:35:50] [INFO ] Flatten gal took : 41 ms
[2024-05-28 22:35:50] [INFO ] Flatten gal took : 40 ms
[2024-05-28 22:35:50] [INFO ] Input system was already deterministic with 1627 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1800/1800 places, 1650/1650 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 367 transitions
Trivial Post-agglo rules discarded 367 transitions
Performed 367 trivial Post agglomeration. Transition count delta: 367
Iterating post reduction 0 with 367 rules applied. Total rules applied 367 place count 1799 transition count 1282
Reduce places removed 367 places and 0 transitions.
Iterating post reduction 1 with 367 rules applied. Total rules applied 734 place count 1432 transition count 1282
Performed 225 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 225 Pre rules applied. Total rules applied 734 place count 1432 transition count 1057
Deduced a syphon composed of 225 places in 2 ms
Reduce places removed 225 places and 0 transitions.
Iterating global reduction 2 with 450 rules applied. Total rules applied 1184 place count 1207 transition count 1057
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 1205 place count 1186 transition count 1036
Iterating global reduction 2 with 21 rules applied. Total rules applied 1226 place count 1186 transition count 1036
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 1226 place count 1186 transition count 1020
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 1258 place count 1170 transition count 1020
Performed 477 Post agglomeration using F-continuation condition.Transition count delta: 477
Deduced a syphon composed of 477 places in 0 ms
Reduce places removed 477 places and 0 transitions.
Iterating global reduction 2 with 954 rules applied. Total rules applied 2212 place count 693 transition count 543
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2213 place count 693 transition count 542
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2215 place count 692 transition count 541
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2217 place count 690 transition count 539
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2219 place count 688 transition count 539
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2219 place count 688 transition count 538
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2221 place count 687 transition count 538
Applied a total of 2221 rules in 265 ms. Remains 687 /1800 variables (removed 1113) and now considering 538/1650 (removed 1112) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 265 ms. Remains : 687/1800 places, 538/1650 transitions.
[2024-05-28 22:35:50] [INFO ] Flatten gal took : 17 ms
[2024-05-28 22:35:50] [INFO ] Flatten gal took : 16 ms
[2024-05-28 22:35:50] [INFO ] Input system was already deterministic with 538 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1800/1800 places, 1650/1650 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 362 transitions
Trivial Post-agglo rules discarded 362 transitions
Performed 362 trivial Post agglomeration. Transition count delta: 362
Iterating post reduction 0 with 362 rules applied. Total rules applied 362 place count 1799 transition count 1287
Reduce places removed 362 places and 0 transitions.
Iterating post reduction 1 with 362 rules applied. Total rules applied 724 place count 1437 transition count 1287
Performed 224 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 224 Pre rules applied. Total rules applied 724 place count 1437 transition count 1063
Deduced a syphon composed of 224 places in 2 ms
Reduce places removed 224 places and 0 transitions.
Iterating global reduction 2 with 448 rules applied. Total rules applied 1172 place count 1213 transition count 1063
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 1190 place count 1195 transition count 1045
Iterating global reduction 2 with 18 rules applied. Total rules applied 1208 place count 1195 transition count 1045
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 1208 place count 1195 transition count 1032
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 1234 place count 1182 transition count 1032
Performed 478 Post agglomeration using F-continuation condition.Transition count delta: 478
Deduced a syphon composed of 478 places in 0 ms
Reduce places removed 478 places and 0 transitions.
Iterating global reduction 2 with 956 rules applied. Total rules applied 2190 place count 704 transition count 554
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2191 place count 704 transition count 553
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2193 place count 703 transition count 552
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2194 place count 702 transition count 551
Applied a total of 2194 rules in 265 ms. Remains 702 /1800 variables (removed 1098) and now considering 551/1650 (removed 1099) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 266 ms. Remains : 702/1800 places, 551/1650 transitions.
[2024-05-28 22:35:51] [INFO ] Flatten gal took : 16 ms
[2024-05-28 22:35:51] [INFO ] Flatten gal took : 17 ms
[2024-05-28 22:35:51] [INFO ] Input system was already deterministic with 551 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1800/1800 places, 1650/1650 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1774 transition count 1624
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1774 transition count 1624
Applied a total of 52 rules in 140 ms. Remains 1774 /1800 variables (removed 26) and now considering 1624/1650 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 141 ms. Remains : 1774/1800 places, 1624/1650 transitions.
[2024-05-28 22:35:51] [INFO ] Flatten gal took : 35 ms
[2024-05-28 22:35:51] [INFO ] Flatten gal took : 37 ms
[2024-05-28 22:35:51] [INFO ] Input system was already deterministic with 1624 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1800/1800 places, 1650/1650 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1773 transition count 1623
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1773 transition count 1623
Applied a total of 54 rules in 149 ms. Remains 1773 /1800 variables (removed 27) and now considering 1623/1650 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 1773/1800 places, 1623/1650 transitions.
[2024-05-28 22:35:51] [INFO ] Flatten gal took : 37 ms
[2024-05-28 22:35:51] [INFO ] Flatten gal took : 39 ms
[2024-05-28 22:35:51] [INFO ] Input system was already deterministic with 1623 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1800/1800 places, 1650/1650 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1772 transition count 1622
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1772 transition count 1622
Applied a total of 56 rules in 143 ms. Remains 1772 /1800 variables (removed 28) and now considering 1622/1650 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 144 ms. Remains : 1772/1800 places, 1622/1650 transitions.
[2024-05-28 22:35:52] [INFO ] Flatten gal took : 36 ms
[2024-05-28 22:35:52] [INFO ] Flatten gal took : 37 ms
[2024-05-28 22:35:52] [INFO ] Input system was already deterministic with 1622 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1800/1800 places, 1650/1650 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 368 transitions
Trivial Post-agglo rules discarded 368 transitions
Performed 368 trivial Post agglomeration. Transition count delta: 368
Iterating post reduction 0 with 368 rules applied. Total rules applied 368 place count 1799 transition count 1281
Reduce places removed 368 places and 0 transitions.
Iterating post reduction 1 with 368 rules applied. Total rules applied 736 place count 1431 transition count 1281
Performed 224 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 224 Pre rules applied. Total rules applied 736 place count 1431 transition count 1057
Deduced a syphon composed of 224 places in 2 ms
Reduce places removed 224 places and 0 transitions.
Iterating global reduction 2 with 448 rules applied. Total rules applied 1184 place count 1207 transition count 1057
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 1205 place count 1186 transition count 1036
Iterating global reduction 2 with 21 rules applied. Total rules applied 1226 place count 1186 transition count 1036
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 1226 place count 1186 transition count 1020
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 1258 place count 1170 transition count 1020
Performed 475 Post agglomeration using F-continuation condition.Transition count delta: 475
Deduced a syphon composed of 475 places in 1 ms
Reduce places removed 475 places and 0 transitions.
Iterating global reduction 2 with 950 rules applied. Total rules applied 2208 place count 695 transition count 545
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2209 place count 695 transition count 544
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2211 place count 694 transition count 543
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2213 place count 692 transition count 541
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2215 place count 690 transition count 541
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2215 place count 690 transition count 540
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2217 place count 689 transition count 540
Applied a total of 2217 rules in 253 ms. Remains 689 /1800 variables (removed 1111) and now considering 540/1650 (removed 1110) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 253 ms. Remains : 689/1800 places, 540/1650 transitions.
[2024-05-28 22:35:52] [INFO ] Flatten gal took : 14 ms
[2024-05-28 22:35:52] [INFO ] Flatten gal took : 14 ms
[2024-05-28 22:35:52] [INFO ] Input system was already deterministic with 540 transitions.
RANDOM walk for 24 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
FORMULA ShieldIIPt-PT-030B-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 1800/1800 places, 1650/1650 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 1771 transition count 1621
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 1771 transition count 1621
Applied a total of 58 rules in 156 ms. Remains 1771 /1800 variables (removed 29) and now considering 1621/1650 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156 ms. Remains : 1771/1800 places, 1621/1650 transitions.
[2024-05-28 22:35:52] [INFO ] Flatten gal took : 35 ms
[2024-05-28 22:35:52] [INFO ] Flatten gal took : 36 ms
[2024-05-28 22:35:52] [INFO ] Input system was already deterministic with 1621 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1800/1800 places, 1650/1650 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1774 transition count 1624
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1774 transition count 1624
Applied a total of 52 rules in 147 ms. Remains 1774 /1800 variables (removed 26) and now considering 1624/1650 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 1774/1800 places, 1624/1650 transitions.
[2024-05-28 22:35:53] [INFO ] Flatten gal took : 31 ms
[2024-05-28 22:35:53] [INFO ] Flatten gal took : 32 ms
[2024-05-28 22:35:53] [INFO ] Input system was already deterministic with 1624 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1800/1800 places, 1650/1650 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 365 transitions
Trivial Post-agglo rules discarded 365 transitions
Performed 365 trivial Post agglomeration. Transition count delta: 365
Iterating post reduction 0 with 365 rules applied. Total rules applied 365 place count 1799 transition count 1284
Reduce places removed 365 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 367 rules applied. Total rules applied 732 place count 1434 transition count 1282
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 734 place count 1432 transition count 1282
Performed 224 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 224 Pre rules applied. Total rules applied 734 place count 1432 transition count 1058
Deduced a syphon composed of 224 places in 1 ms
Reduce places removed 224 places and 0 transitions.
Iterating global reduction 3 with 448 rules applied. Total rules applied 1182 place count 1208 transition count 1058
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 1203 place count 1187 transition count 1037
Iterating global reduction 3 with 21 rules applied. Total rules applied 1224 place count 1187 transition count 1037
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 1224 place count 1187 transition count 1021
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 1256 place count 1171 transition count 1021
Performed 478 Post agglomeration using F-continuation condition.Transition count delta: 478
Deduced a syphon composed of 478 places in 0 ms
Reduce places removed 478 places and 0 transitions.
Iterating global reduction 3 with 956 rules applied. Total rules applied 2212 place count 693 transition count 543
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2213 place count 693 transition count 542
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2215 place count 692 transition count 541
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2217 place count 690 transition count 539
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2219 place count 688 transition count 539
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2219 place count 688 transition count 538
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2221 place count 687 transition count 538
Applied a total of 2221 rules in 210 ms. Remains 687 /1800 variables (removed 1113) and now considering 538/1650 (removed 1112) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 210 ms. Remains : 687/1800 places, 538/1650 transitions.
[2024-05-28 22:35:53] [INFO ] Flatten gal took : 13 ms
[2024-05-28 22:35:53] [INFO ] Flatten gal took : 14 ms
[2024-05-28 22:35:53] [INFO ] Input system was already deterministic with 538 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1800/1800 places, 1650/1650 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1775 transition count 1625
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1775 transition count 1625
Applied a total of 50 rules in 132 ms. Remains 1775 /1800 variables (removed 25) and now considering 1625/1650 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 133 ms. Remains : 1775/1800 places, 1625/1650 transitions.
[2024-05-28 22:35:53] [INFO ] Flatten gal took : 31 ms
[2024-05-28 22:35:53] [INFO ] Flatten gal took : 32 ms
[2024-05-28 22:35:53] [INFO ] Input system was already deterministic with 1625 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1800/1800 places, 1650/1650 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1772 transition count 1622
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1772 transition count 1622
Applied a total of 56 rules in 134 ms. Remains 1772 /1800 variables (removed 28) and now considering 1622/1650 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134 ms. Remains : 1772/1800 places, 1622/1650 transitions.
[2024-05-28 22:35:53] [INFO ] Flatten gal took : 30 ms
[2024-05-28 22:35:53] [INFO ] Flatten gal took : 30 ms
[2024-05-28 22:35:53] [INFO ] Input system was already deterministic with 1622 transitions.
[2024-05-28 22:35:53] [INFO ] Flatten gal took : 33 ms
[2024-05-28 22:35:54] [INFO ] Flatten gal took : 33 ms
[2024-05-28 22:35:54] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-28 22:35:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1800 places, 1650 transitions and 4260 arcs took 8 ms.
Total runtime 216717 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldIIPt-PT-030B

IS_COLORED=
IS_NUPN=

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


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


----------------------------------------------------------------------
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: 789
MODEL NAME: /home/mcc/execution/408/model
1800 places, 1650 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.

BK_TIME_CONFINEMENT_REACHED

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

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

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="ShieldIIPt-PT-030B"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ShieldIIPt-PT-030B, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r355-tall-171683758500297"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-030B.tgz
mv ShieldIIPt-PT-030B execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;