MCC'2024- Execution of r508-tall-171654350800085

About the Execution of LTSMin+red for MultiCrashLeafsetExtension-PT-S24C05

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
11158.552	2090919.00	2279869.00	3978.90	0 1 1 1 1 1 0 ? 1 1 1 1 1 1 1 ?	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r508-tall-171654350800085.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 ltsminxred
Input is MultiCrashLeafsetExtension-PT-S24C05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654350800085
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 15K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 19 18:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 12 06:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 12 06:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K May 19 15:28 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 12M 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717202077194

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S24C05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:34:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 00:34:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:34:38] [INFO ] Load time of PNML (sax parser for PT used): 609 ms
[2024-06-01 00:34:39] [INFO ] Transformed 11106 places.
[2024-06-01 00:34:39] [INFO ] Transformed 16561 transitions.
[2024-06-01 00:34:39] [INFO ] Parsed PT model containing 11106 places and 16561 transitions and 65150 arcs in 790 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 00:34:39] [INFO ] Flow matrix only has 15961 transitions (discarded 600 similar events)
// Phase 1: matrix 15961 rows 11106 cols
[2024-06-01 00:34:40] [INFO ] Computed 975 invariants in 1037 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 25, 75, 75, 25, 75, 1, 1, 25, 75, 28, 25, 75, 25, 75, 1]
RANDOM walk for 10000 steps (193 resets) in 302 ms. (33 steps per ms)
BEST_FIRST walk for 160015 steps (576 resets) in 778 ms. (205 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0] Max Struct:[1, 25, 75, 75, 25, 75, 1, 1, 25, 75, 28, 25, 75, 25, 75, 1]
[2024-06-01 00:34:41] [INFO ] Flow matrix only has 15961 transitions (discarded 600 similar events)
[2024-06-01 00:34:41] [INFO ] Invariant cache hit.
[2024-06-01 00:34:43] [INFO ] [Real]Absence check using 64 positive place invariants in 247 ms returned sat
[2024-06-01 00:34:43] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 485 ms returned sat
[2024-06-01 00:34:46] [INFO ] [Real]Absence check using state equation in 3042 ms returned unknown
[2024-06-01 00:34:47] [INFO ] [Real]Absence check using 64 positive place invariants in 216 ms returned sat
[2024-06-01 00:34:48] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 442 ms returned sat
[2024-06-01 00:34:51] [INFO ] [Real]Absence check using state equation in 3196 ms returned unknown
[2024-06-01 00:34:52] [INFO ] [Real]Absence check using 64 positive place invariants in 210 ms returned sat
[2024-06-01 00:34:53] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 449 ms returned sat
[2024-06-01 00:34:56] [INFO ] [Real]Absence check using state equation in 3279 ms returned unknown
[2024-06-01 00:34:57] [INFO ] [Real]Absence check using 64 positive place invariants in 210 ms returned sat
[2024-06-01 00:34:58] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 363 ms returned unsat
[2024-06-01 00:34:59] [INFO ] [Real]Absence check using 64 positive place invariants in 212 ms returned sat
[2024-06-01 00:35:00] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 468 ms returned sat
[2024-06-01 00:35:03] [INFO ] [Real]Absence check using state equation in 3197 ms returned unknown
[2024-06-01 00:35:04] [INFO ] [Real]Absence check using 64 positive place invariants in 212 ms returned sat
[2024-06-01 00:35:05] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 438 ms returned unsat
[2024-06-01 00:35:06] [INFO ] [Real]Absence check using 64 positive place invariants in 215 ms returned sat
[2024-06-01 00:35:06] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 427 ms returned sat
[2024-06-01 00:35:10] [INFO ] [Real]Absence check using state equation in 3223 ms returned unknown
[2024-06-01 00:35:11] [INFO ] [Real]Absence check using 64 positive place invariants in 207 ms returned sat
[2024-06-01 00:35:11] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 445 ms returned sat
[2024-06-01 00:35:15] [INFO ] [Real]Absence check using state equation in 3220 ms returned unknown
[2024-06-01 00:35:16] [INFO ] [Real]Absence check using 64 positive place invariants in 214 ms returned sat
[2024-06-01 00:35:17] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 438 ms returned sat
[2024-06-01 00:35:20] [INFO ] [Real]Absence check using state equation in 3213 ms returned unknown
[2024-06-01 00:35:21] [INFO ] [Real]Absence check using 64 positive place invariants in 200 ms returned sat
[2024-06-01 00:35:21] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 351 ms returned unsat
[2024-06-01 00:35:23] [INFO ] [Real]Absence check using 64 positive place invariants in 206 ms returned sat
[2024-06-01 00:35:23] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 351 ms returned unsat
[2024-06-01 00:35:25] [INFO ] [Real]Absence check using 64 positive place invariants in 214 ms returned sat
[2024-06-01 00:35:25] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 459 ms returned sat
[2024-06-01 00:35:28] [INFO ] [Real]Absence check using state equation in 3181 ms returned unknown
[2024-06-01 00:35:29] [INFO ] [Real]Absence check using 64 positive place invariants in 203 ms returned sat
[2024-06-01 00:35:30] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 447 ms returned sat
[2024-06-01 00:35:33] [INFO ] [Real]Absence check using state equation in 3299 ms returned unknown
[2024-06-01 00:35:35] [INFO ] [Real]Absence check using 64 positive place invariants in 201 ms returned sat
[2024-06-01 00:35:35] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 345 ms returned unsat
[2024-06-01 00:35:36] [INFO ] [Real]Absence check using 64 positive place invariants in 201 ms returned sat
[2024-06-01 00:35:37] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 436 ms returned sat
[2024-06-01 00:35:40] [INFO ] [Real]Absence check using state equation in 3200 ms returned unknown
[2024-06-01 00:35:41] [INFO ] [Real]Absence check using 64 positive place invariants in 209 ms returned sat
[2024-06-01 00:35:42] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 459 ms returned sat
[2024-06-01 00:35:45] [INFO ] [Real]Absence check using state equation in 3306 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0] Max Struct:[1, 25, 75, 1, 25, 1, 1, 1, 25, 1, 1, 25, 75, 1, 75, 1]
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 25, 75, 25, 1, 1, 25, 25, 75, 75, 1]
Support contains 11 out of 11106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11106/11106 places, 16561/16561 transitions.
Graph (complete) has 37715 edges and 11106 vertex of which 11068 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.38 ms
Discarding 38 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2993 transitions
Trivial Post-agglo rules discarded 2993 transitions
Performed 2993 trivial Post agglomeration. Transition count delta: 2993
Iterating post reduction 0 with 2993 rules applied. Total rules applied 2994 place count 11068 transition count 13568
Reduce places removed 2993 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 2996 rules applied. Total rules applied 5990 place count 8075 transition count 13565
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 5993 place count 8072 transition count 13565
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 250 Pre rules applied. Total rules applied 5993 place count 8072 transition count 13315
Deduced a syphon composed of 250 places in 10 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 3 with 500 rules applied. Total rules applied 6493 place count 7822 transition count 13315
Discarding 2743 places :
Symmetric choice reduction at 3 with 2743 rule applications. Total rules 9236 place count 5079 transition count 10572
Iterating global reduction 3 with 2743 rules applied. Total rules applied 11979 place count 5079 transition count 10572
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 11979 place count 5079 transition count 10566
Deduced a syphon composed of 6 places in 17 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 11991 place count 5073 transition count 10566
Discarding 543 places :
Symmetric choice reduction at 3 with 543 rule applications. Total rules 12534 place count 4530 transition count 7851
Iterating global reduction 3 with 543 rules applied. Total rules applied 13077 place count 4530 transition count 7851
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 13127 place count 4505 transition count 7826
Free-agglomeration rule (complex) applied 341 times.
Iterating global reduction 3 with 341 rules applied. Total rules applied 13468 place count 4505 transition count 9657
Reduce places removed 341 places and 0 transitions.
Iterating post reduction 3 with 341 rules applied. Total rules applied 13809 place count 4164 transition count 9657
Partial Free-agglomeration rule applied 100 times.
Drop transitions (Partial Free agglomeration) removed 100 transitions
Iterating global reduction 4 with 100 rules applied. Total rules applied 13909 place count 4164 transition count 9657
Applied a total of 13909 rules in 4853 ms. Remains 4164 /11106 variables (removed 6942) and now considering 9657/16561 (removed 6904) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4877 ms. Remains : 4164/11106 places, 9657/16561 transitions.
[2024-06-01 00:35:50] [INFO ] Flow matrix only has 8773 transitions (discarded 884 similar events)
// Phase 1: matrix 8773 rows 4164 cols
[2024-06-01 00:35:50] [INFO ] Computed 937 invariants in 257 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 2, 1, 1, 1, 1, 1, 2, 2, 1]
RANDOM walk for 1000000 steps (32000 resets) in 29955 ms. (33 steps per ms)
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 8000008 steps (31216 resets) in 38689 ms. (206 steps per ms)
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 0, 0, 1, 1, 0] Max Struct:[1, 2, 1, 1, 2, 2, 1]
[2024-06-01 00:36:59] [INFO ] Flow matrix only has 8773 transitions (discarded 884 similar events)
[2024-06-01 00:36:59] [INFO ] Invariant cache hit.
[2024-06-01 00:36:59] [INFO ] [Real]Absence check using 49 positive place invariants in 94 ms returned sat
[2024-06-01 00:36:59] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 196 ms returned sat
[2024-06-01 00:37:03] [INFO ] [Real]Absence check using state equation in 3039 ms returned sat
[2024-06-01 00:37:03] [INFO ] State equation strengthened by 5002 read => feed constraints.
[2024-06-01 00:37:04] [INFO ] [Real]Added 5002 Read/Feed constraints in 919 ms returned unsat
[2024-06-01 00:37:04] [INFO ] [Real]Absence check using 49 positive place invariants in 94 ms returned sat
[2024-06-01 00:37:04] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 29 ms returned unsat
[2024-06-01 00:37:05] [INFO ] [Real]Absence check using 49 positive place invariants in 88 ms returned sat
[2024-06-01 00:37:05] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 202 ms returned sat
[2024-06-01 00:37:08] [INFO ] [Real]Absence check using state equation in 2882 ms returned sat
[2024-06-01 00:37:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:37:09] [INFO ] [Nat]Absence check using 49 positive place invariants in 88 ms returned sat
[2024-06-01 00:37:09] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 200 ms returned sat
[2024-06-01 00:37:12] [INFO ] [Nat]Absence check using state equation in 3192 ms returned sat
[2024-06-01 00:37:17] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 00:37:20] [INFO ] [Nat]Added 5002 Read/Feed constraints in 7888 ms returned unsat
[2024-06-01 00:37:21] [INFO ] [Real]Absence check using 49 positive place invariants in 84 ms returned sat
[2024-06-01 00:37:21] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 199 ms returned sat
[2024-06-01 00:37:24] [INFO ] [Real]Absence check using state equation in 3463 ms returned sat
[2024-06-01 00:37:26] [INFO ] [Real]Added 5002 Read/Feed constraints in 1156 ms returned sat
[2024-06-01 00:37:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:37:26] [INFO ] [Nat]Absence check using 49 positive place invariants in 86 ms returned sat
[2024-06-01 00:37:27] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 189 ms returned sat
[2024-06-01 00:37:30] [INFO ] [Nat]Absence check using state equation in 3745 ms returned sat
[2024-06-01 00:37:35] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 00:37:35] [INFO ] [Nat]Added 5002 Read/Feed constraints in 5035 ms returned sat
[2024-06-01 00:37:40] [INFO ] Deduced a trap composed of 513 places in 4842 ms of which 203 ms to minimize.
[2024-06-01 00:37:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 5399 ms
[2024-06-01 00:37:42] [INFO ] Computed and/alt/rep : 4626/6667/4626 causal constraints (skipped 4122 transitions) in 904 ms.
[2024-06-01 00:37:43] [INFO ] Added : 6 causal constraints over 2 iterations in 2471 ms. Result :sat
Minimization took 5571 ms.
[2024-06-01 00:37:49] [INFO ] [Real]Absence check using 49 positive place invariants in 109 ms returned sat
[2024-06-01 00:37:49] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 119 ms returned unsat
[2024-06-01 00:37:50] [INFO ] [Real]Absence check using 49 positive place invariants in 85 ms returned sat
[2024-06-01 00:37:50] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 96 ms returned unsat
[2024-06-01 00:37:50] [INFO ] [Real]Absence check using 49 positive place invariants in 83 ms returned sat
[2024-06-01 00:37:51] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 201 ms returned sat
[2024-06-01 00:37:54] [INFO ] [Real]Absence check using state equation in 3344 ms returned sat
[2024-06-01 00:37:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:37:55] [INFO ] [Nat]Absence check using 49 positive place invariants in 84 ms returned sat
[2024-06-01 00:37:55] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 185 ms returned sat
[2024-06-01 00:37:59] [INFO ] [Nat]Absence check using state equation in 3638 ms returned sat
[2024-06-01 00:38:03] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 00:38:05] [INFO ] [Nat]Added 5002 Read/Feed constraints in 6749 ms returned sat
[2024-06-01 00:38:10] [INFO ] Deduced a trap composed of 557 places in 4442 ms of which 28 ms to minimize.
[2024-06-01 00:38:15] [INFO ] Deduced a trap composed of 330 places in 4870 ms of which 32 ms to minimize.
[2024-06-01 00:38:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 10116 ms
[2024-06-01 00:38:16] [INFO ] Computed and/alt/rep : 4626/6667/4626 causal constraints (skipped 4122 transitions) in 771 ms.
[2024-06-01 00:38:18] [INFO ] Added : 9 causal constraints over 2 iterations in 2243 ms. Result :sat
Minimization took 5602 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 0, 0, 1, 1, 0] Max Struct:[0, 1, 0, 1, 1, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 4164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4164/4164 places, 9657/9657 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 4164 transition count 9653
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 4160 transition count 9653
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 4160 transition count 9648
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 4155 transition count 9648
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 25 place count 4148 transition count 9641
Iterating global reduction 3 with 7 rules applied. Total rules applied 32 place count 4148 transition count 9641
Applied a total of 32 rules in 1224 ms. Remains 4148 /4164 variables (removed 16) and now considering 9641/9657 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1224 ms. Remains : 4148/4164 places, 9641/9657 transitions.
[2024-06-01 00:38:25] [INFO ] Flow matrix only has 8756 transitions (discarded 885 similar events)
// Phase 1: matrix 8756 rows 4148 cols
[2024-06-01 00:38:25] [INFO ] Computed 937 invariants in 251 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (32012 resets) in 28323 ms. (35 steps per ms)
BEST_FIRST walk for 2000002 steps (7804 resets) in 9088 ms. (220 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-01 00:39:02] [INFO ] Flow matrix only has 8756 transitions (discarded 885 similar events)
[2024-06-01 00:39:02] [INFO ] Invariant cache hit.
[2024-06-01 00:39:03] [INFO ] [Real]Absence check using 49 positive place invariants in 76 ms returned sat
[2024-06-01 00:39:03] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 166 ms returned sat
[2024-06-01 00:39:06] [INFO ] [Real]Absence check using state equation in 2955 ms returned sat
[2024-06-01 00:39:06] [INFO ] State equation strengthened by 5002 read => feed constraints.
[2024-06-01 00:39:07] [INFO ] [Real]Added 5002 Read/Feed constraints in 827 ms returned sat
[2024-06-01 00:39:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:39:08] [INFO ] [Nat]Absence check using 49 positive place invariants in 84 ms returned sat
[2024-06-01 00:39:08] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 191 ms returned sat
[2024-06-01 00:39:11] [INFO ] [Nat]Absence check using state equation in 3061 ms returned sat
[2024-06-01 00:39:15] [INFO ] [Nat]Added 5002 Read/Feed constraints in 4401 ms returned sat
[2024-06-01 00:39:20] [INFO ] Deduced a trap composed of 575 places in 4324 ms of which 25 ms to minimize.
[2024-06-01 00:39:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 4889 ms
[2024-06-01 00:39:21] [INFO ] Computed and/alt/rep : 4612/6645/4612 causal constraints (skipped 4119 transitions) in 670 ms.
[2024-06-01 00:39:23] [INFO ] Added : 6 causal constraints over 2 iterations in 2257 ms. Result :sat
Minimization took 6877 ms.
[2024-06-01 00:39:30] [INFO ] [Real]Absence check using 49 positive place invariants in 85 ms returned sat
[2024-06-01 00:39:30] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 189 ms returned sat
[2024-06-01 00:39:34] [INFO ] [Real]Absence check using state equation in 4183 ms returned sat
[2024-06-01 00:39:35] [INFO ] [Real]Added 5002 Read/Feed constraints in 913 ms returned sat
[2024-06-01 00:39:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:39:36] [INFO ] [Nat]Absence check using 49 positive place invariants in 89 ms returned sat
[2024-06-01 00:39:36] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 199 ms returned sat
[2024-06-01 00:39:41] [INFO ] [Nat]Absence check using state equation in 4565 ms returned sat
[2024-06-01 00:39:46] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 00:39:48] [INFO ] [Nat]Added 5002 Read/Feed constraints in 7161 ms returned sat
[2024-06-01 00:39:53] [INFO ] Deduced a trap composed of 431 places in 4423 ms of which 31 ms to minimize.
[2024-06-01 00:39:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 4926 ms
[2024-06-01 00:39:53] [INFO ] Computed and/alt/rep : 4612/6645/4612 causal constraints (skipped 4119 transitions) in 579 ms.
[2024-06-01 00:39:55] [INFO ] Added : 7 causal constraints over 2 iterations in 1975 ms. Result :sat
Minimization took 10296 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 4148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4148/4148 places, 9641/9641 transitions.
Applied a total of 0 rules in 461 ms. Remains 4148 /4148 variables (removed 0) and now considering 9641/9641 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 461 ms. Remains : 4148/4148 places, 9641/9641 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4148/4148 places, 9641/9641 transitions.
Applied a total of 0 rules in 449 ms. Remains 4148 /4148 variables (removed 0) and now considering 9641/9641 (removed 0) transitions.
[2024-06-01 00:40:06] [INFO ] Flow matrix only has 8756 transitions (discarded 885 similar events)
[2024-06-01 00:40:06] [INFO ] Invariant cache hit.
[2024-06-01 00:40:18] [INFO ] Implicit Places using invariants in 11651 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 18, 24, 32, 42, 54, 68, 84, 102, 122, 144, 167, 189, 190, 191, 192, 193, 194, 214, 232, 248, 262, 274, 284, 292, 298, 302, 304, 317, 323, 325, 326, 327, 328, 329, 330, 332, 336, 342, 350, 360, 372, 386, 402, 420, 440, 461, 481, 482, 483, 484, 485, 486, 504, 520, 534, 546, 556, 564, 570, 574, 576, 578, 591, 597, 599, 600, 601, 602, 603, 604, 606, 608, 612, 618, 626, 636, 648, 662, 678, 696, 715, 733, 734, 735, 736, 737, 738, 754, 768, 780, 790, 798, 804, 808, 810, 812, 814, 827, 833, 835, 836, 837, 838, 839, 840, 842, 844, 846, 850, 856, 864, 874, 886, 900, 916, 933, 949, 950, 951, 952, 953, 954, 968, 980, 990, 998, 1004, 1008, 1010, 1012, 1014, 1016, 1029, 1035, 1037, 1038, 1039, 1040, 1041, 1042, 1044, 1046, 1048, 1050, 1054, 1060, 1068, 1078, 1090, 1104, 1119, 1133, 1134, 1135, 1136, 1137, 1138, 1150, 1160, 1168, 1174, 1178, 1180, 1182, 1184, 1186, 1188, 1201, 1207, 1209, 1210, 1211, 1212, 1213, 1214, 1216, 1218, 1220, 1222, 1224, 1228, 1234, 1242, 1252, 1264, 1277, 1289, 1290, 1291, 1292, 1293, 1294, 1304, 1312, 1318, 1322, 1324, 1326, 1328, 1330, 1332, 1334, 1347, 1353, 1355, 1356, 1357, 1358, 1359, 1360, 1362, 1364, 1366, 1368, 1370, 1372, 1376, 1382, 1390, 1400, 1411, 1421, 1422, 1423, 1424, 1425, 1426, 1434, 1440, 1444, 1446, 1448, 1450, 1452, 1454, 1456, 1458, 1471, 1477, 1479, 1480, 1481, 1482, 1483, 1484, 1486, 1488, 1490, 1492, 1494, 1496, 1498, 1502, 1508, 1516, 1525, 1533, 1534, 1535, 1536, 1537, 1538, 1544, 1548, 1550, 1552, 1554, 1556, 1558, 1560, 1562, 1564, 1577, 1583, 1585, 1586, 1587, 1588, 1589, 1590, 1592, 1594, 1596, 1598, 1600, 1602, 1604, 1606, 1610, 1616, 1623, 1629, 1630, 1631, 1632, 1633, 1634, 1638, 1640, 1642, 1644, 1646, 1648, 1650, 1652, 1654, 1656, 1669, 1675, 1677, 1678, 1679, 1680, 1681, 1682, 1684, 1686, 1688, 1690, 1692, 1694, 1696, 1698, 1700, 1704, 1709, 1713, 1714, 1715, 1716, 1717, 1718, 1720, 1722, 1724, 1726, 1728, 1730, 1732, 1734, 1736, 1738, 1751, 1757, 1759, 1760, 1761, 1762, 1763, 1764, 1766, 1768, 1770, 1772, 1774, 1776, 1778, 1780, 1782, 1784, 1787, 1789, 1790, 1791, 1792, 1793, 1794, 1796, 1798, 1800, 1802, 1804, 1806, 1808, 1810, 1812, 1814, 1827, 1833, 1835, 1836, 1837, 1838, 1839, 1840, 1842, 1844, 1846, 1848, 1850, 1852, 1854, 1856, 1858, 1860, 1862, 1864, 1865, 1866, 1867, 1868, 1869, 1871, 1873, 1875, 1877, 1879, 1881, 1883, 1885, 1887, 1889, 1902, 1904, 1907, 1909, 1910, 1911, 1912, 1913, 1914, 1916, 1918, 1920, 1922, 1924, 1926, 1928, 1930, 1932, 1934, 1936, 1938, 1939, 1940, 1941, 1942, 1943, 1945, 1947, 1949, 1951, 1953, 1955, 1957, 1959, 1961, 1963, 1976, 1982, 1984, 1985, 1986, 1987, 1988, 1989, 1991, 1993, 1995, 1997, 1999, 2001, 2003, 2005, 2007, 2009, 2011, 2013, 2014, 2015, 2016, 2017, 2018, 2020, 2022, 2024, 2026, 2028, 2030, 2032, 2034, 2036, 2038, 2051, 2057, 2059, 2060, 2061, 2062, 2063, 2064, 2066, 2068, 2070, 2072, 2074, 2076, 2078, 2080, 2082, 2084, 2086, 2089, 2090, 2091, 2092, 2093, 2094, 2096, 2098, 2100, 2102, 2104, 2106, 2108, 2110, 2112, 2114, 2127, 2133, 2135, 2136, 2137, 2138, 2139, 2140, 2142, 2144, 2146, 2148, 2150, 2152, 2154, 2156, 2158, 2160, 2164, 2169, 2170, 2171, 2172, 2173, 2174, 2178, 2180, 2182, 2184, 2186, 2188, 2190, 2192, 2194, 2196, 2209, 2215, 2217, 2218, 2219, 2220, 2221, 2222, 2224, 2226, 2228, 2230, 2232, 2234, 2236, 2238, 2240, 2244, 2250, 2257, 2258, 2259, 2260, 2261, 2262, 2268, 2272, 2274, 2276, 2278, 2280, 2282, 2284, 2286, 2288, 2301, 2307, 2309, 2310, 2311, 2312, 2313, 2314, 2316, 2318, 2320, 2322, 2324, 2326, 2328, 2330, 2334, 2340, 2348, 2357, 2358, 2359, 2360, 2361, 2362, 2370, 2376, 2380, 2382, 2384, 2386, 2388, 2390, 2392, 2394, 2407, 2413, 2415, 2416, 2417, 2418, 2419, 2420, 2422, 2424, 2426, 2428, 2430, 2432, 2434, 2438, 2444, 2452, 2462, 2473, 2474, 2475, 2476, 2477, 2478, 2488, 2496, 2502, 2506, 2508, 2510, 2512, 2514, 2516, 2518, 2531, 2537, 2539, 2540, 2541, 2542, 2543, 2544, 2546, 2548, 2550, 2552, 2554, 2556, 2560, 2566, 2574, 2584, 2596, 2609, 2610, 2611, 2612, 2613, 2614, 2626, 2636, 2644, 2650, 2654, 2656, 2658, 2660, 2662, 2664, 2677, 2683, 2685, 2686, 2687, 2688, 2689, 2690, 2692, 2694, 2696, 2698, 2700, 2704, 2710, 2718, 2728, 2740, 2754, 2769, 2770, 2771, 2772, 2773, 2774, 2788, 2800, 2810, 2818, 2824, 2828, 2830, 2832, 2834, 2836, 2849, 2855, 2857, 2858, 2859, 2860, 2861, 2862, 2864, 2866, 2868, 2870, 2874, 2880, 2888, 2898, 2910, 2924, 2940, 2957, 2958, 2959, 2960, 2961, 2962, 2978, 2992, 3004, 3014, 3022, 3028, 3032, 3034, 3036, 3038, 3051, 3057, 3059, 3060, 3061, 3062, 3063, 3064, 3066, 3068, 3070, 3074, 3080, 3088, 3098, 3110, 3125, 3141, 3159, 3178, 3179, 3180, 3181, 3182, 3183, 3201, 3217, 3231, 3243, 3253, 3261, 3267, 3271, 3273, 3275, 3288, 3294, 3296, 3297, 3298, 3299, 3300, 3301, 3303, 3305, 3309, 3315, 3323, 3333, 3345, 3359, 3375, 3393, 3413, 3434, 3435, 3436, 3437, 3438, 3439, 3459, 3477, 3493, 3507, 3519, 3529, 3537, 3543, 3547, 3549, 3562, 3564, 3567, 3569, 3570, 3571, 3572, 3573, 3574, 3576, 3580, 3586, 3594, 3604, 3616, 3630, 3646, 3664, 3684, 3706, 3729, 3730, 3731, 3732, 3733, 3734, 3756, 3776, 3794, 3810, 3824, 3836, 3846, 3854, 3860, 3864, 3877]
[2024-06-01 00:40:18] [INFO ] Actually due to overlaps returned [317, 591, 827, 1029, 1201, 1347, 1471, 1577, 1669, 1751, 1827, 1902, 1976, 2051, 2127, 2209, 2301, 2407, 2531, 2677, 2849, 3051, 3288, 3562, 3877, 4, 9, 10, 11, 12, 13, 189, 190, 191, 192, 193, 325, 326, 327, 328, 329, 481, 482, 483, 484, 485, 599, 600, 601, 602, 603, 733, 734, 735, 736, 737, 835, 836, 837, 838, 839, 949, 950, 951, 952, 953, 1037, 1038, 1039, 1040, 1041, 1133, 1134, 1135, 1136, 1137, 1209, 1210, 1211, 1212, 1213, 1289, 1290, 1291, 1292, 1293, 1355, 1356, 1357, 1358, 1359, 1421, 1422, 1423, 1424, 1425, 1479, 1480, 1481, 1482, 1483, 1533, 1534, 1535, 1536, 1537, 1585, 1586, 1587, 1588, 1589, 1629, 1630, 1631, 1632, 1633, 1677, 1678, 1679, 1680, 1681, 1713, 1714, 1715, 1716, 1717, 1759, 1760, 1761, 1762, 1763, 1789, 1790, 1791, 1792, 1793, 1835, 1836, 1837, 1838, 1839, 1864, 1865, 1866, 1867, 1868, 1904, 1909, 1910, 1911, 1912, 1913, 1938, 1939, 1940, 1941, 1942, 1984, 1985, 1986, 1987, 1988, 2013, 2014, 2015, 2016, 2017, 2059, 2060, 2061, 2062, 2063, 2089, 2090, 2091, 2092, 2093, 2135, 2136, 2137, 2138, 2139, 2169, 2170, 2171, 2172, 2173, 2217, 2218, 2219, 2220, 2221, 2257, 2258, 2259, 2260, 2261, 2309, 2310, 2311, 2312, 2313, 2357, 2358, 2359, 2360, 2361, 2415, 2416, 2417, 2418, 2419, 2473, 2474, 2475, 2476, 2477, 2539, 2540, 2541, 2542, 2543, 2609, 2610, 2611, 2612, 2613, 2685, 2686, 2687, 2688, 2689, 2769, 2770, 2771, 2772, 2773, 2857, 2858, 2859, 2860, 2861, 2957, 2958, 2959, 2960, 2961, 3059, 3060, 3061, 3062, 3063, 3178, 3179, 3180, 3181, 3182, 3296, 3297, 3298, 3299, 3300, 3434, 3435, 3436, 3437, 3438, 3564, 3569, 3570, 3571, 3572, 3573, 3729, 3730, 3731, 3732, 3733]
Discarding 278 places :
Implicit Place search using SMT only with invariants took 11677 ms to find 278 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 3870/4148 places, 9641/9641 transitions.
Discarding 240 places :
Symmetric choice reduction at 0 with 240 rule applications. Total rules 240 place count 3630 transition count 9401
Iterating global reduction 0 with 240 rules applied. Total rules applied 480 place count 3630 transition count 9401
Discarding 240 places :
Symmetric choice reduction at 0 with 240 rule applications. Total rules 720 place count 3390 transition count 9161
Iterating global reduction 0 with 240 rules applied. Total rules applied 960 place count 3390 transition count 9161
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 963 place count 3390 transition count 9158
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 966 place count 3387 transition count 9158
Applied a total of 966 rules in 1246 ms. Remains 3387 /3870 variables (removed 483) and now considering 9158/9641 (removed 483) transitions.
[2024-06-01 00:40:19] [INFO ] Flow matrix only has 8273 transitions (discarded 885 similar events)
// Phase 1: matrix 8273 rows 3387 cols
[2024-06-01 00:40:19] [INFO ] Computed 659 invariants in 164 ms
[2024-06-01 00:40:28] [INFO ] Implicit Places using invariants in 8974 ms returned [6, 8, 12, 18, 26, 36, 48, 62, 78, 96, 116, 138, 161, 183, 203, 221, 237, 251, 263, 273, 281, 287, 291, 293, 310, 312, 314, 318, 324, 332, 342, 354, 368, 384, 402, 422, 443, 463, 481, 497, 511, 523, 533, 541, 547, 551, 553, 555, 563, 565, 567, 569, 573, 579, 587, 597, 609, 623, 639, 657, 676, 694, 710, 724, 736, 746, 754, 760, 764, 766, 768, 770, 778, 780, 782, 784, 786, 790, 796, 804, 814, 826, 840, 856, 873, 889, 903, 915, 925, 933, 939, 943, 945, 947, 949, 951, 959, 961, 963, 965, 967, 969, 973, 979, 987, 997, 1009, 1023, 1038, 1052, 1064, 1074, 1082, 1088, 1092, 1094, 1096, 1098, 1100, 1102, 1110, 1112, 1114, 1116, 1118, 1120, 1122, 1126, 1132, 1140, 1150, 1162, 1175, 1187, 1197, 1205, 1211, 1215, 1217, 1219, 1221, 1223, 1225, 1227, 1235, 1237, 1239, 1241, 1243, 1245, 1247, 1249, 1253, 1259, 1267, 1277, 1288, 1298, 1306, 1312, 1316, 1318, 1320, 1322, 1324, 1326, 1328, 1330, 1338, 1340, 1342, 1344, 1346, 1348, 1350, 1352, 1354, 1358, 1364, 1372, 1381, 1389, 1395, 1399, 1401, 1403, 1405, 1407, 1409, 1411, 1413, 1415, 1423, 1425, 1427, 1429, 1431, 1433, 1435, 1437, 1439, 1441, 1445, 1451, 1458, 1464, 1468, 1470, 1472, 1474, 1476, 1478, 1480, 1482, 1484, 1486, 1494, 1496, 1498, 1500, 1502, 1504, 1506, 1508, 1510, 1512, 1514, 1518, 1523, 1527, 1529, 1531, 1533, 1535, 1537, 1539, 1541, 1543, 1545, 1547, 1555, 1557, 1559, 1561, 1563, 1565, 1567, 1569, 1571, 1573, 1575, 1577, 1580, 1582, 1584, 1586, 1588, 1590, 1592, 1594, 1596, 1598, 1600, 1602, 1610, 1612, 1614, 1616, 1618, 1620, 1622, 1624, 1626, 1628, 1630, 1632, 1634, 1636, 1638, 1640, 1642, 1644, 1646, 1648, 1650, 1652, 1654, 1656, 1662, 1664, 1666, 1668, 1670, 1672, 1674, 1676, 1678, 1680, 1682, 1684, 1686, 1688, 1690, 1692, 1694, 1696, 1698, 1700, 1702, 1704, 1706, 1708, 1715, 1717, 1719, 1721, 1723, 1725, 1727, 1729, 1731, 1733, 1735, 1737, 1739, 1741, 1743, 1745, 1747, 1749, 1751, 1753, 1755, 1757, 1759, 1761, 1769, 1771, 1773, 1775, 1777, 1779, 1781, 1783, 1785, 1787, 1789, 1791, 1793, 1796, 1798, 1800, 1802, 1804, 1806, 1808, 1810, 1812, 1814, 1816, 1824, 1826, 1828, 1830, 1832, 1834, 1836, 1838, 1840, 1842, 1844, 1846, 1850, 1855, 1859, 1861, 1863, 1865, 1867, 1869, 1871, 1873, 1875, 1877, 1885, 1887, 1889, 1891, 1893, 1895, 1897, 1899, 1901, 1903, 1905, 1909, 1915, 1922, 1928, 1932, 1934, 1936, 1938, 1940, 1942, 1944, 1946, 1948, 1956, 1958, 1960, 1962, 1964, 1966, 1968, 1970, 1972, 1974, 1978, 1984, 1992, 2001, 2009, 2015, 2019, 2021, 2023, 2025, 2027, 2029, 2031, 2033, 2041, 2043, 2045, 2047, 2049, 2051, 2053, 2055, 2057, 2061, 2067, 2075, 2085, 2096, 2106, 2114, 2120, 2124, 2126, 2128, 2130, 2132, 2134, 2136, 2144, 2146, 2148, 2150, 2152, 2154, 2156, 2158, 2162, 2168, 2176, 2186, 2198, 2211, 2223, 2233, 2241, 2247, 2251, 2253, 2255, 2257, 2259, 2261, 2269, 2271, 2273, 2275, 2277, 2279, 2281, 2285, 2291, 2299, 2309, 2321, 2335, 2350, 2364, 2376, 2386, 2394, 2400, 2404, 2406, 2408, 2410, 2412, 2420, 2422, 2424, 2426, 2428, 2430, 2434, 2440, 2448, 2458, 2470, 2484, 2500, 2517, 2533, 2547, 2559, 2569, 2577, 2583, 2587, 2589, 2591, 2593, 2601, 2603, 2605, 2607, 2609, 2613, 2619, 2627, 2637, 2649, 2664, 2680, 2698, 2717, 2735, 2751, 2765, 2777, 2787, 2795, 2801, 2805, 2807, 2809, 2817, 2819, 2821, 2823, 2827, 2833, 2841, 2851, 2863, 2877, 2893, 2911, 2931, 2952, 2972, 2990, 3006, 3020, 3032, 3042, 3050, 3056, 3060, 3062, 3068, 3070, 3072, 3076, 3082, 3090, 3100, 3112, 3126, 3142, 3160, 3180, 3202, 3225, 3247, 3267, 3285, 3301, 3315, 3327, 3337, 3345, 3351, 3355]
Discarding 600 places :
Implicit Place search using SMT only with invariants took 9001 ms to find 600 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2787/4148 places, 9158/9641 transitions.
Applied a total of 0 rules in 446 ms. Remains 2787 /2787 variables (removed 0) and now considering 9158/9158 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 22823 ms. Remains : 2787/4148 places, 9158/9641 transitions.
[2024-06-01 00:40:28] [INFO ] Flow matrix only has 8273 transitions (discarded 885 similar events)
// Phase 1: matrix 8273 rows 2787 cols
[2024-06-01 00:40:29] [INFO ] Computed 59 invariants in 155 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (34137 resets) in 25471 ms. (39 steps per ms)
BEST_FIRST walk for 2000002 steps (5361 resets) in 5926 ms. (337 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-01 00:41:00] [INFO ] Flow matrix only has 8273 transitions (discarded 885 similar events)
[2024-06-01 00:41:00] [INFO ] Invariant cache hit.
[2024-06-01 00:41:00] [INFO ] [Real]Absence check using 47 positive place invariants in 45 ms returned sat
[2024-06-01 00:41:00] [INFO ] [Real]Absence check using 47 positive and 12 generalized place invariants in 2 ms returned sat
[2024-06-01 00:41:03] [INFO ] [Real]Absence check using state equation in 2951 ms returned sat
[2024-06-01 00:41:04] [INFO ] State equation strengthened by 5002 read => feed constraints.
[2024-06-01 00:41:05] [INFO ] [Real]Added 5002 Read/Feed constraints in 1223 ms returned sat
[2024-06-01 00:41:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:41:05] [INFO ] [Nat]Absence check using 47 positive place invariants in 52 ms returned sat
[2024-06-01 00:41:05] [INFO ] [Nat]Absence check using 47 positive and 12 generalized place invariants in 5 ms returned sat
[2024-06-01 00:41:08] [INFO ] [Nat]Absence check using state equation in 3048 ms returned sat
[2024-06-01 00:41:12] [INFO ] [Nat]Added 5002 Read/Feed constraints in 4120 ms returned sat
[2024-06-01 00:41:15] [INFO ] Deduced a trap composed of 303 places in 2052 ms of which 20 ms to minimize.
[2024-06-01 00:41:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2426 ms
[2024-06-01 00:41:15] [INFO ] Computed and/alt/rep : 4550/6591/4550 causal constraints (skipped 3629 transitions) in 574 ms.
[2024-06-01 00:41:17] [INFO ] Added : 9 causal constraints over 2 iterations in 1734 ms. Result :sat
Minimization took 9622 ms.
[2024-06-01 00:41:26] [INFO ] [Real]Absence check using 47 positive place invariants in 50 ms returned sat
[2024-06-01 00:41:27] [INFO ] [Real]Absence check using 47 positive and 12 generalized place invariants in 3 ms returned sat
[2024-06-01 00:41:30] [INFO ] [Real]Absence check using state equation in 3024 ms returned sat
[2024-06-01 00:41:30] [INFO ] [Real]Added 5002 Read/Feed constraints in 619 ms returned sat
[2024-06-01 00:41:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:41:31] [INFO ] [Nat]Absence check using 47 positive place invariants in 50 ms returned sat
[2024-06-01 00:41:31] [INFO ] [Nat]Absence check using 47 positive and 12 generalized place invariants in 3 ms returned sat
[2024-06-01 00:41:34] [INFO ] [Nat]Absence check using state equation in 3187 ms returned sat
[2024-06-01 00:41:39] [INFO ] [Nat]Added 5002 Read/Feed constraints in 4557 ms returned sat
[2024-06-01 00:41:41] [INFO ] Deduced a trap composed of 316 places in 2010 ms of which 20 ms to minimize.
[2024-06-01 00:41:43] [INFO ] Deduced a trap composed of 124 places in 2228 ms of which 20 ms to minimize.
[2024-06-01 00:41:46] [INFO ] Deduced a trap composed of 90 places in 2163 ms of which 21 ms to minimize.
[2024-06-01 00:41:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 7254 ms
[2024-06-01 00:41:46] [INFO ] Computed and/alt/rep : 4550/6591/4550 causal constraints (skipped 3629 transitions) in 511 ms.
[2024-06-01 00:41:48] [INFO ] Added : 12 causal constraints over 3 iterations in 2006 ms. Result :sat
Minimization took 6468 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 2787 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2787/2787 places, 9158/9158 transitions.
Applied a total of 0 rules in 446 ms. Remains 2787 /2787 variables (removed 0) and now considering 9158/9158 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 447 ms. Remains : 2787/2787 places, 9158/9158 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2787/2787 places, 9158/9158 transitions.
Applied a total of 0 rules in 472 ms. Remains 2787 /2787 variables (removed 0) and now considering 9158/9158 (removed 0) transitions.
[2024-06-01 00:41:55] [INFO ] Flow matrix only has 8273 transitions (discarded 885 similar events)
[2024-06-01 00:41:55] [INFO ] Invariant cache hit.
[2024-06-01 00:42:00] [INFO ] Implicit Places using invariants in 5074 ms returned []
[2024-06-01 00:42:00] [INFO ] Flow matrix only has 8273 transitions (discarded 885 similar events)
[2024-06-01 00:42:00] [INFO ] Invariant cache hit.
[2024-06-01 00:42:04] [INFO ] State equation strengthened by 5002 read => feed constraints.
[2024-06-01 00:42:35] [INFO ] Performed 499/2787 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 00:43:06] [INFO ] Performed 860/2787 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-06-01 00:43:44] [INFO ] Performed 1166/2787 implicitness test of which 0 returned IMPLICIT in 99 seconds.
[2024-06-01 00:44:14] [INFO ] Performed 1304/2787 implicitness test of which 0 returned IMPLICIT in 129 seconds.
[2024-06-01 00:44:14] [INFO ] Timeout of Implicit test with SMT after 129 seconds.
[2024-06-01 00:44:14] [INFO ] Implicit Places using invariants and state equation in 133870 ms returned []
Implicit Place search using SMT with State Equation took 138952 ms to find 0 implicit places.
[2024-06-01 00:44:15] [INFO ] Redundant transitions in 1182 ms returned []
Running 9064 sub problems to find dead transitions.
[2024-06-01 00:44:16] [INFO ] Flow matrix only has 8273 transitions (discarded 885 similar events)
[2024-06-01 00:44:16] [INFO ] Invariant cache hit.
[2024-06-01 00:44:16] [INFO ] State equation strengthened by 5002 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2785 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 9064 unsolved
SMT process timed out in 81713ms, After SMT, problems are : Problem set: 0 solved, 9064 unsolved
Search for dead transitions found 0 dead transitions in 81832ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 222497 ms. Remains : 2787/2787 places, 9158/9158 transitions.
RANDOM walk for 40000 steps (1365 resets) in 1939 ms. (20 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (106 resets) in 202 ms. (197 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (104 resets) in 213 ms. (186 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (106 resets) in 195 ms. (204 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (109 resets) in 186 ms. (213 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 26209 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 4
Probabilistic random walk after 26209 steps, saw 11097 distinct states, run finished after 3004 ms. (steps per millisecond=8 ) properties seen :0
[2024-06-01 00:45:41] [INFO ] Flow matrix only has 8273 transitions (discarded 885 similar events)
[2024-06-01 00:45:41] [INFO ] Invariant cache hit.
[2024-06-01 00:45:41] [INFO ] State equation strengthened by 5002 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2669/2671 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2671 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 26/2697 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 00:45:44] [INFO ] Deduced a trap composed of 382 places in 2060 ms of which 19 ms to minimize.
[2024-06-01 00:45:46] [INFO ] Deduced a trap composed of 475 places in 2111 ms of which 19 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2697/11060 variables, and 5 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 3/47 constraints, Generalized P Invariants (flows): 0/12 constraints, State Equation: 0/2787 constraints, ReadFeed: 0/5002 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2669/2671 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2671 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 26/2697 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2697 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 00:45:49] [INFO ] Deduced a trap composed of 302 places in 2013 ms of which 19 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2697 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2697 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 36/2733 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 00:45:51] [INFO ] Deduced a trap composed of 5 places in 2033 ms of which 18 ms to minimize.
SMT process timed out in 10220ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 2787 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2787/2787 places, 9158/9158 transitions.
Applied a total of 0 rules in 436 ms. Remains 2787 /2787 variables (removed 0) and now considering 9158/9158 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 438 ms. Remains : 2787/2787 places, 9158/9158 transitions.
RANDOM walk for 40000 steps (1363 resets) in 1451 ms. (27 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (106 resets) in 191 ms. (208 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (106 resets) in 230 ms. (173 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (102 resets) in 199 ms. (200 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (105 resets) in 199 ms. (200 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 25722 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 4
Probabilistic random walk after 25722 steps, saw 10891 distinct states, run finished after 3002 ms. (steps per millisecond=8 ) properties seen :0
[2024-06-01 00:45:56] [INFO ] Flow matrix only has 8273 transitions (discarded 885 similar events)
[2024-06-01 00:45:56] [INFO ] Invariant cache hit.
[2024-06-01 00:45:56] [INFO ] State equation strengthened by 5002 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2669/2671 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2671 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 26/2697 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 00:45:58] [INFO ] Deduced a trap composed of 382 places in 2008 ms of which 16 ms to minimize.
[2024-06-01 00:46:00] [INFO ] Deduced a trap composed of 475 places in 2011 ms of which 19 ms to minimize.
[2024-06-01 00:46:02] [INFO ] Deduced a trap composed of 277 places in 1983 ms of which 18 ms to minimize.
[2024-06-01 00:46:04] [INFO ] Deduced a trap composed of 302 places in 1991 ms of which 18 ms to minimize.
[2024-06-01 00:46:06] [INFO ] Deduced a trap composed of 99 places in 1991 ms of which 18 ms to minimize.
[2024-06-01 00:46:09] [INFO ] Deduced a trap composed of 116 places in 2014 ms of which 19 ms to minimize.
[2024-06-01 00:46:11] [INFO ] Deduced a trap composed of 112 places in 2088 ms of which 19 ms to minimize.
[2024-06-01 00:46:13] [INFO ] Deduced a trap composed of 165 places in 1960 ms of which 18 ms to minimize.
[2024-06-01 00:46:15] [INFO ] Deduced a trap composed of 114 places in 2047 ms of which 19 ms to minimize.
[2024-06-01 00:46:17] [INFO ] Deduced a trap composed of 163 places in 1928 ms of which 18 ms to minimize.
[2024-06-01 00:46:19] [INFO ] Deduced a trap composed of 219 places in 2094 ms of which 18 ms to minimize.
[2024-06-01 00:46:21] [INFO ] Deduced a trap composed of 425 places in 1994 ms of which 17 ms to minimize.
[2024-06-01 00:46:23] [INFO ] Deduced a trap composed of 335 places in 2100 ms of which 20 ms to minimize.
[2024-06-01 00:46:25] [INFO ] Deduced a trap composed of 99 places in 2131 ms of which 18 ms to minimize.
[2024-06-01 00:46:27] [INFO ] Deduced a trap composed of 117 places in 1988 ms of which 18 ms to minimize.
[2024-06-01 00:46:29] [INFO ] Deduced a trap composed of 404 places in 2107 ms of which 19 ms to minimize.
[2024-06-01 00:46:32] [INFO ] Deduced a trap composed of 163 places in 2088 ms of which 18 ms to minimize.
[2024-06-01 00:46:34] [INFO ] Deduced a trap composed of 141 places in 2090 ms of which 18 ms to minimize.
[2024-06-01 00:46:36] [INFO ] Deduced a trap composed of 510 places in 1976 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2697 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2697 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 36/2733 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2733 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 44/2777 variables, 44/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2777 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 10/2787 variables, 10/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2787 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 8273/11060 variables, 2787/2865 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SMT process timed out in 45119ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 2787 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2787/2787 places, 9158/9158 transitions.
Applied a total of 0 rules in 460 ms. Remains 2787 /2787 variables (removed 0) and now considering 9158/9158 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 460 ms. Remains : 2787/2787 places, 9158/9158 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2787/2787 places, 9158/9158 transitions.
Applied a total of 0 rules in 435 ms. Remains 2787 /2787 variables (removed 0) and now considering 9158/9158 (removed 0) transitions.
[2024-06-01 00:46:42] [INFO ] Flow matrix only has 8273 transitions (discarded 885 similar events)
[2024-06-01 00:46:42] [INFO ] Invariant cache hit.
[2024-06-01 00:46:47] [INFO ] Implicit Places using invariants in 5054 ms returned []
[2024-06-01 00:46:47] [INFO ] Flow matrix only has 8273 transitions (discarded 885 similar events)
[2024-06-01 00:46:47] [INFO ] Invariant cache hit.
[2024-06-01 00:46:50] [INFO ] State equation strengthened by 5002 read => feed constraints.
[2024-06-01 00:47:21] [INFO ] Performed 454/2787 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 00:47:51] [INFO ] Performed 853/2787 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-06-01 00:48:21] [INFO ] Performed 1112/2787 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-06-01 00:48:52] [INFO ] Performed 1248/2787 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2024-06-01 00:48:52] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2024-06-01 00:48:52] [INFO ] Implicit Places using invariants and state equation in 125208 ms returned []
Implicit Place search using SMT with State Equation took 130264 ms to find 0 implicit places.
[2024-06-01 00:48:53] [INFO ] Redundant transitions in 1136 ms returned []
Running 9064 sub problems to find dead transitions.
[2024-06-01 00:48:53] [INFO ] Flow matrix only has 8273 transitions (discarded 885 similar events)
[2024-06-01 00:48:53] [INFO ] Invariant cache hit.
[2024-06-01 00:48:53] [INFO ] State equation strengthened by 5002 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2785 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 9064 unsolved
SMT process timed out in 78947ms, After SMT, problems are : Problem set: 0 solved, 9064 unsolved
Search for dead transitions found 0 dead transitions in 79057ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 210979 ms. Remains : 2787/2787 places, 9158/9158 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0] Max Struct:[1, 1]
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-06-01 00:50:12] [INFO ] Flow matrix only has 8273 transitions (discarded 885 similar events)
[2024-06-01 00:50:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (341 resets) in 366 ms. (27 steps per ms)
BEST_FIRST walk for 10001 steps (26 resets) in 30 ms. (322 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 00:50:12] [INFO ] Flow matrix only has 8273 transitions (discarded 885 similar events)
[2024-06-01 00:50:13] [INFO ] Invariant cache hit.
[2024-06-01 00:50:13] [INFO ] [Real]Absence check using 47 positive place invariants in 50 ms returned sat
[2024-06-01 00:50:13] [INFO ] [Real]Absence check using 47 positive and 12 generalized place invariants in 3 ms returned sat
[2024-06-01 00:50:16] [INFO ] [Real]Absence check using state equation in 3081 ms returned sat
[2024-06-01 00:50:16] [INFO ] State equation strengthened by 5002 read => feed constraints.
[2024-06-01 00:50:17] [INFO ] [Real]Added 5002 Read/Feed constraints in 456 ms returned sat
[2024-06-01 00:50:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:50:17] [INFO ] [Nat]Absence check using 47 positive place invariants in 51 ms returned sat
[2024-06-01 00:50:17] [INFO ] [Nat]Absence check using 47 positive and 12 generalized place invariants in 5 ms returned sat
[2024-06-01 00:50:20] [INFO ] [Nat]Absence check using state equation in 2955 ms returned sat
[2024-06-01 00:50:21] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 00:50:21] [INFO ] [Nat]Added 5002 Read/Feed constraints in 1285 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 2787 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place Node20ThinksNode15ShouldBeNodeMasterToReplaceNode10) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 2787/2787 places, 9156/9156 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2786 transition count 9154
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2785 transition count 9152
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 2784 transition count 9150
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 2783 transition count 9148
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 2782 transition count 9146
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 2781 transition count 9144
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 2780 transition count 9142
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 2779 transition count 9140
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 2778 transition count 9138
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 10 place count 2778 transition count 9137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 11 place count 2777 transition count 9137
Applied a total of 11 rules in 953 ms. Remains 2777 /2787 variables (removed 10) and now considering 9137/9156 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 954 ms. Remains : 2777/2787 places, 9137/9156 transitions.
[2024-06-01 00:50:22] [INFO ] Flow matrix only has 8251 transitions (discarded 886 similar events)
// Phase 1: matrix 8251 rows 2777 cols
[2024-06-01 00:50:22] [INFO ] Computed 59 invariants in 136 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (34146 resets) in 25662 ms. (38 steps per ms)
BEST_FIRST walk for 1000001 steps (2676 resets) in 2934 ms. (340 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 00:50:51] [INFO ] Flow matrix only has 8251 transitions (discarded 886 similar events)
[2024-06-01 00:50:51] [INFO ] Invariant cache hit.
[2024-06-01 00:50:51] [INFO ] [Real]Absence check using 47 positive place invariants in 51 ms returned sat
[2024-06-01 00:50:51] [INFO ] [Real]Absence check using 47 positive and 12 generalized place invariants in 9 ms returned sat
[2024-06-01 00:50:55] [INFO ] [Real]Absence check using state equation in 3359 ms returned sat
[2024-06-01 00:50:55] [INFO ] State equation strengthened by 4992 read => feed constraints.
[2024-06-01 00:50:57] [INFO ] [Real]Added 4992 Read/Feed constraints in 2159 ms returned sat
[2024-06-01 00:50:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:50:58] [INFO ] [Nat]Absence check using 47 positive place invariants in 51 ms returned sat
[2024-06-01 00:50:58] [INFO ] [Nat]Absence check using 47 positive and 12 generalized place invariants in 6 ms returned sat
[2024-06-01 00:51:01] [INFO ] [Nat]Absence check using state equation in 3341 ms returned sat
[2024-06-01 00:51:06] [INFO ] [Nat]Added 4992 Read/Feed constraints in 4764 ms returned sat
[2024-06-01 00:51:08] [INFO ] Deduced a trap composed of 115 places in 2097 ms of which 18 ms to minimize.
[2024-06-01 00:51:10] [INFO ] Deduced a trap composed of 356 places in 1988 ms of which 20 ms to minimize.
[2024-06-01 00:51:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4658 ms
[2024-06-01 00:51:11] [INFO ] Computed and/alt/rep : 4528/6558/4528 causal constraints (skipped 3629 transitions) in 461 ms.
[2024-06-01 00:51:12] [INFO ] Added : 9 causal constraints over 2 iterations in 1800 ms. Result :sat
Minimization took 9632 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 2777 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2777/2777 places, 9137/9137 transitions.
Applied a total of 0 rules in 435 ms. Remains 2777 /2777 variables (removed 0) and now considering 9137/9137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 435 ms. Remains : 2777/2777 places, 9137/9137 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2777/2777 places, 9137/9137 transitions.
Applied a total of 0 rules in 421 ms. Remains 2777 /2777 variables (removed 0) and now considering 9137/9137 (removed 0) transitions.
[2024-06-01 00:51:23] [INFO ] Flow matrix only has 8251 transitions (discarded 886 similar events)
[2024-06-01 00:51:23] [INFO ] Invariant cache hit.
[2024-06-01 00:51:28] [INFO ] Implicit Places using invariants in 4922 ms returned []
[2024-06-01 00:51:28] [INFO ] Flow matrix only has 8251 transitions (discarded 886 similar events)
[2024-06-01 00:51:28] [INFO ] Invariant cache hit.
[2024-06-01 00:51:30] [INFO ] State equation strengthened by 4992 read => feed constraints.
[2024-06-01 00:52:00] [INFO ] Performed 342/2777 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 00:52:30] [INFO ] Performed 710/2777 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-06-01 00:53:00] [INFO ] Performed 1135/2777 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-06-01 00:53:31] [INFO ] Performed 1279/2777 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2024-06-01 00:53:31] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2024-06-01 00:53:31] [INFO ] Implicit Places using invariants and state equation in 123070 ms returned []
Implicit Place search using SMT with State Equation took 128013 ms to find 0 implicit places.
[2024-06-01 00:53:32] [INFO ] Redundant transitions in 1056 ms returned []
Running 9043 sub problems to find dead transitions.
[2024-06-01 00:53:32] [INFO ] Flow matrix only has 8251 transitions (discarded 886 similar events)
[2024-06-01 00:53:32] [INFO ] Invariant cache hit.
[2024-06-01 00:53:32] [INFO ] State equation strengthened by 4992 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2774 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 9043 unsolved
SMT process timed out in 78814ms, After SMT, problems are : Problem set: 0 solved, 9043 unsolved
Search for dead transitions found 0 dead transitions in 78891ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208425 ms. Remains : 2777/2777 places, 9137/9137 transitions.
RANDOM walk for 40000 steps (1364 resets) in 1189 ms. (33 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (104 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (105 resets) in 131 ms. (303 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 27328 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :0 out of 2
Probabilistic random walk after 27328 steps, saw 11554 distinct states, run finished after 3001 ms. (steps per millisecond=9 ) properties seen :0
[2024-06-01 00:54:54] [INFO ] Flow matrix only has 8251 transitions (discarded 886 similar events)
[2024-06-01 00:54:54] [INFO ] Invariant cache hit.
[2024-06-01 00:54:54] [INFO ] State equation strengthened by 4992 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2660/2661 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2661 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/2687 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 00:54:57] [INFO ] Deduced a trap composed of 342 places in 1966 ms of which 19 ms to minimize.
[2024-06-01 00:54:59] [INFO ] Deduced a trap composed of 187 places in 2106 ms of which 19 ms to minimize.
[2024-06-01 00:55:01] [INFO ] Deduced a trap composed of 163 places in 2005 ms of which 19 ms to minimize.
SMT process timed out in 6744ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2777 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2777/2777 places, 9137/9137 transitions.
Applied a total of 0 rules in 469 ms. Remains 2777 /2777 variables (removed 0) and now considering 9137/9137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 470 ms. Remains : 2777/2777 places, 9137/9137 transitions.
RANDOM walk for 40000 steps (1364 resets) in 1137 ms. (35 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (106 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (107 resets) in 131 ms. (303 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 26756 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 2
Probabilistic random walk after 26756 steps, saw 11318 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
[2024-06-01 00:55:05] [INFO ] Flow matrix only has 8251 transitions (discarded 886 similar events)
[2024-06-01 00:55:05] [INFO ] Invariant cache hit.
[2024-06-01 00:55:05] [INFO ] State equation strengthened by 4992 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2660/2661 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2661 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/2687 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 00:55:07] [INFO ] Deduced a trap composed of 342 places in 2047 ms of which 17 ms to minimize.
[2024-06-01 00:55:09] [INFO ] Deduced a trap composed of 187 places in 2040 ms of which 18 ms to minimize.
[2024-06-01 00:55:11] [INFO ] Deduced a trap composed of 163 places in 2040 ms of which 18 ms to minimize.
[2024-06-01 00:55:14] [INFO ] Deduced a trap composed of 92 places in 2002 ms of which 17 ms to minimize.
[2024-06-01 00:55:16] [INFO ] Deduced a trap composed of 313 places in 1990 ms of which 17 ms to minimize.
[2024-06-01 00:55:18] [INFO ] Deduced a trap composed of 330 places in 1962 ms of which 17 ms to minimize.
[2024-06-01 00:55:20] [INFO ] Deduced a trap composed of 485 places in 1945 ms of which 18 ms to minimize.
[2024-06-01 00:55:22] [INFO ] Deduced a trap composed of 517 places in 2094 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2687 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2687 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 36/2723 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2723 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 44/2767 variables, 44/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2767 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/2777 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2777 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 8251/11028 variables, 2777/2844 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/11028 variables, 4992/7836 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/11028 variables, 0/7836 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/11028 variables, 0/7836 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11028/11028 variables, and 7836 constraints, problems are : Problem set: 0 solved, 2 unsolved in 21740 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 2777/2777 constraints, ReadFeed: 4992/4992 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2660/2661 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2661 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/2687 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2687 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 00:55:29] [INFO ] Deduced a trap composed of 123 places in 1986 ms of which 17 ms to minimize.
[2024-06-01 00:55:31] [INFO ] Deduced a trap composed of 473 places in 1998 ms of which 17 ms to minimize.
[2024-06-01 00:55:33] [INFO ] Deduced a trap composed of 452 places in 1928 ms of which 17 ms to minimize.
[2024-06-01 00:55:35] [INFO ] Deduced a trap composed of 99 places in 1940 ms of which 17 ms to minimize.
[2024-06-01 00:55:37] [INFO ] Deduced a trap composed of 123 places in 1959 ms of which 17 ms to minimize.
[2024-06-01 00:55:39] [INFO ] Deduced a trap composed of 109 places in 2050 ms of which 18 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2687 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2687 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 36/2723 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 00:55:41] [INFO ] Deduced a trap composed of 5 places in 2137 ms of which 18 ms to minimize.
[2024-06-01 00:55:44] [INFO ] Deduced a trap composed of 39 places in 2204 ms of which 18 ms to minimize.
[2024-06-01 00:55:46] [INFO ] Deduced a trap composed of 126 places in 2173 ms of which 19 ms to minimize.
[2024-06-01 00:55:48] [INFO ] Deduced a trap composed of 39 places in 1960 ms of which 17 ms to minimize.
[2024-06-01 00:55:50] [INFO ] Deduced a trap composed of 89 places in 2084 ms of which 18 ms to minimize.
[2024-06-01 00:55:52] [INFO ] Deduced a trap composed of 200 places in 2106 ms of which 19 ms to minimize.
[2024-06-01 00:55:54] [INFO ] Deduced a trap composed of 99 places in 2121 ms of which 19 ms to minimize.
[2024-06-01 00:55:57] [INFO ] Deduced a trap composed of 98 places in 2163 ms of which 18 ms to minimize.
[2024-06-01 00:55:59] [INFO ] Deduced a trap composed of 87 places in 2137 ms of which 18 ms to minimize.
[2024-06-01 00:56:01] [INFO ] Deduced a trap composed of 170 places in 1907 ms of which 18 ms to minimize.
[2024-06-01 00:56:03] [INFO ] Deduced a trap composed of 101 places in 2081 ms of which 17 ms to minimize.
[2024-06-01 00:56:05] [INFO ] Deduced a trap composed of 86 places in 2220 ms of which 18 ms to minimize.
[2024-06-01 00:56:07] [INFO ] Deduced a trap composed of 70 places in 2039 ms of which 18 ms to minimize.
[2024-06-01 00:56:09] [INFO ] Deduced a trap composed of 100 places in 2098 ms of which 18 ms to minimize.
[2024-06-01 00:56:12] [INFO ] Deduced a trap composed of 89 places in 2223 ms of which 19 ms to minimize.
SMT process timed out in 66887ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 2777 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2777/2777 places, 9137/9137 transitions.
Applied a total of 0 rules in 473 ms. Remains 2777 /2777 variables (removed 0) and now considering 9137/9137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 473 ms. Remains : 2777/2777 places, 9137/9137 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2777/2777 places, 9137/9137 transitions.
Applied a total of 0 rules in 487 ms. Remains 2777 /2777 variables (removed 0) and now considering 9137/9137 (removed 0) transitions.
[2024-06-01 00:56:13] [INFO ] Flow matrix only has 8251 transitions (discarded 886 similar events)
[2024-06-01 00:56:13] [INFO ] Invariant cache hit.
[2024-06-01 00:56:18] [INFO ] Implicit Places using invariants in 5022 ms returned []
[2024-06-01 00:56:18] [INFO ] Flow matrix only has 8251 transitions (discarded 886 similar events)
[2024-06-01 00:56:18] [INFO ] Invariant cache hit.
[2024-06-01 00:56:20] [INFO ] State equation strengthened by 4992 read => feed constraints.
[2024-06-01 00:56:50] [INFO ] Performed 333/2777 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 00:57:21] [INFO ] Performed 709/2777 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-06-01 00:57:51] [INFO ] Performed 1141/2777 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-06-01 00:58:21] [INFO ] Performed 1284/2777 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2024-06-01 00:58:21] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2024-06-01 00:58:21] [INFO ] Implicit Places using invariants and state equation in 123755 ms returned []
Implicit Place search using SMT with State Equation took 128780 ms to find 0 implicit places.
[2024-06-01 00:58:22] [INFO ] Redundant transitions in 1071 ms returned []
Running 9043 sub problems to find dead transitions.
[2024-06-01 00:58:23] [INFO ] Flow matrix only has 8251 transitions (discarded 886 similar events)
[2024-06-01 00:58:23] [INFO ] Invariant cache hit.
[2024-06-01 00:58:23] [INFO ] State equation strengthened by 4992 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 0.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 0.0)
(s702 0.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 0.0)
(s859 0.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 0.0)
(s986 0.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 0.0)
(s1087 0.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 0.0)
(s1166 0.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 1.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 1.0)
(s1217 1.0)
(s1218 1.0)
(s1219 1.0)
(s1220 1.0)
(s1221 1.0)
(s1222 1.0)
(s1223 1.0)
(s1224 1.0)
(s1225 1.0)
(s1226 0.0)
(s1227 0.0)
(s1228 1.0)
(s1229 1.0)
(s1230 1.0)
(s1231 1.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
(s1237 1.0)
(s1238 1.0)
(s1239 1.0)
(s1240 1.0)
(s1241 1.0)
(s1242 1.0)
(s1243 1.0)
(s1244 1.0)
(s1245 1.0)
(s1246 1.0)
(s1247 1.0)
(s1248 1.0)
(s1249 1.0)
(s1250 1.0)
(s1251 1.0)
(s1252 1.0)
(s1253 1.0)
(s1254 1.0)
(s1255 1.0)
(s1256 1.0)
(s1257 1.0)
(s1258 1.0)
(s1259 1.0)
(s1260 1.0)
(s1261 1.0)
(s1262 1.0)
(s1263 1.0)
(s1264 1.0)
(s1265 1.0)
(s1266 1.0)
(s1267 1.0)
(s1268 1.0)
(s1269 1.0)
(s1270 1.0)
(s1271 1.0)
(s1272 1.0)
(s1273 0.0)
(s1274 0.0)
(s1275 1.0)
(s1276 1.0)
(s1277 1.0)
(s1278 1.0)
(s1279 1.0)
(s1280 1.0)
(s1281 1.0)
(s1282 1.0)
(s1283 1.0)
(s1284 1.0)
(s1285 1.0)
(s1286 1.0)
(s1287 1.0)
(s1288 1.0)
(s1289 1.0)
(s1290 1.0)
(s1291 1.0)
(s1292 1.0)
(s1293 1.0)
(s1294 1.0)
(s1295 1.0)
(s1296 1.0)
(s1297 1.0)
(s1298 1.0)
(s1299 1.0)
(s1300 1.0)
(s1301 1.0)
(s1302 1.0)
(s1303 1.0)
(s1304 1.0)
(s1305 1.0)
(s1306 1.0)
(s1307 1.0)
(s1308 1.0)
(s1309 1.0)
(s1310 0.0)
(s1311 0.0)
(s1312 1.0)
(s1313 1.0)
(s1314 1.0)
(s1315 1.0)
(s1316 1.0)
(s1317 1.0)
(s1318 1.0)
(s1319 1.0)
(s1320 1.0)
(s1321 1.0)
(s1322 1.0)
(s1323 1.0)
(s1324 1.0)
(s1325 1.0)
(s1326 1.0)
(s1327 1.0)
(s1328 1.0)
(s1329 1.0)
(s1330 1.0)
(s1331 1.0)
(s1332 1.0)
(s1333 1.0)
(s1334 1.0)
(s1335 1.0)
(s1336 1.0)
(s1337 1.0)
(s1338 1.0)
(s1339 1.0)
(s1340 1.0)
(s1341 1.0)
(s1342 1.0)
(s1343 0.0)
(s1344 1.0)
(s1345 1.0)
(s1346 1.0)
(s1347 1.0)
(s1348 1.0)
(s1349 1.0)
(s1350 1.0)
(s1351 1.0)
(s1352 1.0)
(s1353 1.0)
(s1354 1.0)
(s1355 1.0)
(s1356 1.0)
(s1357 1.0)
(s1358 1.0)
(s1359 1.0)
(s1360 1.0)
(s1361 1.0)
(s1362 1.0)
(s1363 1.0)
(s1364 1.0)
(s1365 1.0)
(s1366 1.0)
(s1367 1.0)
(s1368 1.0)
(s1369 1.0)
(s1370 1.0)
(s1371 1.0)
(s1372 1.0)
(s1373 1.0)
(s1374 1.0)
(s1375 1.0)
(s1376 1.0)
(s1377 1.0)
(s1378 1.0)
(s1379 1.0)
(s1380 1.0)
(s1381 1.0)
(s1382 1.0)
(s1383 1.0)
(s1384 1.0)
(s1385 1.0)
(s1386 1.0)
(s1387 1.0)
(s1388 1.0)
(s1389 1.0)
(s1390 1.0)
(s1391 1.0)
(s1392 1.0)
(s1393 1.0)
(s1394 1.0)
(s1395 1.0)
(s1396 1.0)
(s1397 1.0)
(s1398 0.0)
(s1399 0.0)
(s1400 1.0)
(s1401 1.0)
(s1402 1.0)
(s1403 1.0)
(s1404 1.0)
(s1405 1.0)
(s1406 1.0)
(s1407 1.0)
(s1408 1.0)
(s1409 1.0)
(s1410 1.0)
(s1411 1.0)
(s1412 1.0)
(s1413 1.0)
(s1414 1.0)
(s1415 1.0)
(s1416 1.0)
(s1417 1.0)
(s1418 1.0)
(s1419 1.0)
(s1420 1.0)
(s1421 1.0)
(s1422 1.0)
(s1423 1.0)
(s1424 1.0)
(s1425 1.0)
(s1426 1.0)
(s1427 1.0)
(s1428 0.0)
(s1429 0.0)
(s1430 1.0)
(s1431 1.0)
(s1432 1.0)
(s1433 1.0)
(s1434 1.0)
(s1435 1.0)
(s1436 1.0)
(s1437 1.0)
(s1438 1.0)
(s1439 1.0)
(s1440 1.0)
(s1441 1.0)
(s1442 1.0)
(s1443 1.0)
(s1444 1.0)
(s1445 1.0)
(s1446 1.0)
(s1447 1.0)
(s1448 1.0)
(s1449 1.0)
(s1450 1.0)
(s1451 1.0)
(s1452 1.0)
(s1453 1.0)
(s1454 1.0)
(s1455 1.0)
(s1456 1.0)
(s1457 1.0)
(s1458 1.0)
(s1459 0.0)
(s1460 0.0)
(s1461 1.0)
(s1462 1.0)
(s1463 1.0)
(s1464 1.0)
(s1465 1.0)
(s1466 1.0)
(s1467 1.0)
(s1468 1.0)
(s1469 1.0)
(s1470 1.0)
(s1471 1.0)
(s1472 1.0)
(s1473 1.0)
(s1474 1.0)
(s1475 1.0)
(s1476 1.0)
(s1477 1.0)
(s1478 1.0)
(s1479 1.0)
(s1480 1.0)
(s1481 1.0)
(s1482 1.0)
(s1483 1.0)
(s1484 1.0)
(s1485 1.0)
(s1486 1.0)
(s1487 1.0)
(s1488 1.0)
(s1489 1.0)
(s1490 1.0)
(s1491 1.0)
(s1492 1.0)
(s1493 1.0)
(s1494 1.0)
(s1495 1.0)
(s1496 0.0)
(s1497 0.0)
(s1498 1.0)
(s1499 1.0)
(s1500 1.0)
(s1501 1.0)
(s1502 1.0)
(s1503 1.0)
(s1504 1.0)
(s1505 1.0)
(s1506 1.0)
(s1507 1.0)
(s1508 1.0)
(s1509 1.0)
(s1510 1.0)
(s1511 1.0)
(s1512 1.0)
(s1513 1.0)
(s1514 1.0)
(s1515 1.0)
(s1516 1.0)
(s1517 1.0)
(s1518 1.0)
(s1519 1.0)
(s1520 1.0)
(s1521 1.0)
(s1522 1.0)
(s1523 1.0)
(s1524 1.0)
(s1525 1.0)
(s1526 1.0)
(s1527 1.0)
(s1528 1.0)
(s1529 1.0)
(s1530 1.0)
(s1531 1.0)
(s1532 1.0)
(s1533 1.0)
(s1534 1.0)
(s1535 1.0)
(s1536 1.0)
(s1537 1.0)
(s1538 1.0)
(s1539 1.0)
(s1540 1.0)
(s1541 1.0)
(s1542 1.0)
(s1543 0.0)
(s1544 0.0)
(s1545 1.0)
(s1546 1.0)
(s1547 1.0)
(s1548 1.0)
(s1549 1.0)
(s1550 1.0)
(s1551 1.0)
(s1552 1.0)
(s1553 1.0)
(s1554 1.0)
(s1555 1.0)
(s1556 1.0)
(s1557 1.0)
(s1558 1.0)
(s1559 1.0)
(s1560 1.0)
(s1561 1.0)
(s1562 1.0)
(s1563 1.0)
(s1564 1.0)
(s1565 1.0)
(s1566 1.0)
(s1567 1.0)
(s1568 1.0)
(s1569 1.0)
(s1570 1.0)
(s1571 1.0)
(s1572 1.0)
(s1573 1.0)
(s1574 1.0)
(s1575 1.0)
(s1576 1.0)
(s1577 1.0)
(s1578 1.0)
(s1579 1.0)
(s1580 1.0)
(s1581 1.0)
(s1582 1.0)
(s1583 1.0)
(s1584 1.0)
(s1585 1.0)
(s1586 1.0)
(s1587 1.0)
(s1588 1.0)
(s1589 1.0)
(s1590 1.0)
(s1591 1.0)
(s1592 1.0)
(s1593 1.0)
(s1594 1.0)
(s1595 1.0)
(s1596 1.0)
(s1597 1.0)
(s1598 1.0)
(s1599 1.0)
(s1600 1.0)
(s1601 1.0)
(s1602 1.0)
(s1603 1.0)
(s1604 0.0)
(s1605 0.0)
(s1606 1.0)
(s1607 1.0)
(s1608 1.0)
(s1609 1.0)
(s1610 1.0)
(s1611 1.0)
(s1612 1.0)
(s1613 1.0)
(s1614 1.0)
(s1615 1.0)
(s1616 1.0)
(s1617 1.0)
(s1618 1.0)
(s1619 1.0)
(s1620 1.0)
(s1621 1.0)
(s1622 1.0)
(s1623 1.0)
(s1624 1.0)
(s1625 1.0)
(s1626 1.0)
(s1627 1.0)
(s1628 1.0)
(s1629 1.0)
(s1630 1.0)
(s1631 1.0)
(s1632 1.0)
(s1633 1.0)
(s1634 1.0)
(s1635 1.0)
(s1636 1.0)
(s1637 1.0)
(s1638 1.0)
(s1639 1.0)
(s1640 1.0)
(s1641 1.0)
(s1642 1.0)
(s1643 1.0)
(s1644 1.0)
(s1645 1.0)
(s1646 1.0)
(s1647 1.0)
(s1648 1.0)
(s1649 1.0)
(s1650 1.0)
(s1651 1.0)
(s1652 1.0)
(s1653 1.0)
(s1654 1.0)
(s1655 1.0)
(s1656 1.0)
(s1657 1.0)
(s1658 1.0)
(s1659 1.0)
(s1660 1.0)
(s1661 1.0)
(s1662 1.0)
(s1663 1.0)
(s1664 1.0)
(s1665 1.0)
(s1666 1.0)
(s1667 1.0)
(s1668 1.0)
(s1669 1.0)
(s1670 1.0)
(s1671 1.0)
(s1672 1.0)
(s1673 1.0)
(s1674 1.0)
(s1675 1.0)
(s1676 1.0)
(s1677 1.0)
(s1678 1.0)
(s1679 1.0)
(s1680 1.0)
(s1681 1.0)
(s1682 1.0)
(s1683 0.0)
(s1684 0.0)
(s1685 1.0)
(s1686 1.0)
(s1687 1.0)
(s1688 1.0)
(s1689 1.0)
(s1690 1.0)
(s1691 1.0)
(s1692 1.0)
(s1693 1.0)
(s1694 1.0)
(s1695 1.0)
(s1696 1.0)
(s1697 1.0)
(s1698 1.0)
(s1699 1.0)
(s1700 1.0)
(s1701 1.0)
(s1702 1.0)
(s1703 1.0)
(s1704 1.0)
(s1705 1.0)
(s1706 1.0)
(s1707 1.0)
(s1708 1.0)
(s1709 1.0)
(s1710 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2774 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 9043 unsolved
SMT process timed out in 80856ms, After SMT, problems are : Problem set: 0 solved, 9043 unsolved
Search for dead transitions found 0 dead transitions in 80928ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211305 ms. Remains : 2777/2777 places, 9137/9137 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-07 in 571292 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-06-01 00:59:43] [INFO ] Flow matrix only has 8273 transitions (discarded 885 similar events)
// Phase 1: matrix 8273 rows 2787 cols
[2024-06-01 00:59:44] [INFO ] Computed 59 invariants in 133 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (342 resets) in 277 ms. (35 steps per ms)
BEST_FIRST walk for 10001 steps (26 resets) in 32 ms. (303 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 00:59:44] [INFO ] Flow matrix only has 8273 transitions (discarded 885 similar events)
[2024-06-01 00:59:44] [INFO ] Invariant cache hit.
[2024-06-01 00:59:44] [INFO ] [Real]Absence check using 47 positive place invariants in 50 ms returned sat
[2024-06-01 00:59:44] [INFO ] [Real]Absence check using 47 positive and 12 generalized place invariants in 3 ms returned sat
[2024-06-01 00:59:47] [INFO ] [Real]Absence check using state equation in 3077 ms returned sat
[2024-06-01 00:59:47] [INFO ] State equation strengthened by 5002 read => feed constraints.
[2024-06-01 00:59:48] [INFO ] [Real]Added 5002 Read/Feed constraints in 593 ms returned sat
[2024-06-01 00:59:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:59:49] [INFO ] [Nat]Absence check using 47 positive place invariants in 49 ms returned sat
[2024-06-01 00:59:49] [INFO ] [Nat]Absence check using 47 positive and 12 generalized place invariants in 3 ms returned sat
[2024-06-01 00:59:52] [INFO ] [Nat]Absence check using state equation in 3069 ms returned sat
[2024-06-01 00:59:52] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 00:59:53] [INFO ] [Nat]Added 5002 Read/Feed constraints in 1315 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 2787 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place Node22ThinksNode15ShouldBeNodeMasterToReplaceNode9) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 2787/2787 places, 9156/9156 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2786 transition count 9154
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2785 transition count 9152
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 2784 transition count 9150
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 2783 transition count 9148
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 2782 transition count 9146
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 2781 transition count 9144
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 2780 transition count 9142
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 2779 transition count 9140
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 2778 transition count 9138
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 2777 transition count 9136
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 2776 transition count 9134
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 12 place count 2775 transition count 9132
Applied a total of 12 rules in 573 ms. Remains 2775 /2787 variables (removed 12) and now considering 9132/9156 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 574 ms. Remains : 2775/2787 places, 9132/9156 transitions.
[2024-06-01 00:59:54] [INFO ] Flow matrix only has 8247 transitions (discarded 885 similar events)
// Phase 1: matrix 8247 rows 2775 cols
[2024-06-01 00:59:54] [INFO ] Computed 59 invariants in 148 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (34131 resets) in 26479 ms. (37 steps per ms)
BEST_FIRST walk for 1000001 steps (2678 resets) in 2947 ms. (339 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 01:00:23] [INFO ] Flow matrix only has 8247 transitions (discarded 885 similar events)
[2024-06-01 01:00:23] [INFO ] Invariant cache hit.
[2024-06-01 01:00:23] [INFO ] [Real]Absence check using 47 positive place invariants in 47 ms returned sat
[2024-06-01 01:00:23] [INFO ] [Real]Absence check using 47 positive and 12 generalized place invariants in 4 ms returned sat
[2024-06-01 01:00:26] [INFO ] [Real]Absence check using state equation in 2534 ms returned sat
[2024-06-01 01:00:26] [INFO ] State equation strengthened by 4989 read => feed constraints.
[2024-06-01 01:00:27] [INFO ] [Real]Added 4989 Read/Feed constraints in 1075 ms returned sat
[2024-06-01 01:00:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:00:28] [INFO ] [Nat]Absence check using 47 positive place invariants in 49 ms returned sat
[2024-06-01 01:00:28] [INFO ] [Nat]Absence check using 47 positive and 12 generalized place invariants in 3 ms returned sat
[2024-06-01 01:00:30] [INFO ] [Nat]Absence check using state equation in 2661 ms returned sat
[2024-06-01 01:00:35] [INFO ] [Nat]Added 4989 Read/Feed constraints in 4692 ms returned sat
[2024-06-01 01:00:36] [INFO ] Computed and/alt/rep : 4524/6552/4524 causal constraints (skipped 3629 transitions) in 459 ms.
[2024-06-01 01:00:37] [INFO ] Added : 13 causal constraints over 3 iterations in 1878 ms. Result :sat
Minimization took 9326 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 2775 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2775/2775 places, 9132/9132 transitions.
Applied a total of 0 rules in 424 ms. Remains 2775 /2775 variables (removed 0) and now considering 9132/9132 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 424 ms. Remains : 2775/2775 places, 9132/9132 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2775/2775 places, 9132/9132 transitions.
Applied a total of 0 rules in 418 ms. Remains 2775 /2775 variables (removed 0) and now considering 9132/9132 (removed 0) transitions.
[2024-06-01 01:00:47] [INFO ] Flow matrix only has 8247 transitions (discarded 885 similar events)
[2024-06-01 01:00:47] [INFO ] Invariant cache hit.
[2024-06-01 01:00:52] [INFO ] Implicit Places using invariants in 4995 ms returned []
[2024-06-01 01:00:52] [INFO ] Flow matrix only has 8247 transitions (discarded 885 similar events)
[2024-06-01 01:00:52] [INFO ] Invariant cache hit.
[2024-06-01 01:00:56] [INFO ] State equation strengthened by 4989 read => feed constraints.
[2024-06-01 01:01:27] [INFO ] Performed 510/2775 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 01:01:57] [INFO ] Performed 983/2775 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-06-01 01:02:27] [INFO ] Performed 1168/2775 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-06-01 01:02:58] [INFO ] Performed 1331/2775 implicitness test of which 0 returned IMPLICIT in 121 seconds.
[2024-06-01 01:02:58] [INFO ] Timeout of Implicit test with SMT after 121 seconds.
[2024-06-01 01:02:58] [INFO ] Implicit Places using invariants and state equation in 125415 ms returned []
Implicit Place search using SMT with State Equation took 130414 ms to find 0 implicit places.
[2024-06-01 01:02:59] [INFO ] Redundant transitions in 1050 ms returned []
Running 9038 sub problems to find dead transitions.
[2024-06-01 01:02:59] [INFO ] Flow matrix only has 8247 transitions (discarded 885 similar events)
[2024-06-01 01:02:59] [INFO ] Invariant cache hit.
[2024-06-01 01:02:59] [INFO ] State equation strengthened by 4989 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2772 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 9038 unsolved
SMT process timed out in 78476ms, After SMT, problems are : Problem set: 0 solved, 9038 unsolved
Search for dead transitions found 0 dead transitions in 78558ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 210466 ms. Remains : 2775/2775 places, 9132/9132 transitions.
RANDOM walk for 40000 steps (1363 resets) in 1408 ms. (28 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (106 resets) in 140 ms. (283 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (106 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 26656 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 2
Probabilistic random walk after 26656 steps, saw 11277 distinct states, run finished after 3003 ms. (steps per millisecond=8 ) properties seen :0
[2024-06-01 01:04:21] [INFO ] Flow matrix only has 8247 transitions (discarded 885 similar events)
[2024-06-01 01:04:21] [INFO ] Invariant cache hit.
[2024-06-01 01:04:21] [INFO ] State equation strengthened by 4989 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2658/2659 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2659 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/2685 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2685 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 36/2721 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 01:04:23] [INFO ] Deduced a trap composed of 5 places in 1955 ms of which 18 ms to minimize.
[2024-06-01 01:04:25] [INFO ] Deduced a trap composed of 39 places in 1967 ms of which 17 ms to minimize.
[2024-06-01 01:04:27] [INFO ] Deduced a trap composed of 39 places in 1838 ms of which 18 ms to minimize.
SMT process timed out in 6524ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2775 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2775/2775 places, 9132/9132 transitions.
Applied a total of 0 rules in 472 ms. Remains 2775 /2775 variables (removed 0) and now considering 9132/9132 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 474 ms. Remains : 2775/2775 places, 9132/9132 transitions.
RANDOM walk for 40000 steps (1362 resets) in 1302 ms. (30 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (106 resets) in 141 ms. (281 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (105 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 25852 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 2
Probabilistic random walk after 25852 steps, saw 10944 distinct states, run finished after 3002 ms. (steps per millisecond=8 ) properties seen :0
[2024-06-01 01:04:31] [INFO ] Flow matrix only has 8247 transitions (discarded 885 similar events)
[2024-06-01 01:04:31] [INFO ] Invariant cache hit.
[2024-06-01 01:04:31] [INFO ] State equation strengthened by 4989 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2658/2659 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2659 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/2685 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2685 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 36/2721 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 01:04:34] [INFO ] Deduced a trap composed of 5 places in 2053 ms of which 17 ms to minimize.
[2024-06-01 01:04:36] [INFO ] Deduced a trap composed of 39 places in 1925 ms of which 18 ms to minimize.
[2024-06-01 01:04:38] [INFO ] Deduced a trap composed of 39 places in 1916 ms of which 18 ms to minimize.
[2024-06-01 01:04:40] [INFO ] Deduced a trap composed of 232 places in 1979 ms of which 17 ms to minimize.
[2024-06-01 01:04:42] [INFO ] Deduced a trap composed of 89 places in 1955 ms of which 17 ms to minimize.
[2024-06-01 01:04:44] [INFO ] Deduced a trap composed of 191 places in 1962 ms of which 18 ms to minimize.
[2024-06-01 01:04:46] [INFO ] Deduced a trap composed of 164 places in 1896 ms of which 15 ms to minimize.
[2024-06-01 01:04:48] [INFO ] Deduced a trap composed of 188 places in 1925 ms of which 18 ms to minimize.
[2024-06-01 01:04:50] [INFO ] Deduced a trap composed of 167 places in 1928 ms of which 17 ms to minimize.
[2024-06-01 01:04:52] [INFO ] Deduced a trap composed of 166 places in 1870 ms of which 16 ms to minimize.
[2024-06-01 01:04:54] [INFO ] Deduced a trap composed of 167 places in 1911 ms of which 18 ms to minimize.
[2024-06-01 01:04:56] [INFO ] Deduced a trap composed of 167 places in 1843 ms of which 16 ms to minimize.
[2024-06-01 01:04:58] [INFO ] Deduced a trap composed of 191 places in 1984 ms of which 18 ms to minimize.
[2024-06-01 01:05:00] [INFO ] Deduced a trap composed of 191 places in 1913 ms of which 19 ms to minimize.
[2024-06-01 01:05:02] [INFO ] Deduced a trap composed of 191 places in 1910 ms of which 18 ms to minimize.
[2024-06-01 01:05:04] [INFO ] Deduced a trap composed of 169 places in 1956 ms of which 18 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/2721 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2721 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 44/2765 variables, 44/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2765 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/2775 variables, 10/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2775 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 8247/11022 variables, 2775/2850 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/11022 variables, 4989/7839 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/11022 variables, 0/7839 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/11022 variables, 0/7839 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11022/11022 variables, and 7839 constraints, problems are : Problem set: 0 solved, 2 unsolved in 38259 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 2775/2775 constraints, ReadFeed: 4989/4989 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2658/2659 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2659 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/2685 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 01:05:12] [INFO ] Deduced a trap composed of 163 places in 1986 ms of which 18 ms to minimize.
[2024-06-01 01:05:14] [INFO ] Deduced a trap composed of 523 places in 2010 ms of which 19 ms to minimize.
[2024-06-01 01:05:16] [INFO ] Deduced a trap composed of 116 places in 2002 ms of which 18 ms to minimize.
[2024-06-01 01:05:18] [INFO ] Deduced a trap composed of 99 places in 2087 ms of which 18 ms to minimize.
[2024-06-01 01:05:20] [INFO ] Deduced a trap composed of 189 places in 2040 ms of which 18 ms to minimize.
[2024-06-01 01:05:22] [INFO ] Deduced a trap composed of 270 places in 2044 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2685 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2685 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 36/2721 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2721 variables, 16/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 01:05:25] [INFO ] Deduced a trap composed of 87 places in 2095 ms of which 17 ms to minimize.
[2024-06-01 01:05:27] [INFO ] Deduced a trap composed of 104 places in 2045 ms of which 17 ms to minimize.
[2024-06-01 01:05:29] [INFO ] Deduced a trap composed of 98 places in 2068 ms of which 18 ms to minimize.
[2024-06-01 01:05:31] [INFO ] Deduced a trap composed of 91 places in 2173 ms of which 19 ms to minimize.
[2024-06-01 01:05:33] [INFO ] Deduced a trap composed of 104 places in 2232 ms of which 18 ms to minimize.
[2024-06-01 01:05:36] [INFO ] Deduced a trap composed of 92 places in 2110 ms of which 17 ms to minimize.
[2024-06-01 01:05:38] [INFO ] Deduced a trap composed of 92 places in 1951 ms of which 17 ms to minimize.
[2024-06-01 01:05:40] [INFO ] Deduced a trap composed of 99 places in 2114 ms of which 17 ms to minimize.
[2024-06-01 01:05:42] [INFO ] Deduced a trap composed of 112 places in 2001 ms of which 18 ms to minimize.
[2024-06-01 01:05:44] [INFO ] Deduced a trap composed of 109 places in 2141 ms of which 17 ms to minimize.
[2024-06-01 01:05:46] [INFO ] Deduced a trap composed of 94 places in 1973 ms of which 17 ms to minimize.
[2024-06-01 01:05:48] [INFO ] Deduced a trap composed of 87 places in 2025 ms of which 17 ms to minimize.
[2024-06-01 01:05:50] [INFO ] Deduced a trap composed of 168 places in 1799 ms of which 17 ms to minimize.
[2024-06-01 01:05:52] [INFO ] Deduced a trap composed of 179 places in 2092 ms of which 17 ms to minimize.
[2024-06-01 01:05:54] [INFO ] Deduced a trap composed of 108 places in 1947 ms of which 17 ms to minimize.
[2024-06-01 01:05:56] [INFO ] Deduced a trap composed of 168 places in 1954 ms of which 16 ms to minimize.
SMT process timed out in 84700ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 2775 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2775/2775 places, 9132/9132 transitions.
Applied a total of 0 rules in 424 ms. Remains 2775 /2775 variables (removed 0) and now considering 9132/9132 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 424 ms. Remains : 2775/2775 places, 9132/9132 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2775/2775 places, 9132/9132 transitions.
Applied a total of 0 rules in 423 ms. Remains 2775 /2775 variables (removed 0) and now considering 9132/9132 (removed 0) transitions.
[2024-06-01 01:05:57] [INFO ] Flow matrix only has 8247 transitions (discarded 885 similar events)
[2024-06-01 01:05:57] [INFO ] Invariant cache hit.
[2024-06-01 01:06:02] [INFO ] Implicit Places using invariants in 4895 ms returned []
[2024-06-01 01:06:02] [INFO ] Flow matrix only has 8247 transitions (discarded 885 similar events)
[2024-06-01 01:06:02] [INFO ] Invariant cache hit.
[2024-06-01 01:06:05] [INFO ] State equation strengthened by 4989 read => feed constraints.
[2024-06-01 01:06:36] [INFO ] Performed 511/2775 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 01:07:07] [INFO ] Performed 985/2775 implicitness test of which 0 returned IMPLICIT in 61 seconds.
[2024-06-01 01:07:38] [INFO ] Performed 1174/2775 implicitness test of which 0 returned IMPLICIT in 92 seconds.
[2024-06-01 01:08:08] [INFO ] Performed 1337/2775 implicitness test of which 0 returned IMPLICIT in 122 seconds.
[2024-06-01 01:08:08] [INFO ] Timeout of Implicit test with SMT after 122 seconds.
[2024-06-01 01:08:08] [INFO ] Implicit Places using invariants and state equation in 126369 ms returned []
Implicit Place search using SMT with State Equation took 131267 ms to find 0 implicit places.
[2024-06-01 01:08:09] [INFO ] Redundant transitions in 1068 ms returned []
Running 9038 sub problems to find dead transitions.
[2024-06-01 01:08:09] [INFO ] Flow matrix only has 8247 transitions (discarded 885 similar events)
[2024-06-01 01:08:09] [INFO ] Invariant cache hit.
[2024-06-01 01:08:09] [INFO ] State equation strengthened by 4989 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2772 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 9038 unsolved
SMT process timed out in 77234ms, After SMT, problems are : Problem set: 0 solved, 9038 unsolved
Search for dead transitions found 0 dead transitions in 77309ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 210097 ms. Remains : 2775/2775 places, 9132/9132 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-15 in 583142 ms.
[2024-06-01 01:09:27] [INFO ] Flatten gal took : 541 ms
[2024-06-01 01:09:27] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-06-01 01:09:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2787 places, 9158 transitions and 44821 arcs took 43 ms.
Total runtime 2089562 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-07
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-15

BK_STOP 1717204168113

--------------------
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 UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-07
ub formula formula --maxsum=/tmp/1214/ub_0_
ub formula name MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-15
ub formula formula --maxsum=/tmp/1214/ub_1_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-S24C05"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is MultiCrashLeafsetExtension-PT-S24C05, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r508-tall-171654350800085"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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