Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620398600598.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BusinessProcesses-PT-19, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398600598
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 11 16:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 189K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716309055303

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-19
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 16:30:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 16:30:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 16:30:57] [INFO ] Load time of PNML (sax parser for PT used): 176 ms
[2024-05-21 16:30:57] [INFO ] Transformed 772 places.
[2024-05-21 16:30:57] [INFO ] Transformed 685 transitions.
[2024-05-21 16:30:57] [INFO ] Found NUPN structural information;
[2024-05-21 16:30:57] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 328 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 15 places in 20 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (221 resets) in 1364 ms. (29 steps per ms) remains 8/12 properties
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (38 resets) in 323 ms. (123 steps per ms) remains 7/8 properties
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (40 resets) in 103 ms. (384 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (40 resets) in 169 ms. (235 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (38 resets) in 111 ms. (357 steps per ms) remains 6/7 properties
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (45 resets) in 486 ms. (82 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (43 resets) in 323 ms. (123 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (38 resets) in 93 ms. (425 steps per ms) remains 5/6 properties
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 670 rows 757 cols
[2024-05-21 16:30:58] [INFO ] Computed 125 invariants in 63 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 483/537 variables, 58/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/537 variables, 483/595 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 78/615 variables, 20/615 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/615 variables, 78/693 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/615 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 141/756 variables, 46/739 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/756 variables, 141/880 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/756 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/757 variables, 1/881 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/757 variables, 1/882 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/757 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 670/1427 variables, 757/1639 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1427 variables, 0/1639 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/1427 variables, 0/1639 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1427/1427 variables, and 1639 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1985 ms.
Refiners :[Domain max(s): 757/757 constraints, Positive P Invariants (semi-flows): 78/78 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 757/757 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 483/537 variables, 58/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/537 variables, 483/595 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 16:31:01] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 26 ms to minimize.
[2024-05-21 16:31:01] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:31:01] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:31:01] [INFO ] Deduced a trap composed of 22 places in 196 ms of which 3 ms to minimize.
[2024-05-21 16:31:01] [INFO ] Deduced a trap composed of 27 places in 195 ms of which 10 ms to minimize.
[2024-05-21 16:31:02] [INFO ] Deduced a trap composed of 30 places in 170 ms of which 3 ms to minimize.
[2024-05-21 16:31:02] [INFO ] Deduced a trap composed of 158 places in 161 ms of which 4 ms to minimize.
[2024-05-21 16:31:02] [INFO ] Deduced a trap composed of 29 places in 193 ms of which 4 ms to minimize.
[2024-05-21 16:31:02] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 2 ms to minimize.
[2024-05-21 16:31:02] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 4 ms to minimize.
[2024-05-21 16:31:02] [INFO ] Deduced a trap composed of 41 places in 177 ms of which 3 ms to minimize.
[2024-05-21 16:31:03] [INFO ] Deduced a trap composed of 35 places in 163 ms of which 4 ms to minimize.
[2024-05-21 16:31:03] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:31:03] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:31:03] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:31:03] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-21 16:31:03] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:31:03] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:31:03] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 3 ms to minimize.
[2024-05-21 16:31:03] [INFO ] Deduced a trap composed of 181 places in 110 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 20/615 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 16:31:04] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-05-21 16:31:04] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 2 ms to minimize.
[2024-05-21 16:31:04] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 3 ms to minimize.
[2024-05-21 16:31:04] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 2 ms to minimize.
[2024-05-21 16:31:04] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 2 ms to minimize.
[2024-05-21 16:31:04] [INFO ] Deduced a trap composed of 171 places in 164 ms of which 4 ms to minimize.
[2024-05-21 16:31:04] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:31:04] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 4 ms to minimize.
[2024-05-21 16:31:04] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 4 ms to minimize.
[2024-05-21 16:31:05] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:31:05] [INFO ] Deduced a trap composed of 53 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:31:05] [INFO ] Deduced a trap composed of 178 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:31:05] [INFO ] Deduced a trap composed of 168 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:31:05] [INFO ] Deduced a trap composed of 171 places in 123 ms of which 7 ms to minimize.
[2024-05-21 16:31:05] [INFO ] Deduced a trap composed of 176 places in 124 ms of which 3 ms to minimize.
SMT process timed out in 7177ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 54 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 670/670 transitions.
Graph (trivial) has 382 edges and 757 vertex of which 4 / 757 are part of one of the 1 SCC in 3 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1516 edges and 754 vertex of which 747 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 139 place count 747 transition count 528
Reduce places removed 137 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 152 rules applied. Total rules applied 291 place count 610 transition count 513
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 306 place count 595 transition count 513
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 107 Pre rules applied. Total rules applied 306 place count 595 transition count 406
Deduced a syphon composed of 107 places in 2 ms
Ensure Unique test removed 19 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 233 rules applied. Total rules applied 539 place count 469 transition count 406
Discarding 80 places :
Symmetric choice reduction at 3 with 80 rule applications. Total rules 619 place count 389 transition count 326
Iterating global reduction 3 with 80 rules applied. Total rules applied 699 place count 389 transition count 326
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 699 place count 389 transition count 320
Deduced a syphon composed of 6 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 712 place count 382 transition count 320
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Deduced a syphon composed of 108 places in 1 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 928 place count 274 transition count 212
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 930 place count 273 transition count 215
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 931 place count 273 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 932 place count 272 transition count 214
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 935 place count 272 transition count 214
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 936 place count 271 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 937 place count 270 transition count 213
Applied a total of 937 rules in 174 ms. Remains 270 /757 variables (removed 487) and now considering 213/670 (removed 457) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 270/757 places, 213/670 transitions.
RANDOM walk for 40000 steps (1647 resets) in 1333 ms. (29 steps per ms) remains 3/5 properties
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (325 resets) in 162 ms. (245 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (316 resets) in 148 ms. (268 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (349 resets) in 183 ms. (217 steps per ms) remains 3/3 properties
// Phase 1: matrix 213 rows 270 cols
[2024-05-21 16:31:06] [INFO ] Computed 98 invariants in 4 ms
[2024-05-21 16:31:06] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 152/196 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 14/210 variables, 11/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 39/249 variables, 25/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/250 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 213/463 variables, 250/340 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/463 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/463 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 20/483 variables, 20/363 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/483 variables, 8/371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/483 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/483 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 483/483 variables, and 371 constraints, problems are : Problem set: 0 solved, 3 unsolved in 278 ms.
Refiners :[Positive P Invariants (semi-flows): 72/72 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 270/270 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 152/196 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:31:06] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-21 16:31:07] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-21 16:31:07] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-21 16:31:07] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 2 ms to minimize.
[2024-05-21 16:31:07] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-21 16:31:07] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 2 ms to minimize.
[2024-05-21 16:31:07] [INFO ] Deduced a trap composed of 60 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:31:07] [INFO ] Deduced a trap composed of 57 places in 41 ms of which 1 ms to minimize.
[2024-05-21 16:31:07] [INFO ] Deduced a trap composed of 60 places in 42 ms of which 1 ms to minimize.
[2024-05-21 16:31:07] [INFO ] Deduced a trap composed of 59 places in 41 ms of which 1 ms to minimize.
[2024-05-21 16:31:07] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 2 ms to minimize.
[2024-05-21 16:31:07] [INFO ] Deduced a trap composed of 61 places in 51 ms of which 1 ms to minimize.
[2024-05-21 16:31:07] [INFO ] Deduced a trap composed of 60 places in 50 ms of which 1 ms to minimize.
[2024-05-21 16:31:07] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 1 ms to minimize.
[2024-05-21 16:31:07] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 1 ms to minimize.
[2024-05-21 16:31:07] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 2 ms to minimize.
[2024-05-21 16:31:07] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 1 ms to minimize.
[2024-05-21 16:31:07] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 18/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 14/210 variables, 11/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem BusinessProcesses-PT-19-ReachabilityCardinality-2024-06 is UNSAT
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 39/249 variables, 25/107 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 16:31:08] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:31:08] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 1 ms to minimize.
[2024-05-21 16:31:08] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 2 ms to minimize.
[2024-05-21 16:31:08] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 2 ms to minimize.
[2024-05-21 16:31:08] [INFO ] Deduced a trap composed of 67 places in 89 ms of which 1 ms to minimize.
[2024-05-21 16:31:08] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 2 ms to minimize.
[2024-05-21 16:31:08] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 1 ms to minimize.
[2024-05-21 16:31:08] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 1 ms to minimize.
[2024-05-21 16:31:08] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 1 ms to minimize.
[2024-05-21 16:31:08] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2024-05-21 16:31:08] [INFO ] Deduced a trap composed of 62 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:31:08] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 1 ms to minimize.
[2024-05-21 16:31:09] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:31:09] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:31:09] [INFO ] Deduced a trap composed of 69 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:31:09] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:31:09] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 1 ms to minimize.
[2024-05-21 16:31:09] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 2 ms to minimize.
[2024-05-21 16:31:09] [INFO ] Deduced a trap composed of 69 places in 80 ms of which 1 ms to minimize.
[2024-05-21 16:31:09] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 20/127 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 16:31:09] [INFO ] Deduced a trap composed of 70 places in 72 ms of which 1 ms to minimize.
[2024-05-21 16:31:09] [INFO ] Deduced a trap composed of 67 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:31:10] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 2 ms to minimize.
[2024-05-21 16:31:10] [INFO ] Deduced a trap composed of 67 places in 70 ms of which 2 ms to minimize.
[2024-05-21 16:31:10] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 2 ms to minimize.
[2024-05-21 16:31:10] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 1 ms to minimize.
[2024-05-21 16:31:10] [INFO ] Deduced a trap composed of 66 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:31:10] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 1 ms to minimize.
[2024-05-21 16:31:10] [INFO ] Deduced a trap composed of 70 places in 61 ms of which 2 ms to minimize.
[2024-05-21 16:31:10] [INFO ] Deduced a trap composed of 63 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:31:10] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 2 ms to minimize.
[2024-05-21 16:31:10] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:31:10] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:31:11] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 2 ms to minimize.
[2024-05-21 16:31:11] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 1 ms to minimize.
[2024-05-21 16:31:11] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 2 ms to minimize.
[2024-05-21 16:31:11] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 2 ms to minimize.
[2024-05-21 16:31:11] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 2 ms to minimize.
[2024-05-21 16:31:11] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 1 ms to minimize.
[2024-05-21 16:31:11] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 20/147 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 16:31:11] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 2 ms to minimize.
[2024-05-21 16:31:11] [INFO ] Deduced a trap composed of 67 places in 75 ms of which 3 ms to minimize.
[2024-05-21 16:31:11] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:31:12] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:31:12] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:31:12] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-05-21 16:31:12] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 2 ms to minimize.
[2024-05-21 16:31:12] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-05-21 16:31:12] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 9/156 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 16:31:12] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:31:12] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:31:12] [INFO ] Deduced a trap composed of 66 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:31:12] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 4/160 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 16:31:12] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:31:13] [INFO ] Deduced a trap composed of 68 places in 73 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 2/162 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 16:31:13] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:31:13] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:31:13] [INFO ] Deduced a trap composed of 68 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:31:13] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:31:13] [INFO ] Deduced a trap composed of 67 places in 75 ms of which 2 ms to minimize.
[2024-05-21 16:31:13] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 2 ms to minimize.
[2024-05-21 16:31:13] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:31:13] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 2 ms to minimize.
[2024-05-21 16:31:13] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 2 ms to minimize.
[2024-05-21 16:31:14] [INFO ] Deduced a trap composed of 61 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:31:14] [INFO ] Deduced a trap composed of 68 places in 74 ms of which 2 ms to minimize.
[2024-05-21 16:31:14] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 1 ms to minimize.
[2024-05-21 16:31:14] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 2 ms to minimize.
[2024-05-21 16:31:14] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 1 ms to minimize.
[2024-05-21 16:31:14] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 2 ms to minimize.
[2024-05-21 16:31:14] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 2 ms to minimize.
[2024-05-21 16:31:14] [INFO ] Deduced a trap composed of 68 places in 62 ms of which 1 ms to minimize.
[2024-05-21 16:31:14] [INFO ] Deduced a trap composed of 69 places in 88 ms of which 1 ms to minimize.
[2024-05-21 16:31:14] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:31:14] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 20/182 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 0/182 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/250 variables, 1/183 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/250 variables, 0/183 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 213/463 variables, 250/433 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/463 variables, 3/436 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/463 variables, 0/436 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 20/483 variables, 20/456 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/483 variables, 8/464 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/483 variables, 2/466 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 16:31:15] [INFO ] Deduced a trap composed of 63 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:31:15] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-21 16:31:15] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/483 variables, 3/469 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 16:31:16] [INFO ] Deduced a trap composed of 63 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:31:16] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:31:16] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/483 variables, 3/472 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 16:31:16] [INFO ] Deduced a trap composed of 60 places in 100 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/483 variables, 1/473 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/483 variables, 0/473 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/483 variables, 0/473 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 483/483 variables, and 473 constraints, problems are : Problem set: 1 solved, 2 unsolved in 10322 ms.
Refiners :[Positive P Invariants (semi-flows): 72/72 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 270/270 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 100/100 constraints]
After SMT, in 10620ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 304 ms.
Support contains 41 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 213/213 transitions.
Graph (complete) has 862 edges and 270 vertex of which 268 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 268 transition count 210
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 265 transition count 210
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 7 place count 265 transition count 207
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 260 transition count 207
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 17 place count 258 transition count 205
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 258 transition count 205
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 27 place count 254 transition count 201
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 253 transition count 200
Applied a total of 28 rules in 75 ms. Remains 253 /270 variables (removed 17) and now considering 200/213 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 253/270 places, 200/213 transitions.
RANDOM walk for 40000 steps (1920 resets) in 1009 ms. (39 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (372 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (423 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 986008 steps, run timeout after 3001 ms. (steps per millisecond=328 ) properties seen :1 out of 2
Probabilistic random walk after 986008 steps, saw 167491 distinct states, run finished after 3004 ms. (steps per millisecond=328 ) properties seen :1
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 200 rows 253 cols
[2024-05-21 16:31:20] [INFO ] Computed 94 invariants in 9 ms
[2024-05-21 16:31:21] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 91/109 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/124 variables, 12/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/186 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 39/225 variables, 23/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/227 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 198/425 variables, 227/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/425 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/425 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 25/450 variables, 24/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/450 variables, 9/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/450 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/452 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/452 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/453 variables, 2/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/453 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/453 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 453/453 variables, and 350 constraints, problems are : Problem set: 0 solved, 1 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 68/68 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 253/253 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 91/109 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:31:21] [INFO ] Deduced a trap composed of 60 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/124 variables, 12/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/186 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:31:21] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 3 ms to minimize.
[2024-05-21 16:31:21] [INFO ] Deduced a trap composed of 67 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:31:21] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:31:21] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:31:21] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 2 ms to minimize.
[2024-05-21 16:31:21] [INFO ] Deduced a trap composed of 69 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:31:21] [INFO ] Deduced a trap composed of 62 places in 62 ms of which 1 ms to minimize.
[2024-05-21 16:31:21] [INFO ] Deduced a trap composed of 60 places in 61 ms of which 1 ms to minimize.
[2024-05-21 16:31:21] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
[2024-05-21 16:31:21] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 2 ms to minimize.
[2024-05-21 16:31:22] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-05-21 16:31:22] [INFO ] Deduced a trap composed of 60 places in 52 ms of which 1 ms to minimize.
[2024-05-21 16:31:22] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 1 ms to minimize.
[2024-05-21 16:31:22] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 1 ms to minimize.
[2024-05-21 16:31:22] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 1 ms to minimize.
[2024-05-21 16:31:22] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 16/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 39/225 variables, 23/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/227 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 198/425 variables, 227/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/425 variables, 3/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/425 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 25/450 variables, 24/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/450 variables, 9/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/450 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:31:22] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-21 16:31:22] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 2 ms to minimize.
[2024-05-21 16:31:22] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/450 variables, 3/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/450 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/452 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/452 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/453 variables, 2/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/453 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/453 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 453/453 variables, and 371 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1566 ms.
Refiners :[Positive P Invariants (semi-flows): 68/68 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 253/253 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 20/20 constraints]
After SMT, in 1735ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 18 out of 253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 200/200 transitions.
Graph (trivial) has 27 edges and 253 vertex of which 2 / 253 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 252 transition count 192
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 246 transition count 192
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 13 place count 246 transition count 187
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 27 place count 237 transition count 187
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 30 place count 234 transition count 184
Iterating global reduction 2 with 3 rules applied. Total rules applied 33 place count 234 transition count 184
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 29 rules applied. Total rules applied 62 place count 218 transition count 171
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 217 transition count 182
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 217 transition count 181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 216 transition count 181
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 216 transition count 181
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 215 transition count 180
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 215 transition count 180
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 214 transition count 179
Applied a total of 70 rules in 62 ms. Remains 214 /253 variables (removed 39) and now considering 179/200 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 214/253 places, 179/200 transitions.
RANDOM walk for 40000 steps (1290 resets) in 233 ms. (170 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (674 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1073963 steps, run timeout after 3001 ms. (steps per millisecond=357 ) properties seen :0 out of 1
Probabilistic random walk after 1073963 steps, saw 250168 distinct states, run finished after 3001 ms. (steps per millisecond=357 ) properties seen :0
// Phase 1: matrix 179 rows 214 cols
[2024-05-21 16:31:25] [INFO ] Computed 87 invariants in 12 ms
[2024-05-21 16:31:25] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/108 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/120 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/151 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/158 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 175/333 variables, 158/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/333 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 59/392 variables, 55/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/392 variables, 26/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/392 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/393 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/393 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/393 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 305 constraints, problems are : Problem set: 0 solved, 1 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 214/214 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/108 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/120 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/151 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/158 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:31:26] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 2 ms to minimize.
[2024-05-21 16:31:26] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:31:26] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
[2024-05-21 16:31:26] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 2 ms to minimize.
[2024-05-21 16:31:26] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 1 ms to minimize.
[2024-05-21 16:31:26] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 2 ms to minimize.
[2024-05-21 16:31:26] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2024-05-21 16:31:26] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
[2024-05-21 16:31:26] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 9/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 175/333 variables, 158/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/333 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/333 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 59/392 variables, 55/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 26/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/392 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/392 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/392 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/393 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:31:27] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 2 ms to minimize.
[2024-05-21 16:31:27] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/393 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/393 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/393 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 393/393 variables, and 317 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1044 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 214/214 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 1263ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 18 out of 214 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 179/179 transitions.
Applied a total of 0 rules in 7 ms. Remains 214 /214 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 214/214 places, 179/179 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 179/179 transitions.
Applied a total of 0 rules in 6 ms. Remains 214 /214 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2024-05-21 16:31:27] [INFO ] Invariant cache hit.
[2024-05-21 16:31:27] [INFO ] Implicit Places using invariants in 203 ms returned [13, 14, 36, 38, 40, 51, 53, 55, 56, 57, 58, 59, 60, 61, 64, 65, 66, 67, 183]
[2024-05-21 16:31:27] [INFO ] Actually due to overlaps returned [36, 51, 57, 58, 13, 55, 56, 59, 60, 61, 64, 65, 66, 67, 183]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 210 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 199/214 places, 179/179 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 197 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 197 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 196 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 196 transition count 167
Applied a total of 6 rules in 12 ms. Remains 196 /199 variables (removed 3) and now considering 167/179 (removed 12) transitions.
// Phase 1: matrix 167 rows 196 cols
[2024-05-21 16:31:27] [INFO ] Computed 72 invariants in 2 ms
[2024-05-21 16:31:27] [INFO ] Implicit Places using invariants in 144 ms returned [35, 37]
[2024-05-21 16:31:27] [INFO ] Actually due to overlaps returned [35]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 146 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 195/214 places, 167/179 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 193 transition count 156
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 193 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 192 transition count 152
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 192 transition count 152
Applied a total of 6 rules in 11 ms. Remains 192 /195 variables (removed 3) and now considering 152/167 (removed 15) transitions.
// Phase 1: matrix 152 rows 192 cols
[2024-05-21 16:31:27] [INFO ] Computed 71 invariants in 2 ms
[2024-05-21 16:31:27] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-21 16:31:27] [INFO ] Invariant cache hit.
[2024-05-21 16:31:27] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 16:31:27] [INFO ] Implicit Places using invariants and state equation in 270 ms returned [50, 52, 54, 56, 59, 61, 62, 64, 66, 68, 70, 72, 74, 75, 90, 92, 96, 102, 104, 110, 112, 114, 116, 118, 120, 126, 128]
Discarding 27 places :
Implicit Place search using SMT with State Equation took 386 ms to find 27 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 165/214 places, 152/179 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 165 transition count 142
Reduce places removed 10 places and 0 transitions.
Graph (complete) has 470 edges and 155 vertex of which 153 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 153 transition count 142
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 153 transition count 141
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 26 place count 149 transition count 136
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 149 transition count 136
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 32 place count 149 transition count 134
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 34 place count 147 transition count 134
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 35 place count 146 transition count 133
Iterating global reduction 5 with 1 rules applied. Total rules applied 36 place count 146 transition count 133
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 15 rules applied. Total rules applied 51 place count 138 transition count 126
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 5 with 2 rules applied. Total rules applied 53 place count 137 transition count 125
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 57 place count 137 transition count 121
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 61 place count 133 transition count 121
Applied a total of 61 rules in 21 ms. Remains 133 /165 variables (removed 32) and now considering 121/152 (removed 31) transitions.
// Phase 1: matrix 121 rows 133 cols
[2024-05-21 16:31:28] [INFO ] Computed 43 invariants in 1 ms
[2024-05-21 16:31:28] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 16:31:28] [INFO ] Invariant cache hit.
[2024-05-21 16:31:28] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-21 16:31:28] [INFO ] Implicit Places using invariants and state equation in 214 ms returned [4, 5, 6, 7, 8, 10, 12, 20, 23, 27, 28, 43]
Discarding 12 places :
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 289 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 121/214 places, 120/179 transitions.
Graph (complete) has 354 edges and 121 vertex of which 119 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 114 transition count 103
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 114 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 114 transition count 102
Applied a total of 12 rules in 8 ms. Remains 114 /121 variables (removed 7) and now considering 102/120 (removed 18) transitions.
// Phase 1: matrix 102 rows 114 cols
[2024-05-21 16:31:28] [INFO ] Computed 30 invariants in 2 ms
[2024-05-21 16:31:28] [INFO ] Implicit Places using invariants in 96 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 97 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 113/214 places, 102/179 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 112 transition count 101
Applied a total of 2 rules in 7 ms. Remains 112 /113 variables (removed 1) and now considering 101/102 (removed 1) transitions.
// Phase 1: matrix 101 rows 112 cols
[2024-05-21 16:31:28] [INFO ] Computed 29 invariants in 1 ms
[2024-05-21 16:31:28] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 16:31:28] [INFO ] Invariant cache hit.
[2024-05-21 16:31:28] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 16:31:28] [INFO ] Implicit Places using invariants and state equation in 137 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 210 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 111/214 places, 101/179 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 108 transition count 98
Applied a total of 6 rules in 5 ms. Remains 108 /111 variables (removed 3) and now considering 98/101 (removed 3) transitions.
// Phase 1: matrix 98 rows 108 cols
[2024-05-21 16:31:28] [INFO ] Computed 28 invariants in 1 ms
[2024-05-21 16:31:28] [INFO ] Implicit Places using invariants in 88 ms returned [100, 105]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 91 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 106/214 places, 98/179 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 104 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 103 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 103 transition count 94
Applied a total of 6 rules in 7 ms. Remains 103 /106 variables (removed 3) and now considering 94/98 (removed 4) transitions.
// Phase 1: matrix 94 rows 103 cols
[2024-05-21 16:31:28] [INFO ] Computed 26 invariants in 1 ms
[2024-05-21 16:31:28] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-21 16:31:28] [INFO ] Invariant cache hit.
[2024-05-21 16:31:28] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 16:31:28] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 103/214 places, 94/179 transitions.
Finished structural reductions in REACHABILITY mode , in 8 iterations and 1722 ms. Remains : 103/214 places, 94/179 transitions.
RANDOM walk for 40000 steps (1688 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (715 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2090726 steps, run timeout after 3001 ms. (steps per millisecond=696 ) properties seen :0 out of 1
Probabilistic random walk after 2090726 steps, saw 513210 distinct states, run finished after 3006 ms. (steps per millisecond=695 ) properties seen :0
[2024-05-21 16:31:32] [INFO ] Invariant cache hit.
[2024-05-21 16:31:32] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/60 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/63 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 76/139 variables, 63/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 44/183 variables, 31/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 7/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/189 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 7/196 variables, 7/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/196 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/197 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/197 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/197 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 134 constraints, problems are : Problem set: 0 solved, 1 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/60 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:31:32] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/63 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 76/139 variables, 63/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 44/183 variables, 31/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 7/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:31:32] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/183 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/183 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/189 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/189 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/189 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 7/196 variables, 7/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:31:32] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-21 16:31:32] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/196 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/196 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/197 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/197 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/197 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 495 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 670ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 18 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 94/94 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 103/103 places, 94/94 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 94/94 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2024-05-21 16:31:32] [INFO ] Invariant cache hit.
[2024-05-21 16:31:32] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-21 16:31:32] [INFO ] Invariant cache hit.
[2024-05-21 16:31:32] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 16:31:32] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2024-05-21 16:31:32] [INFO ] Redundant transitions in 2 ms returned []
Running 89 sub problems to find dead transitions.
[2024-05-21 16:31:32] [INFO ] Invariant cache hit.
[2024-05-21 16:31:32] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-21 16:31:33] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-21 16:31:33] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-21 16:31:33] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-21 16:31:33] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-21 16:31:33] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-21 16:31:33] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-21 16:31:33] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-21 16:31:33] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-05-21 16:31:33] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-21 16:31:33] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-21 16:31:33] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-21 16:31:33] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-21 16:31:33] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-05-21 16:31:33] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-21 16:31:33] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-21 16:31:33] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-21 16:31:33] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-21 16:31:33] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-21 16:31:33] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-21 16:31:33] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD52 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 20/36 constraints. Problems are: Problem set: 2 solved, 87 unsolved
[2024-05-21 16:31:34] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-21 16:31:34] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-21 16:31:34] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-21 16:31:34] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-21 16:31:34] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
[2024-05-21 16:31:34] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-21 16:31:34] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-21 16:31:34] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-21 16:31:34] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-21 16:31:34] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-21 16:31:34] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-21 16:31:34] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-21 16:31:34] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-21 16:31:34] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-21 16:31:34] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-21 16:31:34] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD92 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 16/52 constraints. Problems are: Problem set: 7 solved, 82 unsolved
[2024-05-21 16:31:35] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 1/53 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/53 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 3/101 variables, 10/63 constraints. Problems are: Problem set: 7 solved, 82 unsolved
[2024-05-21 16:31:35] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-21 16:31:35] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-21 16:31:35] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-21 16:31:35] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-21 16:31:35] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-21 16:31:35] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-21 16:31:36] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-05-21 16:31:36] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 2 ms to minimize.
[2024-05-21 16:31:36] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-21 16:31:36] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 10/73 constraints. Problems are: Problem set: 7 solved, 82 unsolved
[2024-05-21 16:31:36] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-21 16:31:36] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-21 16:31:36] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 3/76 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 0/76 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 94/195 variables, 101/177 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/195 variables, 5/182 constraints. Problems are: Problem set: 7 solved, 82 unsolved
[2024-05-21 16:31:37] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/195 variables, 1/183 constraints. Problems are: Problem set: 7 solved, 82 unsolved
[2024-05-21 16:31:37] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/195 variables, 1/184 constraints. Problems are: Problem set: 7 solved, 82 unsolved
[2024-05-21 16:31:38] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/195 variables, 1/185 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/195 variables, 0/185 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 16 (OVERLAPS) 2/197 variables, 2/187 constraints. Problems are: Problem set: 7 solved, 82 unsolved
[2024-05-21 16:31:39] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/197 variables, 1/188 constraints. Problems are: Problem set: 7 solved, 82 unsolved
[2024-05-21 16:31:39] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-21 16:31:39] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/197 variables, 2/190 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/197 variables, 0/190 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 20 (OVERLAPS) 0/197 variables, 0/190 constraints. Problems are: Problem set: 7 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 190 constraints, problems are : Problem set: 7 solved, 82 unsolved in 7852 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 7 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 13/13 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 3/16 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 55/71 constraints. Problems are: Problem set: 7 solved, 82 unsolved
[2024-05-21 16:31:41] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-21 16:31:41] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-21 16:31:41] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-21 16:31:41] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 4/75 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/75 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 3/101 variables, 10/85 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 1/86 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/86 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 94/195 variables, 101/187 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 5/192 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 82/274 constraints. Problems are: Problem set: 7 solved, 82 unsolved
[2024-05-21 16:31:42] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-21 16:31:42] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 2 ms to minimize.
[2024-05-21 16:31:42] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 2 ms to minimize.
[2024-05-21 16:31:42] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-21 16:31:42] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:31:42] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-05-21 16:31:42] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/195 variables, 7/281 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/195 variables, 0/281 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 13 (OVERLAPS) 2/197 variables, 2/283 constraints. Problems are: Problem set: 7 solved, 82 unsolved
[2024-05-21 16:31:44] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-21 16:31:44] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-21 16:31:44] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-21 16:31:44] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-21 16:31:44] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-21 16:31:44] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-21 16:31:44] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/197 variables, 7/290 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/197 variables, 0/290 constraints. Problems are: Problem set: 7 solved, 82 unsolved
At refinement iteration 16 (OVERLAPS) 0/197 variables, 0/290 constraints. Problems are: Problem set: 7 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 290 constraints, problems are : Problem set: 7 solved, 82 unsolved in 6560 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 82/89 constraints, Known Traps: 74/74 constraints]
After SMT, in 14480ms problems are : Problem set: 7 solved, 82 unsolved
Search for dead transitions found 7 dead transitions in 14481ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 103/103 places, 87/94 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 101 transition count 87
Applied a total of 2 rules in 5 ms. Remains 101 /103 variables (removed 2) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 101 cols
[2024-05-21 16:31:47] [INFO ] Computed 26 invariants in 2 ms
[2024-05-21 16:31:47] [INFO ] Implicit Places using invariants in 63 ms returned [18, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 65 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 99/103 places, 87/94 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 99 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 98 transition count 86
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 98 transition count 86
Applied a total of 3 rules in 6 ms. Remains 98 /99 variables (removed 1) and now considering 86/87 (removed 1) transitions.
// Phase 1: matrix 86 rows 98 cols
[2024-05-21 16:31:47] [INFO ] Computed 24 invariants in 1 ms
[2024-05-21 16:31:47] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 16:31:47] [INFO ] Invariant cache hit.
[2024-05-21 16:31:47] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 16:31:47] [INFO ] Implicit Places using invariants and state equation in 105 ms returned [50, 54]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 174 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 96/103 places, 86/94 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 93 transition count 83
Applied a total of 6 rules in 4 ms. Remains 93 /96 variables (removed 3) and now considering 83/86 (removed 3) transitions.
// Phase 1: matrix 83 rows 93 cols
[2024-05-21 16:31:47] [INFO ] Computed 22 invariants in 1 ms
[2024-05-21 16:31:47] [INFO ] Implicit Places using invariants in 59 ms returned [84, 89]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 60 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 91/103 places, 83/94 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 90 transition count 82
Applied a total of 2 rules in 3 ms. Remains 90 /91 variables (removed 1) and now considering 82/83 (removed 1) transitions.
// Phase 1: matrix 82 rows 90 cols
[2024-05-21 16:31:47] [INFO ] Computed 20 invariants in 1 ms
[2024-05-21 16:31:47] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 16:31:47] [INFO ] Invariant cache hit.
[2024-05-21 16:31:47] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 16:31:47] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 90/103 places, 82/94 transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 15213 ms. Remains : 90/103 places, 82/94 transitions.
RANDOM walk for 40000 steps (1688 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (722 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2222337 steps, run timeout after 3001 ms. (steps per millisecond=740 ) properties seen :0 out of 1
Probabilistic random walk after 2222337 steps, saw 540946 distinct states, run finished after 3001 ms. (steps per millisecond=740 ) properties seen :0
[2024-05-21 16:31:50] [INFO ] Invariant cache hit.
[2024-05-21 16:31:50] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/49 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/51 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/113 variables, 51/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 45/158 variables, 30/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 6/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/164 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/164 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/164 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 7/171 variables, 7/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/171 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/172 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/172 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/172 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 115 constraints, problems are : Problem set: 0 solved, 1 unsolved in 123 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/49 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:31:51] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2/51 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/113 variables, 51/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 45/158 variables, 30/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 6/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/164 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/164 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/164 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 7/171 variables, 7/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/171 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/172 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/172 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/172 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 117 constraints, problems are : Problem set: 0 solved, 1 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 302ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 18 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 82/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 90/90 places, 82/82 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 82/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-21 16:31:51] [INFO ] Invariant cache hit.
[2024-05-21 16:31:51] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-21 16:31:51] [INFO ] Invariant cache hit.
[2024-05-21 16:31:51] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 16:31:51] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2024-05-21 16:31:51] [INFO ] Redundant transitions in 16 ms returned []
Running 77 sub problems to find dead transitions.
[2024-05-21 16:31:51] [INFO ] Invariant cache hit.
[2024-05-21 16:31:51] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-21 16:31:51] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-21 16:31:51] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 2 ms to minimize.
[2024-05-21 16:31:51] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-21 16:31:51] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 3/88 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-21 16:31:52] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-21 16:31:52] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-21 16:31:52] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-21 16:31:52] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-21 16:31:52] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-21 16:31:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
[2024-05-21 16:31:52] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 4 ms to minimize.
[2024-05-21 16:31:52] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-21 16:31:52] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 82/170 variables, 88/121 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 5/126 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 2/172 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-21 16:31:53] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 2 ms to minimize.
[2024-05-21 16:31:53] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 2 ms to minimize.
[2024-05-21 16:31:53] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-21 16:31:53] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-21 16:31:54] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-21 16:31:54] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-21 16:31:54] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-21 16:31:54] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-21 16:31:54] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-21 16:31:54] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-21 16:31:54] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 3/139 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-21 16:31:55] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/172 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/172 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 16 (OVERLAPS) 0/172 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 140 constraints, problems are : Problem set: 0 solved, 77 unsolved in 4927 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 3/88 variables, 10/44 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 82/170 variables, 88/133 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 5/138 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 77/215 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-21 16:31:57] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 12 (OVERLAPS) 2/172 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-21 16:31:58] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/172 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 15 (OVERLAPS) 0/172 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 219 constraints, problems are : Problem set: 0 solved, 77 unsolved in 3935 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 27/27 constraints]
After SMT, in 8901ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 8902ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9083 ms. Remains : 90/90 places, 82/82 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 188 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 89 transition count 75
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 83 transition count 75
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 14 place count 83 transition count 69
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 77 transition count 69
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 35 place count 72 transition count 65
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 72 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 71 transition count 64
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 40 place count 71 transition count 64
Applied a total of 40 rules in 7 ms. Remains 71 /90 variables (removed 19) and now considering 64/82 (removed 18) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 64 rows 71 cols
[2024-05-21 16:32:00] [INFO ] Computed 18 invariants in 1 ms
[2024-05-21 16:32:00] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 16:32:00] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-21 16:32:00] [INFO ] [Nat]Absence check using 16 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 16:32:00] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 16:32:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 16:32:00] [INFO ] After 8ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :1 sat :0
[2024-05-21 16:32:00] [INFO ] After 91ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
Over-approximation ignoring read arcs solved -1 properties in 153 ms.
All properties solved without resorting to model-checking.
Total runtime 63547 ms.
ITS solved all properties within timeout

BK_STOP 1716309120571

--------------------
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 ReachabilityCardinality -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="BusinessProcesses-PT-19"
export BK_EXAMINATION="ReachabilityCardinality"
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 BusinessProcesses-PT-19, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620398600598"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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