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.r399-tall-171690531400901.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is Szymanski-PT-b12, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690531400901
=====================================================================

--------------------
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 1717110236240

Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 23:03:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-30 23:03:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 23:03:57] [INFO ] Load time of PNML (sax parser for PT used): 324 ms
[2024-05-30 23:03:57] [INFO ] Transformed 568 places.
[2024-05-30 23:03:57] [INFO ] Transformed 8320 transitions.
[2024-05-30 23:03:57] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 457 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 260 places in 19 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-05-30 23:03:57] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2024-05-30 23:03:58] [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 (2 resets) in 78 ms. (126 steps per ms)
FORMULA Szymanski-PT-b12-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
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-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (13 resets) in 149 ms. (333 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[11, 0, 0, 0, 0] Max Struct:[25, 1, 1, 1, 1]
[2024-05-30 23:03:58] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-30 23:03:58] [INFO ] Invariant cache hit.
[2024-05-30 23:03:58] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2024-05-30 23:03:58] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-30 23:03:58] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2024-05-30 23:03:59] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 23:03:59] [INFO ] [Real]Added 147 Read/Feed constraints in 487 ms returned sat
[2024-05-30 23:03:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:03:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-30 23:03:59] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-30 23:04:00] [INFO ] [Nat]Absence check using state equation in 396 ms returned sat
[2024-05-30 23:04:00] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-30 23:04:01] [INFO ] [Nat]Added 147 Read/Feed constraints in 1039 ms returned unknown
[2024-05-30 23:04:01] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2024-05-30 23:04:01] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-30 23:04:01] [INFO ] [Real]Absence check using state equation in 439 ms returned sat
[2024-05-30 23:04:01] [INFO ] [Real]Added 147 Read/Feed constraints in 105 ms returned sat
[2024-05-30 23:04:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:04:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-30 23:04:01] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-30 23:04:02] [INFO ] [Nat]Absence check using state equation in 364 ms returned sat
[2024-05-30 23:04:02] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-30 23:04:03] [INFO ] [Nat]Added 147 Read/Feed constraints in 1045 ms returned unknown
[2024-05-30 23:04:03] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-30 23:04:03] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-30 23:04:03] [INFO ] [Real]Absence check using state equation in 473 ms returned sat
[2024-05-30 23:04:04] [INFO ] [Real]Added 147 Read/Feed constraints in 458 ms returned sat
[2024-05-30 23:04:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:04:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-30 23:04:04] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-30 23:04:04] [INFO ] [Nat]Absence check using state equation in 465 ms returned sat
[2024-05-30 23:04:05] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-30 23:04:06] [INFO ] [Nat]Added 147 Read/Feed constraints in 1038 ms returned unknown
[2024-05-30 23:04:06] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-30 23:04:06] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-30 23:04:06] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2024-05-30 23:04:07] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-30 23:04:07] [INFO ] [Real]Added 147 Read/Feed constraints in 886 ms returned sat
[2024-05-30 23:04:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:04:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-30 23:04:07] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-30 23:04:07] [INFO ] [Nat]Absence check using state equation in 360 ms returned sat
[2024-05-30 23:04:08] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-30 23:04:08] [INFO ] [Nat]Added 147 Read/Feed constraints in 1107 ms returned sat
[2024-05-30 23:04:09] [INFO ] Deduced a trap composed of 138 places in 647 ms of which 21 ms to minimize.
[2024-05-30 23:04:10] [INFO ] Deduced a trap composed of 137 places in 637 ms of which 3 ms to minimize.
[2024-05-30 23:04:11] [INFO ] Deduced a trap composed of 137 places in 593 ms of which 2 ms to minimize.
[2024-05-30 23:04:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2168 ms
[2024-05-30 23:04:11] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2722 transitions) in 625 ms.
[2024-05-30 23:04:11] [INFO ] Added : 0 causal constraints over 0 iterations in 820 ms. Result :sat
Minimization took 486 ms.
[2024-05-30 23:04:12] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-30 23:04:12] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-30 23:04:12] [INFO ] [Real]Absence check using state equation in 403 ms returned sat
[2024-05-30 23:04:13] [INFO ] [Real]Added 147 Read/Feed constraints in 312 ms returned sat
[2024-05-30 23:04:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:04:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-30 23:04:13] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-30 23:04:13] [INFO ] [Nat]Absence check using state equation in 396 ms returned sat
[2024-05-30 23:04:14] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-30 23:04:14] [INFO ] [Nat]Added 147 Read/Feed constraints in 1040 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[11, 0, 0, 0, 0] Max Struct:[25, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[11, 0, 0, 0, 0] Max Struct:[25, 1, 1, 1, 1]
Support contains 5 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.15 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 450 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 465 ms. Remains : 305/308 places, 7808/8064 transitions.
[2024-05-30 23:04:15] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-05-30 23:04:15] [INFO ] Computed 3 invariants in 25 ms
Current structural bounds on expressions (after invariants) : Max Seen:[11, 0, 0, 0, 0] Max Struct:[12, 1, 1, 1, 1]
RANDOM walk for 1000011 steps (2 resets) in 700 ms. (1426 steps per ms)
FORMULA Szymanski-PT-b12-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b12-UpperBounds-00 12 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000003 steps (6 resets) in 2343 ms. (1279 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-05-30 23:04:18] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 23:04:18] [INFO ] Invariant cache hit.
[2024-05-30 23:04:18] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-30 23:04:18] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2024-05-30 23:04:18] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 23:04:19] [INFO ] [Real]Added 147 Read/Feed constraints in 167 ms returned sat
[2024-05-30 23:04:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:04:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-30 23:04:19] [INFO ] [Nat]Absence check using state equation in 385 ms returned sat
[2024-05-30 23:04:20] [INFO ] [Nat]Added 147 Read/Feed constraints in 535 ms returned sat
[2024-05-30 23:04:20] [INFO ] Deduced a trap composed of 37 places in 530 ms of which 3 ms to minimize.
[2024-05-30 23:04:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 654 ms
[2024-05-30 23:04:21] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 920 ms.
[2024-05-30 23:04:21] [INFO ] Added : 0 causal constraints over 0 iterations in 1081 ms. Result :sat
Minimization took 5056 ms.
[2024-05-30 23:04:26] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-30 23:04:27] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2024-05-30 23:04:27] [INFO ] [Real]Added 147 Read/Feed constraints in 96 ms returned sat
[2024-05-30 23:04:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:04:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-30 23:04:28] [INFO ] [Nat]Absence check using state equation in 412 ms returned sat
[2024-05-30 23:04:28] [INFO ] [Nat]Added 147 Read/Feed constraints in 966 ms returned sat
[2024-05-30 23:04:29] [INFO ] Deduced a trap composed of 133 places in 582 ms of which 2 ms to minimize.
[2024-05-30 23:04:30] [INFO ] Deduced a trap composed of 78 places in 589 ms of which 2 ms to minimize.
[2024-05-30 23:04:30] [INFO ] Deduced a trap composed of 129 places in 579 ms of which 3 ms to minimize.
[2024-05-30 23:04:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2006 ms
[2024-05-30 23:04:31] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 338 ms.
[2024-05-30 23:04:31] [INFO ] Added : 0 causal constraints over 0 iterations in 520 ms. Result :sat
Minimization took 4907 ms.
[2024-05-30 23:04:36] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-30 23:04:36] [INFO ] [Real]Absence check using state equation in 382 ms returned sat
[2024-05-30 23:04:37] [INFO ] [Real]Added 147 Read/Feed constraints in 106 ms returned sat
[2024-05-30 23:04:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:04:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-30 23:04:37] [INFO ] [Nat]Absence check using state equation in 380 ms returned sat
[2024-05-30 23:04:38] [INFO ] [Nat]Added 147 Read/Feed constraints in 799 ms returned sat
[2024-05-30 23:04:38] [INFO ] Deduced a trap composed of 97 places in 506 ms of which 3 ms to minimize.
[2024-05-30 23:04:39] [INFO ] Deduced a trap composed of 136 places in 510 ms of which 2 ms to minimize.
[2024-05-30 23:04:39] [INFO ] Deduced a trap composed of 136 places in 507 ms of which 2 ms to minimize.
[2024-05-30 23:04:40] [INFO ] Deduced a trap composed of 153 places in 477 ms of which 2 ms to minimize.
[2024-05-30 23:04:41] [INFO ] Deduced a trap composed of 38 places in 483 ms of which 2 ms to minimize.
[2024-05-30 23:04:41] [INFO ] Deduced a trap composed of 50 places in 474 ms of which 2 ms to minimize.
[2024-05-30 23:04:42] [INFO ] Deduced a trap composed of 50 places in 442 ms of which 2 ms to minimize.
[2024-05-30 23:04:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3911 ms
[2024-05-30 23:04:42] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 311 ms.
[2024-05-30 23:04:42] [INFO ] Added : 2 causal constraints over 1 iterations in 540 ms. Result :sat
Minimization took 4903 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 232 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 233 ms. Remains : 305/305 places, 7808/7808 transitions.
[2024-05-30 23:04:47] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 23:04:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000002 steps (2 resets) in 691 ms. (1445 steps per ms)
FORMULA Szymanski-PT-b12-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000001 steps (6 resets) in 2028 ms. (1478 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-05-30 23:04:50] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 23:04:50] [INFO ] Invariant cache hit.
[2024-05-30 23:04:50] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-30 23:04:51] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2024-05-30 23:04:51] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 23:04:51] [INFO ] [Real]Added 147 Read/Feed constraints in 165 ms returned sat
[2024-05-30 23:04:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:04:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-30 23:04:51] [INFO ] [Nat]Absence check using state equation in 414 ms returned sat
[2024-05-30 23:04:52] [INFO ] [Nat]Added 147 Read/Feed constraints in 530 ms returned sat
[2024-05-30 23:04:52] [INFO ] Deduced a trap composed of 37 places in 520 ms of which 3 ms to minimize.
[2024-05-30 23:04:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 645 ms
[2024-05-30 23:04:53] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 352 ms.
[2024-05-30 23:04:53] [INFO ] Added : 0 causal constraints over 0 iterations in 517 ms. Result :sat
Minimization took 4898 ms.
[2024-05-30 23:04:58] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-30 23:04:58] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2024-05-30 23:04:58] [INFO ] [Real]Added 147 Read/Feed constraints in 104 ms returned sat
[2024-05-30 23:04:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:04:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-30 23:04:59] [INFO ] [Nat]Absence check using state equation in 352 ms returned sat
[2024-05-30 23:05:00] [INFO ] [Nat]Added 147 Read/Feed constraints in 789 ms returned sat
[2024-05-30 23:05:00] [INFO ] Deduced a trap composed of 97 places in 492 ms of which 2 ms to minimize.
[2024-05-30 23:05:01] [INFO ] Deduced a trap composed of 136 places in 517 ms of which 2 ms to minimize.
[2024-05-30 23:05:01] [INFO ] Deduced a trap composed of 136 places in 511 ms of which 3 ms to minimize.
[2024-05-30 23:05:02] [INFO ] Deduced a trap composed of 153 places in 496 ms of which 2 ms to minimize.
[2024-05-30 23:05:03] [INFO ] Deduced a trap composed of 38 places in 481 ms of which 2 ms to minimize.
[2024-05-30 23:05:03] [INFO ] Deduced a trap composed of 50 places in 479 ms of which 2 ms to minimize.
[2024-05-30 23:05:04] [INFO ] Deduced a trap composed of 50 places in 455 ms of which 2 ms to minimize.
[2024-05-30 23:05:04] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3944 ms
[2024-05-30 23:05:04] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 306 ms.
[2024-05-30 23:05:04] [INFO ] Added : 2 causal constraints over 1 iterations in 530 ms. Result :sat
Minimization took 4892 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 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 292 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 292 ms. Remains : 305/305 places, 7808/7808 transitions.
[2024-05-30 23:05:09] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 23:05:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000004 steps (2 resets) in 695 ms. (1436 steps per ms)
BEST_FIRST walk for 2000000 steps (4 resets) in 1333 ms. (1499 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-05-30 23:05:11] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 23:05:11] [INFO ] Invariant cache hit.
[2024-05-30 23:05:11] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-30 23:05:12] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2024-05-30 23:05:12] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 23:05:12] [INFO ] [Real]Added 147 Read/Feed constraints in 170 ms returned sat
[2024-05-30 23:05:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:05:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-30 23:05:13] [INFO ] [Nat]Absence check using state equation in 371 ms returned sat
[2024-05-30 23:05:13] [INFO ] [Nat]Added 147 Read/Feed constraints in 517 ms returned sat
[2024-05-30 23:05:14] [INFO ] Deduced a trap composed of 37 places in 508 ms of which 2 ms to minimize.
[2024-05-30 23:05:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 617 ms
[2024-05-30 23:05:14] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 315 ms.
[2024-05-30 23:05:14] [INFO ] Added : 0 causal constraints over 0 iterations in 470 ms. Result :sat
Minimization took 4897 ms.
[2024-05-30 23:05:19] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-30 23:05:19] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2024-05-30 23:05:20] [INFO ] [Real]Added 147 Read/Feed constraints in 100 ms returned sat
[2024-05-30 23:05:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:05:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-30 23:05:20] [INFO ] [Nat]Absence check using state equation in 347 ms returned sat
[2024-05-30 23:05:21] [INFO ] [Nat]Added 147 Read/Feed constraints in 777 ms returned sat
[2024-05-30 23:05:21] [INFO ] Deduced a trap composed of 97 places in 492 ms of which 2 ms to minimize.
[2024-05-30 23:05:22] [INFO ] Deduced a trap composed of 136 places in 488 ms of which 2 ms to minimize.
[2024-05-30 23:05:22] [INFO ] Deduced a trap composed of 136 places in 501 ms of which 2 ms to minimize.
[2024-05-30 23:05:23] [INFO ] Deduced a trap composed of 153 places in 489 ms of which 3 ms to minimize.
[2024-05-30 23:05:24] [INFO ] Deduced a trap composed of 38 places in 462 ms of which 2 ms to minimize.
[2024-05-30 23:05:24] [INFO ] Deduced a trap composed of 50 places in 458 ms of which 2 ms to minimize.
[2024-05-30 23:05:25] [INFO ] Deduced a trap composed of 50 places in 434 ms of which 2 ms to minimize.
[2024-05-30 23:05:25] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3786 ms
[2024-05-30 23:05:25] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 311 ms.
[2024-05-30 23:05:25] [INFO ] Added : 2 causal constraints over 1 iterations in 528 ms. Result :sat
Minimization took 4898 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 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 200 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 202 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 187 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-05-30 23:05:30] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 23:05:30] [INFO ] Invariant cache hit.
[2024-05-30 23:05:31] [INFO ] Implicit Places using invariants in 638 ms returned []
[2024-05-30 23:05:31] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 23:05:31] [INFO ] Invariant cache hit.
[2024-05-30 23:05:31] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 23:05:49] [INFO ] Implicit Places using invariants and state equation in 17486 ms returned []
Implicit Place search using SMT with State Equation took 18128 ms to find 0 implicit places.
[2024-05-30 23:05:49] [INFO ] Redundant transitions in 839 ms returned []
Running 7806 sub problems to find dead transitions.
[2024-05-30 23:05:50] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 23:05:50] [INFO ] Invariant cache hit.
[2024-05-30 23:05:50] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/2909 variables, and 3 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30155 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 30085 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 86889ms problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 86996ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106200 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40022 steps (8 resets) in 588 ms. (67 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 129 ms. (307 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 101 ms. (392 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 145807 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 4
Probabilistic random walk after 145807 steps, saw 113728 distinct states, run finished after 3012 ms. (steps per millisecond=48 ) properties seen :0
[2024-05-30 23:07:20] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 23:07:20] [INFO ] Invariant cache hit.
[2024-05-30 23:07:20] [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-05-30 23:07:21] [INFO ] Deduced a trap composed of 131 places in 446 ms of which 2 ms to minimize.
[2024-05-30 23:07:21] [INFO ] Deduced a trap composed of 130 places in 385 ms of which 2 ms to minimize.
[2024-05-30 23:07:21] [INFO ] Deduced a trap composed of 129 places in 414 ms of which 2 ms to minimize.
[2024-05-30 23:07:22] [INFO ] Deduced a trap composed of 131 places in 388 ms of which 2 ms to minimize.
[2024-05-30 23:07:22] [INFO ] Deduced a trap composed of 129 places in 408 ms of which 5 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-05-30 23:07:23] [INFO ] Deduced a trap composed of 146 places in 319 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 4192 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-05-30 23:07:25] [INFO ] Deduced a trap composed of 50 places in 308 ms of which 2 ms to minimize.
[2024-05-30 23:07:25] [INFO ] Deduced a trap composed of 74 places in 297 ms of which 3 ms to minimize.
[2024-05-30 23:07:25] [INFO ] Deduced a trap composed of 79 places in 296 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
[2024-05-30 23:07:28] [INFO ] Deduced a trap composed of 78 places in 403 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2909 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2909 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 469 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5015 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: 10/10 constraints]
After SMT, in 9245ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
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 192 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 193 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40017 steps (8 resets) in 151 ms. (263 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
[2024-05-30 23:07:29] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 23:07:29] [INFO ] Invariant cache hit.
[2024-05-30 23:07:30] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 255/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 23:07:30] [INFO ] Deduced a trap composed of 75 places in 404 ms of which 2 ms to minimize.
[2024-05-30 23:07:31] [INFO ] Deduced a trap composed of 36 places in 399 ms of which 2 ms to minimize.
[2024-05-30 23:07:31] [INFO ] Deduced a trap composed of 72 places in 381 ms of which 2 ms to minimize.
[2024-05-30 23:07:31] [INFO ] Deduced a trap composed of 42 places in 390 ms of which 2 ms to minimize.
[2024-05-30 23:07:32] [INFO ] Deduced a trap composed of 129 places in 383 ms of which 2 ms to minimize.
[2024-05-30 23:07:32] [INFO ] Deduced a trap composed of 129 places in 370 ms of which 2 ms to minimize.
[2024-05-30 23:07:32] [INFO ] Deduced a trap composed of 138 places in 379 ms of which 2 ms to minimize.
[2024-05-30 23:07:33] [INFO ] Deduced a trap composed of 64 places in 357 ms of which 2 ms to minimize.
[2024-05-30 23:07:33] [INFO ] Deduced a trap composed of 50 places in 321 ms of which 2 ms to minimize.
[2024-05-30 23:07:34] [INFO ] Deduced a trap composed of 60 places in 347 ms of which 2 ms to minimize.
[2024-05-30 23:07:34] [INFO ] Deduced a trap composed of 58 places in 307 ms of which 3 ms to minimize.
[2024-05-30 23:07:34] [INFO ] Deduced a trap composed of 74 places in 351 ms of which 2 ms to minimize.
[2024-05-30 23:07:35] [INFO ] Deduced a trap composed of 64 places in 298 ms of which 2 ms to minimize.
[2024-05-30 23:07:35] [INFO ] Deduced a trap composed of 72 places in 290 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2604/2909 variables, 305/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 147/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2909 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 469 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6157 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 255/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2604/2909 variables, 305/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 147/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 2/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/2909 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 471 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1625 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 14/14 constraints]
After SMT, in 7840ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 7856 steps, including 132 resets, run visited all 2 properties in 245 ms. (steps per millisecond=32 )
Parikh walk visited 2 properties in 256 ms.
FORMULA Szymanski-PT-b12-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
FORMULA Szymanski-PT-b12-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 220710 ms.
ITS solved all properties within timeout

BK_STOP 1717110458158

--------------------
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

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="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is 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 r399-tall-171690531400901"
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 ;