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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Apr 22 14:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Apr 12 06:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 12 06:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K 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.7M 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-S16C07-ReachabilityFireability-2024-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2023-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2023-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716575176137

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-S16C07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 18:26:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-24 18:26:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 18:26:17] [INFO ] Load time of PNML (sax parser for PT used): 417 ms
[2024-05-24 18:26:17] [INFO ] Transformed 6222 places.
[2024-05-24 18:26:17] [INFO ] Transformed 8685 transitions.
[2024-05-24 18:26:17] [INFO ] Parsed PT model containing 6222 places and 8685 transitions and 32582 arcs in 576 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (548 resets) in 2047 ms. (19 steps per ms) remains 11/16 properties
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (152 resets) in 430 ms. (92 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (152 resets) in 561 ms. (71 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (152 resets) in 346 ms. (115 steps per ms) remains 10/11 properties
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (152 resets) in 300 ms. (132 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (152 resets) in 262 ms. (152 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (152 resets) in 247 ms. (161 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (152 resets) in 237 ms. (168 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (152 resets) in 230 ms. (173 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (152 resets) in 221 ms. (180 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (152 resets) in 1596 ms. (25 steps per ms) remains 10/10 properties
[2024-05-24 18:26:20] [INFO ] Flow matrix only has 8413 transitions (discarded 272 similar events)
// Phase 1: matrix 8413 rows 6222 cols
[2024-05-24 18:26:20] [INFO ] Computed 611 invariants in 479 ms
[2024-05-24 18:26:20] [INFO ] State equation strengthened by 2450 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 704/933 variables, 33/42 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/933 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/933 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 11/944 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/944 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-13 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-14 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-15 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 3483/4427 variables, 209/266 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4427 variables, 0/266 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 1780/6207 variables, 330/596 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/6207 variables, 0/596 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 15/6222 variables, 15/611 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/6222 variables, 0/611 constraints. Problems are: Problem set: 3 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 14635/14635 variables, and 6833 constraints, problems are : Problem set: 3 solved, 7 unsolved in 5042 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 559/559 constraints, State Equation: 6222/6222 constraints, ReadFeed: 0/2450 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 732/798 variables, 23/27 constraints. Problems are: Problem set: 3 solved, 7 unsolved
[2024-05-24 18:26:26] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 18 ms to minimize.
[2024-05-24 18:26:26] [INFO ] Deduced a trap composed of 248 places in 288 ms of which 6 ms to minimize.
[2024-05-24 18:26:27] [INFO ] Deduced a trap composed of 193 places in 307 ms of which 5 ms to minimize.
[2024-05-24 18:26:27] [INFO ] Deduced a trap composed of 248 places in 282 ms of which 4 ms to minimize.
[2024-05-24 18:26:27] [INFO ] Deduced a trap composed of 262 places in 279 ms of which 5 ms to minimize.
[2024-05-24 18:26:28] [INFO ] Deduced a trap composed of 50 places in 274 ms of which 4 ms to minimize.
[2024-05-24 18:26:28] [INFO ] Deduced a trap composed of 241 places in 286 ms of which 5 ms to minimize.
[2024-05-24 18:26:28] [INFO ] Deduced a trap composed of 243 places in 291 ms of which 4 ms to minimize.
[2024-05-24 18:26:29] [INFO ] Deduced a trap composed of 251 places in 281 ms of which 5 ms to minimize.
[2024-05-24 18:26:29] [INFO ] Deduced a trap composed of 230 places in 280 ms of which 5 ms to minimize.
[2024-05-24 18:26:29] [INFO ] Deduced a trap composed of 128 places in 273 ms of which 4 ms to minimize.
[2024-05-24 18:26:30] [INFO ] Deduced a trap composed of 139 places in 280 ms of which 5 ms to minimize.
[2024-05-24 18:26:30] [INFO ] Deduced a trap composed of 177 places in 299 ms of which 4 ms to minimize.
[2024-05-24 18:26:30] [INFO ] Deduced a trap composed of 220 places in 292 ms of which 4 ms to minimize.
[2024-05-24 18:26:30] [INFO ] Deduced a trap composed of 173 places in 286 ms of which 5 ms to minimize.
[2024-05-24 18:26:31] [INFO ] Deduced a trap composed of 193 places in 277 ms of which 4 ms to minimize.
SMT process timed out in 11109ms, After SMT, problems are : Problem set: 3 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 66 out of 6222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6222/6222 places, 8685/8685 transitions.
Graph (complete) has 19247 edges and 6222 vertex of which 6188 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.27 ms
Discarding 34 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1855 transitions
Trivial Post-agglo rules discarded 1855 transitions
Performed 1855 trivial Post agglomeration. Transition count delta: 1855
Iterating post reduction 0 with 1855 rules applied. Total rules applied 1856 place count 6188 transition count 6830
Reduce places removed 1855 places and 0 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 1 with 1895 rules applied. Total rules applied 3751 place count 4333 transition count 6790
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 3791 place count 4293 transition count 6790
Performed 231 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 231 Pre rules applied. Total rules applied 3791 place count 4293 transition count 6559
Deduced a syphon composed of 231 places in 6 ms
Reduce places removed 231 places and 0 transitions.
Iterating global reduction 3 with 462 rules applied. Total rules applied 4253 place count 4062 transition count 6559
Discarding 1652 places :
Symmetric choice reduction at 3 with 1652 rule applications. Total rules 5905 place count 2410 transition count 4907
Iterating global reduction 3 with 1652 rules applied. Total rules applied 7557 place count 2410 transition count 4907
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 7557 place count 2410 transition count 4902
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 7567 place count 2405 transition count 4902
Discarding 218 places :
Symmetric choice reduction at 3 with 218 rule applications. Total rules 7785 place count 2187 transition count 3376
Iterating global reduction 3 with 218 rules applied. Total rules applied 8003 place count 2187 transition count 3376
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 5 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 8031 place count 2173 transition count 3362
Free-agglomeration rule (complex) applied 105 times.
Iterating global reduction 3 with 105 rules applied. Total rules applied 8136 place count 2173 transition count 3257
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 3 with 105 rules applied. Total rules applied 8241 place count 2068 transition count 3257
Partial Free-agglomeration rule applied 148 times.
Drop transitions (Partial Free agglomeration) removed 148 transitions
Iterating global reduction 4 with 148 rules applied. Total rules applied 8389 place count 2068 transition count 3257
Applied a total of 8389 rules in 1908 ms. Remains 2068 /6222 variables (removed 4154) and now considering 3257/8685 (removed 5428) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1927 ms. Remains : 2068/6222 places, 3257/8685 transitions.
RANDOM walk for 40000 steps (781 resets) in 607 ms. (65 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (164 resets) in 208 ms. (191 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (164 resets) in 234 ms. (170 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (164 resets) in 176 ms. (226 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (164 resets) in 174 ms. (228 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (164 resets) in 103 ms. (384 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (164 resets) in 101 ms. (392 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (164 resets) in 96 ms. (412 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 53955 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :0 out of 7
Probabilistic random walk after 53955 steps, saw 24630 distinct states, run finished after 3004 ms. (steps per millisecond=17 ) properties seen :0
[2024-05-24 18:26:36] [INFO ] Flow matrix only has 2880 transitions (discarded 377 similar events)
// Phase 1: matrix 2880 rows 2068 cols
[2024-05-24 18:26:36] [INFO ] Computed 577 invariants in 37 ms
[2024-05-24 18:26:36] [INFO ] State equation strengthened by 1142 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1256/1322 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1322 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/1324 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1324 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 631/1955 variables, 442/464 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1955 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 12/1967 variables, 12/476 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1967 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 101/2068 variables, 101/577 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2068 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 2880/4948 variables, 2068/2645 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4948 variables, 1142/3787 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4948 variables, 0/3787 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/4948 variables, 0/3787 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4948/4948 variables, and 3787 constraints, problems are : Problem set: 0 solved, 7 unsolved in 6120 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 544/544 constraints, State Equation: 2068/2068 constraints, ReadFeed: 1142/1142 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1256/1322 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 18:26:43] [INFO ] Deduced a trap composed of 511 places in 422 ms of which 6 ms to minimize.
[2024-05-24 18:26:44] [INFO ] Deduced a trap composed of 566 places in 442 ms of which 6 ms to minimize.
[2024-05-24 18:26:44] [INFO ] Deduced a trap composed of 550 places in 430 ms of which 6 ms to minimize.
[2024-05-24 18:26:45] [INFO ] Deduced a trap composed of 509 places in 449 ms of which 6 ms to minimize.
[2024-05-24 18:26:45] [INFO ] Deduced a trap composed of 623 places in 387 ms of which 5 ms to minimize.
[2024-05-24 18:26:46] [INFO ] Deduced a trap composed of 572 places in 377 ms of which 6 ms to minimize.
[2024-05-24 18:26:46] [INFO ] Deduced a trap composed of 549 places in 381 ms of which 5 ms to minimize.
[2024-05-24 18:26:46] [INFO ] Deduced a trap composed of 515 places in 383 ms of which 5 ms to minimize.
[2024-05-24 18:26:47] [INFO ] Deduced a trap composed of 274 places in 219 ms of which 3 ms to minimize.
[2024-05-24 18:26:47] [INFO ] Deduced a trap composed of 333 places in 643 ms of which 8 ms to minimize.
[2024-05-24 18:26:48] [INFO ] Deduced a trap composed of 506 places in 661 ms of which 9 ms to minimize.
[2024-05-24 18:26:49] [INFO ] Deduced a trap composed of 347 places in 698 ms of which 8 ms to minimize.
[2024-05-24 18:26:49] [INFO ] Deduced a trap composed of 541 places in 693 ms of which 9 ms to minimize.
[2024-05-24 18:26:50] [INFO ] Deduced a trap composed of 368 places in 667 ms of which 8 ms to minimize.
[2024-05-24 18:26:51] [INFO ] Deduced a trap composed of 333 places in 699 ms of which 9 ms to minimize.
[2024-05-24 18:26:51] [INFO ] Deduced a trap composed of 531 places in 431 ms of which 6 ms to minimize.
[2024-05-24 18:26:52] [INFO ] Deduced a trap composed of 501 places in 451 ms of which 6 ms to minimize.
[2024-05-24 18:26:52] [INFO ] Deduced a trap composed of 521 places in 446 ms of which 6 ms to minimize.
[2024-05-24 18:26:53] [INFO ] Deduced a trap composed of 525 places in 445 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1322 variables, 19/39 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 18:26:54] [INFO ] Deduced a trap composed of 342 places in 668 ms of which 8 ms to minimize.
[2024-05-24 18:26:54] [INFO ] Deduced a trap composed of 432 places in 670 ms of which 9 ms to minimize.
[2024-05-24 18:26:55] [INFO ] Deduced a trap composed of 441 places in 657 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1322 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1322 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 2/1324 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1324 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 631/1955 variables, 442/486 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 18:26:57] [INFO ] Deduced a trap composed of 386 places in 1254 ms of which 13 ms to minimize.
[2024-05-24 18:26:58] [INFO ] Deduced a trap composed of 335 places in 1248 ms of which 14 ms to minimize.
[2024-05-24 18:27:00] [INFO ] Deduced a trap composed of 5 places in 1264 ms of which 13 ms to minimize.
[2024-05-24 18:27:01] [INFO ] Deduced a trap composed of 298 places in 1269 ms of which 13 ms to minimize.
[2024-05-24 18:27:02] [INFO ] Deduced a trap composed of 307 places in 1274 ms of which 13 ms to minimize.
[2024-05-24 18:27:03] [INFO ] Deduced a trap composed of 384 places in 1224 ms of which 13 ms to minimize.
[2024-05-24 18:27:05] [INFO ] Deduced a trap composed of 460 places in 1217 ms of which 13 ms to minimize.
[2024-05-24 18:27:06] [INFO ] Deduced a trap composed of 347 places in 1200 ms of which 13 ms to minimize.
[2024-05-24 18:27:07] [INFO ] Deduced a trap composed of 307 places in 1207 ms of which 12 ms to minimize.
[2024-05-24 18:27:08] [INFO ] Deduced a trap composed of 458 places in 1105 ms of which 12 ms to minimize.
[2024-05-24 18:27:10] [INFO ] Deduced a trap composed of 589 places in 1212 ms of which 14 ms to minimize.
[2024-05-24 18:27:11] [INFO ] Deduced a trap composed of 446 places in 1191 ms of which 12 ms to minimize.
[2024-05-24 18:27:12] [INFO ] Deduced a trap composed of 373 places in 1219 ms of which 13 ms to minimize.
[2024-05-24 18:27:13] [INFO ] Deduced a trap composed of 371 places in 1242 ms of which 13 ms to minimize.
[2024-05-24 18:27:15] [INFO ] Deduced a trap composed of 303 places in 1244 ms of which 13 ms to minimize.
[2024-05-24 18:27:16] [INFO ] Deduced a trap composed of 367 places in 1250 ms of which 13 ms to minimize.
[2024-05-24 18:27:17] [INFO ] Deduced a trap composed of 277 places in 1259 ms of which 13 ms to minimize.
[2024-05-24 18:27:18] [INFO ] Deduced a trap composed of 394 places in 1217 ms of which 16 ms to minimize.
[2024-05-24 18:27:20] [INFO ] Deduced a trap composed of 457 places in 1227 ms of which 14 ms to minimize.
[2024-05-24 18:27:21] [INFO ] Deduced a trap composed of 224 places in 1247 ms of which 12 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1955 variables, 20/506 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 18:27:22] [INFO ] Deduced a trap composed of 392 places in 1199 ms of which 13 ms to minimize.
[2024-05-24 18:27:24] [INFO ] Deduced a trap composed of 386 places in 1261 ms of which 12 ms to minimize.
[2024-05-24 18:27:25] [INFO ] Deduced a trap composed of 255 places in 1243 ms of which 14 ms to minimize.
[2024-05-24 18:27:26] [INFO ] Deduced a trap composed of 423 places in 1240 ms of which 13 ms to minimize.
[2024-05-24 18:27:28] [INFO ] Deduced a trap composed of 425 places in 1244 ms of which 13 ms to minimize.
SMT process timed out in 51243ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 66 out of 2068 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2068/2068 places, 3257/3257 transitions.
Applied a total of 0 rules in 115 ms. Remains 2068 /2068 variables (removed 0) and now considering 3257/3257 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 2068/2068 places, 3257/3257 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2068/2068 places, 3257/3257 transitions.
Applied a total of 0 rules in 120 ms. Remains 2068 /2068 variables (removed 0) and now considering 3257/3257 (removed 0) transitions.
[2024-05-24 18:27:28] [INFO ] Flow matrix only has 2880 transitions (discarded 377 similar events)
[2024-05-24 18:27:28] [INFO ] Invariant cache hit.
[2024-05-24 18:27:30] [INFO ] Implicit Places using invariants in 2436 ms returned [4, 7, 10, 11, 12, 13, 14, 15, 16, 17, 21, 27, 36, 47, 59, 73, 88, 103, 104, 105, 106, 107, 108, 109, 110, 122, 132, 140, 146, 150, 153, 170, 176, 179, 180, 181, 184, 185, 187, 191, 195, 202, 211, 224, 236, 249, 262, 264, 265, 266, 267, 268, 269, 279, 287, 293, 297, 299, 301, 321, 327, 331, 332, 333, 334, 335, 336, 337, 339, 341, 346, 353, 361, 371, 385, 396, 397, 398, 399, 400, 401, 402, 403, 411, 417, 421, 423, 425, 427, 444, 450, 453, 454, 455, 456, 457, 458, 460, 462, 467, 470, 475, 481, 489, 499, 508, 509, 510, 511, 512, 513, 514, 515, 521, 525, 527, 529, 532, 534, 552, 559, 562, 564, 565, 567, 568, 569, 574, 578, 580, 583, 587, 593, 600, 607, 608, 609, 610, 611, 612, 613, 614, 618, 620, 622, 624, 626, 628, 646, 653, 656, 658, 659, 660, 662, 663, 667, 669, 671, 673, 675, 679, 687, 692, 693, 694, 695, 696, 697, 698, 699, 701, 703, 705, 707, 709, 711, 729, 735, 738, 739, 740, 741, 742, 743, 744, 745, 747, 749, 751, 753, 755, 757, 760, 763, 764, 765, 766, 767, 768, 770, 774, 778, 780, 782, 784, 802, 808, 811, 812, 813, 814, 815, 816, 817, 818, 820, 822, 824, 826, 828, 830, 832, 835, 836, 837, 838, 839, 840, 841, 842, 844, 846, 848, 850, 852, 854, 871, 873, 876, 879, 880, 881, 882, 883, 884, 885, 886, 888, 890, 892, 894, 896, 898, 900, 903, 904, 905, 906, 907, 908, 909, 910, 912, 915, 917, 919, 921, 923, 940, 946, 949, 950, 951, 952, 953, 954, 956, 958, 960, 962, 966, 968, 970, 972, 975, 976, 977, 978, 979, 980, 981, 982, 984, 986, 988, 990, 992, 994, 1012, 1018, 1021, 1022, 1023, 1024, 1025, 1026, 1027, 1028, 1030, 1032, 1035, 1037, 1039, 1041, 1043, 1047, 1048, 1049, 1050, 1051, 1052, 1054, 1056, 1058, 1060, 1062, 1067, 1069, 1086, 1092, 1095, 1096, 1097, 1098, 1099, 1100, 1102, 1104, 1106, 1108, 1110, 1115, 1117, 1121, 1127, 1128, 1129, 1130, 1131, 1132, 1133, 1134, 1138, 1140, 1142, 1144, 1146, 1148, 1166, 1172, 1175, 1176, 1177, 1178, 1179, 1180, 1181, 1182, 1184, 1186, 1188, 1190, 1193, 1197, 1203, 1211, 1212, 1213, 1214, 1215, 1216, 1217, 1218, 1224, 1228, 1231, 1233, 1235, 1237, 1260, 1263, 1264, 1265, 1266, 1267, 1268, 1269, 1270, 1272, 1274, 1276, 1279, 1284, 1290, 1298, 1308, 1309, 1310, 1311, 1312, 1313, 1314, 1315, 1323, 1329, 1333, 1335, 1337, 1339, 1356, 1362, 1365, 1366, 1367, 1368, 1369, 1370, 1371, 1372, 1374, 1376, 1378, 1383, 1390, 1398, 1408, 1420, 1421, 1422, 1423, 1424, 1426, 1427, 1437, 1445, 1451, 1455, 1457, 1461, 1479, 1486, 1489, 1490, 1491, 1492, 1493, 1494, 1495, 1496, 1498, 1500, 1504, 1511, 1520, 1530, 1542, 1556, 1557, 1558, 1559, 1560, 1561, 1562, 1563, 1575, 1585, 1593, 1599, 1603, 1605, 1622, 1624, 1627, 1630, 1631, 1632, 1633, 1634, 1635, 1636, 1637, 1639, 1643, 1649, 1658, 1669, 1681, 1696, 1712, 1713, 1714, 1715, 1716, 1717, 1718, 1719, 1733, 1745, 1755, 1763, 1770, 1774, 1792]
[2024-05-24 18:27:30] [INFO ] Actually due to overlaps returned [170, 321, 444, 552, 646, 729, 802, 871, 940, 1012, 1086, 1166, 1356, 1479, 1622, 1792, 4, 10, 11, 12, 13, 14, 15, 16, 103, 104, 105, 106, 107, 108, 109, 132, 179, 180, 181, 184, 185, 262, 264, 265, 266, 267, 268, 287, 331, 332, 333, 334, 335, 336, 396, 397, 398, 399, 400, 401, 402, 417, 453, 454, 455, 456, 457, 458, 508, 509, 510, 511, 512, 513, 514, 525, 562, 564, 565, 567, 568, 607, 608, 609, 610, 611, 612, 613, 620, 656, 658, 659, 660, 662, 692, 693, 694, 695, 696, 697, 698, 703, 738, 739, 740, 741, 742, 743, 744, 763, 764, 765, 766, 767, 768, 811, 812, 813, 814, 815, 816, 817, 835, 836, 837, 838, 839, 840, 841, 846, 873, 879, 880, 881, 882, 883, 884, 885, 903, 904, 905, 906, 907, 908, 909, 915, 949, 950, 951, 952, 953, 954, 975, 976, 977, 978, 979, 980, 981, 986, 1021, 1022, 1023, 1024, 1025, 1026, 1027, 1047, 1048, 1049, 1050, 1051, 1052, 1058, 1095, 1096, 1097, 1098, 1099, 1100, 1127, 1128, 1129, 1130, 1131, 1132, 1133, 1140, 1175, 1176, 1177, 1178, 1179, 1180, 1181, 1211, 1212, 1213, 1214, 1215, 1216, 1217, 1263, 1264, 1265, 1266, 1267, 1268, 1269, 1308, 1309, 1310, 1311, 1312, 1313, 1314, 1333, 1365, 1366, 1367, 1368, 1369, 1370, 1371, 1420, 1421, 1422, 1423, 1424, 1426, 1451, 1489, 1490, 1491, 1492, 1493, 1494, 1495, 1556, 1557, 1558, 1559, 1560, 1561, 1562, 1593, 1624, 1630, 1631, 1632, 1633, 1634, 1635, 1636, 1712, 1713, 1714, 1715, 1716, 1717, 1718, 1755]
Discarding 258 places :
Implicit Place search using SMT only with invariants took 2469 ms to find 258 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1810/2068 places, 3257/3257 transitions.
Discarding 210 places :
Symmetric choice reduction at 0 with 210 rule applications. Total rules 210 place count 1600 transition count 3047
Iterating global reduction 0 with 210 rules applied. Total rules applied 420 place count 1600 transition count 3047
Discarding 209 places :
Symmetric choice reduction at 0 with 209 rule applications. Total rules 629 place count 1391 transition count 2838
Iterating global reduction 0 with 209 rules applied. Total rules applied 838 place count 1391 transition count 2838
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 858 place count 1371 transition count 2698
Iterating global reduction 0 with 20 rules applied. Total rules applied 878 place count 1371 transition count 2698
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 881 place count 1371 transition count 2695
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 884 place count 1368 transition count 2695
Applied a total of 884 rules in 249 ms. Remains 1368 /1810 variables (removed 442) and now considering 2695/3257 (removed 562) transitions.
[2024-05-24 18:27:31] [INFO ] Flow matrix only has 2318 transitions (discarded 377 similar events)
// Phase 1: matrix 2318 rows 1368 cols
[2024-05-24 18:27:31] [INFO ] Computed 319 invariants in 33 ms
[2024-05-24 18:27:32] [INFO ] Implicit Places using invariants in 1277 ms returned [6, 9, 13, 19, 28, 39, 51, 65, 80, 95, 107, 124, 130, 134, 137, 158, 164, 168, 172, 179, 188, 201, 213, 226, 240, 250, 263, 267, 269, 271, 285, 289, 291, 293, 298, 305, 313, 323, 337, 347, 355, 364, 366, 368, 370, 379, 383, 385, 390, 393, 398, 404, 412, 422, 431, 437, 442, 444, 447, 449, 461, 466, 471, 475, 477, 480, 484, 490, 497, 503, 507, 510, 512, 514, 516, 528, 533, 537, 539, 541, 543, 545, 549, 557, 561, 563, 566, 568, 570, 572, 583, 585, 587, 589, 591, 593, 595, 597, 600, 604, 608, 612, 614, 616, 618, 628, 630, 632, 634, 636, 638, 640, 642, 644, 646, 648, 651, 653, 655, 657, 663, 665, 667, 669, 671, 673, 675, 677, 679, 681, 683, 687, 689, 691, 693, 700, 704, 706, 708, 710, 714, 716, 718, 720, 722, 724, 727, 729, 731, 733, 743, 745, 747, 749, 752, 754, 756, 758, 760, 765, 767, 770, 772, 777, 779, 788, 792, 794, 796, 798, 800, 805, 807, 811, 816, 820, 823, 825, 827, 829, 839, 841, 843, 845, 847, 849, 852, 856, 862, 869, 875, 879, 882, 884, 886, 888, 897, 899, 901, 903, 905, 908, 913, 919, 927, 936, 944, 950, 955, 957, 959, 967, 969, 971, 973, 975, 980, 987, 995, 1005, 1018, 1028, 1036, 1045, 1047, 1051, 1062, 1064, 1066, 1068, 1072, 1079, 1088, 1098, 1110, 1123, 1135, 1145, 1158, 1162, 1164, 1170, 1172, 1174, 1178, 1184, 1193, 1204, 1216, 1231, 1246, 1260, 1272, 1289, 1296, 1300]
Discarding 256 places :
Implicit Place search using SMT only with invariants took 1292 ms to find 256 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1112/2068 places, 2695/3257 transitions.
Applied a total of 0 rules in 67 ms. Remains 1112 /1112 variables (removed 0) and now considering 2695/2695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4199 ms. Remains : 1112/2068 places, 2695/3257 transitions.
RANDOM walk for 40000 steps (816 resets) in 465 ms. (85 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (127 resets) in 124 ms. (320 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (126 resets) in 172 ms. (231 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (128 resets) in 103 ms. (384 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (140 resets) in 90 ms. (439 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (111 resets) in 75 ms. (526 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (124 resets) in 123 ms. (322 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (112 resets) in 104 ms. (380 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 71402 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 7
Probabilistic random walk after 71402 steps, saw 30681 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
[2024-05-24 18:27:35] [INFO ] Flow matrix only has 2318 transitions (discarded 377 similar events)
// Phase 1: matrix 2318 rows 1112 cols
[2024-05-24 18:27:35] [INFO ] Computed 63 invariants in 24 ms
[2024-05-24 18:27:35] [INFO ] State equation strengthened by 1022 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 961/1027 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1027 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/1029 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1029 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 67/1096 variables, 28/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1096 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 12/1108 variables, 12/59 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1108 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 4/1112 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1112 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 2318/3430 variables, 1112/1175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3430 variables, 1022/2197 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3430 variables, 0/2197 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/3430 variables, 0/2197 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3430/3430 variables, and 2197 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3072 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 1112/1112 constraints, ReadFeed: 1022/1022 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 961/1027 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 18:27:39] [INFO ] Deduced a trap composed of 178 places in 453 ms of which 6 ms to minimize.
[2024-05-24 18:27:40] [INFO ] Deduced a trap composed of 548 places in 445 ms of which 6 ms to minimize.
[2024-05-24 18:27:40] [INFO ] Deduced a trap composed of 262 places in 444 ms of which 6 ms to minimize.
[2024-05-24 18:27:41] [INFO ] Deduced a trap composed of 185 places in 451 ms of which 6 ms to minimize.
[2024-05-24 18:27:41] [INFO ] Deduced a trap composed of 578 places in 429 ms of which 6 ms to minimize.
[2024-05-24 18:27:41] [INFO ] Deduced a trap composed of 182 places in 436 ms of which 7 ms to minimize.
[2024-05-24 18:27:42] [INFO ] Deduced a trap composed of 220 places in 432 ms of which 6 ms to minimize.
[2024-05-24 18:27:42] [INFO ] Deduced a trap composed of 181 places in 436 ms of which 6 ms to minimize.
[2024-05-24 18:27:43] [INFO ] Deduced a trap composed of 161 places in 451 ms of which 6 ms to minimize.
[2024-05-24 18:27:43] [INFO ] Deduced a trap composed of 181 places in 444 ms of which 6 ms to minimize.
[2024-05-24 18:27:44] [INFO ] Deduced a trap composed of 232 places in 456 ms of which 6 ms to minimize.
[2024-05-24 18:27:44] [INFO ] Deduced a trap composed of 246 places in 446 ms of which 6 ms to minimize.
[2024-05-24 18:27:45] [INFO ] Deduced a trap composed of 238 places in 477 ms of which 6 ms to minimize.
[2024-05-24 18:27:45] [INFO ] Deduced a trap composed of 189 places in 433 ms of which 7 ms to minimize.
[2024-05-24 18:27:46] [INFO ] Deduced a trap composed of 191 places in 459 ms of which 6 ms to minimize.
[2024-05-24 18:27:46] [INFO ] Deduced a trap composed of 216 places in 440 ms of which 7 ms to minimize.
[2024-05-24 18:27:47] [INFO ] Deduced a trap composed of 171 places in 430 ms of which 6 ms to minimize.
[2024-05-24 18:27:47] [INFO ] Deduced a trap composed of 184 places in 449 ms of which 6 ms to minimize.
[2024-05-24 18:27:48] [INFO ] Deduced a trap composed of 154 places in 439 ms of which 6 ms to minimize.
[2024-05-24 18:27:48] [INFO ] Deduced a trap composed of 238 places in 462 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1027 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 18:27:48] [INFO ] Deduced a trap composed of 199 places in 452 ms of which 6 ms to minimize.
[2024-05-24 18:27:49] [INFO ] Deduced a trap composed of 215 places in 444 ms of which 7 ms to minimize.
[2024-05-24 18:27:49] [INFO ] Deduced a trap composed of 182 places in 434 ms of which 6 ms to minimize.
[2024-05-24 18:27:50] [INFO ] Deduced a trap composed of 243 places in 442 ms of which 6 ms to minimize.
[2024-05-24 18:27:50] [INFO ] Deduced a trap composed of 219 places in 452 ms of which 7 ms to minimize.
[2024-05-24 18:27:51] [INFO ] Deduced a trap composed of 266 places in 431 ms of which 6 ms to minimize.
[2024-05-24 18:27:51] [INFO ] Deduced a trap composed of 210 places in 438 ms of which 7 ms to minimize.
[2024-05-24 18:27:52] [INFO ] Deduced a trap composed of 169 places in 432 ms of which 6 ms to minimize.
[2024-05-24 18:27:52] [INFO ] Deduced a trap composed of 527 places in 391 ms of which 6 ms to minimize.
[2024-05-24 18:27:53] [INFO ] Deduced a trap composed of 226 places in 442 ms of which 6 ms to minimize.
[2024-05-24 18:27:53] [INFO ] Deduced a trap composed of 575 places in 432 ms of which 6 ms to minimize.
[2024-05-24 18:27:54] [INFO ] Deduced a trap composed of 221 places in 466 ms of which 6 ms to minimize.
[2024-05-24 18:27:54] [INFO ] Deduced a trap composed of 203 places in 456 ms of which 7 ms to minimize.
[2024-05-24 18:27:54] [INFO ] Deduced a trap composed of 547 places in 380 ms of which 6 ms to minimize.
[2024-05-24 18:27:55] [INFO ] Deduced a trap composed of 449 places in 403 ms of which 6 ms to minimize.
[2024-05-24 18:27:55] [INFO ] Deduced a trap composed of 210 places in 437 ms of which 6 ms to minimize.
[2024-05-24 18:27:56] [INFO ] Deduced a trap composed of 192 places in 443 ms of which 6 ms to minimize.
[2024-05-24 18:27:56] [INFO ] Deduced a trap composed of 198 places in 443 ms of which 7 ms to minimize.
[2024-05-24 18:27:57] [INFO ] Deduced a trap composed of 188 places in 431 ms of which 6 ms to minimize.
[2024-05-24 18:27:57] [INFO ] Deduced a trap composed of 504 places in 389 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1027 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 18:27:58] [INFO ] Deduced a trap composed of 252 places in 448 ms of which 6 ms to minimize.
[2024-05-24 18:27:58] [INFO ] Deduced a trap composed of 201 places in 456 ms of which 6 ms to minimize.
[2024-05-24 18:27:59] [INFO ] Deduced a trap composed of 223 places in 455 ms of which 7 ms to minimize.
[2024-05-24 18:27:59] [INFO ] Deduced a trap composed of 215 places in 454 ms of which 7 ms to minimize.
[2024-05-24 18:27:59] [INFO ] Deduced a trap composed of 232 places in 462 ms of which 6 ms to minimize.
[2024-05-24 18:28:00] [INFO ] Deduced a trap composed of 221 places in 459 ms of which 6 ms to minimize.
[2024-05-24 18:28:00] [INFO ] Deduced a trap composed of 553 places in 432 ms of which 6 ms to minimize.
[2024-05-24 18:28:01] [INFO ] Deduced a trap composed of 217 places in 429 ms of which 6 ms to minimize.
[2024-05-24 18:28:01] [INFO ] Deduced a trap composed of 215 places in 428 ms of which 7 ms to minimize.
[2024-05-24 18:28:02] [INFO ] Deduced a trap composed of 528 places in 441 ms of which 6 ms to minimize.
[2024-05-24 18:28:02] [INFO ] Deduced a trap composed of 476 places in 386 ms of which 6 ms to minimize.
[2024-05-24 18:28:03] [INFO ] Deduced a trap composed of 183 places in 428 ms of which 6 ms to minimize.
[2024-05-24 18:28:03] [INFO ] Deduced a trap composed of 141 places in 429 ms of which 6 ms to minimize.
[2024-05-24 18:28:04] [INFO ] Deduced a trap composed of 214 places in 432 ms of which 5 ms to minimize.
[2024-05-24 18:28:04] [INFO ] Deduced a trap composed of 274 places in 422 ms of which 6 ms to minimize.
[2024-05-24 18:28:04] [INFO ] Deduced a trap composed of 187 places in 438 ms of which 6 ms to minimize.
[2024-05-24 18:28:05] [INFO ] Deduced a trap composed of 150 places in 439 ms of which 7 ms to minimize.
[2024-05-24 18:28:05] [INFO ] Deduced a trap composed of 213 places in 430 ms of which 7 ms to minimize.
[2024-05-24 18:28:06] [INFO ] Deduced a trap composed of 261 places in 440 ms of which 6 ms to minimize.
[2024-05-24 18:28:06] [INFO ] Deduced a trap composed of 220 places in 432 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1027 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 18:28:07] [INFO ] Deduced a trap composed of 266 places in 437 ms of which 6 ms to minimize.
[2024-05-24 18:28:07] [INFO ] Deduced a trap composed of 574 places in 376 ms of which 6 ms to minimize.
[2024-05-24 18:28:08] [INFO ] Deduced a trap composed of 580 places in 391 ms of which 6 ms to minimize.
[2024-05-24 18:28:08] [INFO ] Deduced a trap composed of 504 places in 443 ms of which 6 ms to minimize.
[2024-05-24 18:28:09] [INFO ] Deduced a trap composed of 185 places in 427 ms of which 6 ms to minimize.
[2024-05-24 18:28:09] [INFO ] Deduced a trap composed of 154 places in 415 ms of which 6 ms to minimize.
[2024-05-24 18:28:09] [INFO ] Deduced a trap composed of 173 places in 432 ms of which 6 ms to minimize.
[2024-05-24 18:28:10] [INFO ] Deduced a trap composed of 234 places in 417 ms of which 6 ms to minimize.
[2024-05-24 18:28:10] [INFO ] Deduced a trap composed of 347 places in 201 ms of which 3 ms to minimize.
[2024-05-24 18:28:11] [INFO ] Deduced a trap composed of 234 places in 427 ms of which 6 ms to minimize.
[2024-05-24 18:28:11] [INFO ] Deduced a trap composed of 368 places in 451 ms of which 6 ms to minimize.
[2024-05-24 18:28:12] [INFO ] Deduced a trap composed of 230 places in 424 ms of which 5 ms to minimize.
[2024-05-24 18:28:12] [INFO ] Deduced a trap composed of 186 places in 421 ms of which 6 ms to minimize.
[2024-05-24 18:28:12] [INFO ] Deduced a trap composed of 342 places in 416 ms of which 6 ms to minimize.
[2024-05-24 18:28:13] [INFO ] Deduced a trap composed of 441 places in 406 ms of which 6 ms to minimize.
[2024-05-24 18:28:13] [INFO ] Deduced a trap composed of 674 places in 374 ms of which 6 ms to minimize.
[2024-05-24 18:28:14] [INFO ] Deduced a trap composed of 191 places in 432 ms of which 6 ms to minimize.
[2024-05-24 18:28:14] [INFO ] Deduced a trap composed of 181 places in 426 ms of which 6 ms to minimize.
[2024-05-24 18:28:15] [INFO ] Deduced a trap composed of 146 places in 451 ms of which 6 ms to minimize.
[2024-05-24 18:28:15] [INFO ] Deduced a trap composed of 614 places in 405 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1027 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 18:28:16] [INFO ] Deduced a trap composed of 206 places in 471 ms of which 7 ms to minimize.
[2024-05-24 18:28:16] [INFO ] Deduced a trap composed of 624 places in 385 ms of which 6 ms to minimize.
[2024-05-24 18:28:17] [INFO ] Deduced a trap composed of 664 places in 424 ms of which 6 ms to minimize.
[2024-05-24 18:28:17] [INFO ] Deduced a trap composed of 301 places in 446 ms of which 6 ms to minimize.
[2024-05-24 18:28:17] [INFO ] Deduced a trap composed of 197 places in 442 ms of which 6 ms to minimize.
[2024-05-24 18:28:18] [INFO ] Deduced a trap composed of 662 places in 400 ms of which 6 ms to minimize.
[2024-05-24 18:28:18] [INFO ] Deduced a trap composed of 624 places in 390 ms of which 6 ms to minimize.
[2024-05-24 18:28:19] [INFO ] Deduced a trap composed of 668 places in 396 ms of which 6 ms to minimize.
[2024-05-24 18:28:19] [INFO ] Deduced a trap composed of 205 places in 440 ms of which 6 ms to minimize.
[2024-05-24 18:28:20] [INFO ] Deduced a trap composed of 616 places in 454 ms of which 6 ms to minimize.
[2024-05-24 18:28:20] [INFO ] Deduced a trap composed of 616 places in 449 ms of which 6 ms to minimize.
[2024-05-24 18:28:21] [INFO ] Deduced a trap composed of 510 places in 463 ms of which 6 ms to minimize.
[2024-05-24 18:28:21] [INFO ] Deduced a trap composed of 262 places in 413 ms of which 6 ms to minimize.
[2024-05-24 18:28:22] [INFO ] Deduced a trap composed of 156 places in 421 ms of which 6 ms to minimize.
[2024-05-24 18:28:22] [INFO ] Deduced a trap composed of 143 places in 423 ms of which 6 ms to minimize.
[2024-05-24 18:28:23] [INFO ] Deduced a trap composed of 703 places in 429 ms of which 6 ms to minimize.
[2024-05-24 18:28:23] [INFO ] Deduced a trap composed of 160 places in 427 ms of which 6 ms to minimize.
[2024-05-24 18:28:23] [INFO ] Deduced a trap composed of 183 places in 417 ms of which 6 ms to minimize.
[2024-05-24 18:28:24] [INFO ] Deduced a trap composed of 148 places in 419 ms of which 6 ms to minimize.
[2024-05-24 18:28:24] [INFO ] Deduced a trap composed of 216 places in 424 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1027 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 18:28:25] [INFO ] Deduced a trap composed of 664 places in 432 ms of which 7 ms to minimize.
[2024-05-24 18:28:25] [INFO ] Deduced a trap composed of 186 places in 440 ms of which 6 ms to minimize.
[2024-05-24 18:28:26] [INFO ] Deduced a trap composed of 161 places in 428 ms of which 5 ms to minimize.
[2024-05-24 18:28:26] [INFO ] Deduced a trap composed of 188 places in 428 ms of which 6 ms to minimize.
[2024-05-24 18:28:27] [INFO ] Deduced a trap composed of 200 places in 430 ms of which 6 ms to minimize.
[2024-05-24 18:28:27] [INFO ] Deduced a trap composed of 237 places in 430 ms of which 6 ms to minimize.
[2024-05-24 18:28:28] [INFO ] Deduced a trap composed of 155 places in 448 ms of which 6 ms to minimize.
[2024-05-24 18:28:28] [INFO ] Deduced a trap composed of 156 places in 425 ms of which 6 ms to minimize.
[2024-05-24 18:28:29] [INFO ] Deduced a trap composed of 212 places in 433 ms of which 6 ms to minimize.
[2024-05-24 18:28:29] [INFO ] Deduced a trap composed of 651 places in 374 ms of which 6 ms to minimize.
[2024-05-24 18:28:30] [INFO ] Deduced a trap composed of 223 places in 443 ms of which 6 ms to minimize.
[2024-05-24 18:28:30] [INFO ] Deduced a trap composed of 649 places in 385 ms of which 6 ms to minimize.
[2024-05-24 18:28:30] [INFO ] Deduced a trap composed of 191 places in 423 ms of which 6 ms to minimize.
[2024-05-24 18:28:31] [INFO ] Deduced a trap composed of 144 places in 429 ms of which 7 ms to minimize.
[2024-05-24 18:28:31] [INFO ] Deduced a trap composed of 265 places in 445 ms of which 7 ms to minimize.
[2024-05-24 18:28:32] [INFO ] Deduced a trap composed of 650 places in 448 ms of which 6 ms to minimize.
[2024-05-24 18:28:32] [INFO ] Deduced a trap composed of 214 places in 448 ms of which 6 ms to minimize.
[2024-05-24 18:28:33] [INFO ] Deduced a trap composed of 628 places in 429 ms of which 6 ms to minimize.
[2024-05-24 18:28:33] [INFO ] Deduced a trap composed of 630 places in 429 ms of which 6 ms to minimize.
[2024-05-24 18:28:34] [INFO ] Deduced a trap composed of 203 places in 435 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1027 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 18:28:34] [INFO ] Deduced a trap composed of 226 places in 418 ms of which 6 ms to minimize.
[2024-05-24 18:28:35] [INFO ] Deduced a trap composed of 155 places in 431 ms of which 6 ms to minimize.
[2024-05-24 18:28:35] [INFO ] Deduced a trap composed of 155 places in 416 ms of which 6 ms to minimize.
[2024-05-24 18:28:36] [INFO ] Deduced a trap composed of 201 places in 417 ms of which 6 ms to minimize.
[2024-05-24 18:28:36] [INFO ] Deduced a trap composed of 193 places in 415 ms of which 6 ms to minimize.
[2024-05-24 18:28:37] [INFO ] Deduced a trap composed of 264 places in 425 ms of which 6 ms to minimize.
[2024-05-24 18:28:37] [INFO ] Deduced a trap composed of 181 places in 426 ms of which 6 ms to minimize.
[2024-05-24 18:28:37] [INFO ] Deduced a trap composed of 654 places in 415 ms of which 6 ms to minimize.
[2024-05-24 18:28:38] [INFO ] Deduced a trap composed of 187 places in 431 ms of which 5 ms to minimize.
[2024-05-24 18:28:38] [INFO ] Deduced a trap composed of 261 places in 434 ms of which 6 ms to minimize.
[2024-05-24 18:28:39] [INFO ] Deduced a trap composed of 654 places in 393 ms of which 6 ms to minimize.
[2024-05-24 18:28:39] [INFO ] Deduced a trap composed of 243 places in 451 ms of which 6 ms to minimize.
[2024-05-24 18:28:40] [INFO ] Deduced a trap composed of 226 places in 443 ms of which 6 ms to minimize.
[2024-05-24 18:28:40] [INFO ] Deduced a trap composed of 655 places in 392 ms of which 6 ms to minimize.
[2024-05-24 18:28:41] [INFO ] Deduced a trap composed of 199 places in 422 ms of which 6 ms to minimize.
[2024-05-24 18:28:41] [INFO ] Deduced a trap composed of 568 places in 393 ms of which 6 ms to minimize.
[2024-05-24 18:28:42] [INFO ] Deduced a trap composed of 223 places in 429 ms of which 6 ms to minimize.
[2024-05-24 18:28:42] [INFO ] Deduced a trap composed of 827 places in 383 ms of which 6 ms to minimize.
[2024-05-24 18:28:42] [INFO ] Deduced a trap composed of 197 places in 424 ms of which 6 ms to minimize.
[2024-05-24 18:28:43] [INFO ] Deduced a trap composed of 589 places in 388 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1027 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 18:28:44] [INFO ] Deduced a trap composed of 222 places in 488 ms of which 7 ms to minimize.
[2024-05-24 18:28:44] [INFO ] Deduced a trap composed of 560 places in 447 ms of which 6 ms to minimize.
[2024-05-24 18:28:45] [INFO ] Deduced a trap composed of 188 places in 485 ms of which 7 ms to minimize.
[2024-05-24 18:28:45] [INFO ] Deduced a trap composed of 822 places in 427 ms of which 6 ms to minimize.
[2024-05-24 18:28:46] [INFO ] Deduced a trap composed of 566 places in 452 ms of which 7 ms to minimize.
[2024-05-24 18:28:46] [INFO ] Deduced a trap composed of 142 places in 452 ms of which 6 ms to minimize.
[2024-05-24 18:28:47] [INFO ] Deduced a trap composed of 560 places in 406 ms of which 6 ms to minimize.
[2024-05-24 18:28:47] [INFO ] Deduced a trap composed of 591 places in 380 ms of which 6 ms to minimize.
[2024-05-24 18:28:48] [INFO ] Deduced a trap composed of 595 places in 386 ms of which 6 ms to minimize.
[2024-05-24 18:28:48] [INFO ] Deduced a trap composed of 181 places in 445 ms of which 5 ms to minimize.
[2024-05-24 18:28:49] [INFO ] Deduced a trap composed of 811 places in 387 ms of which 6 ms to minimize.
[2024-05-24 18:28:49] [INFO ] Deduced a trap composed of 698 places in 378 ms of which 6 ms to minimize.
[2024-05-24 18:28:50] [INFO ] Deduced a trap composed of 573 places in 422 ms of which 5 ms to minimize.
[2024-05-24 18:28:50] [INFO ] Deduced a trap composed of 656 places in 374 ms of which 6 ms to minimize.
[2024-05-24 18:28:51] [INFO ] Deduced a trap composed of 601 places in 380 ms of which 6 ms to minimize.
[2024-05-24 18:28:51] [INFO ] Deduced a trap composed of 657 places in 443 ms of which 5 ms to minimize.
[2024-05-24 18:28:52] [INFO ] Deduced a trap composed of 828 places in 393 ms of which 6 ms to minimize.
[2024-05-24 18:28:52] [INFO ] Deduced a trap composed of 868 places in 395 ms of which 6 ms to minimize.
[2024-05-24 18:28:52] [INFO ] Deduced a trap composed of 694 places in 390 ms of which 6 ms to minimize.
[2024-05-24 18:28:53] [INFO ] Deduced a trap composed of 699 places in 412 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1027 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 18:28:54] [INFO ] Deduced a trap composed of 541 places in 459 ms of which 7 ms to minimize.
SMT process timed out in 78584ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 66 out of 1112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1112/1112 places, 2695/2695 transitions.
Applied a total of 0 rules in 61 ms. Remains 1112 /1112 variables (removed 0) and now considering 2695/2695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 1112/1112 places, 2695/2695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1112/1112 places, 2695/2695 transitions.
Applied a total of 0 rules in 71 ms. Remains 1112 /1112 variables (removed 0) and now considering 2695/2695 (removed 0) transitions.
[2024-05-24 18:28:54] [INFO ] Flow matrix only has 2318 transitions (discarded 377 similar events)
[2024-05-24 18:28:54] [INFO ] Invariant cache hit.
[2024-05-24 18:28:55] [INFO ] Implicit Places using invariants in 826 ms returned []
[2024-05-24 18:28:55] [INFO ] Flow matrix only has 2318 transitions (discarded 377 similar events)
[2024-05-24 18:28:55] [INFO ] Invariant cache hit.
[2024-05-24 18:28:56] [INFO ] State equation strengthened by 1022 read => feed constraints.
[2024-05-24 18:29:11] [INFO ] Implicit Places using invariants and state equation in 16101 ms returned []
Implicit Place search using SMT with State Equation took 16935 ms to find 0 implicit places.
[2024-05-24 18:29:11] [INFO ] Redundant transitions in 143 ms returned []
Running 2633 sub problems to find dead transitions.
[2024-05-24 18:29:11] [INFO ] Flow matrix only has 2318 transitions (discarded 377 similar events)
[2024-05-24 18:29:11] [INFO ] Invariant cache hit.
[2024-05-24 18:29:11] [INFO ] State equation strengthened by 1022 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1110 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2633 unsolved
SMT process timed out in 33070ms, After SMT, problems are : Problem set: 0 solved, 2633 unsolved
Search for dead transitions found 0 dead transitions in 33097ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50267 ms. Remains : 1112/1112 places, 2695/2695 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 872 edges and 1112 vertex of which 14 / 1112 are part of one of the 2 SCC in 3 ms
Free SCC test removed 12 places
Drop transitions (Empty/Sink Transition effects.) removed 152 transitions
Ensure Unique test removed 436 transitions
Reduce isomorphic transitions removed 588 transitions.
Graph (complete) has 3464 edges and 1100 vertex of which 1091 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output transitions
Ensure Unique test removed 14 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 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 1076 transition count 2055
Reduce places removed 50 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 30 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 1 with 109 rules applied. Total rules applied 163 place count 1026 transition count 1996
Reduce places removed 29 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 2 with 65 rules applied. Total rules applied 228 place count 997 transition count 1960
Reduce places removed 14 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 29 rules applied. Total rules applied 257 place count 983 transition count 1945
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 7 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 4 with 19 rules applied. Total rules applied 276 place count 976 transition count 1933
Reduce places removed 5 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 5 with 15 rules applied. Total rules applied 291 place count 971 transition count 1923
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 304 place count 961 transition count 1920
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 26 Pre rules applied. Total rules applied 304 place count 961 transition count 1894
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 7 with 52 rules applied. Total rules applied 356 place count 935 transition count 1894
Discarding 156 places :
Symmetric choice reduction at 7 with 156 rule applications. Total rules 512 place count 779 transition count 1737
Iterating global reduction 7 with 156 rules applied. Total rules applied 668 place count 779 transition count 1737
Ensure Unique test removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Iterating post reduction 7 with 87 rules applied. Total rules applied 755 place count 779 transition count 1650
Performed 444 Post agglomeration using F-continuation condition.Transition count delta: 444
Deduced a syphon composed of 444 places in 0 ms
Reduce places removed 444 places and 0 transitions.
Iterating global reduction 8 with 888 rules applied. Total rules applied 1643 place count 335 transition count 1206
Drop transitions (Empty/Sink Transition effects.) removed 157 transitions
Ensure Unique test removed 139 transitions
Reduce isomorphic transitions removed 296 transitions.
Iterating post reduction 8 with 296 rules applied. Total rules applied 1939 place count 335 transition count 910
Discarding 27 places :
Symmetric choice reduction at 9 with 27 rule applications. Total rules 1966 place count 308 transition count 807
Iterating global reduction 9 with 27 rules applied. Total rules applied 1993 place count 308 transition count 807
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -134
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 9 with 20 rules applied. Total rules applied 2013 place count 298 transition count 941
Drop transitions (Redundant composition of simpler transitions.) removed 131 transitions
Redundant transition composition rules discarded 131 transitions
Iterating global reduction 9 with 131 rules applied. Total rules applied 2144 place count 298 transition count 810
Discarding 36 places :
Symmetric choice reduction at 9 with 36 rule applications. Total rules 2180 place count 262 transition count 712
Iterating global reduction 9 with 36 rules applied. Total rules applied 2216 place count 262 transition count 712
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 9 with 33 rules applied. Total rules applied 2249 place count 262 transition count 679
Free-agglomeration rule applied 3 times.
Iterating global reduction 10 with 3 rules applied. Total rules applied 2252 place count 262 transition count 676
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 2255 place count 259 transition count 676
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 11 with 15 rules applied. Total rules applied 2270 place count 259 transition count 661
Discarding 12 places :
Symmetric choice reduction at 11 with 12 rule applications. Total rules 2282 place count 247 transition count 613
Iterating global reduction 11 with 12 rules applied. Total rules applied 2294 place count 247 transition count 613
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 11 with 16 rules applied. Total rules applied 2310 place count 247 transition count 597
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 12 with 11 rules applied. Total rules applied 2321 place count 247 transition count 586
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 12 rules applied. Total rules applied 2333 place count 236 transition count 585
Partial Free-agglomeration rule applied 42 times.
Drop transitions (Partial Free agglomeration) removed 42 transitions
Iterating global reduction 13 with 42 rules applied. Total rules applied 2375 place count 236 transition count 585
Partial Post-agglomeration rule applied 53 times.
Drop transitions (Partial Post agglomeration) removed 53 transitions
Iterating global reduction 13 with 53 rules applied. Total rules applied 2428 place count 236 transition count 585
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 2430 place count 234 transition count 581
Iterating global reduction 13 with 2 rules applied. Total rules applied 2432 place count 234 transition count 581
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 2433 place count 234 transition count 580
Applied a total of 2433 rules in 686 ms. Remains 234 /1112 variables (removed 878) and now considering 580/2695 (removed 2115) transitions.
Running SMT prover for 7 properties.
[2024-05-24 18:29:45] [INFO ] Flow matrix only has 576 transitions (discarded 4 similar events)
// Phase 1: matrix 576 rows 234 cols
[2024-05-24 18:29:45] [INFO ] Computed 40 invariants in 5 ms
[2024-05-24 18:29:45] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-24 18:29:45] [INFO ] [Real]Absence check using 9 positive and 31 generalized place invariants in 9 ms returned sat
[2024-05-24 18:29:45] [INFO ] After 243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-24 18:29:45] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 18:29:45] [INFO ] [Nat]Absence check using 9 positive and 31 generalized place invariants in 6 ms returned sat
[2024-05-24 18:29:46] [INFO ] After 338ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-24 18:29:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 18:29:46] [INFO ] After 222ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :7
TRAPS : Iteration 0
[2024-05-24 18:29:46] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 2 ms to minimize.
[2024-05-24 18:29:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
TRAPS : Iteration 1
[2024-05-24 18:29:47] [INFO ] After 924ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
[2024-05-24 18:29:47] [INFO ] After 1615ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Over-approximation ignoring read arcs solved 0 properties in 2579 ms.
[2024-05-24 18:29:47] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-24 18:29:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1112 places, 2695 transitions and 12499 arcs took 19 ms.
[2024-05-24 18:29:47] [INFO ] Flatten gal took : 255 ms
Total runtime 210544 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MultiCrashLeafsetExtension-PT-S16C07

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.009s, 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: 1270
MODEL NAME: /home/mcc/execution/411/model
1112 places, 2695 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -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-S16C07"
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-S16C07, 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-171654349100047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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