About the Execution of GreatSPN+red for MultiCrashLeafsetExtension-PT-S16C06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9957.455 | 3600000.00 | 11005077.00 | 7035.50 | TFFTFFFFFF?FTTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r245-tall-171654349000038.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is MultiCrashLeafsetExtension-PT-S16C06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654349000038
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.7M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 19 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 22 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Apr 12 06:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 06:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.2M May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716571560230
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 17:26:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-24 17:26:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 17:26:01] [INFO ] Load time of PNML (sax parser for PT used): 371 ms
[2024-05-24 17:26:01] [INFO ] Transformed 5568 places.
[2024-05-24 17:26:01] [INFO ] Transformed 7799 transitions.
[2024-05-24 17:26:01] [INFO ] Parsed PT model containing 5568 places and 7799 transitions and 29646 arcs in 503 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (641 resets) in 2626 ms. (15 steps per ms) remains 13/16 properties
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (172 resets) in 576 ms. (69 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (172 resets) in 1144 ms. (34 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (172 resets) in 330 ms. (120 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (172 resets) in 325 ms. (122 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (172 resets) in 169 ms. (235 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (172 resets) in 164 ms. (242 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (172 resets) in 185 ms. (215 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (172 resets) in 200 ms. (199 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (172 resets) in 188 ms. (211 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (172 resets) in 194 ms. (205 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (172 resets) in 197 ms. (202 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (172 resets) in 207 ms. (192 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (172 resets) in 188 ms. (211 steps per ms) remains 13/13 properties
[2024-05-24 17:26:04] [INFO ] Flow matrix only has 7527 transitions (discarded 272 similar events)
// Phase 1: matrix 7527 rows 5568 cols
[2024-05-24 17:26:04] [INFO ] Computed 573 invariants in 434 ms
[2024-05-24 17:26:04] [INFO ] State equation strengthened by 2178 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 672/1037 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1037 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1037 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 30/1067 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1067 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-03 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-04 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-05 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-06 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-07 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-08 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-09 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-11 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-13 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-14 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-15 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 3575/4642 variables, 295/333 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4642 variables, 0/333 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 14/4656 variables, 14/347 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4656 variables, 0/347 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 912/5568 variables, 226/573 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5568 variables, 0/573 constraints. Problems are: Problem set: 11 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 13095/13095 variables, and 6141 constraints, problems are : Problem set: 11 solved, 2 unsolved in 5053 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 523/523 constraints, State Equation: 5568/5568 constraints, ReadFeed: 0/2178 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 689/769 variables, 2/2 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/769 variables, 0/2 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/787 variables, 2/4 constraints. Problems are: Problem set: 11 solved, 2 unsolved
[2024-05-24 17:26:10] [INFO ] Deduced a trap composed of 50 places in 321 ms of which 44 ms to minimize.
[2024-05-24 17:26:10] [INFO ] Deduced a trap composed of 104 places in 275 ms of which 5 ms to minimize.
[2024-05-24 17:26:11] [INFO ] Deduced a trap composed of 139 places in 259 ms of which 5 ms to minimize.
[2024-05-24 17:26:11] [INFO ] Deduced a trap composed of 173 places in 278 ms of which 4 ms to minimize.
[2024-05-24 17:26:11] [INFO ] Deduced a trap composed of 220 places in 264 ms of which 4 ms to minimize.
[2024-05-24 17:26:11] [INFO ] Deduced a trap composed of 234 places in 250 ms of which 4 ms to minimize.
[2024-05-24 17:26:12] [INFO ] Deduced a trap composed of 231 places in 249 ms of which 5 ms to minimize.
[2024-05-24 17:26:12] [INFO ] Deduced a trap composed of 233 places in 257 ms of which 4 ms to minimize.
[2024-05-24 17:26:12] [INFO ] Deduced a trap composed of 230 places in 250 ms of which 4 ms to minimize.
[2024-05-24 17:26:12] [INFO ] Deduced a trap composed of 248 places in 267 ms of which 4 ms to minimize.
[2024-05-24 17:26:13] [INFO ] Deduced a trap composed of 241 places in 260 ms of which 5 ms to minimize.
[2024-05-24 17:26:13] [INFO ] Deduced a trap composed of 201 places in 253 ms of which 4 ms to minimize.
[2024-05-24 17:26:13] [INFO ] Deduced a trap composed of 164 places in 267 ms of which 4 ms to minimize.
[2024-05-24 17:26:14] [INFO ] Deduced a trap composed of 173 places in 275 ms of which 4 ms to minimize.
[2024-05-24 17:26:14] [INFO ] Deduced a trap composed of 208 places in 243 ms of which 4 ms to minimize.
[2024-05-24 17:26:14] [INFO ] Deduced a trap composed of 224 places in 280 ms of which 4 ms to minimize.
[2024-05-24 17:26:14] [INFO ] Deduced a trap composed of 257 places in 269 ms of which 5 ms to minimize.
SMT process timed out in 10854ms, After SMT, problems are : Problem set: 11 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 80 out of 5568 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5568/5568 places, 7799/7799 transitions.
Graph (complete) has 17461 edges and 5568 vertex of which 5537 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.24 ms
Discarding 31 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1572 transitions
Trivial Post-agglo rules discarded 1572 transitions
Performed 1572 trivial Post agglomeration. Transition count delta: 1572
Iterating post reduction 0 with 1572 rules applied. Total rules applied 1573 place count 5537 transition count 6227
Reduce places removed 1572 places and 0 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 1 with 1608 rules applied. Total rules applied 3181 place count 3965 transition count 6191
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 3217 place count 3929 transition count 6191
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 202 Pre rules applied. Total rules applied 3217 place count 3929 transition count 5989
Deduced a syphon composed of 202 places in 4 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 3 with 404 rules applied. Total rules applied 3621 place count 3727 transition count 5989
Discarding 1384 places :
Symmetric choice reduction at 3 with 1384 rule applications. Total rules 5005 place count 2343 transition count 4605
Iterating global reduction 3 with 1384 rules applied. Total rules applied 6389 place count 2343 transition count 4605
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 6389 place count 2343 transition count 4604
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6391 place count 2342 transition count 4604
Discarding 194 places :
Symmetric choice reduction at 3 with 194 rule applications. Total rules 6585 place count 2148 transition count 3440
Iterating global reduction 3 with 194 rules applied. Total rules applied 6779 place count 2148 transition count 3440
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 4 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 6813 place count 2131 transition count 3423
Free-agglomeration rule (complex) applied 193 times.
Iterating global reduction 3 with 193 rules applied. Total rules applied 7006 place count 2131 transition count 4000
Reduce places removed 193 places and 0 transitions.
Iterating post reduction 3 with 193 rules applied. Total rules applied 7199 place count 1938 transition count 4000
Partial Free-agglomeration rule applied 185 times.
Drop transitions (Partial Free agglomeration) removed 185 transitions
Iterating global reduction 4 with 185 rules applied. Total rules applied 7384 place count 1938 transition count 4000
Applied a total of 7384 rules in 1600 ms. Remains 1938 /5568 variables (removed 3630) and now considering 4000/7799 (removed 3799) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1616 ms. Remains : 1938/5568 places, 4000/7799 transitions.
RANDOM walk for 40000 steps (1028 resets) in 1034 ms. (38 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (192 resets) in 306 ms. (130 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (192 resets) in 310 ms. (128 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 56474 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 2
Probabilistic random walk after 56474 steps, saw 25407 distinct states, run finished after 3005 ms. (steps per millisecond=18 ) properties seen :0
[2024-05-24 17:26:20] [INFO ] Flow matrix only has 3604 transitions (discarded 396 similar events)
// Phase 1: matrix 3604 rows 1938 cols
[2024-05-24 17:26:20] [INFO ] Computed 542 invariants in 68 ms
[2024-05-24 17:26:20] [INFO ] State equation strengthened by 1978 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1148/1228 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1228 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1228 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/1229 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1229 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 598/1827 variables, 421/431 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1827 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 26/1853 variables, 26/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1853 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 85/1938 variables, 85/542 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1938 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3604/5542 variables, 1938/2480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5542 variables, 1978/4458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5542 variables, 0/4458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/5542 variables, 0/4458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5542/5542 variables, and 4458 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2254 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 508/508 constraints, State Equation: 1938/1938 constraints, ReadFeed: 1978/1978 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1148/1228 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1228 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1228 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/1229 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1229 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 598/1827 variables, 421/431 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:26:24] [INFO ] Deduced a trap composed of 6 places in 1472 ms of which 12 ms to minimize.
[2024-05-24 17:26:26] [INFO ] Deduced a trap composed of 235 places in 1496 ms of which 13 ms to minimize.
[2024-05-24 17:26:27] [INFO ] Deduced a trap composed of 201 places in 1469 ms of which 12 ms to minimize.
[2024-05-24 17:26:29] [INFO ] Deduced a trap composed of 254 places in 1493 ms of which 12 ms to minimize.
[2024-05-24 17:26:30] [INFO ] Deduced a trap composed of 310 places in 1535 ms of which 13 ms to minimize.
[2024-05-24 17:26:31] [INFO ] Deduced a trap composed of 244 places in 1328 ms of which 17 ms to minimize.
[2024-05-24 17:26:33] [INFO ] Deduced a trap composed of 255 places in 1480 ms of which 12 ms to minimize.
[2024-05-24 17:26:34] [INFO ] Deduced a trap composed of 48 places in 1425 ms of which 12 ms to minimize.
[2024-05-24 17:26:36] [INFO ] Deduced a trap composed of 285 places in 1386 ms of which 12 ms to minimize.
[2024-05-24 17:26:37] [INFO ] Deduced a trap composed of 351 places in 1405 ms of which 12 ms to minimize.
[2024-05-24 17:26:39] [INFO ] Deduced a trap composed of 238 places in 1504 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1827 variables, 11/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:26:40] [INFO ] Deduced a trap composed of 256 places in 1429 ms of which 12 ms to minimize.
[2024-05-24 17:26:42] [INFO ] Deduced a trap composed of 281 places in 1505 ms of which 12 ms to minimize.
[2024-05-24 17:26:43] [INFO ] Deduced a trap composed of 354 places in 1503 ms of which 12 ms to minimize.
[2024-05-24 17:26:45] [INFO ] Deduced a trap composed of 272 places in 1526 ms of which 12 ms to minimize.
[2024-05-24 17:26:47] [INFO ] Deduced a trap composed of 73 places in 1476 ms of which 12 ms to minimize.
[2024-05-24 17:26:48] [INFO ] Deduced a trap composed of 211 places in 1492 ms of which 13 ms to minimize.
[2024-05-24 17:26:50] [INFO ] Deduced a trap composed of 260 places in 1481 ms of which 13 ms to minimize.
[2024-05-24 17:26:51] [INFO ] Deduced a trap composed of 164 places in 1496 ms of which 12 ms to minimize.
[2024-05-24 17:26:53] [INFO ] Deduced a trap composed of 168 places in 1520 ms of which 12 ms to minimize.
[2024-05-24 17:26:54] [INFO ] Deduced a trap composed of 184 places in 1476 ms of which 12 ms to minimize.
[2024-05-24 17:26:56] [INFO ] Deduced a trap composed of 267 places in 1446 ms of which 13 ms to minimize.
[2024-05-24 17:26:57] [INFO ] Deduced a trap composed of 195 places in 1470 ms of which 15 ms to minimize.
[2024-05-24 17:26:59] [INFO ] Deduced a trap composed of 232 places in 1411 ms of which 12 ms to minimize.
[2024-05-24 17:27:00] [INFO ] Deduced a trap composed of 170 places in 1356 ms of which 11 ms to minimize.
[2024-05-24 17:27:01] [INFO ] Deduced a trap composed of 298 places in 1411 ms of which 11 ms to minimize.
[2024-05-24 17:27:03] [INFO ] Deduced a trap composed of 206 places in 1462 ms of which 12 ms to minimize.
[2024-05-24 17:27:04] [INFO ] Deduced a trap composed of 259 places in 1375 ms of which 12 ms to minimize.
[2024-05-24 17:27:06] [INFO ] Deduced a trap composed of 276 places in 1465 ms of which 12 ms to minimize.
[2024-05-24 17:27:07] [INFO ] Deduced a trap composed of 331 places in 1500 ms of which 12 ms to minimize.
SMT process timed out in 47756ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 80 out of 1938 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1938/1938 places, 4000/4000 transitions.
Applied a total of 0 rules in 116 ms. Remains 1938 /1938 variables (removed 0) and now considering 4000/4000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 1938/1938 places, 4000/4000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1938/1938 places, 4000/4000 transitions.
Applied a total of 0 rules in 111 ms. Remains 1938 /1938 variables (removed 0) and now considering 4000/4000 (removed 0) transitions.
[2024-05-24 17:27:08] [INFO ] Flow matrix only has 3604 transitions (discarded 396 similar events)
[2024-05-24 17:27:08] [INFO ] Invariant cache hit.
[2024-05-24 17:27:11] [INFO ] Implicit Places using invariants in 3517 ms returned [4, 7, 10, 11, 12, 13, 15, 19, 25, 33, 43, 57, 72, 87, 101, 102, 104, 105, 106, 107, 120, 130, 138, 144, 148, 152, 168, 174, 176, 177, 178, 179, 180, 181, 182, 184, 188, 194, 202, 212, 224, 237, 250, 251, 252, 253, 254, 255, 256, 266, 280, 284, 286, 304, 310, 312, 313, 314, 316, 317, 318, 322, 324, 328, 334, 342, 352, 363, 373, 374, 375, 377, 378, 379, 387, 394, 398, 400, 402, 404, 419, 425, 427, 428, 430, 431, 432, 433, 437, 439, 441, 445, 451, 459, 468, 477, 478, 480, 481, 482, 489, 493, 495, 497, 499, 501, 518, 524, 527, 528, 529, 530, 531, 532, 533, 535, 537, 539, 541, 545, 558, 564, 565, 567, 568, 569, 570, 575, 577, 579, 581, 583, 585, 600, 606, 608, 609, 610, 612, 613, 614, 616, 618, 620, 622, 624, 628, 636, 641, 642, 643, 645, 646, 647, 649, 651, 655, 657, 660, 675, 681, 683, 684, 685, 687, 688, 689, 691, 693, 695, 697, 700, 702, 705, 708, 709, 710, 711, 712, 713, 714, 716, 718, 720, 722, 726, 741, 747, 750, 751, 752, 753, 754, 755, 757, 759, 762, 764, 766, 768, 772, 775, 776, 779, 780, 781, 785, 787, 789, 791, 793, 795, 810, 812, 815, 817, 818, 820, 822, 823, 827, 829, 831, 833, 835, 839, 843, 845, 846, 847, 856, 858, 860, 864, 866, 870, 885, 891, 893, 894, 895, 897, 898, 899, 901, 903, 905, 908, 910, 912, 914, 916, 917, 918, 920, 921, 922, 924, 926, 928, 930, 932, 934, 951, 957, 960, 961, 962, 963, 964, 965, 967, 969, 971, 973, 977, 979, 981, 986, 987, 988, 989, 990, 991, 993, 995, 997, 999, 1001, 1004, 1019, 1025, 1027, 1033, 1034, 1037, 1040, 1044, 1048, 1050, 1052, 1056, 1062, 1063, 1064, 1065, 1066, 1067, 1073, 1076, 1078, 1080, 1082, 1084, 1099, 1105, 1107, 1110, 1111, 1113, 1115, 1118, 1120, 1123, 1127, 1131, 1137, 1145, 1146, 1147, 1149, 1150, 1156, 1160, 1162, 1164, 1166, 1170, 1187, 1193, 1195, 1196, 1197, 1199, 1200, 1201, 1203, 1205, 1207, 1209, 1213, 1219, 1228, 1238, 1239, 1240, 1241, 1242, 1243, 1244, 1252, 1262, 1264, 1266, 1268, 1283, 1289, 1292, 1293, 1294, 1295, 1296, 1297, 1300, 1302, 1304, 1308, 1316, 1324, 1334, 1345, 1346, 1347, 1348, 1349, 1351, 1361, 1370, 1376, 1380, 1382, 1384, 1399, 1405, 1407, 1408, 1409, 1412, 1413, 1415, 1417, 1421, 1428, 1436, 1446, 1460, 1473, 1474, 1475, 1476, 1477, 1478, 1479, 1491, 1501, 1509, 1515, 1519, 1521, 1536, 1538, 1541, 1543, 1545, 1546, 1548, 1549, 1551, 1555, 1562, 1570, 1580, 1592, 1607, 1622, 1623, 1624, 1625, 1626, 1627, 1628, 1642, 1654, 1664, 1672, 1678, 1682, 1697]
[2024-05-24 17:27:11] [INFO ] Actually due to overlaps returned [600, 168, 304, 419, 518, 675, 741, 810, 1536, 885, 1283, 951, 1099, 1187, 1399, 1697, 1019, 4, 10, 11, 12, 13, 101, 102, 104, 105, 106, 176, 177, 178, 179, 180, 181, 250, 251, 252, 253, 254, 255, 312, 313, 314, 316, 317, 373, 374, 375, 377, 378, 427, 428, 430, 431, 432, 477, 478, 480, 481, 527, 528, 529, 530, 531, 532, 564, 565, 567, 568, 569, 608, 609, 610, 612, 613, 641, 642, 643, 645, 646, 683, 684, 685, 687, 688, 708, 709, 710, 711, 712, 713, 750, 751, 752, 753, 754, 775, 776, 779, 780, 812, 817, 818, 820, 822, 845, 846, 847, 893, 894, 895, 897, 898, 916, 917, 918, 920, 921, 960, 961, 962, 963, 964, 986, 987, 988, 989, 990, 1027, 1033, 1062, 1063, 1064, 1065, 1066, 1107, 1110, 1111, 1145, 1146, 1147, 1149, 1195, 1196, 1197, 1199, 1200, 1238, 1239, 1240, 1241, 1242, 1243, 1292, 1293, 1294, 1295, 1296, 1345, 1346, 1347, 1348, 1349, 1407, 1408, 1409, 1412, 1473, 1474, 1475, 1476, 1477, 1478, 1538, 1543, 1545, 1546, 1548, 1622, 1623, 1624, 1625, 1626, 1627]
Discarding 183 places :
Implicit Place search using SMT only with invariants took 3536 ms to find 183 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1755/1938 places, 4000/4000 transitions.
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 149 place count 1606 transition count 3851
Iterating global reduction 0 with 149 rules applied. Total rules applied 298 place count 1606 transition count 3851
Discarding 146 places :
Symmetric choice reduction at 0 with 146 rule applications. Total rules 444 place count 1460 transition count 3705
Iterating global reduction 0 with 146 rules applied. Total rules applied 590 place count 1460 transition count 3705
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 591 place count 1459 transition count 3699
Iterating global reduction 0 with 1 rules applied. Total rules applied 592 place count 1459 transition count 3699
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 595 place count 1459 transition count 3696
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 598 place count 1456 transition count 3696
Applied a total of 598 rules in 280 ms. Remains 1456 /1755 variables (removed 299) and now considering 3696/4000 (removed 304) transitions.
[2024-05-24 17:27:11] [INFO ] Flow matrix only has 3300 transitions (discarded 396 similar events)
// Phase 1: matrix 3300 rows 1456 cols
[2024-05-24 17:27:11] [INFO ] Computed 359 invariants in 43 ms
[2024-05-24 17:27:14] [INFO ] Implicit Places using invariants in 2383 ms returned [6, 10, 14, 20, 28, 38, 52, 67, 82, 97, 110, 120, 128, 134, 138, 142, 162, 164, 166, 170, 176, 184, 194, 206, 219, 232, 242, 256, 260, 262, 278, 281, 285, 287, 291, 297, 305, 315, 326, 337, 345, 352, 356, 358, 360, 362, 373, 376, 380, 382, 384, 388, 394, 402, 411, 421, 428, 432, 434, 436, 438, 440, 453, 456, 458, 460, 462, 464, 468, 481, 488, 493, 495, 497, 499, 501, 503, 512, 515, 517, 519, 521, 523, 525, 529, 537, 543, 545, 547, 551, 553, 556, 566, 569, 571, 573, 575, 577, 580, 582, 585, 588, 590, 592, 594, 596, 600, 610, 613, 615, 617, 620, 622, 624, 626, 630, 635, 639, 641, 643, 645, 647, 649, 658, 662, 666, 668, 670, 672, 674, 678, 682, 692, 694, 696, 700, 702, 706, 718, 721, 723, 725, 727, 730, 732, 734, 736, 739, 741, 743, 745, 747, 749, 751, 763, 766, 768, 770, 772, 774, 778, 780, 782, 787, 789, 791, 793, 795, 797, 800, 810, 817, 820, 823, 827, 831, 833, 835, 839, 845, 851, 854, 856, 858, 860, 862, 875, 880, 882, 885, 887, 890, 894, 898, 904, 913, 919, 923, 925, 927, 929, 933, 948, 951, 953, 955, 957, 959, 963, 969, 978, 987, 995, 1005, 1007, 1009, 1011, 1020, 1023, 1026, 1028, 1030, 1034, 1042, 1050, 1060, 1072, 1082, 1091, 1097, 1101, 1103, 1105, 1115, 1119, 1121, 1123, 1127, 1134, 1142, 1152, 1166, 1179, 1191, 1201, 1209, 1215, 1219, 1221, 1230, 1234, 1236, 1240, 1247, 1255, 1265, 1277, 1292, 1307, 1321, 1333, 1343, 1351, 1357, 1361]
Discarding 265 places :
Implicit Place search using SMT only with invariants took 2391 ms to find 265 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1191/1938 places, 3696/4000 transitions.
Applied a total of 0 rules in 85 ms. Remains 1191 /1191 variables (removed 0) and now considering 3696/3696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 6405 ms. Remains : 1191/1938 places, 3696/4000 transitions.
RANDOM walk for 40000 steps (1080 resets) in 795 ms. (50 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (142 resets) in 158 ms. (251 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (143 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 65610 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :1 out of 2
Probabilistic random walk after 65610 steps, saw 28288 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-05-24 17:27:17] [INFO ] Flow matrix only has 3300 transitions (discarded 396 similar events)
// Phase 1: matrix 3300 rows 1191 cols
[2024-05-24 17:27:17] [INFO ] Computed 94 invariants in 43 ms
[2024-05-24 17:27:17] [INFO ] State equation strengthened by 1973 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1005/1042 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1042 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1042 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 109/1151 variables, 48/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1151 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 31/1182 variables, 31/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1182 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/1191 variables, 9/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1191 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3300/4491 variables, 1191/1285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4491 variables, 1973/3258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4491 variables, 0/3258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/4491 variables, 0/3258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4491/4491 variables, and 3258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1309 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 59/59 constraints, State Equation: 1191/1191 constraints, ReadFeed: 1973/1973 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/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1005/1042 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1042 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:27:19] [INFO ] Deduced a trap composed of 371 places in 543 ms of which 6 ms to minimize.
[2024-05-24 17:27:20] [INFO ] Deduced a trap composed of 218 places in 611 ms of which 6 ms to minimize.
[2024-05-24 17:27:21] [INFO ] Deduced a trap composed of 206 places in 562 ms of which 7 ms to minimize.
[2024-05-24 17:27:21] [INFO ] Deduced a trap composed of 241 places in 564 ms of which 6 ms to minimize.
[2024-05-24 17:27:22] [INFO ] Deduced a trap composed of 349 places in 563 ms of which 6 ms to minimize.
[2024-05-24 17:27:22] [INFO ] Deduced a trap composed of 403 places in 559 ms of which 6 ms to minimize.
[2024-05-24 17:27:23] [INFO ] Deduced a trap composed of 219 places in 555 ms of which 7 ms to minimize.
[2024-05-24 17:27:23] [INFO ] Deduced a trap composed of 297 places in 563 ms of which 6 ms to minimize.
[2024-05-24 17:27:24] [INFO ] Deduced a trap composed of 248 places in 566 ms of which 6 ms to minimize.
[2024-05-24 17:27:25] [INFO ] Deduced a trap composed of 438 places in 566 ms of which 7 ms to minimize.
[2024-05-24 17:27:25] [INFO ] Deduced a trap composed of 215 places in 555 ms of which 6 ms to minimize.
[2024-05-24 17:27:26] [INFO ] Deduced a trap composed of 258 places in 601 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1042 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1042 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 109/1151 variables, 48/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:27:27] [INFO ] Deduced a trap composed of 6 places in 730 ms of which 7 ms to minimize.
[2024-05-24 17:27:27] [INFO ] Deduced a trap composed of 172 places in 662 ms of which 7 ms to minimize.
[2024-05-24 17:27:28] [INFO ] Deduced a trap composed of 29 places in 666 ms of which 7 ms to minimize.
[2024-05-24 17:27:29] [INFO ] Deduced a trap composed of 164 places in 743 ms of which 8 ms to minimize.
[2024-05-24 17:27:30] [INFO ] Deduced a trap composed of 183 places in 732 ms of which 7 ms to minimize.
[2024-05-24 17:27:30] [INFO ] Deduced a trap composed of 201 places in 718 ms of which 7 ms to minimize.
[2024-05-24 17:27:31] [INFO ] Deduced a trap composed of 64 places in 721 ms of which 7 ms to minimize.
[2024-05-24 17:27:32] [INFO ] Deduced a trap composed of 177 places in 729 ms of which 8 ms to minimize.
[2024-05-24 17:27:33] [INFO ] Deduced a trap composed of 195 places in 743 ms of which 8 ms to minimize.
[2024-05-24 17:27:33] [INFO ] Deduced a trap composed of 181 places in 734 ms of which 8 ms to minimize.
[2024-05-24 17:27:34] [INFO ] Deduced a trap composed of 172 places in 743 ms of which 8 ms to minimize.
[2024-05-24 17:27:35] [INFO ] Deduced a trap composed of 205 places in 688 ms of which 7 ms to minimize.
[2024-05-24 17:27:36] [INFO ] Deduced a trap composed of 164 places in 746 ms of which 7 ms to minimize.
[2024-05-24 17:27:36] [INFO ] Deduced a trap composed of 99 places in 749 ms of which 7 ms to minimize.
[2024-05-24 17:27:37] [INFO ] Deduced a trap composed of 171 places in 681 ms of which 7 ms to minimize.
[2024-05-24 17:27:38] [INFO ] Deduced a trap composed of 166 places in 664 ms of which 7 ms to minimize.
[2024-05-24 17:27:38] [INFO ] Deduced a trap composed of 194 places in 717 ms of which 8 ms to minimize.
[2024-05-24 17:27:39] [INFO ] Deduced a trap composed of 174 places in 729 ms of which 8 ms to minimize.
[2024-05-24 17:27:40] [INFO ] Deduced a trap composed of 152 places in 744 ms of which 8 ms to minimize.
[2024-05-24 17:27:41] [INFO ] Deduced a trap composed of 215 places in 740 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1151 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:27:42] [INFO ] Deduced a trap composed of 163 places in 728 ms of which 7 ms to minimize.
[2024-05-24 17:27:42] [INFO ] Deduced a trap composed of 172 places in 724 ms of which 7 ms to minimize.
[2024-05-24 17:27:43] [INFO ] Deduced a trap composed of 189 places in 718 ms of which 7 ms to minimize.
[2024-05-24 17:27:44] [INFO ] Deduced a trap composed of 209 places in 721 ms of which 8 ms to minimize.
[2024-05-24 17:27:45] [INFO ] Deduced a trap composed of 29 places in 732 ms of which 7 ms to minimize.
[2024-05-24 17:27:45] [INFO ] Deduced a trap composed of 166 places in 700 ms of which 7 ms to minimize.
[2024-05-24 17:27:46] [INFO ] Deduced a trap composed of 159 places in 673 ms of which 7 ms to minimize.
[2024-05-24 17:27:47] [INFO ] Deduced a trap composed of 202 places in 657 ms of which 8 ms to minimize.
[2024-05-24 17:27:47] [INFO ] Deduced a trap composed of 155 places in 744 ms of which 8 ms to minimize.
[2024-05-24 17:27:48] [INFO ] Deduced a trap composed of 158 places in 736 ms of which 7 ms to minimize.
[2024-05-24 17:27:49] [INFO ] Deduced a trap composed of 168 places in 733 ms of which 8 ms to minimize.
[2024-05-24 17:27:50] [INFO ] Deduced a trap composed of 187 places in 659 ms of which 7 ms to minimize.
[2024-05-24 17:27:50] [INFO ] Deduced a trap composed of 158 places in 726 ms of which 8 ms to minimize.
[2024-05-24 17:27:51] [INFO ] Deduced a trap composed of 163 places in 680 ms of which 8 ms to minimize.
[2024-05-24 17:27:52] [INFO ] Deduced a trap composed of 59 places in 707 ms of which 7 ms to minimize.
[2024-05-24 17:27:53] [INFO ] Deduced a trap composed of 174 places in 716 ms of which 8 ms to minimize.
[2024-05-24 17:27:53] [INFO ] Deduced a trap composed of 184 places in 697 ms of which 8 ms to minimize.
[2024-05-24 17:27:54] [INFO ] Deduced a trap composed of 207 places in 718 ms of which 8 ms to minimize.
[2024-05-24 17:27:55] [INFO ] Deduced a trap composed of 166 places in 705 ms of which 8 ms to minimize.
[2024-05-24 17:27:55] [INFO ] Deduced a trap composed of 182 places in 711 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1151 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:27:56] [INFO ] Deduced a trap composed of 106 places in 646 ms of which 7 ms to minimize.
[2024-05-24 17:27:57] [INFO ] Deduced a trap composed of 58 places in 719 ms of which 7 ms to minimize.
[2024-05-24 17:27:58] [INFO ] Deduced a trap composed of 48 places in 718 ms of which 7 ms to minimize.
[2024-05-24 17:27:58] [INFO ] Deduced a trap composed of 160 places in 751 ms of which 8 ms to minimize.
[2024-05-24 17:27:59] [INFO ] Deduced a trap composed of 160 places in 693 ms of which 8 ms to minimize.
[2024-05-24 17:28:00] [INFO ] Deduced a trap composed of 77 places in 689 ms of which 8 ms to minimize.
[2024-05-24 17:28:01] [INFO ] Deduced a trap composed of 100 places in 682 ms of which 7 ms to minimize.
[2024-05-24 17:28:01] [INFO ] Deduced a trap composed of 87 places in 685 ms of which 7 ms to minimize.
[2024-05-24 17:28:02] [INFO ] Deduced a trap composed of 99 places in 630 ms of which 7 ms to minimize.
[2024-05-24 17:28:03] [INFO ] Deduced a trap composed of 181 places in 679 ms of which 7 ms to minimize.
[2024-05-24 17:28:03] [INFO ] Deduced a trap composed of 191 places in 677 ms of which 7 ms to minimize.
[2024-05-24 17:28:04] [INFO ] Deduced a trap composed of 202 places in 656 ms of which 7 ms to minimize.
[2024-05-24 17:28:05] [INFO ] Deduced a trap composed of 154 places in 668 ms of which 9 ms to minimize.
[2024-05-24 17:28:05] [INFO ] Deduced a trap composed of 176 places in 681 ms of which 7 ms to minimize.
[2024-05-24 17:28:06] [INFO ] Deduced a trap composed of 217 places in 677 ms of which 7 ms to minimize.
[2024-05-24 17:28:07] [INFO ] Deduced a trap composed of 175 places in 684 ms of which 7 ms to minimize.
[2024-05-24 17:28:07] [INFO ] Deduced a trap composed of 201 places in 652 ms of which 7 ms to minimize.
[2024-05-24 17:28:08] [INFO ] Deduced a trap composed of 104 places in 655 ms of which 7 ms to minimize.
[2024-05-24 17:28:09] [INFO ] Deduced a trap composed of 96 places in 659 ms of which 8 ms to minimize.
[2024-05-24 17:28:10] [INFO ] Deduced a trap composed of 109 places in 660 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1151 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:28:10] [INFO ] Deduced a trap composed of 96 places in 670 ms of which 7 ms to minimize.
[2024-05-24 17:28:11] [INFO ] Deduced a trap composed of 186 places in 670 ms of which 7 ms to minimize.
[2024-05-24 17:28:12] [INFO ] Deduced a trap composed of 144 places in 675 ms of which 7 ms to minimize.
[2024-05-24 17:28:12] [INFO ] Deduced a trap composed of 96 places in 665 ms of which 7 ms to minimize.
[2024-05-24 17:28:13] [INFO ] Deduced a trap composed of 103 places in 674 ms of which 7 ms to minimize.
[2024-05-24 17:28:14] [INFO ] Deduced a trap composed of 199 places in 696 ms of which 8 ms to minimize.
[2024-05-24 17:28:14] [INFO ] Deduced a trap composed of 183 places in 681 ms of which 7 ms to minimize.
[2024-05-24 17:28:15] [INFO ] Deduced a trap composed of 209 places in 663 ms of which 7 ms to minimize.
[2024-05-24 17:28:16] [INFO ] Deduced a trap composed of 182 places in 653 ms of which 7 ms to minimize.
[2024-05-24 17:28:16] [INFO ] Deduced a trap composed of 97 places in 655 ms of which 7 ms to minimize.
[2024-05-24 17:28:17] [INFO ] Deduced a trap composed of 179 places in 674 ms of which 7 ms to minimize.
[2024-05-24 17:28:18] [INFO ] Deduced a trap composed of 191 places in 669 ms of which 7 ms to minimize.
[2024-05-24 17:28:19] [INFO ] Deduced a trap composed of 94 places in 670 ms of which 7 ms to minimize.
[2024-05-24 17:28:19] [INFO ] Deduced a trap composed of 207 places in 667 ms of which 7 ms to minimize.
[2024-05-24 17:28:20] [INFO ] Deduced a trap composed of 312 places in 594 ms of which 7 ms to minimize.
[2024-05-24 17:28:21] [INFO ] Deduced a trap composed of 201 places in 679 ms of which 8 ms to minimize.
[2024-05-24 17:28:21] [INFO ] Deduced a trap composed of 199 places in 672 ms of which 7 ms to minimize.
[2024-05-24 17:28:22] [INFO ] Deduced a trap composed of 124 places in 676 ms of which 7 ms to minimize.
[2024-05-24 17:28:23] [INFO ] Deduced a trap composed of 110 places in 668 ms of which 7 ms to minimize.
[2024-05-24 17:28:23] [INFO ] Deduced a trap composed of 94 places in 661 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1151 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:28:24] [INFO ] Deduced a trap composed of 181 places in 675 ms of which 7 ms to minimize.
[2024-05-24 17:28:25] [INFO ] Deduced a trap composed of 108 places in 664 ms of which 7 ms to minimize.
[2024-05-24 17:28:25] [INFO ] Deduced a trap composed of 137 places in 671 ms of which 8 ms to minimize.
[2024-05-24 17:28:26] [INFO ] Deduced a trap composed of 121 places in 668 ms of which 7 ms to minimize.
[2024-05-24 17:28:27] [INFO ] Deduced a trap composed of 299 places in 658 ms of which 7 ms to minimize.
[2024-05-24 17:28:28] [INFO ] Deduced a trap composed of 180 places in 652 ms of which 7 ms to minimize.
[2024-05-24 17:28:28] [INFO ] Deduced a trap composed of 180 places in 642 ms of which 7 ms to minimize.
[2024-05-24 17:28:29] [INFO ] Deduced a trap composed of 96 places in 659 ms of which 7 ms to minimize.
[2024-05-24 17:28:30] [INFO ] Deduced a trap composed of 116 places in 680 ms of which 7 ms to minimize.
[2024-05-24 17:28:30] [INFO ] Deduced a trap composed of 312 places in 676 ms of which 7 ms to minimize.
[2024-05-24 17:28:31] [INFO ] Deduced a trap composed of 164 places in 653 ms of which 7 ms to minimize.
[2024-05-24 17:28:32] [INFO ] Deduced a trap composed of 194 places in 659 ms of which 7 ms to minimize.
[2024-05-24 17:28:32] [INFO ] Deduced a trap composed of 176 places in 649 ms of which 7 ms to minimize.
[2024-05-24 17:28:33] [INFO ] Deduced a trap composed of 201 places in 629 ms of which 7 ms to minimize.
[2024-05-24 17:28:34] [INFO ] Deduced a trap composed of 103 places in 656 ms of which 7 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1151/4491 variables, and 161 constraints, problems are : Problem set: 0 solved, 1 unsolved in 75012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/35 constraints, Generalized P Invariants (flows): 50/59 constraints, State Equation: 0/1191 constraints, ReadFeed: 0/1973 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 107/107 constraints]
After SMT, in 76410ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 37 out of 1191 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1191/1191 places, 3696/3696 transitions.
Graph (complete) has 7212 edges and 1191 vertex of which 1190 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 1190 transition count 3681
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 1175 transition count 3681
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 1174 transition count 3680
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 1174 transition count 3680
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 1173 transition count 3674
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 1173 transition count 3674
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 39 place count 1171 transition count 3672
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 47 place count 1171 transition count 3759
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 55 place count 1163 transition count 3759
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 57 place count 1161 transition count 3757
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 1161 transition count 3757
Partial Free-agglomeration rule applied 20 times.
Drop transitions (Partial Free agglomeration) removed 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 79 place count 1161 transition count 3757
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 99 place count 1141 transition count 3737
Iterating global reduction 3 with 20 rules applied. Total rules applied 119 place count 1141 transition count 3737
Applied a total of 119 rules in 459 ms. Remains 1141 /1191 variables (removed 50) and now considering 3737/3696 (removed -41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 459 ms. Remains : 1141/1191 places, 3737/3696 transitions.
RANDOM walk for 40000 steps (1107 resets) in 802 ms. (49 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (142 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 68922 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 1
Probabilistic random walk after 68922 steps, saw 29501 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-24 17:28:37] [INFO ] Flow matrix only has 3340 transitions (discarded 397 similar events)
// Phase 1: matrix 3340 rows 1141 cols
[2024-05-24 17:28:37] [INFO ] Computed 93 invariants in 42 ms
[2024-05-24 17:28:37] [INFO ] State equation strengthened by 2063 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 978/1015 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1015 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1015 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 86/1101 variables, 47/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1101 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 28/1129 variables, 28/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1129 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/1141 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1141 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3340/4481 variables, 1141/1234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4481 variables, 2063/3297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4481 variables, 0/3297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/4481 variables, 0/3297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4481/4481 variables, and 3297 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1357 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 1141/1141 constraints, ReadFeed: 2063/2063 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/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 978/1015 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1015 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:28:40] [INFO ] Deduced a trap composed of 258 places in 613 ms of which 7 ms to minimize.
[2024-05-24 17:28:40] [INFO ] Deduced a trap composed of 354 places in 629 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1015 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1015 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 86/1101 variables, 47/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:28:41] [INFO ] Deduced a trap composed of 5 places in 603 ms of which 7 ms to minimize.
[2024-05-24 17:28:42] [INFO ] Deduced a trap composed of 162 places in 598 ms of which 7 ms to minimize.
[2024-05-24 17:28:42] [INFO ] Deduced a trap composed of 202 places in 609 ms of which 8 ms to minimize.
[2024-05-24 17:28:43] [INFO ] Deduced a trap composed of 187 places in 618 ms of which 6 ms to minimize.
[2024-05-24 17:28:43] [INFO ] Deduced a trap composed of 177 places in 536 ms of which 7 ms to minimize.
[2024-05-24 17:28:44] [INFO ] Deduced a trap composed of 173 places in 550 ms of which 7 ms to minimize.
[2024-05-24 17:28:45] [INFO ] Deduced a trap composed of 176 places in 542 ms of which 7 ms to minimize.
[2024-05-24 17:28:45] [INFO ] Deduced a trap composed of 182 places in 541 ms of which 6 ms to minimize.
[2024-05-24 17:28:46] [INFO ] Deduced a trap composed of 180 places in 538 ms of which 7 ms to minimize.
[2024-05-24 17:28:46] [INFO ] Deduced a trap composed of 185 places in 552 ms of which 6 ms to minimize.
[2024-05-24 17:28:47] [INFO ] Deduced a trap composed of 183 places in 526 ms of which 7 ms to minimize.
[2024-05-24 17:28:47] [INFO ] Deduced a trap composed of 182 places in 547 ms of which 7 ms to minimize.
[2024-05-24 17:28:48] [INFO ] Deduced a trap composed of 184 places in 536 ms of which 7 ms to minimize.
[2024-05-24 17:28:48] [INFO ] Deduced a trap composed of 180 places in 531 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1101 variables, 14/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1101 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 28/1129 variables, 28/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:28:49] [INFO ] Deduced a trap composed of 182 places in 577 ms of which 7 ms to minimize.
[2024-05-24 17:28:50] [INFO ] Deduced a trap composed of 152 places in 672 ms of which 7 ms to minimize.
[2024-05-24 17:28:50] [INFO ] Deduced a trap composed of 113 places in 661 ms of which 7 ms to minimize.
[2024-05-24 17:28:51] [INFO ] Deduced a trap composed of 155 places in 617 ms of which 6 ms to minimize.
[2024-05-24 17:28:52] [INFO ] Deduced a trap composed of 145 places in 649 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1129 variables, 5/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1129 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/1141 variables, 12/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1141 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3340/4481 variables, 1141/1255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4481 variables, 2063/3318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4481 variables, 1/3319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:28:55] [INFO ] Deduced a trap composed of 187 places in 553 ms of which 6 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/4481 variables, 1/3320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4481 variables, 0/3320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/4481 variables, 0/3320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4481/4481 variables, and 3320 constraints, problems are : Problem set: 0 solved, 1 unsolved in 16646 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 1141/1141 constraints, ReadFeed: 2063/2063 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 22/22 constraints]
After SMT, in 18096ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 73 ms.
Support contains 37 out of 1141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1141/1141 places, 3737/3737 transitions.
Applied a total of 0 rules in 111 ms. Remains 1141 /1141 variables (removed 0) and now considering 3737/3737 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 1141/1141 places, 3737/3737 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1141/1141 places, 3737/3737 transitions.
Applied a total of 0 rules in 98 ms. Remains 1141 /1141 variables (removed 0) and now considering 3737/3737 (removed 0) transitions.
[2024-05-24 17:28:56] [INFO ] Flow matrix only has 3340 transitions (discarded 397 similar events)
[2024-05-24 17:28:56] [INFO ] Invariant cache hit.
[2024-05-24 17:28:57] [INFO ] Implicit Places using invariants in 1238 ms returned [7, 220, 293, 323, 358, 395, 407, 425, 445, 460, 475, 496, 529, 530, 532, 563, 580, 608, 610, 653, 678, 679, 705, 802, 840]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 1243 ms to find 25 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1116/1141 places, 3737/3737 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1096 transition count 3717
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1096 transition count 3717
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 60 place count 1076 transition count 3697
Iterating global reduction 0 with 20 rules applied. Total rules applied 80 place count 1076 transition count 3697
Applied a total of 80 rules in 138 ms. Remains 1076 /1116 variables (removed 40) and now considering 3697/3737 (removed 40) transitions.
[2024-05-24 17:28:57] [INFO ] Flow matrix only has 3300 transitions (discarded 397 similar events)
// Phase 1: matrix 3300 rows 1076 cols
[2024-05-24 17:28:57] [INFO ] Computed 68 invariants in 37 ms
[2024-05-24 17:28:59] [INFO ] Implicit Places using invariants in 1371 ms returned []
[2024-05-24 17:28:59] [INFO ] Flow matrix only has 3300 transitions (discarded 397 similar events)
[2024-05-24 17:28:59] [INFO ] Invariant cache hit.
[2024-05-24 17:28:59] [INFO ] State equation strengthened by 2063 read => feed constraints.
[2024-05-24 17:29:30] [INFO ] Performed 941/1076 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 17:29:37] [INFO ] Implicit Places using invariants and state equation in 38612 ms returned []
Implicit Place search using SMT with State Equation took 39984 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1076/1141 places, 3697/3737 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 41464 ms. Remains : 1076/1141 places, 3697/3737 transitions.
RANDOM walk for 40000 steps (1107 resets) in 765 ms. (52 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (141 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 69803 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 1
Probabilistic random walk after 69803 steps, saw 29527 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
[2024-05-24 17:29:40] [INFO ] Flow matrix only has 3300 transitions (discarded 397 similar events)
[2024-05-24 17:29:40] [INFO ] Invariant cache hit.
[2024-05-24 17:29:40] [INFO ] State equation strengthened by 2063 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 937/974 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/974 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/974 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 62/1036 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1036 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 28/1064 variables, 28/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1064 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/1076 variables, 12/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1076 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3300/4376 variables, 1076/1144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4376 variables, 2063/3207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4376 variables, 0/3207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/4376 variables, 0/3207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4376/4376 variables, and 3207 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1285 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 1076/1076 constraints, ReadFeed: 2063/2063 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/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 937/974 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/974 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:29:42] [INFO ] Deduced a trap composed of 307 places in 586 ms of which 7 ms to minimize.
[2024-05-24 17:29:43] [INFO ] Deduced a trap composed of 172 places in 555 ms of which 7 ms to minimize.
[2024-05-24 17:29:44] [INFO ] Deduced a trap composed of 141 places in 529 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/974 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/974 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/1036 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:29:44] [INFO ] Deduced a trap composed of 5 places in 598 ms of which 6 ms to minimize.
[2024-05-24 17:29:45] [INFO ] Deduced a trap composed of 127 places in 590 ms of which 6 ms to minimize.
[2024-05-24 17:29:46] [INFO ] Deduced a trap composed of 28 places in 588 ms of which 7 ms to minimize.
[2024-05-24 17:29:46] [INFO ] Deduced a trap composed of 125 places in 567 ms of which 6 ms to minimize.
[2024-05-24 17:29:47] [INFO ] Deduced a trap composed of 133 places in 672 ms of which 7 ms to minimize.
[2024-05-24 17:29:47] [INFO ] Deduced a trap composed of 47 places in 654 ms of which 6 ms to minimize.
[2024-05-24 17:29:48] [INFO ] Deduced a trap composed of 131 places in 599 ms of which 7 ms to minimize.
[2024-05-24 17:29:49] [INFO ] Deduced a trap composed of 76 places in 609 ms of which 6 ms to minimize.
[2024-05-24 17:29:49] [INFO ] Deduced a trap composed of 147 places in 588 ms of which 7 ms to minimize.
[2024-05-24 17:29:50] [INFO ] Deduced a trap composed of 108 places in 642 ms of which 7 ms to minimize.
[2024-05-24 17:29:51] [INFO ] Deduced a trap composed of 86 places in 561 ms of which 6 ms to minimize.
[2024-05-24 17:29:51] [INFO ] Deduced a trap composed of 124 places in 645 ms of which 7 ms to minimize.
[2024-05-24 17:29:52] [INFO ] Deduced a trap composed of 91 places in 622 ms of which 6 ms to minimize.
[2024-05-24 17:29:52] [INFO ] Deduced a trap composed of 148 places in 599 ms of which 6 ms to minimize.
[2024-05-24 17:29:53] [INFO ] Deduced a trap composed of 95 places in 595 ms of which 10 ms to minimize.
[2024-05-24 17:29:54] [INFO ] Deduced a trap composed of 86 places in 601 ms of which 7 ms to minimize.
[2024-05-24 17:29:54] [INFO ] Deduced a trap composed of 107 places in 589 ms of which 6 ms to minimize.
[2024-05-24 17:29:55] [INFO ] Deduced a trap composed of 139 places in 617 ms of which 7 ms to minimize.
[2024-05-24 17:29:56] [INFO ] Deduced a trap composed of 206 places in 591 ms of which 6 ms to minimize.
[2024-05-24 17:29:56] [INFO ] Deduced a trap composed of 63 places in 570 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1036 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:29:57] [INFO ] Deduced a trap composed of 125 places in 560 ms of which 7 ms to minimize.
[2024-05-24 17:29:57] [INFO ] Deduced a trap composed of 199 places in 571 ms of which 6 ms to minimize.
[2024-05-24 17:29:58] [INFO ] Deduced a trap composed of 139 places in 564 ms of which 6 ms to minimize.
[2024-05-24 17:29:59] [INFO ] Deduced a trap composed of 126 places in 566 ms of which 6 ms to minimize.
[2024-05-24 17:29:59] [INFO ] Deduced a trap composed of 136 places in 573 ms of which 6 ms to minimize.
[2024-05-24 17:30:00] [INFO ] Deduced a trap composed of 202 places in 559 ms of which 8 ms to minimize.
[2024-05-24 17:30:00] [INFO ] Deduced a trap composed of 86 places in 557 ms of which 6 ms to minimize.
[2024-05-24 17:30:01] [INFO ] Deduced a trap composed of 96 places in 575 ms of which 7 ms to minimize.
[2024-05-24 17:30:01] [INFO ] Deduced a trap composed of 122 places in 584 ms of which 7 ms to minimize.
[2024-05-24 17:30:02] [INFO ] Deduced a trap composed of 123 places in 596 ms of which 6 ms to minimize.
[2024-05-24 17:30:03] [INFO ] Deduced a trap composed of 160 places in 599 ms of which 7 ms to minimize.
[2024-05-24 17:30:03] [INFO ] Deduced a trap composed of 103 places in 606 ms of which 6 ms to minimize.
[2024-05-24 17:30:04] [INFO ] Deduced a trap composed of 136 places in 604 ms of which 7 ms to minimize.
[2024-05-24 17:30:05] [INFO ] Deduced a trap composed of 122 places in 581 ms of which 7 ms to minimize.
[2024-05-24 17:30:05] [INFO ] Deduced a trap composed of 142 places in 595 ms of which 6 ms to minimize.
[2024-05-24 17:30:06] [INFO ] Deduced a trap composed of 104 places in 588 ms of which 7 ms to minimize.
[2024-05-24 17:30:06] [INFO ] Deduced a trap composed of 89 places in 590 ms of which 6 ms to minimize.
[2024-05-24 17:30:07] [INFO ] Deduced a trap composed of 119 places in 583 ms of which 7 ms to minimize.
[2024-05-24 17:30:08] [INFO ] Deduced a trap composed of 131 places in 571 ms of which 6 ms to minimize.
[2024-05-24 17:30:08] [INFO ] Deduced a trap composed of 176 places in 496 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1036 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:30:09] [INFO ] Deduced a trap composed of 63 places in 523 ms of which 6 ms to minimize.
[2024-05-24 17:30:09] [INFO ] Deduced a trap composed of 83 places in 585 ms of which 7 ms to minimize.
[2024-05-24 17:30:10] [INFO ] Deduced a trap composed of 134 places in 610 ms of which 6 ms to minimize.
[2024-05-24 17:30:11] [INFO ] Deduced a trap composed of 58 places in 582 ms of which 6 ms to minimize.
[2024-05-24 17:30:11] [INFO ] Deduced a trap composed of 129 places in 590 ms of which 6 ms to minimize.
[2024-05-24 17:30:12] [INFO ] Deduced a trap composed of 146 places in 584 ms of which 6 ms to minimize.
[2024-05-24 17:30:12] [INFO ] Deduced a trap composed of 146 places in 568 ms of which 6 ms to minimize.
[2024-05-24 17:30:13] [INFO ] Deduced a trap composed of 63 places in 566 ms of which 6 ms to minimize.
[2024-05-24 17:30:14] [INFO ] Deduced a trap composed of 105 places in 599 ms of which 7 ms to minimize.
[2024-05-24 17:30:14] [INFO ] Deduced a trap composed of 150 places in 594 ms of which 7 ms to minimize.
[2024-05-24 17:30:15] [INFO ] Deduced a trap composed of 63 places in 574 ms of which 6 ms to minimize.
[2024-05-24 17:30:15] [INFO ] Deduced a trap composed of 150 places in 591 ms of which 6 ms to minimize.
[2024-05-24 17:30:16] [INFO ] Deduced a trap composed of 166 places in 574 ms of which 7 ms to minimize.
[2024-05-24 17:30:17] [INFO ] Deduced a trap composed of 163 places in 583 ms of which 6 ms to minimize.
[2024-05-24 17:30:17] [INFO ] Deduced a trap composed of 152 places in 561 ms of which 6 ms to minimize.
[2024-05-24 17:30:18] [INFO ] Deduced a trap composed of 98 places in 510 ms of which 6 ms to minimize.
[2024-05-24 17:30:18] [INFO ] Deduced a trap composed of 116 places in 592 ms of which 7 ms to minimize.
[2024-05-24 17:30:19] [INFO ] Deduced a trap composed of 132 places in 586 ms of which 6 ms to minimize.
[2024-05-24 17:30:20] [INFO ] Deduced a trap composed of 106 places in 594 ms of which 7 ms to minimize.
[2024-05-24 17:30:20] [INFO ] Deduced a trap composed of 128 places in 573 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1036 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:30:21] [INFO ] Deduced a trap composed of 47 places in 570 ms of which 6 ms to minimize.
[2024-05-24 17:30:21] [INFO ] Deduced a trap composed of 72 places in 579 ms of which 6 ms to minimize.
[2024-05-24 17:30:22] [INFO ] Deduced a trap composed of 128 places in 588 ms of which 6 ms to minimize.
[2024-05-24 17:30:23] [INFO ] Deduced a trap composed of 132 places in 569 ms of which 6 ms to minimize.
[2024-05-24 17:30:23] [INFO ] Deduced a trap composed of 174 places in 585 ms of which 6 ms to minimize.
[2024-05-24 17:30:24] [INFO ] Deduced a trap composed of 120 places in 573 ms of which 7 ms to minimize.
[2024-05-24 17:30:24] [INFO ] Deduced a trap composed of 110 places in 599 ms of which 7 ms to minimize.
[2024-05-24 17:30:25] [INFO ] Deduced a trap composed of 108 places in 553 ms of which 6 ms to minimize.
[2024-05-24 17:30:26] [INFO ] Deduced a trap composed of 76 places in 568 ms of which 6 ms to minimize.
[2024-05-24 17:30:26] [INFO ] Deduced a trap composed of 111 places in 533 ms of which 7 ms to minimize.
[2024-05-24 17:30:27] [INFO ] Deduced a trap composed of 86 places in 562 ms of which 6 ms to minimize.
[2024-05-24 17:30:27] [INFO ] Deduced a trap composed of 128 places in 568 ms of which 6 ms to minimize.
[2024-05-24 17:30:28] [INFO ] Deduced a trap composed of 276 places in 559 ms of which 6 ms to minimize.
[2024-05-24 17:30:29] [INFO ] Deduced a trap composed of 130 places in 594 ms of which 6 ms to minimize.
[2024-05-24 17:30:29] [INFO ] Deduced a trap composed of 134 places in 551 ms of which 6 ms to minimize.
[2024-05-24 17:30:30] [INFO ] Deduced a trap composed of 134 places in 585 ms of which 6 ms to minimize.
[2024-05-24 17:30:30] [INFO ] Deduced a trap composed of 135 places in 585 ms of which 6 ms to minimize.
[2024-05-24 17:30:31] [INFO ] Deduced a trap composed of 121 places in 613 ms of which 7 ms to minimize.
[2024-05-24 17:30:32] [INFO ] Deduced a trap composed of 117 places in 587 ms of which 7 ms to minimize.
[2024-05-24 17:30:32] [INFO ] Deduced a trap composed of 47 places in 582 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1036 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:30:33] [INFO ] Deduced a trap composed of 139 places in 568 ms of which 6 ms to minimize.
[2024-05-24 17:30:33] [INFO ] Deduced a trap composed of 143 places in 586 ms of which 6 ms to minimize.
[2024-05-24 17:30:34] [INFO ] Deduced a trap composed of 126 places in 590 ms of which 6 ms to minimize.
[2024-05-24 17:30:35] [INFO ] Deduced a trap composed of 99 places in 571 ms of which 6 ms to minimize.
[2024-05-24 17:30:35] [INFO ] Deduced a trap composed of 116 places in 578 ms of which 6 ms to minimize.
[2024-05-24 17:30:36] [INFO ] Deduced a trap composed of 187 places in 607 ms of which 7 ms to minimize.
[2024-05-24 17:30:36] [INFO ] Deduced a trap composed of 115 places in 572 ms of which 6 ms to minimize.
[2024-05-24 17:30:37] [INFO ] Deduced a trap composed of 135 places in 556 ms of which 6 ms to minimize.
[2024-05-24 17:30:38] [INFO ] Deduced a trap composed of 113 places in 579 ms of which 7 ms to minimize.
[2024-05-24 17:30:38] [INFO ] Deduced a trap composed of 138 places in 580 ms of which 6 ms to minimize.
[2024-05-24 17:30:39] [INFO ] Deduced a trap composed of 120 places in 601 ms of which 6 ms to minimize.
[2024-05-24 17:30:39] [INFO ] Deduced a trap composed of 242 places in 597 ms of which 6 ms to minimize.
[2024-05-24 17:30:40] [INFO ] Deduced a trap composed of 164 places in 610 ms of which 7 ms to minimize.
[2024-05-24 17:30:41] [INFO ] Deduced a trap composed of 89 places in 561 ms of which 7 ms to minimize.
[2024-05-24 17:30:41] [INFO ] Deduced a trap composed of 112 places in 589 ms of which 7 ms to minimize.
[2024-05-24 17:30:42] [INFO ] Deduced a trap composed of 63 places in 562 ms of which 7 ms to minimize.
[2024-05-24 17:30:42] [INFO ] Deduced a trap composed of 76 places in 573 ms of which 6 ms to minimize.
[2024-05-24 17:30:43] [INFO ] Deduced a trap composed of 86 places in 587 ms of which 6 ms to minimize.
[2024-05-24 17:30:44] [INFO ] Deduced a trap composed of 128 places in 585 ms of which 7 ms to minimize.
[2024-05-24 17:30:44] [INFO ] Deduced a trap composed of 99 places in 586 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1036 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:30:45] [INFO ] Deduced a trap composed of 161 places in 593 ms of which 7 ms to minimize.
[2024-05-24 17:30:46] [INFO ] Deduced a trap composed of 95 places in 571 ms of which 7 ms to minimize.
[2024-05-24 17:30:46] [INFO ] Deduced a trap composed of 144 places in 593 ms of which 6 ms to minimize.
[2024-05-24 17:30:47] [INFO ] Deduced a trap composed of 126 places in 597 ms of which 7 ms to minimize.
[2024-05-24 17:30:47] [INFO ] Deduced a trap composed of 178 places in 603 ms of which 6 ms to minimize.
[2024-05-24 17:30:48] [INFO ] Deduced a trap composed of 126 places in 591 ms of which 7 ms to minimize.
[2024-05-24 17:30:49] [INFO ] Deduced a trap composed of 110 places in 591 ms of which 6 ms to minimize.
[2024-05-24 17:30:49] [INFO ] Deduced a trap composed of 225 places in 604 ms of which 6 ms to minimize.
[2024-05-24 17:30:50] [INFO ] Deduced a trap composed of 95 places in 578 ms of which 6 ms to minimize.
[2024-05-24 17:30:51] [INFO ] Deduced a trap composed of 110 places in 599 ms of which 6 ms to minimize.
[2024-05-24 17:30:51] [INFO ] Deduced a trap composed of 115 places in 568 ms of which 6 ms to minimize.
[2024-05-24 17:30:52] [INFO ] Deduced a trap composed of 125 places in 600 ms of which 7 ms to minimize.
[2024-05-24 17:30:53] [INFO ] Deduced a trap composed of 99 places in 608 ms of which 7 ms to minimize.
[2024-05-24 17:30:53] [INFO ] Deduced a trap composed of 114 places in 605 ms of which 7 ms to minimize.
[2024-05-24 17:30:54] [INFO ] Deduced a trap composed of 144 places in 593 ms of which 6 ms to minimize.
[2024-05-24 17:30:54] [INFO ] Deduced a trap composed of 226 places in 580 ms of which 6 ms to minimize.
[2024-05-24 17:30:55] [INFO ] Deduced a trap composed of 83 places in 598 ms of which 6 ms to minimize.
[2024-05-24 17:30:56] [INFO ] Deduced a trap composed of 118 places in 591 ms of which 7 ms to minimize.
[2024-05-24 17:30:56] [INFO ] Deduced a trap composed of 105 places in 584 ms of which 7 ms to minimize.
[2024-05-24 17:30:57] [INFO ] Deduced a trap composed of 179 places in 617 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1036 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:30:57] [INFO ] Deduced a trap composed of 118 places in 575 ms of which 7 ms to minimize.
[2024-05-24 17:30:58] [INFO ] Deduced a trap composed of 197 places in 635 ms of which 7 ms to minimize.
[2024-05-24 17:30:59] [INFO ] Deduced a trap composed of 156 places in 604 ms of which 6 ms to minimize.
[2024-05-24 17:30:59] [INFO ] Deduced a trap composed of 116 places in 609 ms of which 7 ms to minimize.
[2024-05-24 17:31:00] [INFO ] Deduced a trap composed of 122 places in 594 ms of which 7 ms to minimize.
[2024-05-24 17:31:01] [INFO ] Deduced a trap composed of 76 places in 575 ms of which 7 ms to minimize.
[2024-05-24 17:31:01] [INFO ] Deduced a trap composed of 123 places in 582 ms of which 7 ms to minimize.
[2024-05-24 17:31:02] [INFO ] Deduced a trap composed of 113 places in 596 ms of which 6 ms to minimize.
[2024-05-24 17:31:02] [INFO ] Deduced a trap composed of 86 places in 591 ms of which 7 ms to minimize.
[2024-05-24 17:31:03] [INFO ] Deduced a trap composed of 76 places in 562 ms of which 6 ms to minimize.
[2024-05-24 17:31:04] [INFO ] Deduced a trap composed of 116 places in 582 ms of which 6 ms to minimize.
[2024-05-24 17:31:04] [INFO ] Deduced a trap composed of 109 places in 589 ms of which 7 ms to minimize.
[2024-05-24 17:31:05] [INFO ] Deduced a trap composed of 161 places in 598 ms of which 7 ms to minimize.
[2024-05-24 17:31:06] [INFO ] Deduced a trap composed of 108 places in 590 ms of which 6 ms to minimize.
[2024-05-24 17:31:06] [INFO ] Deduced a trap composed of 117 places in 570 ms of which 6 ms to minimize.
[2024-05-24 17:31:07] [INFO ] Deduced a trap composed of 108 places in 568 ms of which 6 ms to minimize.
[2024-05-24 17:31:07] [INFO ] Deduced a trap composed of 181 places in 587 ms of which 7 ms to minimize.
[2024-05-24 17:31:08] [INFO ] Deduced a trap composed of 137 places in 563 ms of which 6 ms to minimize.
[2024-05-24 17:31:08] [INFO ] Deduced a trap composed of 224 places in 598 ms of which 7 ms to minimize.
[2024-05-24 17:31:09] [INFO ] Deduced a trap composed of 122 places in 575 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1036 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:31:10] [INFO ] Deduced a trap composed of 121 places in 572 ms of which 6 ms to minimize.
[2024-05-24 17:31:10] [INFO ] Deduced a trap composed of 107 places in 571 ms of which 7 ms to minimize.
[2024-05-24 17:31:11] [INFO ] Deduced a trap composed of 156 places in 573 ms of which 6 ms to minimize.
[2024-05-24 17:31:11] [INFO ] Deduced a trap composed of 114 places in 587 ms of which 6 ms to minimize.
[2024-05-24 17:31:12] [INFO ] Deduced a trap composed of 117 places in 584 ms of which 6 ms to minimize.
[2024-05-24 17:31:13] [INFO ] Deduced a trap composed of 171 places in 599 ms of which 7 ms to minimize.
[2024-05-24 17:31:13] [INFO ] Deduced a trap composed of 105 places in 589 ms of which 6 ms to minimize.
[2024-05-24 17:31:14] [INFO ] Deduced a trap composed of 124 places in 594 ms of which 7 ms to minimize.
[2024-05-24 17:31:15] [INFO ] Deduced a trap composed of 137 places in 575 ms of which 7 ms to minimize.
[2024-05-24 17:31:15] [INFO ] Deduced a trap composed of 136 places in 584 ms of which 7 ms to minimize.
[2024-05-24 17:31:16] [INFO ] Deduced a trap composed of 138 places in 573 ms of which 6 ms to minimize.
[2024-05-24 17:31:16] [INFO ] Deduced a trap composed of 152 places in 574 ms of which 6 ms to minimize.
[2024-05-24 17:31:17] [INFO ] Deduced a trap composed of 118 places in 493 ms of which 6 ms to minimize.
[2024-05-24 17:31:18] [INFO ] Deduced a trap composed of 136 places in 592 ms of which 6 ms to minimize.
[2024-05-24 17:31:18] [INFO ] Deduced a trap composed of 128 places in 576 ms of which 6 ms to minimize.
[2024-05-24 17:31:19] [INFO ] Deduced a trap composed of 186 places in 569 ms of which 6 ms to minimize.
[2024-05-24 17:31:19] [INFO ] Deduced a trap composed of 136 places in 593 ms of which 6 ms to minimize.
[2024-05-24 17:31:20] [INFO ] Deduced a trap composed of 152 places in 590 ms of which 6 ms to minimize.
[2024-05-24 17:31:21] [INFO ] Deduced a trap composed of 117 places in 592 ms of which 6 ms to minimize.
[2024-05-24 17:31:21] [INFO ] Deduced a trap composed of 161 places in 580 ms of which 7 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1036 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:31:22] [INFO ] Deduced a trap composed of 126 places in 577 ms of which 7 ms to minimize.
[2024-05-24 17:31:22] [INFO ] Deduced a trap composed of 118 places in 502 ms of which 7 ms to minimize.
[2024-05-24 17:31:23] [INFO ] Deduced a trap composed of 128 places in 579 ms of which 6 ms to minimize.
[2024-05-24 17:31:24] [INFO ] Deduced a trap composed of 128 places in 587 ms of which 7 ms to minimize.
[2024-05-24 17:31:24] [INFO ] Deduced a trap composed of 91 places in 584 ms of which 6 ms to minimize.
[2024-05-24 17:31:25] [INFO ] Deduced a trap composed of 250 places in 591 ms of which 6 ms to minimize.
[2024-05-24 17:31:25] [INFO ] Deduced a trap composed of 149 places in 562 ms of which 7 ms to minimize.
[2024-05-24 17:31:26] [INFO ] Deduced a trap composed of 129 places in 580 ms of which 7 ms to minimize.
[2024-05-24 17:31:27] [INFO ] Deduced a trap composed of 109 places in 580 ms of which 6 ms to minimize.
[2024-05-24 17:31:27] [INFO ] Deduced a trap composed of 124 places in 534 ms of which 6 ms to minimize.
SMT process timed out in 106685ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 37 out of 1076 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1076/1076 places, 3697/3697 transitions.
Applied a total of 0 rules in 95 ms. Remains 1076 /1076 variables (removed 0) and now considering 3697/3697 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 1076/1076 places, 3697/3697 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1076/1076 places, 3697/3697 transitions.
Applied a total of 0 rules in 89 ms. Remains 1076 /1076 variables (removed 0) and now considering 3697/3697 (removed 0) transitions.
[2024-05-24 17:31:27] [INFO ] Flow matrix only has 3300 transitions (discarded 397 similar events)
[2024-05-24 17:31:27] [INFO ] Invariant cache hit.
[2024-05-24 17:31:29] [INFO ] Implicit Places using invariants in 1284 ms returned []
[2024-05-24 17:31:29] [INFO ] Flow matrix only has 3300 transitions (discarded 397 similar events)
[2024-05-24 17:31:29] [INFO ] Invariant cache hit.
[2024-05-24 17:31:29] [INFO ] State equation strengthened by 2063 read => feed constraints.
[2024-05-24 17:32:00] [INFO ] Performed 957/1076 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 17:32:07] [INFO ] Implicit Places using invariants and state equation in 38416 ms returned []
Implicit Place search using SMT with State Equation took 39701 ms to find 0 implicit places.
[2024-05-24 17:32:07] [INFO ] Redundant transitions in 222 ms returned []
Running 3635 sub problems to find dead transitions.
[2024-05-24 17:32:07] [INFO ] Flow matrix only has 3300 transitions (discarded 397 similar events)
[2024-05-24 17:32:07] [INFO ] Invariant cache hit.
[2024-05-24 17:32:07] [INFO ] State equation strengthened by 2063 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1074 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3635 unsolved
SMT process timed out in 50645ms, After SMT, problems are : Problem set: 0 solved, 3635 unsolved
Search for dead transitions found 0 dead transitions in 50680ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90718 ms. Remains : 1076/1076 places, 3697/3697 transitions.
[2024-05-24 17:32:58] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2024-05-24 17:32:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1076 places, 3697 transitions and 18458 arcs took 19 ms.
[2024-05-24 17:32:58] [INFO ] Flatten gal took : 284 ms
Total runtime 417568 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running MultiCrashLeafsetExtension-PT-S16C06
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1076
TRANSITIONS: 3697
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.093s, Sys 0.003s]
SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.008s, Sys 0.004s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1666
MODEL NAME: /home/mcc/execution/410/model
1076 places, 3697 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S16C06"
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 MultiCrashLeafsetExtension-PT-S16C06, 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 r245-tall-171654349000038"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C06.tgz
mv MultiCrashLeafsetExtension-PT-S16C06 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 '
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 ;