MCC'2024- Execution of r536-tall-171690533400901

About the Execution of LTSMin+red for Szymanski-PT-b12

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16108.575	345980.00	427260.00	820.80	12 1 0 1 1 0 1 0 0 1 0 0 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-171690533400901.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-b12, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690533400901
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Apr 11 15:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 11 15:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:02 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-b12-UpperBounds-00
FORMULA_NAME Szymanski-PT-b12-UpperBounds-01
FORMULA_NAME Szymanski-PT-b12-UpperBounds-02
FORMULA_NAME Szymanski-PT-b12-UpperBounds-03
FORMULA_NAME Szymanski-PT-b12-UpperBounds-04
FORMULA_NAME Szymanski-PT-b12-UpperBounds-05
FORMULA_NAME Szymanski-PT-b12-UpperBounds-06
FORMULA_NAME Szymanski-PT-b12-UpperBounds-07
FORMULA_NAME Szymanski-PT-b12-UpperBounds-08
FORMULA_NAME Szymanski-PT-b12-UpperBounds-09
FORMULA_NAME Szymanski-PT-b12-UpperBounds-10
FORMULA_NAME Szymanski-PT-b12-UpperBounds-11
FORMULA_NAME Szymanski-PT-b12-UpperBounds-12
FORMULA_NAME Szymanski-PT-b12-UpperBounds-13
FORMULA_NAME Szymanski-PT-b12-UpperBounds-14
FORMULA_NAME Szymanski-PT-b12-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717285460164

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-b12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 23:44:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 23:44:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 23:44:21] [INFO ] Load time of PNML (sax parser for PT used): 319 ms
[2024-06-01 23:44:21] [INFO ] Transformed 568 places.
[2024-06-01 23:44:21] [INFO ] Transformed 8320 transitions.
[2024-06-01 23:44:21] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 448 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 260 places in 18 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b12-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b12-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b12-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b12-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b12-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b12-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b12-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+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] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 23:44:21] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2024-06-01 23:44:21] [INFO ] Computed 3 invariants in 64 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[25, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (7 resets) in 67 ms. (147 steps per ms)
FORMULA Szymanski-PT-b12-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b12-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b12-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b12-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (13 resets) in 117 ms. (423 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12, 0, 0, 0, 0] Max Struct:[25, 1, 1, 1, 1]
[2024-06-01 23:44:22] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-06-01 23:44:22] [INFO ] Invariant cache hit.
[2024-06-01 23:44:22] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2024-06-01 23:44:22] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 8 ms returned sat
[2024-06-01 23:44:22] [INFO ] [Real]Absence check using state equation in 440 ms returned unsat
[2024-06-01 23:44:22] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 23:44:22] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 23:44:23] [INFO ] [Real]Absence check using state equation in 397 ms returned sat
[2024-06-01 23:44:23] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:44:23] [INFO ] [Real]Added 147 Read/Feed constraints in 84 ms returned sat
[2024-06-01 23:44:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:44:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 23:44:23] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 23:44:24] [INFO ] [Nat]Absence check using state equation in 402 ms returned sat
[2024-06-01 23:44:24] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:44:25] [INFO ] [Nat]Added 147 Read/Feed constraints in 1039 ms returned unknown
[2024-06-01 23:44:25] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 23:44:25] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 23:44:25] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2024-06-01 23:44:26] [INFO ] [Real]Added 147 Read/Feed constraints in 419 ms returned sat
[2024-06-01 23:44:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:44:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 23:44:26] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 23:44:26] [INFO ] [Nat]Absence check using state equation in 429 ms returned sat
[2024-06-01 23:44:27] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:44:27] [INFO ] [Nat]Added 147 Read/Feed constraints in 1043 ms returned unknown
[2024-06-01 23:44:27] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 23:44:27] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 23:44:28] [INFO ] [Real]Absence check using state equation in 399 ms returned sat
[2024-06-01 23:44:29] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:44:29] [INFO ] [Real]Added 147 Read/Feed constraints in 861 ms returned sat
[2024-06-01 23:44:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:44:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 23:44:29] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 23:44:29] [INFO ] [Nat]Absence check using state equation in 367 ms returned sat
[2024-06-01 23:44:30] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:44:30] [INFO ] [Nat]Added 147 Read/Feed constraints in 1090 ms returned sat
[2024-06-01 23:44:31] [INFO ] Deduced a trap composed of 138 places in 623 ms of which 20 ms to minimize.
[2024-06-01 23:44:32] [INFO ] Deduced a trap composed of 137 places in 612 ms of which 3 ms to minimize.
[2024-06-01 23:44:32] [INFO ] Deduced a trap composed of 137 places in 596 ms of which 3 ms to minimize.
[2024-06-01 23:44:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2120 ms
[2024-06-01 23:44:33] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2722 transitions) in 660 ms.
[2024-06-01 23:44:33] [INFO ] Added : 0 causal constraints over 0 iterations in 868 ms. Result :sat
Minimization took 490 ms.
[2024-06-01 23:44:34] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 23:44:34] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 23:44:34] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2024-06-01 23:44:34] [INFO ] [Real]Added 147 Read/Feed constraints in 304 ms returned sat
[2024-06-01 23:44:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:44:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 23:44:35] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 23:44:35] [INFO ] [Nat]Absence check using state equation in 417 ms returned sat
[2024-06-01 23:44:36] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:44:36] [INFO ] [Nat]Added 147 Read/Feed constraints in 1036 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[12, 0, 0, 0, 0] Max Struct:[12, 1, 1, 1, 1]
FORMULA Szymanski-PT-b12-UpperBounds-00 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 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.16 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 462 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 473 ms. Remains : 305/308 places, 7808/8064 transitions.
[2024-06-01 23:44:36] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-06-01 23:44:37] [INFO ] Computed 3 invariants in 24 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000003 steps (2 resets) in 833 ms. (1199 steps per ms)
FORMULA Szymanski-PT-b12-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4000003 steps (8 resets) in 2904 ms. (1376 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-01 23:44:40] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:44:40] [INFO ] Invariant cache hit.
[2024-06-01 23:44:40] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:44:41] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2024-06-01 23:44:41] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:44:41] [INFO ] [Real]Added 147 Read/Feed constraints in 156 ms returned sat
[2024-06-01 23:44:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:44:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 23:44:41] [INFO ] [Nat]Absence check using state equation in 378 ms returned sat
[2024-06-01 23:44:42] [INFO ] [Nat]Added 147 Read/Feed constraints in 522 ms returned sat
[2024-06-01 23:44:42] [INFO ] Deduced a trap composed of 37 places in 512 ms of which 2 ms to minimize.
[2024-06-01 23:44:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 638 ms
[2024-06-01 23:44:43] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 325 ms.
[2024-06-01 23:44:43] [INFO ] Added : 0 causal constraints over 0 iterations in 489 ms. Result :sat
Minimization took 4914 ms.
[2024-06-01 23:44:48] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 23:44:48] [INFO ] [Real]Absence check using state equation in 358 ms returned sat
[2024-06-01 23:44:49] [INFO ] [Real]Added 147 Read/Feed constraints in 109 ms returned sat
[2024-06-01 23:44:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:44:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:44:49] [INFO ] [Nat]Absence check using state equation in 355 ms returned sat
[2024-06-01 23:44:52] [INFO ] [Nat]Added 147 Read/Feed constraints in 2733 ms returned sat
[2024-06-01 23:44:52] [INFO ] Deduced a trap composed of 52 places in 498 ms of which 2 ms to minimize.
[2024-06-01 23:44:53] [INFO ] Deduced a trap composed of 37 places in 465 ms of which 2 ms to minimize.
[2024-06-01 23:44:53] [INFO ] Deduced a trap composed of 140 places in 446 ms of which 2 ms to minimize.
[2024-06-01 23:44:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1638 ms
[2024-06-01 23:44:54] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 337 ms.
[2024-06-01 23:44:54] [INFO ] Added : 0 causal constraints over 0 iterations in 499 ms. Result :sat
Minimization took 4944 ms.
[2024-06-01 23:44:59] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 23:44:59] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2024-06-01 23:44:59] [INFO ] [Real]Added 147 Read/Feed constraints in 96 ms returned sat
[2024-06-01 23:44:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:44:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:45:00] [INFO ] [Nat]Absence check using state equation in 348 ms returned sat
[2024-06-01 23:45:01] [INFO ] [Nat]Added 147 Read/Feed constraints in 749 ms returned sat
[2024-06-01 23:45:01] [INFO ] Deduced a trap composed of 97 places in 550 ms of which 2 ms to minimize.
[2024-06-01 23:45:02] [INFO ] Deduced a trap composed of 136 places in 578 ms of which 2 ms to minimize.
[2024-06-01 23:45:02] [INFO ] Deduced a trap composed of 136 places in 552 ms of which 2 ms to minimize.
[2024-06-01 23:45:03] [INFO ] Deduced a trap composed of 153 places in 556 ms of which 2 ms to minimize.
[2024-06-01 23:45:04] [INFO ] Deduced a trap composed of 38 places in 544 ms of which 3 ms to minimize.
[2024-06-01 23:45:04] [INFO ] Deduced a trap composed of 50 places in 529 ms of which 2 ms to minimize.
[2024-06-01 23:45:05] [INFO ] Deduced a trap composed of 50 places in 515 ms of which 2 ms to minimize.
[2024-06-01 23:45:05] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4308 ms
[2024-06-01 23:45:05] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 345 ms.
[2024-06-01 23:45:05] [INFO ] Added : 2 causal constraints over 1 iterations in 588 ms. Result :sat
Minimization took 5055 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 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 230 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 230 ms. Remains : 305/305 places, 7808/7808 transitions.
[2024-06-01 23:45:11] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:45:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000004 steps (2 resets) in 633 ms. (1577 steps per ms)
BEST_FIRST walk for 3000003 steps (6 resets) in 2296 ms. (1306 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-01 23:45:14] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:45:14] [INFO ] Invariant cache hit.
[2024-06-01 23:45:14] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:45:14] [INFO ] [Real]Absence check using state equation in 424 ms returned sat
[2024-06-01 23:45:14] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:45:14] [INFO ] [Real]Added 147 Read/Feed constraints in 190 ms returned sat
[2024-06-01 23:45:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:45:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:45:15] [INFO ] [Nat]Absence check using state equation in 435 ms returned sat
[2024-06-01 23:45:16] [INFO ] [Nat]Added 147 Read/Feed constraints in 639 ms returned sat
[2024-06-01 23:45:16] [INFO ] Deduced a trap composed of 37 places in 517 ms of which 2 ms to minimize.
[2024-06-01 23:45:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 638 ms
[2024-06-01 23:45:17] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 328 ms.
[2024-06-01 23:45:17] [INFO ] Added : 0 causal constraints over 0 iterations in 486 ms. Result :sat
Minimization took 4990 ms.
[2024-06-01 23:45:22] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 23:45:22] [INFO ] [Real]Absence check using state equation in 358 ms returned sat
[2024-06-01 23:45:22] [INFO ] [Real]Added 147 Read/Feed constraints in 111 ms returned sat
[2024-06-01 23:45:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:45:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:45:23] [INFO ] [Nat]Absence check using state equation in 349 ms returned sat
[2024-06-01 23:45:26] [INFO ] [Nat]Added 147 Read/Feed constraints in 2808 ms returned sat
[2024-06-01 23:45:26] [INFO ] Deduced a trap composed of 52 places in 493 ms of which 2 ms to minimize.
[2024-06-01 23:45:27] [INFO ] Deduced a trap composed of 37 places in 492 ms of which 2 ms to minimize.
[2024-06-01 23:45:27] [INFO ] Deduced a trap composed of 140 places in 466 ms of which 2 ms to minimize.
[2024-06-01 23:45:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1700 ms
[2024-06-01 23:45:28] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 323 ms.
[2024-06-01 23:45:28] [INFO ] Added : 0 causal constraints over 0 iterations in 479 ms. Result :sat
Minimization took 5043 ms.
[2024-06-01 23:45:33] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:45:33] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2024-06-01 23:45:33] [INFO ] [Real]Added 147 Read/Feed constraints in 100 ms returned sat
[2024-06-01 23:45:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:45:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 23:45:34] [INFO ] [Nat]Absence check using state equation in 350 ms returned sat
[2024-06-01 23:45:34] [INFO ] [Nat]Added 147 Read/Feed constraints in 757 ms returned sat
[2024-06-01 23:45:35] [INFO ] Deduced a trap composed of 97 places in 517 ms of which 1 ms to minimize.
[2024-06-01 23:45:36] [INFO ] Deduced a trap composed of 136 places in 509 ms of which 3 ms to minimize.
[2024-06-01 23:45:36] [INFO ] Deduced a trap composed of 136 places in 485 ms of which 2 ms to minimize.
[2024-06-01 23:45:37] [INFO ] Deduced a trap composed of 153 places in 481 ms of which 2 ms to minimize.
[2024-06-01 23:45:37] [INFO ] Deduced a trap composed of 38 places in 475 ms of which 2 ms to minimize.
[2024-06-01 23:45:38] [INFO ] Deduced a trap composed of 50 places in 479 ms of which 2 ms to minimize.
[2024-06-01 23:45:38] [INFO ] Deduced a trap composed of 50 places in 452 ms of which 2 ms to minimize.
[2024-06-01 23:45:38] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3895 ms
[2024-06-01 23:45:39] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 333 ms.
[2024-06-01 23:45:39] [INFO ] Added : 2 causal constraints over 1 iterations in 551 ms. Result :sat
Minimization took 4985 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 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 284 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 285 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 213 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-06-01 23:45:44] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:45:44] [INFO ] Invariant cache hit.
[2024-06-01 23:45:45] [INFO ] Implicit Places using invariants in 623 ms returned []
[2024-06-01 23:45:45] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:45:45] [INFO ] Invariant cache hit.
[2024-06-01 23:45:45] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:46:02] [INFO ] Implicit Places using invariants and state equation in 16927 ms returned []
Implicit Place search using SMT with State Equation took 17563 ms to find 0 implicit places.
[2024-06-01 23:46:03] [INFO ] Redundant transitions in 941 ms returned []
Running 7806 sub problems to find dead transitions.
[2024-06-01 23:46:03] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:46:03] [INFO ] Invariant cache hit.
[2024-06-01 23:46:03] [INFO ] State equation strengthened by 147 read => feed constraints.
(s64 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.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 0.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 0.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 0.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.0timeout
)
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30173 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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int 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: 0/7806 constraints, Known Traps: 0/0 constraints]
After SMT, in 88695ms problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 88838ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107613 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40020 steps (8 resets) in 714 ms. (55 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 133 ms. (298 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
[2024-06-01 23:47:32] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:47:32] [INFO ] Invariant cache hit.
[2024-06-01 23:47:32] [INFO ] State equation strengthened by 147 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) 254/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 23:47:33] [INFO ] Deduced a trap composed of 131 places in 479 ms of which 2 ms to minimize.
[2024-06-01 23:47:33] [INFO ] Deduced a trap composed of 130 places in 444 ms of which 2 ms to minimize.
[2024-06-01 23:47:34] [INFO ] Deduced a trap composed of 129 places in 432 ms of which 2 ms to minimize.
[2024-06-01 23:47:34] [INFO ] Deduced a trap composed of 131 places in 435 ms of which 2 ms to minimize.
[2024-06-01 23:47:35] [INFO ] Deduced a trap composed of 129 places in 420 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 23:47:35] [INFO ] Deduced a trap composed of 146 places in 363 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2604/2909 variables, 305/314 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 147/461 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/2909 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 461 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4379 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 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) 254/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 23:47:37] [INFO ] Deduced a trap composed of 50 places in 361 ms of which 1 ms to minimize.
[2024-06-01 23:47:38] [INFO ] Deduced a trap composed of 74 places in 328 ms of which 2 ms to minimize.
[2024-06-01 23:47:38] [INFO ] Deduced a trap composed of 79 places in 354 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 19/305 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2604/2909 variables, 305/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 147/464 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2909 variables, 4/468 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2909 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/2909 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 468 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4957 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 9383ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 540 ms.
Support contains 2 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 188 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 190 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40019 steps (8 resets) in 147 ms. (270 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 129438 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 4
Probabilistic random walk after 129438 steps, saw 100826 distinct states, run finished after 3004 ms. (steps per millisecond=43 ) properties seen :0
[2024-06-01 23:47:46] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:47:46] [INFO ] Invariant cache hit.
[2024-06-01 23:47:46] [INFO ] State equation strengthened by 147 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) 254/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 23:47:46] [INFO ] Deduced a trap composed of 131 places in 461 ms of which 5 ms to minimize.
[2024-06-01 23:47:47] [INFO ] Deduced a trap composed of 130 places in 438 ms of which 2 ms to minimize.
[2024-06-01 23:47:47] [INFO ] Deduced a trap composed of 129 places in 398 ms of which 2 ms to minimize.
[2024-06-01 23:47:48] [INFO ] Deduced a trap composed of 131 places in 447 ms of which 2 ms to minimize.
[2024-06-01 23:47:48] [INFO ] Deduced a trap composed of 129 places in 430 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 23:47:49] [INFO ] Deduced a trap composed of 146 places in 326 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2604/2909 variables, 305/314 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 147/461 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/2909 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 461 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4251 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 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) 254/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 23:47:50] [INFO ] Deduced a trap composed of 50 places in 322 ms of which 2 ms to minimize.
[2024-06-01 23:47:51] [INFO ] Deduced a trap composed of 74 places in 320 ms of which 2 ms to minimize.
[2024-06-01 23:47:51] [INFO ] Deduced a trap composed of 79 places in 314 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 19/305 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2604/2909 variables, 305/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 147/464 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2909 variables, 4/468 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2909 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/2909 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 468 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4292 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 8572ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 368 ms.
Support contains 2 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 199 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 199 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 193 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-06-01 23:47:55] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:47:55] [INFO ] Invariant cache hit.
[2024-06-01 23:47:56] [INFO ] Implicit Places using invariants in 600 ms returned []
[2024-06-01 23:47:56] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:47:56] [INFO ] Invariant cache hit.
[2024-06-01 23:47:56] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:48:13] [INFO ] Implicit Places using invariants and state equation in 17810 ms returned []
Implicit Place search using SMT with State Equation took 18414 ms to find 0 implicit places.
[2024-06-01 23:48:14] [INFO ] Redundant transitions in 780 ms returned []
Running 7806 sub problems to find dead transitions.
[2024-06-01 23:48:14] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:48:14] [INFO ] Invariant cache hit.
[2024-06-01 23:48:14] [INFO ] State equation strengthened by 147 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/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 30098 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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/2909 variables, and 3 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30107 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: 0/0 constraints]
After SMT, in 88489ms problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 88557ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107999 ms. Remains : 305/305 places, 7808/7808 transitions.
FORMULA Szymanski-PT-b12-UpperBounds-04 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[0, 0] Max Struct:[1, 1]
Starting property specific reduction for Szymanski-PT-b12-UpperBounds-01
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:49:43] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:49:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10008 steps (2 resets) in 18 ms. (526 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 23:49:43] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:49:43] [INFO ] Invariant cache hit.
[2024-06-01 23:49:43] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:49:43] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2024-06-01 23:49:43] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:49:44] [INFO ] [Real]Added 147 Read/Feed constraints in 160 ms returned sat
[2024-06-01 23:49:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:49:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:49:44] [INFO ] [Nat]Absence check using state equation in 412 ms returned sat
[2024-06-01 23:49:45] [INFO ] [Nat]Added 147 Read/Feed constraints in 495 ms returned sat
[2024-06-01 23:49:45] [INFO ] Deduced a trap composed of 37 places in 582 ms of which 2 ms to minimize.
[2024-06-01 23:49:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 697 ms
[2024-06-01 23:49:46] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 312 ms.
[2024-06-01 23:49:46] [INFO ] Added : 0 causal constraints over 0 iterations in 471 ms. Result :sat
Minimization took 578 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 305 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p166) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 180 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 181 ms. Remains : 305/305 places, 7807/7807 transitions.
[2024-06-01 23:49:46] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
// Phase 1: matrix 2603 rows 305 cols
[2024-06-01 23:49:47] [INFO ] Computed 3 invariants in 15 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000006 steps (2 resets) in 621 ms. (1607 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 678 ms. (1472 steps per ms)
FORMULA Szymanski-PT-b12-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Szymanski-PT-b12-UpperBounds-01 in 5043 ms.
Starting property specific reduction for Szymanski-PT-b12-UpperBounds-14
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:49:48] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-06-01 23:49:48] [INFO ] Computed 3 invariants in 20 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10001 steps (2 resets) in 23 ms. (416 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 23:49:48] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:49:48] [INFO ] Invariant cache hit.
[2024-06-01 23:49:48] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:49:48] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2024-06-01 23:49:48] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:49:48] [INFO ] [Real]Added 147 Read/Feed constraints in 114 ms returned sat
[2024-06-01 23:49:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:49:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:49:49] [INFO ] [Nat]Absence check using state equation in 391 ms returned sat
[2024-06-01 23:49:49] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:49:50] [INFO ] [Nat]Added 147 Read/Feed constraints in 594 ms returned sat
[2024-06-01 23:49:50] [INFO ] Deduced a trap composed of 51 places in 525 ms of which 2 ms to minimize.
[2024-06-01 23:49:51] [INFO ] Deduced a trap composed of 37 places in 502 ms of which 2 ms to minimize.
[2024-06-01 23:49:51] [INFO ] Deduced a trap composed of 85 places in 556 ms of which 2 ms to minimize.
[2024-06-01 23:49:52] [INFO ] Deduced a trap composed of 93 places in 494 ms of which 2 ms to minimize.
[2024-06-01 23:49:52] [INFO ] Deduced a trap composed of 50 places in 558 ms of which 3 ms to minimize.
[2024-06-01 23:49:53] [INFO ] Deduced a trap composed of 142 places in 564 ms of which 2 ms to minimize.
[2024-06-01 23:49:54] [INFO ] Deduced a trap composed of 133 places in 485 ms of which 3 ms to minimize.
[2024-06-01 23:49:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:929)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
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 p154) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 202 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 202 ms. Remains : 305/305 places, 7807/7807 transitions.
[2024-06-01 23:49:54] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
// Phase 1: matrix 2603 rows 305 cols
[2024-06-01 23:49:54] [INFO ] Computed 3 invariants in 23 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000010 steps (2 resets) in 888 ms. (1124 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 866 ms. (1153 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 23:49:56] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2024-06-01 23:49:56] [INFO ] Invariant cache hit.
[2024-06-01 23:49:56] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:49:56] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2024-06-01 23:49:56] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:49:56] [INFO ] [Real]Added 147 Read/Feed constraints in 104 ms returned sat
[2024-06-01 23:49:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:49:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:49:57] [INFO ] [Nat]Absence check using state equation in 407 ms returned sat
[2024-06-01 23:50:01] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:50:02] [INFO ] [Nat]Added 147 Read/Feed constraints in 5369 ms returned sat
[2024-06-01 23:50:03] [INFO ] Deduced a trap composed of 136 places in 581 ms of which 2 ms to minimize.
[2024-06-01 23:50:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 720 ms
[2024-06-01 23:50:03] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2592 transitions) in 374 ms.
[2024-06-01 23:50:03] [INFO ] Added : 0 causal constraints over 0 iterations in 539 ms. Result :sat
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 : Szymanski-PT-b12-UpperBounds-00
Could not compute solution for formula : Szymanski-PT-b12-UpperBounds-01
Could not compute solution for formula : Szymanski-PT-b12-UpperBounds-02
Could not compute solution for formula : Szymanski-PT-b12-UpperBounds-03
Could not compute solution for formula : Szymanski-PT-b12-UpperBounds-04
Could not compute solution for formula : Szymanski-PT-b12-UpperBounds-05
Could not compute solution for formula : Szymanski-PT-b12-UpperBounds-06
Could not compute solution for formula : Szymanski-PT-b12-UpperBounds-07
Could not compute solution for formula : Szymanski-PT-b12-UpperBounds-08
Could not compute solution for formula : Szymanski-PT-b12-UpperBounds-09
Could not compute solution for formula : Szymanski-PT-b12-UpperBounds-10
Could not compute solution for formula : Szymanski-PT-b12-UpperBounds-11
Could not compute solution for formula : Szymanski-PT-b12-UpperBounds-12
Could not compute solution for formula : Szymanski-PT-b12-UpperBounds-13
Could not compute solution for formula : Szymanski-PT-b12-UpperBounds-14
Could not compute solution for formula : Szymanski-PT-b12-UpperBounds-15

BK_STOP 1717285806144

--------------------
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-b12-UpperBounds-00
ub formula formula --maxsum=/tmp/815/ub_0_
ub formula name Szymanski-PT-b12-UpperBounds-01
ub formula formula --maxsum=/tmp/815/ub_1_
ub formula name Szymanski-PT-b12-UpperBounds-02
ub formula formula --maxsum=/tmp/815/ub_2_
ub formula name Szymanski-PT-b12-UpperBounds-03
ub formula formula --maxsum=/tmp/815/ub_3_
ub formula name Szymanski-PT-b12-UpperBounds-04
ub formula formula --maxsum=/tmp/815/ub_4_
ub formula name Szymanski-PT-b12-UpperBounds-05
ub formula formula --maxsum=/tmp/815/ub_5_
ub formula name Szymanski-PT-b12-UpperBounds-06
ub formula formula --maxsum=/tmp/815/ub_6_
ub formula name Szymanski-PT-b12-UpperBounds-07
ub formula formula --maxsum=/tmp/815/ub_7_
ub formula name Szymanski-PT-b12-UpperBounds-08
ub formula formula --maxsum=/tmp/815/ub_8_
ub formula name Szymanski-PT-b12-UpperBounds-09
ub formula formula --maxsum=/tmp/815/ub_9_
ub formula name Szymanski-PT-b12-UpperBounds-10
ub formula formula --maxsum=/tmp/815/ub_10_
ub formula name Szymanski-PT-b12-UpperBounds-11
ub formula formula --maxsum=/tmp/815/ub_11_
ub formula name Szymanski-PT-b12-UpperBounds-12
ub formula formula --maxsum=/tmp/815/ub_12_
ub formula name Szymanski-PT-b12-UpperBounds-13
ub formula formula --maxsum=/tmp/815/ub_13_
ub formula name Szymanski-PT-b12-UpperBounds-14
ub formula formula --maxsum=/tmp/815/ub_14_
ub formula name Szymanski-PT-b12-UpperBounds-15
ub formula formula --maxsum=/tmp/815/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-b12"
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-b12, 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-171690533400901"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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