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-171654349100055.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-S16C08, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654349100055
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.7M
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 06:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 12 06:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 19 15:27 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 6.3M 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-S16C08-ReachabilityFireability-2024-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-2024-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-2024-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-2023-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-2024-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-2024-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-2024-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-2024-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-2024-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-2024-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-2024-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-2024-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-2024-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-2024-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-2024-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716578792193

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 19:26:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-24 19:26:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 19:26:33] [INFO ] Load time of PNML (sax parser for PT used): 431 ms
[2024-05-24 19:26:33] [INFO ] Transformed 6876 places.
[2024-05-24 19:26:33] [INFO ] Transformed 9571 transitions.
[2024-05-24 19:26:34] [INFO ] Parsed PT model containing 6876 places and 9571 transitions and 35518 arcs in 597 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (480 resets) in 3018 ms. (13 steps per ms) remains 11/16 properties
FORMULA MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (136 resets) in 665 ms. (60 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (136 resets) in 943 ms. (42 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (136 resets) in 380 ms. (104 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (136 resets) in 271 ms. (147 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (136 resets) in 320 ms. (124 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (136 resets) in 284 ms. (140 steps per ms) remains 10/11 properties
FORMULA MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (136 resets) in 221 ms. (180 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (136 resets) in 234 ms. (170 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (136 resets) in 190 ms. (209 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (136 resets) in 183 ms. (217 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (136 resets) in 416 ms. (95 steps per ms) remains 10/10 properties
[2024-05-24 19:26:36] [INFO ] Flow matrix only has 9299 transitions (discarded 272 similar events)
// Phase 1: matrix 9299 rows 6876 cols
[2024-05-24 19:26:36] [INFO ] Computed 649 invariants in 529 ms
[2024-05-24 19:26:37] [INFO ] State equation strengthened by 2722 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 691/1008 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1008 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1008 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 6/1014 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1014 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-2024-00 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-2024-01 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-2024-02 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-2024-07 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-2024-08 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-2024-09 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-2024-13 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C08-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 3922/4936 variables, 226/291 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4936 variables, 0/291 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1940/6876 variables, 358/649 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/6876 variables, 0/649 constraints. Problems are: Problem set: 7 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 16175/16175 variables, and 7525 constraints, problems are : Problem set: 7 solved, 3 unsolved in 5051 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 595/595 constraints, State Equation: 6876/6876 constraints, ReadFeed: 0/2722 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 3/3 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 742/789 variables, 17/20 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/789 variables, 2/22 constraints. Problems are: Problem set: 7 solved, 3 unsolved
[2024-05-24 19:26:42] [INFO ] Deduced a trap composed of 50 places in 260 ms of which 20 ms to minimize.
[2024-05-24 19:26:43] [INFO ] Deduced a trap composed of 98 places in 122 ms of which 2 ms to minimize.
[2024-05-24 19:26:43] [INFO ] Deduced a trap composed of 139 places in 315 ms of which 5 ms to minimize.
[2024-05-24 19:26:43] [INFO ] Deduced a trap composed of 225 places in 304 ms of which 5 ms to minimize.
[2024-05-24 19:26:44] [INFO ] Deduced a trap composed of 173 places in 336 ms of which 5 ms to minimize.
[2024-05-24 19:26:44] [INFO ] Deduced a trap composed of 243 places in 287 ms of which 5 ms to minimize.
[2024-05-24 19:26:44] [INFO ] Deduced a trap composed of 233 places in 279 ms of which 5 ms to minimize.
[2024-05-24 19:26:45] [INFO ] Deduced a trap composed of 173 places in 291 ms of which 4 ms to minimize.
[2024-05-24 19:26:45] [INFO ] Deduced a trap composed of 181 places in 285 ms of which 4 ms to minimize.
[2024-05-24 19:26:45] [INFO ] Deduced a trap composed of 164 places in 276 ms of which 4 ms to minimize.
[2024-05-24 19:26:45] [INFO ] Deduced a trap composed of 173 places in 269 ms of which 4 ms to minimize.
[2024-05-24 19:26:46] [INFO ] Deduced a trap composed of 208 places in 306 ms of which 5 ms to minimize.
[2024-05-24 19:26:46] [INFO ] Deduced a trap composed of 173 places in 283 ms of which 5 ms to minimize.
[2024-05-24 19:26:46] [INFO ] Deduced a trap composed of 208 places in 262 ms of which 4 ms to minimize.
[2024-05-24 19:26:47] [INFO ] Deduced a trap composed of 193 places in 290 ms of which 5 ms to minimize.
[2024-05-24 19:26:47] [INFO ] Deduced a trap composed of 254 places in 283 ms of which 5 ms to minimize.
[2024-05-24 19:26:47] [INFO ] Deduced a trap composed of 164 places in 284 ms of which 4 ms to minimize.
SMT process timed out in 11298ms, After SMT, problems are : Problem set: 7 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 47 out of 6876 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6876/6876 places, 9571/9571 transitions.
Graph (complete) has 21033 edges and 6876 vertex of which 6840 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.24 ms
Discarding 36 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2121 transitions
Trivial Post-agglo rules discarded 2121 transitions
Performed 2121 trivial Post agglomeration. Transition count delta: 2121
Iterating post reduction 0 with 2121 rules applied. Total rules applied 2122 place count 6840 transition count 7450
Reduce places removed 2121 places and 0 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Iterating post reduction 1 with 2169 rules applied. Total rules applied 4291 place count 4719 transition count 7402
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 4339 place count 4671 transition count 7402
Performed 265 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 265 Pre rules applied. Total rules applied 4339 place count 4671 transition count 7137
Deduced a syphon composed of 265 places in 7 ms
Reduce places removed 265 places and 0 transitions.
Iterating global reduction 3 with 530 rules applied. Total rules applied 4869 place count 4406 transition count 7137
Discarding 1891 places :
Symmetric choice reduction at 3 with 1891 rule applications. Total rules 6760 place count 2515 transition count 5246
Iterating global reduction 3 with 1891 rules applied. Total rules applied 8651 place count 2515 transition count 5246
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 8651 place count 2515 transition count 5240
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 8663 place count 2509 transition count 5240
Discarding 223 places :
Symmetric choice reduction at 3 with 223 rule applications. Total rules 8886 place count 2286 transition count 3456
Iterating global reduction 3 with 223 rules applied. Total rules applied 9109 place count 2286 transition count 3456
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 5 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 9141 place count 2270 transition count 3440
Free-agglomeration rule (complex) applied 115 times.
Iterating global reduction 3 with 115 rules applied. Total rules applied 9256 place count 2270 transition count 3325
Reduce places removed 115 places and 0 transitions.
Iterating post reduction 3 with 115 rules applied. Total rules applied 9371 place count 2155 transition count 3325
Partial Free-agglomeration rule applied 164 times.
Drop transitions (Partial Free agglomeration) removed 164 transitions
Iterating global reduction 4 with 164 rules applied. Total rules applied 9535 place count 2155 transition count 3325
Applied a total of 9535 rules in 1991 ms. Remains 2155 /6876 variables (removed 4721) and now considering 3325/9571 (removed 6246) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2000 ms. Remains : 2155/6876 places, 3325/9571 transitions.
RANDOM walk for 40000 steps (685 resets) in 657 ms. (60 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (148 resets) in 168 ms. (236 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (148 resets) in 245 ms. (162 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (148 resets) in 228 ms. (174 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 55112 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 3
Probabilistic random walk after 55112 steps, saw 25059 distinct states, run finished after 3008 ms. (steps per millisecond=18 ) properties seen :0
[2024-05-24 19:26:53] [INFO ] Flow matrix only has 2938 transitions (discarded 387 similar events)
// Phase 1: matrix 2938 rows 2155 cols
[2024-05-24 19:26:53] [INFO ] Computed 613 invariants in 51 ms
[2024-05-24 19:26:53] [INFO ] State equation strengthened by 1161 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1372/1419 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1419 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1419 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 628/2047 variables, 492/505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2047 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 22/2069 variables, 22/527 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2069 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 86/2155 variables, 86/613 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2155 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2938/5093 variables, 2155/2768 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5093 variables, 1161/3929 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5093 variables, 0/3929 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/5093 variables, 0/3929 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5093/5093 variables, and 3929 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2516 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 580/580 constraints, State Equation: 2155/2155 constraints, ReadFeed: 1161/1161 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1372/1419 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1419 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 19:26:56] [INFO ] Deduced a trap composed of 556 places in 673 ms of which 9 ms to minimize.
[2024-05-24 19:26:57] [INFO ] Deduced a trap composed of 606 places in 700 ms of which 8 ms to minimize.
[2024-05-24 19:26:58] [INFO ] Deduced a trap composed of 591 places in 703 ms of which 9 ms to minimize.
[2024-05-24 19:26:58] [INFO ] Deduced a trap composed of 563 places in 700 ms of which 8 ms to minimize.
[2024-05-24 19:26:59] [INFO ] Deduced a trap composed of 568 places in 695 ms of which 9 ms to minimize.
[2024-05-24 19:27:00] [INFO ] Deduced a trap composed of 590 places in 686 ms of which 9 ms to minimize.
[2024-05-24 19:27:01] [INFO ] Deduced a trap composed of 555 places in 705 ms of which 8 ms to minimize.
[2024-05-24 19:27:01] [INFO ] Deduced a trap composed of 673 places in 691 ms of which 8 ms to minimize.
[2024-05-24 19:27:02] [INFO ] Deduced a trap composed of 563 places in 663 ms of which 8 ms to minimize.
[2024-05-24 19:27:03] [INFO ] Deduced a trap composed of 581 places in 676 ms of which 8 ms to minimize.
[2024-05-24 19:27:03] [INFO ] Deduced a trap composed of 563 places in 668 ms of which 8 ms to minimize.
[2024-05-24 19:27:04] [INFO ] Deduced a trap composed of 551 places in 711 ms of which 8 ms to minimize.
[2024-05-24 19:27:05] [INFO ] Deduced a trap composed of 586 places in 678 ms of which 8 ms to minimize.
[2024-05-24 19:27:06] [INFO ] Deduced a trap composed of 605 places in 798 ms of which 10 ms to minimize.
[2024-05-24 19:27:07] [INFO ] Deduced a trap composed of 330 places in 798 ms of which 9 ms to minimize.
[2024-05-24 19:27:07] [INFO ] Deduced a trap composed of 859 places in 604 ms of which 8 ms to minimize.
[2024-05-24 19:27:08] [INFO ] Deduced a trap composed of 905 places in 632 ms of which 8 ms to minimize.
[2024-05-24 19:27:09] [INFO ] Deduced a trap composed of 908 places in 630 ms of which 12 ms to minimize.
[2024-05-24 19:27:09] [INFO ] Deduced a trap composed of 942 places in 608 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1419 variables, 19/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1419 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 628/2047 variables, 492/524 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 19:27:11] [INFO ] Deduced a trap composed of 27 places in 1309 ms of which 13 ms to minimize.
[2024-05-24 19:27:12] [INFO ] Deduced a trap composed of 427 places in 1295 ms of which 13 ms to minimize.
[2024-05-24 19:27:14] [INFO ] Deduced a trap composed of 5 places in 1300 ms of which 13 ms to minimize.
[2024-05-24 19:27:15] [INFO ] Deduced a trap composed of 251 places in 1343 ms of which 14 ms to minimize.
[2024-05-24 19:27:16] [INFO ] Deduced a trap composed of 341 places in 1305 ms of which 13 ms to minimize.
[2024-05-24 19:27:18] [INFO ] Deduced a trap composed of 402 places in 1256 ms of which 13 ms to minimize.
[2024-05-24 19:27:19] [INFO ] Deduced a trap composed of 437 places in 1339 ms of which 14 ms to minimize.
[2024-05-24 19:27:20] [INFO ] Deduced a trap composed of 310 places in 1328 ms of which 14 ms to minimize.
[2024-05-24 19:27:22] [INFO ] Deduced a trap composed of 279 places in 1368 ms of which 15 ms to minimize.
[2024-05-24 19:27:23] [INFO ] Deduced a trap composed of 233 places in 1368 ms of which 15 ms to minimize.
[2024-05-24 19:27:25] [INFO ] Deduced a trap composed of 57 places in 1309 ms of which 13 ms to minimize.
[2024-05-24 19:27:26] [INFO ] Deduced a trap composed of 109 places in 1351 ms of which 14 ms to minimize.
[2024-05-24 19:27:27] [INFO ] Deduced a trap composed of 435 places in 1300 ms of which 13 ms to minimize.
[2024-05-24 19:27:29] [INFO ] Deduced a trap composed of 440 places in 1283 ms of which 14 ms to minimize.
[2024-05-24 19:27:30] [INFO ] Deduced a trap composed of 287 places in 1348 ms of which 14 ms to minimize.
[2024-05-24 19:27:31] [INFO ] Deduced a trap composed of 440 places in 1302 ms of which 13 ms to minimize.
[2024-05-24 19:27:33] [INFO ] Deduced a trap composed of 408 places in 1366 ms of which 13 ms to minimize.
[2024-05-24 19:27:34] [INFO ] Deduced a trap composed of 406 places in 1317 ms of which 14 ms to minimize.
[2024-05-24 19:27:36] [INFO ] Deduced a trap composed of 317 places in 1386 ms of which 14 ms to minimize.
[2024-05-24 19:27:37] [INFO ] Deduced a trap composed of 463 places in 1334 ms of which 33 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2047 variables, 20/544 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 19:27:38] [INFO ] Deduced a trap composed of 290 places in 1252 ms of which 13 ms to minimize.
[2024-05-24 19:27:39] [INFO ] Deduced a trap composed of 279 places in 1210 ms of which 13 ms to minimize.
[2024-05-24 19:27:41] [INFO ] Deduced a trap composed of 234 places in 1288 ms of which 13 ms to minimize.
SMT process timed out in 48107ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 47 out of 2155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2155/2155 places, 3325/3325 transitions.
Applied a total of 0 rules in 107 ms. Remains 2155 /2155 variables (removed 0) and now considering 3325/3325 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 2155/2155 places, 3325/3325 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2155/2155 places, 3325/3325 transitions.
Applied a total of 0 rules in 96 ms. Remains 2155 /2155 variables (removed 0) and now considering 3325/3325 (removed 0) transitions.
[2024-05-24 19:27:41] [INFO ] Flow matrix only has 2938 transitions (discarded 387 similar events)
[2024-05-24 19:27:41] [INFO ] Invariant cache hit.
[2024-05-24 19:27:44] [INFO ] Implicit Places using invariants in 2696 ms returned [4, 7, 10, 11, 13, 14, 15, 16, 17, 18, 22, 28, 36, 47, 59, 73, 91, 106, 107, 108, 109, 110, 111, 112, 113, 114, 126, 136, 144, 150, 154, 156, 176, 182, 185, 186, 187, 188, 189, 190, 191, 192, 193, 195, 199, 205, 214, 224, 236, 249, 262, 263, 264, 265, 266, 267, 268, 269, 270, 280, 288, 294, 298, 300, 302, 321, 327, 330, 331, 332, 333, 334, 335, 336, 337, 338, 340, 342, 346, 353, 361, 371, 382, 394, 395, 396, 397, 398, 400, 401, 409, 417, 421, 423, 425, 427, 450, 456, 459, 460, 461, 462, 463, 464, 465, 466, 467, 469, 474, 479, 485, 493, 502, 511, 512, 513, 515, 517, 518, 519, 525, 529, 531, 537, 539, 541, 561, 567, 571, 572, 573, 574, 575, 576, 577, 578, 582, 584, 586, 589, 593, 599, 606, 613, 614, 615, 616, 617, 618, 619, 620, 621, 625, 627, 629, 631, 633, 635, 662, 665, 666, 667, 668, 670, 671, 672, 673, 675, 677, 679, 681, 683, 689, 694, 699, 700, 701, 702, 703, 704, 705, 706, 707, 709, 711, 714, 716, 718, 720, 740, 746, 749, 750, 751, 752, 753, 754, 755, 756, 757, 759, 761, 763, 765, 767, 769, 772, 775, 776, 777, 778, 779, 780, 781, 783, 788, 790, 792, 794, 796, 798, 817, 823, 826, 827, 828, 829, 830, 831, 832, 833, 834, 836, 838, 840, 842, 844, 846, 848, 851, 852, 853, 854, 855, 856, 857, 858, 859, 861, 863, 865, 867, 869, 871, 890, 892, 895, 898, 899, 900, 901, 902, 903, 904, 905, 906, 908, 910, 912, 914, 916, 918, 920, 923, 924, 925, 926, 927, 928, 929, 930, 931, 933, 935, 937, 939, 941, 943, 962, 968, 971, 972, 973, 974, 975, 976, 977, 978, 979, 981, 983, 985, 987, 989, 991, 993, 996, 997, 998, 999, 1000, 1001, 1002, 1003, 1004, 1006, 1008, 1011, 1013, 1015, 1017, 1036, 1042, 1045, 1046, 1047, 1048, 1049, 1050, 1051, 1052, 1053, 1055, 1057, 1059, 1061, 1063, 1065, 1067, 1071, 1072, 1073, 1075, 1076, 1077, 1078, 1079, 1081, 1083, 1085, 1090, 1092, 1094, 1113, 1119, 1122, 1123, 1124, 1125, 1126, 1127, 1128, 1129, 1130, 1132, 1134, 1136, 1138, 1140, 1142, 1146, 1152, 1153, 1154, 1155, 1156, 1157, 1158, 1159, 1160, 1164, 1166, 1168, 1171, 1173, 1175, 1194, 1200, 1203, 1204, 1205, 1206, 1207, 1208, 1209, 1210, 1211, 1213, 1215, 1217, 1219, 1222, 1226, 1232, 1240, 1241, 1242, 1243, 1244, 1245, 1246, 1247, 1248, 1254, 1258, 1260, 1262, 1264, 1266, 1285, 1291, 1294, 1295, 1296, 1297, 1298, 1299, 1300, 1301, 1302, 1304, 1306, 1308, 1310, 1315, 1321, 1329, 1339, 1340, 1342, 1344, 1345, 1346, 1347, 1360, 1366, 1370, 1372, 1374, 1376, 1395, 1401, 1404, 1405, 1406, 1407, 1408, 1409, 1410, 1411, 1412, 1414, 1416, 1418, 1422, 1429, 1437, 1447, 1459, 1460, 1461, 1462, 1463, 1464, 1465, 1466, 1467, 1477, 1485, 1491, 1495, 1497, 1499, 1518, 1524, 1527, 1528, 1529, 1530, 1531, 1532, 1533, 1534, 1535, 1537, 1539, 1543, 1549, 1558, 1568, 1580, 1594, 1595, 1596, 1597, 1598, 1599, 1600, 1602, 1614, 1624, 1633, 1642, 1646, 1648, 1667, 1669, 1672, 1675, 1676, 1677, 1678, 1680, 1681, 1682, 1683, 1685, 1689, 1695, 1703, 1716, 1728, 1742, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1780, 1792, 1802, 1810, 1816, 1820, 1840]
[2024-05-24 19:27:44] [INFO ] Actually due to overlaps returned [176, 321, 450, 561, 740, 817, 890, 962, 1036, 1113, 1194, 1285, 1395, 1518, 1667, 1840, 4, 10, 11, 13, 14, 15, 16, 17, 28, 106, 107, 108, 109, 110, 111, 112, 113, 185, 186, 187, 188, 189, 190, 191, 192, 199, 262, 263, 264, 265, 266, 267, 268, 269, 330, 331, 332, 333, 334, 335, 336, 337, 342, 394, 395, 396, 397, 398, 400, 459, 460, 461, 462, 463, 464, 465, 466, 511, 512, 513, 515, 517, 518, 571, 572, 573, 574, 575, 576, 577, 613, 614, 615, 616, 617, 618, 619, 620, 665, 666, 667, 668, 670, 671, 672, 679, 699, 700, 701, 702, 703, 704, 705, 706, 749, 750, 751, 752, 753, 754, 755, 756, 763, 775, 776, 777, 778, 779, 780, 781, 826, 827, 828, 829, 830, 831, 832, 833, 840, 851, 852, 853, 854, 855, 856, 857, 858, 892, 898, 899, 900, 901, 902, 903, 904, 905, 912, 923, 924, 925, 926, 927, 928, 929, 930, 971, 972, 973, 974, 975, 976, 977, 978, 985, 996, 997, 998, 999, 1000, 1001, 1002, 1003, 1045, 1046, 1047, 1048, 1049, 1050, 1051, 1052, 1059, 1071, 1072, 1073, 1075, 1076, 1077, 1078, 1122, 1123, 1124, 1125, 1126, 1127, 1128, 1129, 1136, 1152, 1153, 1154, 1155, 1156, 1157, 1158, 1159, 1203, 1204, 1205, 1206, 1207, 1208, 1209, 1210, 1217, 1240, 1241, 1242, 1243, 1244, 1245, 1246, 1247, 1294, 1295, 1296, 1297, 1298, 1299, 1300, 1301, 1308, 1339, 1340, 1342, 1344, 1345, 1346, 1404, 1405, 1406, 1407, 1408, 1409, 1410, 1411, 1418, 1459, 1460, 1461, 1462, 1463, 1464, 1465, 1466, 1527, 1528, 1529, 1530, 1531, 1532, 1533, 1534, 1543, 1594, 1595, 1596, 1597, 1598, 1599, 1600, 1669, 1675, 1676, 1677, 1678, 1680, 1681, 1682, 1695, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765]
Discarding 293 places :
Implicit Place search using SMT only with invariants took 2715 ms to find 293 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1862/2155 places, 3325/3325 transitions.
Discarding 243 places :
Symmetric choice reduction at 0 with 243 rule applications. Total rules 243 place count 1619 transition count 3082
Iterating global reduction 0 with 243 rules applied. Total rules applied 486 place count 1619 transition count 3082
Discarding 242 places :
Symmetric choice reduction at 0 with 242 rule applications. Total rules 728 place count 1377 transition count 2840
Iterating global reduction 0 with 242 rules applied. Total rules applied 970 place count 1377 transition count 2840
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 991 place count 1356 transition count 2672
Iterating global reduction 0 with 21 rules applied. Total rules applied 1012 place count 1356 transition count 2672
Applied a total of 1012 rules in 184 ms. Remains 1356 /1862 variables (removed 506) and now considering 2672/3325 (removed 653) transitions.
[2024-05-24 19:27:44] [INFO ] Flow matrix only has 2285 transitions (discarded 387 similar events)
// Phase 1: matrix 2285 rows 1356 cols
[2024-05-24 19:27:44] [INFO ] Computed 320 invariants in 38 ms
[2024-05-24 19:27:45] [INFO ] Implicit Places using invariants in 1318 ms returned [6, 10, 14, 27, 38, 50, 64, 82, 97, 109, 119, 127, 133, 137, 139, 164, 167, 169, 178, 187, 197, 209, 222, 235, 245, 253, 259, 263, 265, 267, 277, 279, 281, 286, 293, 301, 311, 322, 335, 343, 351, 355, 357, 359, 361, 375, 377, 379, 384, 389, 395, 403, 412, 423, 429, 433, 435, 441, 443, 445, 456, 460, 464, 466, 468, 471, 475, 481, 488, 494, 498, 500, 502, 504, 506, 508, 520, 524, 526, 528, 531, 533, 539, 544, 548, 550, 552, 555, 557, 559, 561, 571, 573, 575, 577, 580, 582, 584, 587, 591, 596, 598, 600, 602, 604, 606, 615, 617, 619, 621, 624, 626, 628, 630, 632, 634, 636, 638, 640, 642, 644, 650, 652, 654, 656, 659, 661, 663, 665, 667, 669, 671, 673, 675, 677, 679, 687, 689, 691, 693, 696, 698, 700, 702, 704, 706, 708, 711, 713, 715, 717, 725, 727, 729, 731, 734, 736, 738, 740, 745, 747, 749, 751, 756, 758, 760, 769, 771, 773, 775, 778, 780, 782, 786, 791, 795, 797, 799, 802, 804, 806, 814, 816, 818, 820, 823, 826, 830, 836, 843, 849, 853, 855, 857, 859, 861, 869, 871, 873, 875, 878, 883, 889, 897, 909, 922, 928, 932, 934, 936, 938, 948, 950, 952, 954, 959, 966, 974, 984, 995, 1005, 1013, 1019, 1023, 1025, 1027, 1035, 1037, 1039, 1041, 1050, 1059, 1069, 1081, 1096, 1108, 1118, 1127, 1136, 1140, 1142, 1149, 1153, 1155, 1159, 1172, 1185, 1197, 1211, 1226, 1240, 1252, 1262, 1270, 1276, 1280]
Discarding 256 places :
Implicit Place search using SMT only with invariants took 1333 ms to find 256 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1100/2155 places, 2672/3325 transitions.
Applied a total of 0 rules in 63 ms. Remains 1100 /1100 variables (removed 0) and now considering 2672/2672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4392 ms. Remains : 1100/2155 places, 2672/3325 transitions.
RANDOM walk for 40000 steps (685 resets) in 452 ms. (88 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (148 resets) in 150 ms. (264 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (148 resets) in 204 ms. (195 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (148 resets) in 148 ms. (268 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 76692 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :0 out of 3
Probabilistic random walk after 76692 steps, saw 32905 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
[2024-05-24 19:27:49] [INFO ] Flow matrix only has 2285 transitions (discarded 387 similar events)
// Phase 1: matrix 2285 rows 1100 cols
[2024-05-24 19:27:49] [INFO ] Computed 64 invariants in 34 ms
[2024-05-24 19:27:49] [INFO ] State equation strengthened by 1014 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 969/1016 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1016 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 53/1069 variables, 22/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1069 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 22/1091 variables, 22/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1091 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 9/1100 variables, 9/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1100 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2285/3385 variables, 1100/1164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3385 variables, 1014/2178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3385 variables, 0/2178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/3385 variables, 0/2178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3385/3385 variables, and 2178 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1445 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 1100/1100 constraints, ReadFeed: 1014/1014 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 969/1016 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 19:27:51] [INFO ] Deduced a trap composed of 217 places in 474 ms of which 7 ms to minimize.
[2024-05-24 19:27:51] [INFO ] Deduced a trap composed of 177 places in 427 ms of which 6 ms to minimize.
[2024-05-24 19:27:52] [INFO ] Deduced a trap composed of 215 places in 467 ms of which 7 ms to minimize.
[2024-05-24 19:27:52] [INFO ] Deduced a trap composed of 170 places in 475 ms of which 6 ms to minimize.
[2024-05-24 19:27:53] [INFO ] Deduced a trap composed of 214 places in 473 ms of which 6 ms to minimize.
[2024-05-24 19:27:53] [INFO ] Deduced a trap composed of 211 places in 470 ms of which 7 ms to minimize.
[2024-05-24 19:27:54] [INFO ] Deduced a trap composed of 195 places in 463 ms of which 7 ms to minimize.
[2024-05-24 19:27:54] [INFO ] Deduced a trap composed of 195 places in 458 ms of which 6 ms to minimize.
[2024-05-24 19:27:55] [INFO ] Deduced a trap composed of 248 places in 463 ms of which 7 ms to minimize.
[2024-05-24 19:27:55] [INFO ] Deduced a trap composed of 260 places in 454 ms of which 6 ms to minimize.
[2024-05-24 19:27:56] [INFO ] Deduced a trap composed of 211 places in 462 ms of which 7 ms to minimize.
[2024-05-24 19:27:56] [INFO ] Deduced a trap composed of 315 places in 480 ms of which 6 ms to minimize.
[2024-05-24 19:27:57] [INFO ] Deduced a trap composed of 266 places in 450 ms of which 7 ms to minimize.
[2024-05-24 19:27:57] [INFO ] Deduced a trap composed of 311 places in 470 ms of which 7 ms to minimize.
[2024-05-24 19:27:58] [INFO ] Deduced a trap composed of 178 places in 459 ms of which 6 ms to minimize.
[2024-05-24 19:27:58] [INFO ] Deduced a trap composed of 199 places in 459 ms of which 7 ms to minimize.
[2024-05-24 19:27:59] [INFO ] Deduced a trap composed of 188 places in 466 ms of which 6 ms to minimize.
[2024-05-24 19:27:59] [INFO ] Deduced a trap composed of 181 places in 460 ms of which 6 ms to minimize.
[2024-05-24 19:28:00] [INFO ] Deduced a trap composed of 228 places in 465 ms of which 6 ms to minimize.
[2024-05-24 19:28:00] [INFO ] Deduced a trap composed of 182 places in 461 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1016 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1016 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 53/1069 variables, 22/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 19:28:01] [INFO ] Deduced a trap composed of 5 places in 514 ms of which 7 ms to minimize.
[2024-05-24 19:28:01] [INFO ] Deduced a trap composed of 148 places in 519 ms of which 7 ms to minimize.
[2024-05-24 19:28:02] [INFO ] Deduced a trap composed of 138 places in 538 ms of which 7 ms to minimize.
[2024-05-24 19:28:02] [INFO ] Deduced a trap composed of 137 places in 531 ms of which 7 ms to minimize.
[2024-05-24 19:28:03] [INFO ] Deduced a trap composed of 27 places in 520 ms of which 7 ms to minimize.
[2024-05-24 19:28:03] [INFO ] Deduced a trap composed of 164 places in 513 ms of which 7 ms to minimize.
[2024-05-24 19:28:04] [INFO ] Deduced a trap composed of 152 places in 541 ms of which 7 ms to minimize.
[2024-05-24 19:28:05] [INFO ] Deduced a trap composed of 168 places in 547 ms of which 7 ms to minimize.
[2024-05-24 19:28:05] [INFO ] Deduced a trap composed of 156 places in 538 ms of which 7 ms to minimize.
[2024-05-24 19:28:06] [INFO ] Deduced a trap composed of 27 places in 546 ms of which 7 ms to minimize.
[2024-05-24 19:28:06] [INFO ] Deduced a trap composed of 270 places in 537 ms of which 7 ms to minimize.
[2024-05-24 19:28:07] [INFO ] Deduced a trap composed of 152 places in 497 ms of which 7 ms to minimize.
[2024-05-24 19:28:07] [INFO ] Deduced a trap composed of 120 places in 509 ms of which 7 ms to minimize.
[2024-05-24 19:28:08] [INFO ] Deduced a trap composed of 154 places in 500 ms of which 7 ms to minimize.
[2024-05-24 19:28:08] [INFO ] Deduced a trap composed of 142 places in 543 ms of which 7 ms to minimize.
[2024-05-24 19:28:09] [INFO ] Deduced a trap composed of 160 places in 529 ms of which 7 ms to minimize.
[2024-05-24 19:28:10] [INFO ] Deduced a trap composed of 153 places in 532 ms of which 7 ms to minimize.
[2024-05-24 19:28:10] [INFO ] Deduced a trap composed of 151 places in 513 ms of which 7 ms to minimize.
[2024-05-24 19:28:11] [INFO ] Deduced a trap composed of 57 places in 499 ms of which 6 ms to minimize.
[2024-05-24 19:28:11] [INFO ] Deduced a trap composed of 167 places in 539 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1069 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 19:28:12] [INFO ] Deduced a trap composed of 159 places in 500 ms of which 6 ms to minimize.
[2024-05-24 19:28:12] [INFO ] Deduced a trap composed of 142 places in 494 ms of which 8 ms to minimize.
[2024-05-24 19:28:13] [INFO ] Deduced a trap composed of 146 places in 530 ms of which 6 ms to minimize.
[2024-05-24 19:28:13] [INFO ] Deduced a trap composed of 168 places in 489 ms of which 7 ms to minimize.
[2024-05-24 19:28:14] [INFO ] Deduced a trap composed of 219 places in 501 ms of which 7 ms to minimize.
[2024-05-24 19:28:14] [INFO ] Deduced a trap composed of 183 places in 528 ms of which 7 ms to minimize.
[2024-05-24 19:28:15] [INFO ] Deduced a trap composed of 287 places in 520 ms of which 6 ms to minimize.
[2024-05-24 19:28:15] [INFO ] Deduced a trap composed of 135 places in 476 ms of which 6 ms to minimize.
[2024-05-24 19:28:16] [INFO ] Deduced a trap composed of 157 places in 513 ms of which 7 ms to minimize.
[2024-05-24 19:28:16] [INFO ] Deduced a trap composed of 128 places in 517 ms of which 7 ms to minimize.
[2024-05-24 19:28:17] [INFO ] Deduced a trap composed of 186 places in 512 ms of which 7 ms to minimize.
[2024-05-24 19:28:18] [INFO ] Deduced a trap composed of 130 places in 520 ms of which 7 ms to minimize.
[2024-05-24 19:28:18] [INFO ] Deduced a trap composed of 161 places in 529 ms of which 7 ms to minimize.
[2024-05-24 19:28:19] [INFO ] Deduced a trap composed of 245 places in 514 ms of which 7 ms to minimize.
[2024-05-24 19:28:19] [INFO ] Deduced a trap composed of 153 places in 510 ms of which 7 ms to minimize.
[2024-05-24 19:28:20] [INFO ] Deduced a trap composed of 158 places in 527 ms of which 7 ms to minimize.
[2024-05-24 19:28:20] [INFO ] Deduced a trap composed of 152 places in 510 ms of which 7 ms to minimize.
[2024-05-24 19:28:21] [INFO ] Deduced a trap composed of 140 places in 494 ms of which 6 ms to minimize.
[2024-05-24 19:28:21] [INFO ] Deduced a trap composed of 161 places in 499 ms of which 7 ms to minimize.
[2024-05-24 19:28:22] [INFO ] Deduced a trap composed of 172 places in 500 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1069 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 19:28:22] [INFO ] Deduced a trap composed of 171 places in 495 ms of which 7 ms to minimize.
[2024-05-24 19:28:23] [INFO ] Deduced a trap composed of 170 places in 500 ms of which 7 ms to minimize.
[2024-05-24 19:28:23] [INFO ] Deduced a trap composed of 143 places in 533 ms of which 7 ms to minimize.
[2024-05-24 19:28:24] [INFO ] Deduced a trap composed of 172 places in 500 ms of which 7 ms to minimize.
[2024-05-24 19:28:25] [INFO ] Deduced a trap composed of 145 places in 538 ms of which 7 ms to minimize.
[2024-05-24 19:28:25] [INFO ] Deduced a trap composed of 227 places in 536 ms of which 7 ms to minimize.
[2024-05-24 19:28:26] [INFO ] Deduced a trap composed of 126 places in 527 ms of which 8 ms to minimize.
[2024-05-24 19:28:26] [INFO ] Deduced a trap composed of 148 places in 533 ms of which 8 ms to minimize.
[2024-05-24 19:28:27] [INFO ] Deduced a trap composed of 186 places in 580 ms of which 7 ms to minimize.
[2024-05-24 19:28:28] [INFO ] Deduced a trap composed of 200 places in 515 ms of which 6 ms to minimize.
[2024-05-24 19:28:28] [INFO ] Deduced a trap composed of 208 places in 547 ms of which 7 ms to minimize.
[2024-05-24 19:28:29] [INFO ] Deduced a trap composed of 140 places in 508 ms of which 7 ms to minimize.
[2024-05-24 19:28:29] [INFO ] Deduced a trap composed of 166 places in 513 ms of which 7 ms to minimize.
[2024-05-24 19:28:30] [INFO ] Deduced a trap composed of 126 places in 487 ms of which 7 ms to minimize.
[2024-05-24 19:28:30] [INFO ] Deduced a trap composed of 220 places in 498 ms of which 7 ms to minimize.
[2024-05-24 19:28:31] [INFO ] Deduced a trap composed of 234 places in 517 ms of which 7 ms to minimize.
[2024-05-24 19:28:32] [INFO ] Deduced a trap composed of 221 places in 515 ms of which 9 ms to minimize.
[2024-05-24 19:28:32] [INFO ] Deduced a trap composed of 154 places in 522 ms of which 8 ms to minimize.
[2024-05-24 19:28:33] [INFO ] Deduced a trap composed of 317 places in 524 ms of which 7 ms to minimize.
[2024-05-24 19:28:33] [INFO ] Deduced a trap composed of 258 places in 519 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1069 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 19:28:34] [INFO ] Deduced a trap composed of 251 places in 535 ms of which 7 ms to minimize.
[2024-05-24 19:28:34] [INFO ] Deduced a trap composed of 158 places in 521 ms of which 7 ms to minimize.
[2024-05-24 19:28:35] [INFO ] Deduced a trap composed of 292 places in 516 ms of which 7 ms to minimize.
[2024-05-24 19:28:36] [INFO ] Deduced a trap composed of 160 places in 519 ms of which 8 ms to minimize.
[2024-05-24 19:28:36] [INFO ] Deduced a trap composed of 133 places in 492 ms of which 7 ms to minimize.
[2024-05-24 19:28:37] [INFO ] Deduced a trap composed of 136 places in 518 ms of which 7 ms to minimize.
[2024-05-24 19:28:37] [INFO ] Deduced a trap composed of 159 places in 512 ms of which 7 ms to minimize.
[2024-05-24 19:28:38] [INFO ] Deduced a trap composed of 154 places in 515 ms of which 8 ms to minimize.
[2024-05-24 19:28:38] [INFO ] Deduced a trap composed of 152 places in 531 ms of which 7 ms to minimize.
[2024-05-24 19:28:39] [INFO ] Deduced a trap composed of 161 places in 519 ms of which 7 ms to minimize.
[2024-05-24 19:28:39] [INFO ] Deduced a trap composed of 128 places in 533 ms of which 7 ms to minimize.
[2024-05-24 19:28:40] [INFO ] Deduced a trap composed of 174 places in 507 ms of which 7 ms to minimize.
[2024-05-24 19:28:41] [INFO ] Deduced a trap composed of 140 places in 479 ms of which 7 ms to minimize.
[2024-05-24 19:28:41] [INFO ] Deduced a trap composed of 150 places in 548 ms of which 7 ms to minimize.
[2024-05-24 19:28:42] [INFO ] Deduced a trap composed of 283 places in 499 ms of which 6 ms to minimize.
[2024-05-24 19:28:42] [INFO ] Deduced a trap composed of 164 places in 516 ms of which 7 ms to minimize.
[2024-05-24 19:28:43] [INFO ] Deduced a trap composed of 155 places in 510 ms of which 6 ms to minimize.
[2024-05-24 19:28:43] [INFO ] Deduced a trap composed of 139 places in 520 ms of which 7 ms to minimize.
[2024-05-24 19:28:44] [INFO ] Deduced a trap composed of 155 places in 507 ms of which 7 ms to minimize.
[2024-05-24 19:28:44] [INFO ] Deduced a trap composed of 162 places in 522 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1069 variables, 20/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 19:28:46] [INFO ] Deduced a trap composed of 119 places in 514 ms of which 6 ms to minimize.
[2024-05-24 19:28:46] [INFO ] Deduced a trap composed of 138 places in 502 ms of which 7 ms to minimize.
[2024-05-24 19:28:47] [INFO ] Deduced a trap composed of 241 places in 544 ms of which 7 ms to minimize.
[2024-05-24 19:28:47] [INFO ] Deduced a trap composed of 182 places in 530 ms of which 7 ms to minimize.
[2024-05-24 19:28:48] [INFO ] Deduced a trap composed of 151 places in 520 ms of which 7 ms to minimize.
[2024-05-24 19:28:49] [INFO ] Deduced a trap composed of 160 places in 510 ms of which 7 ms to minimize.
[2024-05-24 19:28:49] [INFO ] Deduced a trap composed of 163 places in 501 ms of which 7 ms to minimize.
[2024-05-24 19:28:50] [INFO ] Deduced a trap composed of 228 places in 496 ms of which 7 ms to minimize.
[2024-05-24 19:28:50] [INFO ] Deduced a trap composed of 172 places in 509 ms of which 8 ms to minimize.
[2024-05-24 19:28:51] [INFO ] Deduced a trap composed of 157 places in 528 ms of which 6 ms to minimize.
[2024-05-24 19:28:52] [INFO ] Deduced a trap composed of 302 places in 519 ms of which 6 ms to minimize.
[2024-05-24 19:28:52] [INFO ] Deduced a trap composed of 156 places in 516 ms of which 7 ms to minimize.
[2024-05-24 19:28:53] [INFO ] Deduced a trap composed of 167 places in 498 ms of which 7 ms to minimize.
[2024-05-24 19:28:53] [INFO ] Deduced a trap composed of 175 places in 521 ms of which 6 ms to minimize.
[2024-05-24 19:28:54] [INFO ] Deduced a trap composed of 155 places in 500 ms of which 6 ms to minimize.
[2024-05-24 19:28:54] [INFO ] Deduced a trap composed of 288 places in 507 ms of which 7 ms to minimize.
[2024-05-24 19:28:55] [INFO ] Deduced a trap composed of 133 places in 499 ms of which 7 ms to minimize.
[2024-05-24 19:28:56] [INFO ] Deduced a trap composed of 159 places in 509 ms of which 7 ms to minimize.
[2024-05-24 19:28:56] [INFO ] Deduced a trap composed of 157 places in 512 ms of which 7 ms to minimize.
[2024-05-24 19:28:57] [INFO ] Deduced a trap composed of 177 places in 499 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1069 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 19:28:57] [INFO ] Deduced a trap composed of 146 places in 521 ms of which 7 ms to minimize.
[2024-05-24 19:28:58] [INFO ] Deduced a trap composed of 165 places in 503 ms of which 7 ms to minimize.
[2024-05-24 19:28:59] [INFO ] Deduced a trap composed of 213 places in 508 ms of which 7 ms to minimize.
[2024-05-24 19:28:59] [INFO ] Deduced a trap composed of 157 places in 485 ms of which 7 ms to minimize.
[2024-05-24 19:29:00] [INFO ] Deduced a trap composed of 135 places in 490 ms of which 8 ms to minimize.
[2024-05-24 19:29:00] [INFO ] Deduced a trap composed of 215 places in 505 ms of which 7 ms to minimize.
[2024-05-24 19:29:01] [INFO ] Deduced a trap composed of 152 places in 508 ms of which 7 ms to minimize.
[2024-05-24 19:29:01] [INFO ] Deduced a trap composed of 155 places in 493 ms of which 7 ms to minimize.
[2024-05-24 19:29:02] [INFO ] Deduced a trap composed of 231 places in 502 ms of which 7 ms to minimize.
[2024-05-24 19:29:03] [INFO ] Deduced a trap composed of 147 places in 500 ms of which 8 ms to minimize.
[2024-05-24 19:29:03] [INFO ] Deduced a trap composed of 152 places in 510 ms of which 7 ms to minimize.
[2024-05-24 19:29:04] [INFO ] Deduced a trap composed of 152 places in 499 ms of which 8 ms to minimize.
[2024-05-24 19:29:04] [INFO ] Deduced a trap composed of 152 places in 498 ms of which 7 ms to minimize.
[2024-05-24 19:29:05] [INFO ] Deduced a trap composed of 152 places in 469 ms of which 6 ms to minimize.
[2024-05-24 19:29:05] [INFO ] Deduced a trap composed of 143 places in 486 ms of which 7 ms to minimize.
SMT process timed out in 76766ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 47 out of 1100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1100/1100 places, 2672/2672 transitions.
Applied a total of 0 rules in 64 ms. Remains 1100 /1100 variables (removed 0) and now considering 2672/2672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 1100/1100 places, 2672/2672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1100/1100 places, 2672/2672 transitions.
Applied a total of 0 rules in 61 ms. Remains 1100 /1100 variables (removed 0) and now considering 2672/2672 (removed 0) transitions.
[2024-05-24 19:29:06] [INFO ] Flow matrix only has 2285 transitions (discarded 387 similar events)
[2024-05-24 19:29:06] [INFO ] Invariant cache hit.
[2024-05-24 19:29:06] [INFO ] Implicit Places using invariants in 876 ms returned []
[2024-05-24 19:29:06] [INFO ] Flow matrix only has 2285 transitions (discarded 387 similar events)
[2024-05-24 19:29:06] [INFO ] Invariant cache hit.
[2024-05-24 19:29:07] [INFO ] State equation strengthened by 1014 read => feed constraints.
[2024-05-24 19:29:23] [INFO ] Implicit Places using invariants and state equation in 16163 ms returned []
Implicit Place search using SMT with State Equation took 17045 ms to find 0 implicit places.
[2024-05-24 19:29:23] [INFO ] Redundant transitions in 133 ms returned []
Running 2655 sub problems to find dead transitions.
[2024-05-24 19:29:23] [INFO ] Flow matrix only has 2285 transitions (discarded 387 similar events)
[2024-05-24 19:29:23] [INFO ] Invariant cache hit.
[2024-05-24 19:29:23] [INFO ] State equation strengthened by 1014 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1098 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2655 unsolved
SMT process timed out in 33106ms, After SMT, problems are : Problem set: 0 solved, 2655 unsolved
Search for dead transitions found 0 dead transitions in 33133ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50401 ms. Remains : 1100/1100 places, 2672/2672 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 915 edges and 1100 vertex of which 16 / 1100 are part of one of the 1 SCC in 4 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 257 transitions
Ensure Unique test removed 392 transitions
Reduce isomorphic transitions removed 649 transitions.
Graph (complete) has 3237 edges and 1085 vertex of which 1074 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 0 output transitions
Ensure Unique test removed 15 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition Node6DetectsThatNode9CanReplaceNode8.Node9IsBecomingTheNewNodeMaster and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 91 rules applied. Total rules applied 93 place count 1058 transition count 1932
Reduce places removed 89 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 84 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 1 with 256 rules applied. Total rules applied 349 place count 969 transition count 1765
Reduce places removed 83 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 78 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 2 with 219 rules applied. Total rules applied 568 place count 886 transition count 1629
Reduce places removed 58 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 53 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 3 with 163 rules applied. Total rules applied 731 place count 828 transition count 1524
Reduce places removed 52 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 4 with 135 rules applied. Total rules applied 866 place count 776 transition count 1441
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 5 with 96 rules applied. Total rules applied 962 place count 740 transition count 1381
Reduce places removed 29 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 6 with 70 rules applied. Total rules applied 1032 place count 711 transition count 1340
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 7 with 41 rules applied. Total rules applied 1073 place count 694 transition count 1316
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 8 with 26 rules applied. Total rules applied 1099 place count 682 transition count 1302
Reduce places removed 5 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 9 with 19 rules applied. Total rules applied 1118 place count 677 transition count 1288
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 18 rules applied. Total rules applied 1136 place count 663 transition count 1284
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 28 Pre rules applied. Total rules applied 1136 place count 663 transition count 1256
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 11 with 56 rules applied. Total rules applied 1192 place count 635 transition count 1256
Discarding 198 places :
Symmetric choice reduction at 11 with 198 rule applications. Total rules 1390 place count 437 transition count 1053
Iterating global reduction 11 with 198 rules applied. Total rules applied 1588 place count 437 transition count 1053
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 11 with 126 rules applied. Total rules applied 1714 place count 437 transition count 927
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 1716 place count 435 transition count 917
Iterating global reduction 12 with 2 rules applied. Total rules applied 1718 place count 435 transition count 917
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1719 place count 434 transition count 916
Iterating global reduction 12 with 1 rules applied. Total rules applied 1720 place count 434 transition count 916
Performed 173 Post agglomeration using F-continuation condition.Transition count delta: 173
Deduced a syphon composed of 173 places in 1 ms
Reduce places removed 173 places and 0 transitions.
Iterating global reduction 12 with 346 rules applied. Total rules applied 2066 place count 261 transition count 743
Drop transitions (Empty/Sink Transition effects.) removed 151 transitions
Reduce isomorphic transitions removed 151 transitions.
Iterating post reduction 12 with 151 rules applied. Total rules applied 2217 place count 261 transition count 592
Discarding 34 places :
Symmetric choice reduction at 13 with 34 rule applications. Total rules 2251 place count 227 transition count 524
Iterating global reduction 13 with 34 rules applied. Total rules applied 2285 place count 227 transition count 524
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 13 with 18 rules applied. Total rules applied 2303 place count 227 transition count 506
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 14 with 16 rules applied. Total rules applied 2319 place count 219 transition count 565
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 14 with 27 rules applied. Total rules applied 2346 place count 219 transition count 538
Discarding 18 places :
Symmetric choice reduction at 14 with 18 rule applications. Total rules 2364 place count 201 transition count 464
Iterating global reduction 14 with 18 rules applied. Total rules applied 2382 place count 201 transition count 464
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 14 with 14 rules applied. Total rules applied 2396 place count 201 transition count 450
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 15 with 6 rules applied. Total rules applied 2402 place count 198 transition count 475
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 2403 place count 198 transition count 474
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 2404 place count 197 transition count 474
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 16 with 3 rules applied. Total rules applied 2407 place count 197 transition count 471
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 2410 place count 194 transition count 471
Partial Free-agglomeration rule applied 40 times.
Drop transitions (Partial Free agglomeration) removed 40 transitions
Iterating global reduction 17 with 40 rules applied. Total rules applied 2450 place count 194 transition count 471
Partial Post-agglomeration rule applied 10 times.
Drop transitions (Partial Post agglomeration) removed 10 transitions
Iterating global reduction 17 with 10 rules applied. Total rules applied 2460 place count 194 transition count 471
Applied a total of 2460 rules in 721 ms. Remains 194 /1100 variables (removed 906) and now considering 471/2672 (removed 2201) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 471 rows 194 cols
[2024-05-24 19:29:57] [INFO ] Computed 38 invariants in 8 ms
[2024-05-24 19:29:57] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-24 19:29:57] [INFO ] [Real]Absence check using 7 positive and 31 generalized place invariants in 5 ms returned sat
[2024-05-24 19:29:57] [INFO ] After 109ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
TRAPS : Iteration 0
[2024-05-24 19:29:57] [INFO ] After 137ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 19:29:57] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 19:29:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-24 19:29:57] [INFO ] [Nat]Absence check using 7 positive and 31 generalized place invariants in 5 ms returned sat
[2024-05-24 19:29:57] [INFO ] After 243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-24 19:29:57] [INFO ] After 398ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-24 19:29:57] [INFO ] After 586ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 1546 ms.
[2024-05-24 19:29:57] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-05-24 19:29:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1100 places, 2672 transitions and 12345 arcs took 41 ms.
[2024-05-24 19:29:58] [INFO ] Flatten gal took : 198 ms
Total runtime 205022 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MultiCrashLeafsetExtension-PT-S16C08

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 1228
MODEL NAME: /home/mcc/execution/412/model
1100 places, 2672 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
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 ReachabilityFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S16C08"
export BK_EXAMINATION="ReachabilityFireability"
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-S16C08, examination is ReachabilityFireability"
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-171654349100055"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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