About the Execution of LTSMin+red for Szymanski-PT-b04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15968.443 | 528493.00 | 626499.00 | 1287.10 | 4 1 1 1 1 1 0 ? 4 ? 1 1 0 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.r536-tall-171690533300869.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 Szymanski-PT-b04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690533300869
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 15:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 11 15:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.7M May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Szymanski-PT-b04-UpperBounds-00
FORMULA_NAME Szymanski-PT-b04-UpperBounds-01
FORMULA_NAME Szymanski-PT-b04-UpperBounds-02
FORMULA_NAME Szymanski-PT-b04-UpperBounds-03
FORMULA_NAME Szymanski-PT-b04-UpperBounds-04
FORMULA_NAME Szymanski-PT-b04-UpperBounds-05
FORMULA_NAME Szymanski-PT-b04-UpperBounds-06
FORMULA_NAME Szymanski-PT-b04-UpperBounds-07
FORMULA_NAME Szymanski-PT-b04-UpperBounds-08
FORMULA_NAME Szymanski-PT-b04-UpperBounds-09
FORMULA_NAME Szymanski-PT-b04-UpperBounds-10
FORMULA_NAME Szymanski-PT-b04-UpperBounds-11
FORMULA_NAME Szymanski-PT-b04-UpperBounds-12
FORMULA_NAME Szymanski-PT-b04-UpperBounds-13
FORMULA_NAME Szymanski-PT-b04-UpperBounds-14
FORMULA_NAME Szymanski-PT-b04-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717282928060
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 23:02:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 23:02:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 23:02:09] [INFO ] Load time of PNML (sax parser for PT used): 386 ms
[2024-06-01 23:02:09] [INFO ] Transformed 568 places.
[2024-06-01 23:02:09] [INFO ] Transformed 8320 transitions.
[2024-06-01 23:02:09] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 537 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 260 places in 20 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b04-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[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]
Current structural bounds on expressions (Before main loop) : Max Seen:[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]
[2024-06-01 23:02:09] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2024-06-01 23:02:09] [INFO ] Computed 3 invariants in 56 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[9, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10003 steps (3 resets) in 78 ms. (126 steps per ms)
FORMULA Szymanski-PT-b04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b04-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90008 steps (24 resets) in 297 ms. (302 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 0, 0, 0, 3, 0, 0, 0, 0] Max Struct:[9, 1, 1, 1, 9, 1, 1, 1, 1]
[2024-06-01 23:02:10] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-06-01 23:02:10] [INFO ] Invariant cache hit.
[2024-06-01 23:02:10] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2024-06-01 23:02:10] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 23:02:11] [INFO ] [Real]Absence check using state equation in 611 ms returned sat
[2024-06-01 23:02:11] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:02:11] [INFO ] [Real]Added 147 Read/Feed constraints in 101 ms returned sat
[2024-06-01 23:02:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:02:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 30 ms returned sat
[2024-06-01 23:02:11] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 12 ms returned sat
[2024-06-01 23:02:12] [INFO ] [Nat]Absence check using state equation in 524 ms returned sat
[2024-06-01 23:02:12] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:02:13] [INFO ] [Nat]Added 147 Read/Feed constraints in 1045 ms returned unknown
[2024-06-01 23:02:13] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 23:02:13] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 23:02:13] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2024-06-01 23:02:14] [INFO ] [Real]Added 147 Read/Feed constraints in 77 ms returned sat
[2024-06-01 23:02:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:02:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 23:02:14] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 23:02:14] [INFO ] [Nat]Absence check using state equation in 467 ms returned sat
[2024-06-01 23:02:15] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:02:15] [INFO ] [Nat]Added 147 Read/Feed constraints in 1057 ms returned unknown
[2024-06-01 23:02:15] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 23:02:15] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 23:02:16] [INFO ] [Real]Absence check using state equation in 459 ms returned sat
[2024-06-01 23:02:16] [INFO ] [Real]Added 147 Read/Feed constraints in 108 ms returned sat
[2024-06-01 23:02:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:02:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 23:02:16] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 23:02:16] [INFO ] [Nat]Absence check using state equation in 442 ms returned sat
[2024-06-01 23:02:17] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:02:17] [INFO ] [Nat]Added 147 Read/Feed constraints in 1049 ms returned unknown
[2024-06-01 23:02:17] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2024-06-01 23:02:17] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 23:02:18] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2024-06-01 23:02:19] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:02:19] [INFO ] [Real]Added 147 Read/Feed constraints in 634 ms returned sat
[2024-06-01 23:02:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:02:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 23:02:19] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 23:02:19] [INFO ] [Nat]Absence check using state equation in 418 ms returned sat
[2024-06-01 23:02:20] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:02:20] [INFO ] [Nat]Added 147 Read/Feed constraints in 1055 ms returned unknown
[2024-06-01 23:02:20] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 23:02:20] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 23:02:21] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2024-06-01 23:02:21] [INFO ] [Real]Added 147 Read/Feed constraints in 76 ms returned sat
[2024-06-01 23:02:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:02:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 23:02:21] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 23:02:21] [INFO ] [Nat]Absence check using state equation in 453 ms returned sat
[2024-06-01 23:02:22] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:02:22] [INFO ] [Nat]Added 147 Read/Feed constraints in 1039 ms returned unknown
[2024-06-01 23:02:23] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 23:02:23] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 23:02:23] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2024-06-01 23:02:23] [INFO ] [Real]Added 147 Read/Feed constraints in 167 ms returned sat
[2024-06-01 23:02:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:02:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 23:02:23] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 23:02:24] [INFO ] [Nat]Absence check using state equation in 436 ms returned sat
[2024-06-01 23:02:24] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:02:25] [INFO ] [Nat]Added 147 Read/Feed constraints in 1037 ms returned unknown
[2024-06-01 23:02:25] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 23:02:25] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 23:02:25] [INFO ] [Real]Absence check using state equation in 470 ms returned sat
[2024-06-01 23:02:26] [INFO ] [Real]Added 147 Read/Feed constraints in 413 ms returned sat
[2024-06-01 23:02:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:02:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 23:02:26] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 23:02:26] [INFO ] [Nat]Absence check using state equation in 443 ms returned sat
[2024-06-01 23:02:27] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:02:27] [INFO ] [Nat]Added 147 Read/Feed constraints in 1039 ms returned unknown
[2024-06-01 23:02:27] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 23:02:27] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 23:02:28] [INFO ] [Real]Absence check using state equation in 415 ms returned sat
[2024-06-01 23:02:28] [INFO ] [Real]Added 147 Read/Feed constraints in 374 ms returned sat
[2024-06-01 23:02:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:02:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-06-01 23:02:28] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 23:02:29] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2024-06-01 23:02:29] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:02:30] [INFO ] [Nat]Added 147 Read/Feed constraints in 1061 ms returned unknown
[2024-06-01 23:02:30] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 23:02:30] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 23:02:30] [INFO ] [Real]Absence check using state equation in 527 ms returned sat
[2024-06-01 23:02:31] [INFO ] [Real]Added 147 Read/Feed constraints in 369 ms returned sat
[2024-06-01 23:02:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:02:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 23:02:31] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 23:02:31] [INFO ] [Nat]Absence check using state equation in 490 ms returned sat
[2024-06-01 23:02:32] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:02:33] [INFO ] [Nat]Added 147 Read/Feed constraints in 1050 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[4, 0, 0, 0, 3, 0, 0, 0, 0] Max Struct:[9, 1, 1, 1, 9, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 0, 0, 0, 3, 0, 0, 0, 0] Max Struct:[9, 1, 1, 1, 9, 1, 1, 1, 1]
Support contains 9 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Graph (complete) has 9195 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 129 place count 306 transition count 7936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 305 transition count 7808
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 305 transition count 7808
Applied a total of 131 rules in 495 ms. Remains 305 /308 variables (removed 3) and now considering 7808/8064 (removed 256) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 507 ms. Remains : 305/308 places, 7808/8064 transitions.
[2024-06-01 23:02:33] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-06-01 23:02:33] [INFO ] Computed 3 invariants in 28 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4, 0, 0, 0, 3, 0, 0, 0, 0] Max Struct:[5, 1, 1, 1, 4, 1, 1, 1, 1]
RANDOM walk for 1000002 steps (2 resets) in 1704 ms. (586 steps per ms)
FORMULA Szymanski-PT-b04-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 7000005 steps (14 resets) in 6106 ms. (1146 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 0, 0, 0, 0, 0, 0] Max Struct:[5, 1, 1, 1, 1, 1, 1]
[2024-06-01 23:02:41] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:02:41] [INFO ] Invariant cache hit.
[2024-06-01 23:02:41] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:02:41] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2024-06-01 23:02:41] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:02:42] [INFO ] [Real]Added 147 Read/Feed constraints in 149 ms returned sat
[2024-06-01 23:02:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:02:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:02:42] [INFO ] [Nat]Absence check using state equation in 403 ms returned sat
[2024-06-01 23:02:47] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:02:51] [INFO ] [Nat]Added 147 Read/Feed constraints in 9039 ms returned unknown
[2024-06-01 23:02:51] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:02:52] [INFO ] [Real]Absence check using state equation in 375 ms returned sat
[2024-06-01 23:02:52] [INFO ] [Real]Added 147 Read/Feed constraints in 90 ms returned sat
[2024-06-01 23:02:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:02:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 23:02:52] [INFO ] [Nat]Absence check using state equation in 396 ms returned sat
[2024-06-01 23:02:54] [INFO ] [Nat]Added 147 Read/Feed constraints in 1790 ms returned sat
[2024-06-01 23:02:54] [INFO ] Deduced a trap composed of 138 places in 378 ms of which 14 ms to minimize.
[2024-06-01 23:02:55] [INFO ] Deduced a trap composed of 137 places in 408 ms of which 3 ms to minimize.
[2024-06-01 23:02:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 988 ms
[2024-06-01 23:02:56] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 602 ms.
[2024-06-01 23:02:56] [INFO ] Added : 0 causal constraints over 0 iterations in 761 ms. Result :sat
Minimization took 4959 ms.
[2024-06-01 23:03:01] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:03:01] [INFO ] [Real]Absence check using state equation in 382 ms returned sat
[2024-06-01 23:03:01] [INFO ] [Real]Added 147 Read/Feed constraints in 100 ms returned sat
[2024-06-01 23:03:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:03:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:03:02] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2024-06-01 23:03:02] [INFO ] [Nat]Added 147 Read/Feed constraints in 470 ms returned sat
[2024-06-01 23:03:03] [INFO ] Deduced a trap composed of 78 places in 593 ms of which 4 ms to minimize.
[2024-06-01 23:03:04] [INFO ] Deduced a trap composed of 129 places in 601 ms of which 5 ms to minimize.
[2024-06-01 23:03:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1376 ms
[2024-06-01 23:03:04] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 526 ms.
[2024-06-01 23:03:04] [INFO ] Added : 0 causal constraints over 0 iterations in 694 ms. Result :sat
Minimization took 4961 ms.
[2024-06-01 23:03:10] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:03:10] [INFO ] [Real]Absence check using state equation in 416 ms returned sat
[2024-06-01 23:03:10] [INFO ] [Real]Added 147 Read/Feed constraints in 78 ms returned sat
[2024-06-01 23:03:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:03:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:03:11] [INFO ] [Nat]Absence check using state equation in 393 ms returned sat
[2024-06-01 23:03:13] [INFO ] [Nat]Added 147 Read/Feed constraints in 2310 ms returned sat
[2024-06-01 23:03:13] [INFO ] Deduced a trap composed of 137 places in 384 ms of which 2 ms to minimize.
[2024-06-01 23:03:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 506 ms
[2024-06-01 23:03:14] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 357 ms.
[2024-06-01 23:03:14] [INFO ] Added : 0 causal constraints over 0 iterations in 527 ms. Result :sat
Minimization took 4979 ms.
[2024-06-01 23:03:19] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 23:03:19] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2024-06-01 23:03:19] [INFO ] [Real]Added 147 Read/Feed constraints in 89 ms returned sat
[2024-06-01 23:03:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:03:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:03:20] [INFO ] [Nat]Absence check using state equation in 389 ms returned sat
[2024-06-01 23:03:22] [INFO ] [Nat]Added 147 Read/Feed constraints in 1806 ms returned sat
[2024-06-01 23:03:22] [INFO ] Deduced a trap composed of 137 places in 599 ms of which 2 ms to minimize.
[2024-06-01 23:03:23] [INFO ] Deduced a trap composed of 129 places in 616 ms of which 3 ms to minimize.
[2024-06-01 23:03:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1431 ms
[2024-06-01 23:03:24] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 552 ms.
[2024-06-01 23:03:24] [INFO ] Added : 0 causal constraints over 0 iterations in 719 ms. Result :sat
Minimization took 4958 ms.
[2024-06-01 23:03:29] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:03:29] [INFO ] [Real]Absence check using state equation in 402 ms returned sat
[2024-06-01 23:03:30] [INFO ] [Real]Added 147 Read/Feed constraints in 161 ms returned sat
[2024-06-01 23:03:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:03:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:03:30] [INFO ] [Nat]Absence check using state equation in 416 ms returned sat
[2024-06-01 23:03:32] [INFO ] [Nat]Added 147 Read/Feed constraints in 1743 ms returned sat
[2024-06-01 23:03:32] [INFO ] Deduced a trap composed of 135 places in 622 ms of which 3 ms to minimize.
[2024-06-01 23:03:33] [INFO ] Deduced a trap composed of 136 places in 587 ms of which 2 ms to minimize.
[2024-06-01 23:03:34] [INFO ] Deduced a trap composed of 132 places in 601 ms of which 2 ms to minimize.
[2024-06-01 23:03:35] [INFO ] Deduced a trap composed of 137 places in 617 ms of which 2 ms to minimize.
[2024-06-01 23:03:35] [INFO ] Deduced a trap composed of 132 places in 604 ms of which 2 ms to minimize.
[2024-06-01 23:03:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3483 ms
[2024-06-01 23:03:36] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 366 ms.
[2024-06-01 23:03:36] [INFO ] Added : 0 causal constraints over 0 iterations in 589 ms. Result :sat
Minimization took 5091 ms.
[2024-06-01 23:03:41] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:03:41] [INFO ] [Real]Absence check using state equation in 416 ms returned sat
[2024-06-01 23:03:42] [INFO ] [Real]Added 147 Read/Feed constraints in 84 ms returned sat
[2024-06-01 23:03:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:03:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:03:42] [INFO ] [Nat]Absence check using state equation in 438 ms returned sat
[2024-06-01 23:03:43] [INFO ] [Nat]Added 147 Read/Feed constraints in 1079 ms returned sat
[2024-06-01 23:03:44] [INFO ] Deduced a trap composed of 111 places in 606 ms of which 2 ms to minimize.
[2024-06-01 23:03:44] [INFO ] Deduced a trap composed of 78 places in 576 ms of which 3 ms to minimize.
[2024-06-01 23:03:45] [INFO ] Deduced a trap composed of 84 places in 599 ms of which 3 ms to minimize.
[2024-06-01 23:03:46] [INFO ] Deduced a trap composed of 140 places in 595 ms of which 2 ms to minimize.
[2024-06-01 23:03:47] [INFO ] Deduced a trap composed of 135 places in 574 ms of which 5 ms to minimize.
[2024-06-01 23:03:47] [INFO ] Deduced a trap composed of 132 places in 578 ms of which 3 ms to minimize.
[2024-06-01 23:03:47] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4215 ms
[2024-06-01 23:03:48] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 330 ms.
[2024-06-01 23:03:48] [INFO ] Added : 0 causal constraints over 0 iterations in 507 ms. Result :sat
Minimization took 5099 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 0, 0, 0, 0, 0, 0] Max Struct:[5, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 0, 0, 0, 0, 0, 0] Max Struct:[5, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 282 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 282 ms. Remains : 305/305 places, 7808/7808 transitions.
[2024-06-01 23:03:53] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:03:53] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4, 0, 0, 0, 0, 0, 0] Max Struct:[5, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000001 steps (2 resets) in 1903 ms. (525 steps per ms)
BEST_FIRST walk for 7000006 steps (14 resets) in 6304 ms. (1110 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 0, 0, 0, 0, 0, 0] Max Struct:[5, 1, 1, 1, 1, 1, 1]
[2024-06-01 23:04:02] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:04:02] [INFO ] Invariant cache hit.
[2024-06-01 23:04:02] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:04:02] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
[2024-06-01 23:04:02] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:04:02] [INFO ] [Real]Added 147 Read/Feed constraints in 150 ms returned sat
[2024-06-01 23:04:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:04:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:04:03] [INFO ] [Nat]Absence check using state equation in 410 ms returned sat
[2024-06-01 23:04:07] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:04:12] [INFO ] [Nat]Added 147 Read/Feed constraints in 9047 ms returned unknown
[2024-06-01 23:04:12] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2024-06-01 23:04:12] [INFO ] [Real]Absence check using state equation in 382 ms returned sat
[2024-06-01 23:04:12] [INFO ] [Real]Added 147 Read/Feed constraints in 93 ms returned sat
[2024-06-01 23:04:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:04:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 23:04:13] [INFO ] [Nat]Absence check using state equation in 405 ms returned sat
[2024-06-01 23:04:15] [INFO ] [Nat]Added 147 Read/Feed constraints in 1833 ms returned sat
[2024-06-01 23:04:15] [INFO ] Deduced a trap composed of 138 places in 422 ms of which 2 ms to minimize.
[2024-06-01 23:04:16] [INFO ] Deduced a trap composed of 137 places in 363 ms of which 2 ms to minimize.
[2024-06-01 23:04:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 962 ms
[2024-06-01 23:04:16] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 339 ms.
[2024-06-01 23:04:16] [INFO ] Added : 0 causal constraints over 0 iterations in 504 ms. Result :sat
Minimization took 4916 ms.
[2024-06-01 23:04:21] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:04:22] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2024-06-01 23:04:22] [INFO ] [Real]Added 147 Read/Feed constraints in 104 ms returned sat
[2024-06-01 23:04:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:04:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 23:04:22] [INFO ] [Nat]Absence check using state equation in 422 ms returned sat
[2024-06-01 23:04:23] [INFO ] [Nat]Added 147 Read/Feed constraints in 489 ms returned sat
[2024-06-01 23:04:23] [INFO ] Deduced a trap composed of 78 places in 587 ms of which 2 ms to minimize.
[2024-06-01 23:04:24] [INFO ] Deduced a trap composed of 129 places in 664 ms of which 2 ms to minimize.
[2024-06-01 23:04:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1419 ms
[2024-06-01 23:04:25] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 331 ms.
[2024-06-01 23:04:25] [INFO ] Added : 0 causal constraints over 0 iterations in 499 ms. Result :sat
Minimization took 4929 ms.
[2024-06-01 23:04:30] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:04:30] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2024-06-01 23:04:30] [INFO ] [Real]Added 147 Read/Feed constraints in 71 ms returned sat
[2024-06-01 23:04:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:04:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:04:31] [INFO ] [Nat]Absence check using state equation in 381 ms returned sat
[2024-06-01 23:04:33] [INFO ] [Nat]Added 147 Read/Feed constraints in 2298 ms returned sat
[2024-06-01 23:04:33] [INFO ] Deduced a trap composed of 137 places in 383 ms of which 1 ms to minimize.
[2024-06-01 23:04:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 506 ms
[2024-06-01 23:04:34] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 340 ms.
[2024-06-01 23:04:34] [INFO ] Added : 0 causal constraints over 0 iterations in 504 ms. Result :sat
Minimization took 4927 ms.
[2024-06-01 23:04:39] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:04:39] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2024-06-01 23:04:40] [INFO ] [Real]Added 147 Read/Feed constraints in 91 ms returned sat
[2024-06-01 23:04:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:04:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:04:40] [INFO ] [Nat]Absence check using state equation in 419 ms returned sat
[2024-06-01 23:04:42] [INFO ] [Nat]Added 147 Read/Feed constraints in 1874 ms returned sat
[2024-06-01 23:04:43] [INFO ] Deduced a trap composed of 137 places in 582 ms of which 6 ms to minimize.
[2024-06-01 23:04:43] [INFO ] Deduced a trap composed of 129 places in 576 ms of which 3 ms to minimize.
[2024-06-01 23:04:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1377 ms
[2024-06-01 23:04:44] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 338 ms.
[2024-06-01 23:04:44] [INFO ] Added : 0 causal constraints over 0 iterations in 501 ms. Result :sat
Minimization took 4914 ms.
[2024-06-01 23:04:49] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:04:49] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2024-06-01 23:04:49] [INFO ] [Real]Added 147 Read/Feed constraints in 155 ms returned sat
[2024-06-01 23:04:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:04:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:04:50] [INFO ] [Nat]Absence check using state equation in 398 ms returned sat
[2024-06-01 23:04:52] [INFO ] [Nat]Added 147 Read/Feed constraints in 1683 ms returned sat
[2024-06-01 23:04:52] [INFO ] Deduced a trap composed of 135 places in 598 ms of which 2 ms to minimize.
[2024-06-01 23:04:53] [INFO ] Deduced a trap composed of 136 places in 585 ms of which 16 ms to minimize.
[2024-06-01 23:04:54] [INFO ] Deduced a trap composed of 132 places in 574 ms of which 2 ms to minimize.
[2024-06-01 23:04:54] [INFO ] Deduced a trap composed of 137 places in 599 ms of which 2 ms to minimize.
[2024-06-01 23:04:55] [INFO ] Deduced a trap composed of 132 places in 633 ms of which 2 ms to minimize.
[2024-06-01 23:04:55] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3402 ms
[2024-06-01 23:04:55] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 319 ms.
[2024-06-01 23:04:55] [INFO ] Added : 0 causal constraints over 0 iterations in 477 ms. Result :sat
Minimization took 4912 ms.
[2024-06-01 23:05:00] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 23:05:01] [INFO ] [Real]Absence check using state equation in 389 ms returned sat
[2024-06-01 23:05:01] [INFO ] [Real]Added 147 Read/Feed constraints in 79 ms returned sat
[2024-06-01 23:05:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:05:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 23:05:01] [INFO ] [Nat]Absence check using state equation in 372 ms returned sat
[2024-06-01 23:05:02] [INFO ] [Nat]Added 147 Read/Feed constraints in 1028 ms returned sat
[2024-06-01 23:05:03] [INFO ] Deduced a trap composed of 111 places in 592 ms of which 3 ms to minimize.
[2024-06-01 23:05:04] [INFO ] Deduced a trap composed of 78 places in 600 ms of which 2 ms to minimize.
[2024-06-01 23:05:04] [INFO ] Deduced a trap composed of 84 places in 547 ms of which 2 ms to minimize.
[2024-06-01 23:05:05] [INFO ] Deduced a trap composed of 140 places in 548 ms of which 2 ms to minimize.
[2024-06-01 23:05:06] [INFO ] Deduced a trap composed of 135 places in 572 ms of which 5 ms to minimize.
[2024-06-01 23:05:06] [INFO ] Deduced a trap composed of 132 places in 529 ms of which 2 ms to minimize.
[2024-06-01 23:05:07] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4055 ms
[2024-06-01 23:05:07] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 325 ms.
[2024-06-01 23:05:07] [INFO ] Added : 0 causal constraints over 0 iterations in 496 ms. Result :sat
Minimization took 4908 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 0, 0, 0, 0, 0, 0] Max Struct:[5, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 0, 0, 0, 0, 0, 0] Max Struct:[5, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 264 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 267 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 244 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-06-01 23:05:12] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:05:12] [INFO ] Invariant cache hit.
[2024-06-01 23:05:13] [INFO ] Implicit Places using invariants in 644 ms returned []
[2024-06-01 23:05:13] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:05:13] [INFO ] Invariant cache hit.
[2024-06-01 23:05:14] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:05:40] [INFO ] Implicit Places using invariants and state equation in 27237 ms returned []
Implicit Place search using SMT with State Equation took 27884 ms to find 0 implicit places.
[2024-06-01 23:05:41] [INFO ] Redundant transitions in 1011 ms returned []
Running 7806 sub problems to find dead transitions.
[2024-06-01 23:05:42] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:05:42] [INFO ] Invariant cache hit.
[2024-06-01 23:05:42] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/2909 variables, and 3 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30172 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7806/7806 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7806 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2024-06-01 23:06:43] [INFO ] Deduced a trap composed of 138 places in 509 ms of which 2 ms to minimize.
[2024-06-01 23:06:45] [INFO ] Deduced a trap composed of 31 places in 470 ms of which 2 ms to minimize.
[2024-06-01 23:06:45] [INFO ] Deduced a trap composed of 106 places in 465 ms of which 2 ms to minimize.
[2024-06-01 23:06:46] [INFO ] Deduced a trap composed of 104 places in 507 ms of which 2 ms to minimize.
[2024-06-01 23:06:46] [INFO ] Deduced a trap composed of 37 places in 384 ms of which 2 ms to minimize.
[2024-06-01 23:06:47] [INFO ] Deduced a trap composed of 59 places in 389 ms of which 2 ms to minimize.
[2024-06-01 23:06:47] [INFO ] Deduced a trap composed of 42 places in 391 ms of which 2 ms to minimize.
[2024-06-01 23:06:47] [INFO ] Deduced a trap composed of 50 places in 375 ms of which 2 ms to minimize.
[2024-06-01 23:06:48] [INFO ] Deduced a trap composed of 42 places in 388 ms of which 2 ms to minimize.
[2024-06-01 23:06:48] [INFO ] Deduced a trap composed of 47 places in 389 ms of which 2 ms to minimize.
[2024-06-01 23:06:49] [INFO ] Deduced a trap composed of 62 places in 488 ms of which 2 ms to minimize.
[2024-06-01 23:06:49] [INFO ] Deduced a trap composed of 78 places in 480 ms of which 2 ms to minimize.
[2024-06-01 23:06:50] [INFO ] Deduced a trap composed of 48 places in 449 ms of which 2 ms to minimize.
[2024-06-01 23:06:50] [INFO ] Deduced a trap composed of 75 places in 395 ms of which 2 ms to minimize.
[2024-06-01 23:06:50] [INFO ] Deduced a trap composed of 42 places in 314 ms of which 3 ms to minimize.
[2024-06-01 23:06:51] [INFO ] Deduced a trap composed of 47 places in 300 ms of which 2 ms to minimize.
[2024-06-01 23:06:51] [INFO ] Deduced a trap composed of 50 places in 459 ms of which 2 ms to minimize.
[2024-06-01 23:06:52] [INFO ] Deduced a trap composed of 97 places in 440 ms of which 2 ms to minimize.
[2024-06-01 23:06:52] [INFO ] Deduced a trap composed of 64 places in 338 ms of which 2 ms to minimize.
[2024-06-01 23:06:53] [INFO ] Deduced a trap composed of 72 places in 447 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2024-06-01 23:06:57] [INFO ] Deduced a trap composed of 44 places in 523 ms of which 2 ms to minimize.
[2024-06-01 23:06:58] [INFO ] Deduced a trap composed of 57 places in 466 ms of which 2 ms to minimize.
[2024-06-01 23:06:58] [INFO ] Deduced a trap composed of 57 places in 446 ms of which 2 ms to minimize.
[2024-06-01 23:06:59] [INFO ] Deduced a trap composed of 72 places in 412 ms of which 2 ms to minimize.
[2024-06-01 23:06:59] [INFO ] Deduced a trap composed of 115 places in 451 ms of which 2 ms to minimize.
[2024-06-01 23:07:00] [INFO ] Deduced a trap composed of 114 places in 454 ms of which 2 ms to minimize.
[2024-06-01 23:07:00] [INFO ] Deduced a trap composed of 101 places in 377 ms of which 2 ms to minimize.
[2024-06-01 23:07:00] [INFO ] Deduced a trap composed of 114 places in 401 ms of which 2 ms to minimize.
[2024-06-01 23:07:01] [INFO ] Deduced a trap composed of 113 places in 438 ms of which 2 ms to minimize.
[2024-06-01 23:07:02] [INFO ] Deduced a trap composed of 125 places in 523 ms of which 2 ms to minimize.
[2024-06-01 23:07:03] [INFO ] Deduced a trap composed of 58 places in 438 ms of which 2 ms to minimize.
[2024-06-01 23:07:09] [INFO ] Deduced a trap composed of 86 places in 469 ms of which 2 ms to minimize.
SMT process timed out in 87607ms, After SMT, problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 87722ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116941 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40010 steps (8 resets) in 953 ms. (41 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 242 ms. (164 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 178 ms. (223 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 106 ms. (373 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 114 ms. (347 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 100 ms. (396 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 123 ms. (322 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 125 ms. (317 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 104 ms. (380 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 107 ms. (370 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 110 ms. (360 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 127541 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 14
Probabilistic random walk after 127541 steps, saw 48547 distinct states, run finished after 3004 ms. (steps per millisecond=42 ) properties seen :0
[2024-06-01 23:07:13] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:07:13] [INFO ] Invariant cache hit.
[2024-06-01 23:07:13] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 279/286 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 23:07:14] [INFO ] Deduced a trap composed of 75 places in 507 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
Problem MIN0 is UNSAT
[2024-06-01 23:07:14] [INFO ] Deduced a trap composed of 131 places in 461 ms of which 2 ms to minimize.
[2024-06-01 23:07:15] [INFO ] Deduced a trap composed of 130 places in 509 ms of which 2 ms to minimize.
[2024-06-01 23:07:15] [INFO ] Deduced a trap composed of 137 places in 455 ms of which 2 ms to minimize.
[2024-06-01 23:07:16] [INFO ] Deduced a trap composed of 130 places in 484 ms of which 2 ms to minimize.
[2024-06-01 23:07:16] [INFO ] Deduced a trap composed of 134 places in 382 ms of which 1 ms to minimize.
[2024-06-01 23:07:17] [INFO ] Deduced a trap composed of 195 places in 392 ms of which 2 ms to minimize.
[2024-06-01 23:07:17] [INFO ] Deduced a trap composed of 74 places in 408 ms of which 2 ms to minimize.
[2024-06-01 23:07:17] [INFO ] Deduced a trap composed of 103 places in 377 ms of which 2 ms to minimize.
[2024-06-01 23:07:18] [INFO ] Deduced a trap composed of 88 places in 400 ms of which 2 ms to minimize.
[2024-06-01 23:07:18] [INFO ] Deduced a trap composed of 59 places in 377 ms of which 2 ms to minimize.
SMT process timed out in 5193ms, After SMT, problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 203 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40007 steps (8 resets) in 183 ms. (217 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 10/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 164 ms. (242 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 77 ms. (512 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 57 ms. (689 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 58 ms. (678 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 10/10 properties
[2024-06-01 23:07:19] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:07:19] [INFO ] Invariant cache hit.
[2024-06-01 23:07:19] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 251/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 23:07:20] [INFO ] Deduced a trap composed of 72 places in 505 ms of which 2 ms to minimize.
[2024-06-01 23:07:20] [INFO ] Deduced a trap composed of 101 places in 492 ms of which 2 ms to minimize.
[2024-06-01 23:07:21] [INFO ] Deduced a trap composed of 131 places in 443 ms of which 1 ms to minimize.
[2024-06-01 23:07:21] [INFO ] Deduced a trap composed of 74 places in 437 ms of which 3 ms to minimize.
[2024-06-01 23:07:22] [INFO ] Deduced a trap composed of 134 places in 481 ms of which 2 ms to minimize.
[2024-06-01 23:07:22] [INFO ] Deduced a trap composed of 134 places in 442 ms of which 2 ms to minimize.
[2024-06-01 23:07:23] [INFO ] Deduced a trap composed of 103 places in 430 ms of which 2 ms to minimize.
[2024-06-01 23:07:23] [INFO ] Deduced a trap composed of 195 places in 422 ms of which 2 ms to minimize.
[2024-06-01 23:07:24] [INFO ] Deduced a trap composed of 132 places in 434 ms of which 2 ms to minimize.
[2024-06-01 23:07:24] [INFO ] Deduced a trap composed of 45 places in 475 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 2604/2909 variables, 305/318 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 147/465 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/2909 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 465 constraints, problems are : Problem set: 0 solved, 10 unsolved in 15998 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 251/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 23:07:36] [INFO ] Deduced a trap composed of 131 places in 467 ms of which 2 ms to minimize.
[2024-06-01 23:07:36] [INFO ] Deduced a trap composed of 140 places in 246 ms of which 1 ms to minimize.
[2024-06-01 23:07:37] [INFO ] Deduced a trap composed of 138 places in 406 ms of which 2 ms to minimize.
[2024-06-01 23:07:37] [INFO ] Deduced a trap composed of 59 places in 361 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 19/305 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 2604/2909 variables, 305/322 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 147/469 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 10/479 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2909 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 0/2909 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 479 constraints, problems are : Problem set: 0 solved, 10 unsolved in 9797 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 14/14 constraints]
After SMT, in 25826ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 1644 ms.
Support contains 5 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 208 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40009 steps (8 resets) in 173 ms. (229 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 71 ms. (555 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 56 ms. (701 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 62 ms. (634 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 63 ms. (625 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 128806 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 10
Probabilistic random walk after 128806 steps, saw 49501 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
[2024-06-01 23:07:50] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:07:50] [INFO ] Invariant cache hit.
[2024-06-01 23:07:50] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 251/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 23:07:51] [INFO ] Deduced a trap composed of 72 places in 470 ms of which 2 ms to minimize.
[2024-06-01 23:07:51] [INFO ] Deduced a trap composed of 101 places in 460 ms of which 3 ms to minimize.
[2024-06-01 23:07:52] [INFO ] Deduced a trap composed of 131 places in 452 ms of which 2 ms to minimize.
[2024-06-01 23:07:52] [INFO ] Deduced a trap composed of 74 places in 461 ms of which 2 ms to minimize.
[2024-06-01 23:07:53] [INFO ] Deduced a trap composed of 134 places in 448 ms of which 2 ms to minimize.
[2024-06-01 23:07:53] [INFO ] Deduced a trap composed of 134 places in 401 ms of which 2 ms to minimize.
[2024-06-01 23:07:54] [INFO ] Deduced a trap composed of 103 places in 478 ms of which 3 ms to minimize.
[2024-06-01 23:07:54] [INFO ] Deduced a trap composed of 195 places in 451 ms of which 2 ms to minimize.
[2024-06-01 23:07:55] [INFO ] Deduced a trap composed of 132 places in 485 ms of which 4 ms to minimize.
[2024-06-01 23:07:55] [INFO ] Deduced a trap composed of 45 places in 437 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 2604/2909 variables, 305/318 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 147/465 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/2909 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 465 constraints, problems are : Problem set: 0 solved, 10 unsolved in 15781 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 251/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 23:08:07] [INFO ] Deduced a trap composed of 131 places in 449 ms of which 2 ms to minimize.
[2024-06-01 23:08:07] [INFO ] Deduced a trap composed of 140 places in 242 ms of which 1 ms to minimize.
[2024-06-01 23:08:07] [INFO ] Deduced a trap composed of 138 places in 419 ms of which 2 ms to minimize.
[2024-06-01 23:08:08] [INFO ] Deduced a trap composed of 59 places in 375 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 19/305 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 2604/2909 variables, 305/322 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 147/469 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 10/479 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2909 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 0/2909 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 479 constraints, problems are : Problem set: 0 solved, 10 unsolved in 9459 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 14/14 constraints]
After SMT, in 25267ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 5 different solutions.
Parikh walk visited 2 properties in 1668 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 209 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40005 steps (8 resets) in 176 ms. (226 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 95 ms. (416 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 63 ms. (625 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 55 ms. (714 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 57 ms. (689 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 132193 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 8
Probabilistic random walk after 132193 steps, saw 51857 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
[2024-06-01 23:08:20] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:08:20] [INFO ] Invariant cache hit.
[2024-06-01 23:08:20] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 252/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 23:08:21] [INFO ] Deduced a trap composed of 48 places in 496 ms of which 2 ms to minimize.
[2024-06-01 23:08:22] [INFO ] Deduced a trap composed of 72 places in 486 ms of which 2 ms to minimize.
[2024-06-01 23:08:22] [INFO ] Deduced a trap composed of 131 places in 448 ms of which 2 ms to minimize.
[2024-06-01 23:08:23] [INFO ] Deduced a trap composed of 79 places in 485 ms of which 2 ms to minimize.
[2024-06-01 23:08:23] [INFO ] Deduced a trap composed of 134 places in 436 ms of which 2 ms to minimize.
[2024-06-01 23:08:24] [INFO ] Deduced a trap composed of 137 places in 444 ms of which 2 ms to minimize.
[2024-06-01 23:08:24] [INFO ] Deduced a trap composed of 129 places in 443 ms of which 3 ms to minimize.
[2024-06-01 23:08:24] [INFO ] Deduced a trap composed of 138 places in 433 ms of which 2 ms to minimize.
[2024-06-01 23:08:25] [INFO ] Deduced a trap composed of 103 places in 422 ms of which 2 ms to minimize.
[2024-06-01 23:08:25] [INFO ] Deduced a trap composed of 134 places in 269 ms of which 1 ms to minimize.
[2024-06-01 23:08:26] [INFO ] Deduced a trap composed of 195 places in 398 ms of which 2 ms to minimize.
[2024-06-01 23:08:26] [INFO ] Deduced a trap composed of 58 places in 413 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 2604/2909 variables, 305/320 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 147/467 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 23:08:31] [INFO ] Deduced a trap composed of 181 places in 516 ms of which 2 ms to minimize.
[2024-06-01 23:08:31] [INFO ] Deduced a trap composed of 93 places in 504 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 2/469 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/2909 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 469 constraints, problems are : Problem set: 0 solved, 8 unsolved in 17880 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 252/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 23:08:39] [INFO ] Deduced a trap composed of 59 places in 432 ms of which 2 ms to minimize.
[2024-06-01 23:08:40] [INFO ] Deduced a trap composed of 72 places in 353 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 19/305 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 2604/2909 variables, 305/324 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 147/471 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2909 variables, 8/479 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2909 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/2909 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 479 constraints, problems are : Problem set: 0 solved, 8 unsolved in 8897 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 16/16 constraints]
After SMT, in 26824ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 329 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 195 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 183 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-06-01 23:08:48] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:08:48] [INFO ] Invariant cache hit.
[2024-06-01 23:08:49] [INFO ] Implicit Places using invariants in 558 ms returned []
[2024-06-01 23:08:49] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:08:49] [INFO ] Invariant cache hit.
[2024-06-01 23:08:49] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:09:14] [INFO ] Implicit Places using invariants and state equation in 25943 ms returned []
Implicit Place search using SMT with State Equation took 26515 ms to find 0 implicit places.
[2024-06-01 23:09:15] [INFO ] Redundant transitions in 886 ms returned []
Running 7806 sub problems to find dead transitions.
[2024-06-01 23:09:15] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:09:15] [INFO ] Invariant cache hit.
[2024-06-01 23:09:16] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/2909 variables, and 3 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30124 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7806/7806 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7806 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2024-06-01 23:10:17] [INFO ] Deduced a trap composed of 138 places in 472 ms of which 2 ms to minimize.
[2024-06-01 23:10:19] [INFO ] Deduced a trap composed of 31 places in 473 ms of which 2 ms to minimize.
[2024-06-01 23:10:20] [INFO ] Deduced a trap composed of 106 places in 445 ms of which 2 ms to minimize.
[2024-06-01 23:10:20] [INFO ] Deduced a trap composed of 104 places in 499 ms of which 2 ms to minimize.
[2024-06-01 23:10:21] [INFO ] Deduced a trap composed of 37 places in 456 ms of which 3 ms to minimize.
[2024-06-01 23:10:21] [INFO ] Deduced a trap composed of 59 places in 392 ms of which 3 ms to minimize.
[2024-06-01 23:10:21] [INFO ] Deduced a trap composed of 42 places in 349 ms of which 2 ms to minimize.
[2024-06-01 23:10:22] [INFO ] Deduced a trap composed of 50 places in 366 ms of which 2 ms to minimize.
[2024-06-01 23:10:22] [INFO ] Deduced a trap composed of 42 places in 372 ms of which 2 ms to minimize.
[2024-06-01 23:10:23] [INFO ] Deduced a trap composed of 47 places in 359 ms of which 2 ms to minimize.
[2024-06-01 23:10:23] [INFO ] Deduced a trap composed of 62 places in 493 ms of which 2 ms to minimize.
[2024-06-01 23:10:24] [INFO ] Deduced a trap composed of 78 places in 467 ms of which 2 ms to minimize.
[2024-06-01 23:10:24] [INFO ] Deduced a trap composed of 48 places in 437 ms of which 2 ms to minimize.
[2024-06-01 23:10:24] [INFO ] Deduced a trap composed of 75 places in 428 ms of which 2 ms to minimize.
[2024-06-01 23:10:25] [INFO ] Deduced a trap composed of 42 places in 341 ms of which 2 ms to minimize.
[2024-06-01 23:10:25] [INFO ] Deduced a trap composed of 47 places in 325 ms of which 2 ms to minimize.
[2024-06-01 23:10:26] [INFO ] Deduced a trap composed of 50 places in 500 ms of which 2 ms to minimize.
[2024-06-01 23:10:26] [INFO ] Deduced a trap composed of 97 places in 500 ms of which 2 ms to minimize.
[2024-06-01 23:10:27] [INFO ] Deduced a trap composed of 64 places in 393 ms of which 2 ms to minimize.
[2024-06-01 23:10:27] [INFO ] Deduced a trap composed of 72 places in 441 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2024-06-01 23:10:32] [INFO ] Deduced a trap composed of 44 places in 467 ms of which 2 ms to minimize.
[2024-06-01 23:10:32] [INFO ] Deduced a trap composed of 57 places in 446 ms of which 2 ms to minimize.
[2024-06-01 23:10:33] [INFO ] Deduced a trap composed of 57 places in 494 ms of which 2 ms to minimize.
[2024-06-01 23:10:33] [INFO ] Deduced a trap composed of 72 places in 433 ms of which 2 ms to minimize.
[2024-06-01 23:10:34] [INFO ] Deduced a trap composed of 115 places in 450 ms of which 2 ms to minimize.
[2024-06-01 23:10:34] [INFO ] Deduced a trap composed of 114 places in 467 ms of which 2 ms to minimize.
[2024-06-01 23:10:35] [INFO ] Deduced a trap composed of 101 places in 404 ms of which 2 ms to minimize.
[2024-06-01 23:10:35] [INFO ] Deduced a trap composed of 114 places in 423 ms of which 2 ms to minimize.
[2024-06-01 23:10:36] [INFO ] Deduced a trap composed of 113 places in 429 ms of which 2 ms to minimize.
[2024-06-01 23:10:37] [INFO ] Deduced a trap composed of 125 places in 548 ms of which 2 ms to minimize.
[2024-06-01 23:10:37] [INFO ] Deduced a trap composed of 58 places in 420 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/2909 variables, and 34 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30100 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7806 constraints, Known Traps: 31/31 constraints]
After SMT, in 87844ms problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 87910ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115531 ms. Remains : 305/305 places, 7808/7808 transitions.
FORMULA Szymanski-PT-b04-UpperBounds-05 1 TECHNIQUES REACHABILITY_MAX
FORMULA Szymanski-PT-b04-UpperBounds-02 1 TECHNIQUES REACHABILITY_MAX
FORMULA Szymanski-PT-b04-UpperBounds-00 4 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 3 queries.) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Starting property specific reduction for Szymanski-PT-b04-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 23:10:43] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:10:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10002 steps (2 resets) in 26 ms. (370 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 23:10:43] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:10:43] [INFO ] Invariant cache hit.
[2024-06-01 23:10:43] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:10:44] [INFO ] [Real]Absence check using state equation in 416 ms returned sat
[2024-06-01 23:10:44] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:10:44] [INFO ] [Real]Added 147 Read/Feed constraints in 70 ms returned sat
[2024-06-01 23:10:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:10:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:10:44] [INFO ] [Nat]Absence check using state equation in 413 ms returned sat
[2024-06-01 23:10:45] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:10:46] [INFO ] [Nat]Added 147 Read/Feed constraints in 1046 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 305 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p253) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 204 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 305/305 places, 7807/7807 transitions.
[2024-06-01 23:10:46] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
// Phase 1: matrix 2603 rows 305 cols
[2024-06-01 23:10:46] [INFO ] Computed 3 invariants in 21 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000002 steps (2 resets) in 2178 ms. (458 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1083 ms. (922 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 23:10:49] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2024-06-01 23:10:49] [INFO ] Invariant cache hit.
[2024-06-01 23:10:49] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:10:50] [INFO ] [Real]Absence check using state equation in 419 ms returned sat
[2024-06-01 23:10:50] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:10:50] [INFO ] [Real]Added 147 Read/Feed constraints in 76 ms returned sat
[2024-06-01 23:10:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:10:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:10:50] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2024-06-01 23:10:51] [INFO ] [Nat]Added 147 Read/Feed constraints in 746 ms returned sat
[2024-06-01 23:10:52] [INFO ] Deduced a trap composed of 78 places in 628 ms of which 2 ms to minimize.
[2024-06-01 23:10:52] [INFO ] Deduced a trap composed of 129 places in 620 ms of which 2 ms to minimize.
[2024-06-01 23:10:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1437 ms
[2024-06-01 23:10:53] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2592 transitions) in 350 ms.
[2024-06-01 23:10:53] [INFO ] Added : 0 causal constraints over 0 iterations in 514 ms. Result :sat
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : Szymanski-PT-b04-UpperBounds-00
Could not compute solution for formula : Szymanski-PT-b04-UpperBounds-01
Could not compute solution for formula : Szymanski-PT-b04-UpperBounds-02
Could not compute solution for formula : Szymanski-PT-b04-UpperBounds-03
Could not compute solution for formula : Szymanski-PT-b04-UpperBounds-04
Could not compute solution for formula : Szymanski-PT-b04-UpperBounds-05
Could not compute solution for formula : Szymanski-PT-b04-UpperBounds-06
Could not compute solution for formula : Szymanski-PT-b04-UpperBounds-07
Could not compute solution for formula : Szymanski-PT-b04-UpperBounds-08
Could not compute solution for formula : Szymanski-PT-b04-UpperBounds-09
Could not compute solution for formula : Szymanski-PT-b04-UpperBounds-10
Could not compute solution for formula : Szymanski-PT-b04-UpperBounds-11
Could not compute solution for formula : Szymanski-PT-b04-UpperBounds-12
Could not compute solution for formula : Szymanski-PT-b04-UpperBounds-13
Could not compute solution for formula : Szymanski-PT-b04-UpperBounds-14
Could not compute solution for formula : Szymanski-PT-b04-UpperBounds-15
BK_STOP 1717283456553
--------------------
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 Szymanski-PT-b04-UpperBounds-00
ub formula formula --maxsum=/tmp/1206/ub_0_
ub formula name Szymanski-PT-b04-UpperBounds-01
ub formula formula --maxsum=/tmp/1206/ub_1_
ub formula name Szymanski-PT-b04-UpperBounds-02
ub formula formula --maxsum=/tmp/1206/ub_2_
ub formula name Szymanski-PT-b04-UpperBounds-03
ub formula formula --maxsum=/tmp/1206/ub_3_
ub formula name Szymanski-PT-b04-UpperBounds-04
ub formula formula --maxsum=/tmp/1206/ub_4_
ub formula name Szymanski-PT-b04-UpperBounds-05
ub formula formula --maxsum=/tmp/1206/ub_5_
ub formula name Szymanski-PT-b04-UpperBounds-06
ub formula formula --maxsum=/tmp/1206/ub_6_
ub formula name Szymanski-PT-b04-UpperBounds-07
ub formula formula --maxsum=/tmp/1206/ub_7_
ub formula name Szymanski-PT-b04-UpperBounds-08
ub formula formula --maxsum=/tmp/1206/ub_8_
ub formula name Szymanski-PT-b04-UpperBounds-09
ub formula formula --maxsum=/tmp/1206/ub_9_
ub formula name Szymanski-PT-b04-UpperBounds-10
ub formula formula --maxsum=/tmp/1206/ub_10_
ub formula name Szymanski-PT-b04-UpperBounds-11
ub formula formula --maxsum=/tmp/1206/ub_11_
ub formula name Szymanski-PT-b04-UpperBounds-12
ub formula formula --maxsum=/tmp/1206/ub_12_
ub formula name Szymanski-PT-b04-UpperBounds-13
ub formula formula --maxsum=/tmp/1206/ub_13_
ub formula name Szymanski-PT-b04-UpperBounds-14
ub formula formula --maxsum=/tmp/1206/ub_14_
ub formula name Szymanski-PT-b04-UpperBounds-15
ub formula formula --maxsum=/tmp/1206/ub_15_
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="Szymanski-PT-b04"
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 Szymanski-PT-b04, 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 r536-tall-171690533300869"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Szymanski-PT-b04.tgz
mv Szymanski-PT-b04 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 '
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 ;