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-171690533300861.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-b02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690533300861
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Apr 11 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 11 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 15:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 15:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:01 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-b02-UpperBounds-00
FORMULA_NAME Szymanski-PT-b02-UpperBounds-01
FORMULA_NAME Szymanski-PT-b02-UpperBounds-02
FORMULA_NAME Szymanski-PT-b02-UpperBounds-03
FORMULA_NAME Szymanski-PT-b02-UpperBounds-04
FORMULA_NAME Szymanski-PT-b02-UpperBounds-05
FORMULA_NAME Szymanski-PT-b02-UpperBounds-06
FORMULA_NAME Szymanski-PT-b02-UpperBounds-07
FORMULA_NAME Szymanski-PT-b02-UpperBounds-08
FORMULA_NAME Szymanski-PT-b02-UpperBounds-09
FORMULA_NAME Szymanski-PT-b02-UpperBounds-10
FORMULA_NAME Szymanski-PT-b02-UpperBounds-11
FORMULA_NAME Szymanski-PT-b02-UpperBounds-12
FORMULA_NAME Szymanski-PT-b02-UpperBounds-13
FORMULA_NAME Szymanski-PT-b02-UpperBounds-14
FORMULA_NAME Szymanski-PT-b02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717281995094

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-b02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 22:46:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 22:46:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 22:46:36] [INFO ] Load time of PNML (sax parser for PT used): 328 ms
[2024-06-01 22:46:36] [INFO ] Transformed 568 places.
[2024-06-01 22:46:36] [INFO ] Transformed 8320 transitions.
[2024-06-01 22:46:36] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 460 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 260 places in 23 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b02-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 22:46:36] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2024-06-01 22:46:36] [INFO ] Computed 3 invariants in 56 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 88 ms. (112 steps per ms)
FORMULA Szymanski-PT-b02-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80005 steps (16 resets) in 233 ms. (341 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2024-06-01 22:46:37] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-06-01 22:46:37] [INFO ] Invariant cache hit.
[2024-06-01 22:46:37] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-06-01 22:46:37] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 19 ms returned sat
[2024-06-01 22:46:37] [INFO ] [Real]Absence check using state equation in 486 ms returned sat
[2024-06-01 22:46:38] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 22:46:38] [INFO ] [Real]Added 147 Read/Feed constraints in 110 ms returned sat
[2024-06-01 22:46:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 22:46:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 22:46:38] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 22:46:38] [INFO ] [Nat]Absence check using state equation in 413 ms returned sat
[2024-06-01 22:46:39] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 22:46:39] [INFO ] [Nat]Added 147 Read/Feed constraints in 1047 ms returned unknown
[2024-06-01 22:46:39] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 22:46:39] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 22:46:40] [INFO ] [Real]Absence check using state equation in 500 ms returned sat
[2024-06-01 22:46:40] [INFO ] [Real]Added 147 Read/Feed constraints in 130 ms returned sat
[2024-06-01 22:46:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 22:46:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 22:46:40] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 22:46:41] [INFO ] [Nat]Absence check using state equation in 513 ms returned sat
[2024-06-01 22:46:41] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 22:46:42] [INFO ] [Nat]Added 147 Read/Feed constraints in 1046 ms returned unknown
[2024-06-01 22:46:42] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 22:46:42] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 22:46:42] [INFO ] [Real]Absence check using state equation in 420 ms returned sat
[2024-06-01 22:46:43] [INFO ] [Real]Added 147 Read/Feed constraints in 285 ms returned sat
[2024-06-01 22:46:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 22:46:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 22:46:43] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 22:46:43] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2024-06-01 22:46:44] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 22:46:44] [INFO ] [Nat]Added 147 Read/Feed constraints in 1054 ms returned unknown
[2024-06-01 22:46:44] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-06-01 22:46:44] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 22:46:45] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2024-06-01 22:46:45] [INFO ] [Real]Added 147 Read/Feed constraints in 295 ms returned sat
[2024-06-01 22:46:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 22:46:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 22:46:45] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 22:46:46] [INFO ] [Nat]Absence check using state equation in 425 ms returned sat
[2024-06-01 22:46:46] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 22:46:47] [INFO ] [Nat]Added 147 Read/Feed constraints in 1045 ms returned unknown
[2024-06-01 22:46:47] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 22:46:47] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 22:46:47] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2024-06-01 22:46:47] [INFO ] [Real]Added 147 Read/Feed constraints in 296 ms returned sat
[2024-06-01 22:46:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 22:46:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 22:46:48] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 22:46:48] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2024-06-01 22:46:48] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 22:46:49] [INFO ] [Nat]Added 147 Read/Feed constraints in 1049 ms returned unknown
[2024-06-01 22:46:49] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 22:46:49] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 22:46:49] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2024-06-01 22:46:49] [INFO ] [Real]Added 147 Read/Feed constraints in 57 ms returned sat
[2024-06-01 22:46:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 22:46:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 22:46:50] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 3 ms returned sat
[2024-06-01 22:46:50] [INFO ] [Nat]Absence check using state equation in 356 ms returned sat
[2024-06-01 22:46:50] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 22:46:51] [INFO ] [Nat]Added 147 Read/Feed constraints in 1040 ms returned unknown
[2024-06-01 22:46:51] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-06-01 22:46:51] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 22:46:51] [INFO ] [Real]Absence check using state equation in 401 ms returned sat
[2024-06-01 22:46:52] [INFO ] [Real]Added 147 Read/Feed constraints in 139 ms returned sat
[2024-06-01 22:46:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 22:46:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 22:46:52] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 22:46:52] [INFO ] [Nat]Absence check using state equation in 388 ms returned sat
[2024-06-01 22:46:53] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 22:46:53] [INFO ] [Nat]Added 147 Read/Feed constraints in 1039 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 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.18 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 125 transitions
Reduce isomorphic transitions removed 125 transitions.
Iterating post reduction 0 with 125 rules applied. Total rules applied 126 place count 306 transition count 7939
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 305 transition count 7811
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 305 transition count 7811
Applied a total of 128 rules in 523 ms. Remains 305 /308 variables (removed 3) and now considering 7811/8064 (removed 253) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 556 ms. Remains : 305/308 places, 7811/8064 transitions.
[2024-06-01 22:46:54] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
// Phase 1: matrix 2607 rows 305 cols
[2024-06-01 22:46:54] [INFO ] Computed 1 invariants in 39 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 2976 ms. (335 steps per ms)
FORMULA Szymanski-PT-b02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 6000005 steps (12 resets) in 6044 ms. (992 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2024-06-01 22:47:03] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
[2024-06-01 22:47:03] [INFO ] Invariant cache hit.
[2024-06-01 22:47:03] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2024-06-01 22:47:03] [INFO ] [Real]Absence check using state equation in 396 ms returned sat
[2024-06-01 22:47:03] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 22:47:04] [INFO ] [Real]Added 147 Read/Feed constraints in 173 ms returned sat
[2024-06-01 22:47:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 22:47:04] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2024-06-01 22:47:04] [INFO ] [Nat]Absence check using state equation in 464 ms returned sat
[2024-06-01 22:47:09] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 22:47:09] [INFO ] [Nat]Added 147 Read/Feed constraints in 5108 ms returned sat
[2024-06-01 22:47:10] [INFO ] Deduced a trap composed of 42 places in 891 ms of which 20 ms to minimize.
[2024-06-01 22:47:11] [INFO ] Deduced a trap composed of 44 places in 804 ms of which 3 ms to minimize.
[2024-06-01 22:47:12] [INFO ] Deduced a trap composed of 72 places in 399 ms of which 6 ms to minimize.
[2024-06-01 22:47:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2378 ms
[2024-06-01 22:47:12] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2596 transitions) in 503 ms.
[2024-06-01 22:47:12] [INFO ] Added : 0 causal constraints over 0 iterations in 685 ms. Result :sat
Minimization took 4510 ms.
[2024-06-01 22:47:17] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2024-06-01 22:47:17] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2024-06-01 22:47:18] [INFO ] [Real]Added 147 Read/Feed constraints in 334 ms returned sat
[2024-06-01 22:47:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 22:47:18] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2024-06-01 22:47:18] [INFO ] [Nat]Absence check using state equation in 378 ms returned sat
[2024-06-01 22:47:23] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 22:47:24] [INFO ] [Nat]Added 147 Read/Feed constraints in 5281 ms returned sat
[2024-06-01 22:47:24] [INFO ] Deduced a trap composed of 74 places in 410 ms of which 3 ms to minimize.
[2024-06-01 22:47:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 546 ms
[2024-06-01 22:47:25] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2596 transitions) in 496 ms.
[2024-06-01 22:47:25] [INFO ] Added : 0 causal constraints over 0 iterations in 670 ms. Result :sat
Minimization took 4501 ms.
[2024-06-01 22:47:29] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-06-01 22:47:30] [INFO ] [Real]Absence check using state equation in 390 ms returned sat
[2024-06-01 22:47:30] [INFO ] [Real]Added 147 Read/Feed constraints in 216 ms returned sat
[2024-06-01 22:47:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 22:47:30] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-06-01 22:47:31] [INFO ] [Nat]Absence check using state equation in 359 ms returned sat
[2024-06-01 22:47:35] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 22:47:40] [INFO ] [Nat]Added 147 Read/Feed constraints in 9038 ms returned unknown
[2024-06-01 22:47:40] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-06-01 22:47:40] [INFO ] [Real]Absence check using state equation in 388 ms returned sat
[2024-06-01 22:47:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 22:47:40] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-06-01 22:47:41] [INFO ] [Nat]Absence check using state equation in 442 ms returned sat
[2024-06-01 22:47:45] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 22:47:50] [INFO ] [Nat]Added 147 Read/Feed constraints in 9047 ms returned unknown
[2024-06-01 22:47:50] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 5 ms returned sat
[2024-06-01 22:47:50] [INFO ] [Real]Absence check using state equation in 422 ms returned sat
[2024-06-01 22:47:51] [INFO ] [Real]Added 147 Read/Feed constraints in 683 ms returned sat
[2024-06-01 22:47:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 22:47:51] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-06-01 22:47:51] [INFO ] [Nat]Absence check using state equation in 386 ms returned sat
[2024-06-01 22:47:54] [INFO ] [Nat]Added 147 Read/Feed constraints in 3029 ms returned sat
[2024-06-01 22:47:55] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2596 transitions) in 468 ms.
[2024-06-01 22:47:55] [INFO ] Added : 0 causal constraints over 0 iterations in 623 ms. Result :sat
Minimization took 4503 ms.
[2024-06-01 22:48:00] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2024-06-01 22:48:00] [INFO ] [Real]Absence check using state equation in 380 ms returned sat
[2024-06-01 22:48:00] [INFO ] [Real]Added 147 Read/Feed constraints in 93 ms returned sat
[2024-06-01 22:48:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 22:48:00] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-06-01 22:48:01] [INFO ] [Nat]Absence check using state equation in 373 ms returned sat
[2024-06-01 22:48:04] [INFO ] [Nat]Added 147 Read/Feed constraints in 2946 ms returned sat
[2024-06-01 22:48:04] [INFO ] Deduced a trap composed of 47 places in 384 ms of which 4 ms to minimize.
[2024-06-01 22:48:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 506 ms
[2024-06-01 22:48:05] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2596 transitions) in 575 ms.
[2024-06-01 22:48:05] [INFO ] Added : 0 causal constraints over 0 iterations in 716 ms. Result :sat
Minimization took 4502 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7811/7811 transitions.
Applied a total of 0 rules in 361 ms. Remains 305 /305 variables (removed 0) and now considering 7811/7811 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 361 ms. Remains : 305/305 places, 7811/7811 transitions.
[2024-06-01 22:48:10] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
[2024-06-01 22:48:10] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 2430 ms. (411 steps per ms)
FORMULA Szymanski-PT-b02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 5000004 steps (10 resets) in 5049 ms. (990 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2024-06-01 22:48:17] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
[2024-06-01 22:48:17] [INFO ] Invariant cache hit.
[2024-06-01 22:48:17] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2024-06-01 22:48:18] [INFO ] [Real]Absence check using state equation in 379 ms returned sat
[2024-06-01 22:48:18] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 22:48:18] [INFO ] [Real]Added 147 Read/Feed constraints in 153 ms returned sat
[2024-06-01 22:48:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 22:48:18] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-06-01 22:48:18] [INFO ] [Nat]Absence check using state equation in 364 ms returned sat
[2024-06-01 22:48:23] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 22:48:24] [INFO ] [Nat]Added 147 Read/Feed constraints in 5690 ms returned sat
[2024-06-01 22:48:24] [INFO ] Deduced a trap composed of 72 places in 401 ms of which 11 ms to minimize.
[2024-06-01 22:48:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 521 ms
[2024-06-01 22:48:25] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2596 transitions) in 330 ms.
[2024-06-01 22:48:25] [INFO ] Added : 0 causal constraints over 0 iterations in 515 ms. Result :sat
Minimization took 4502 ms.
[2024-06-01 22:48:30] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-06-01 22:48:30] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2024-06-01 22:48:30] [INFO ] [Real]Added 147 Read/Feed constraints in 336 ms returned sat
[2024-06-01 22:48:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 22:48:31] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2024-06-01 22:48:31] [INFO ] [Nat]Absence check using state equation in 442 ms returned sat
[2024-06-01 22:48:35] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 22:48:36] [INFO ] [Nat]Added 147 Read/Feed constraints in 4987 ms returned sat
[2024-06-01 22:48:36] [INFO ] Deduced a trap composed of 74 places in 378 ms of which 2 ms to minimize.
[2024-06-01 22:48:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 491 ms
[2024-06-01 22:48:37] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2596 transitions) in 317 ms.
[2024-06-01 22:48:37] [INFO ] Added : 0 causal constraints over 0 iterations in 470 ms. Result :sat
Minimization took 4501 ms.
[2024-06-01 22:48:41] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2024-06-01 22:48:42] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2024-06-01 22:48:42] [INFO ] [Real]Added 147 Read/Feed constraints in 214 ms returned sat
[2024-06-01 22:48:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 22:48:42] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-06-01 22:48:43] [INFO ] [Nat]Absence check using state equation in 401 ms returned sat
[2024-06-01 22:48:47] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 22:48:52] [INFO ] [Nat]Added 147 Read/Feed constraints in 9074 ms returned unknown
[2024-06-01 22:48:52] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2024-06-01 22:48:52] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2024-06-01 22:48:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 22:48:52] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-06-01 22:48:53] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2024-06-01 22:48:57] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 22:49:02] [INFO ] [Nat]Added 147 Read/Feed constraints in 9042 ms returned unknown
[2024-06-01 22:49:02] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2024-06-01 22:49:02] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2024-06-01 22:49:03] [INFO ] [Real]Added 147 Read/Feed constraints in 695 ms returned sat
[2024-06-01 22:49:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 22:49:03] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2024-06-01 22:49:03] [INFO ] [Nat]Absence check using state equation in 411 ms returned sat
[2024-06-01 22:49:06] [INFO ] [Nat]Added 147 Read/Feed constraints in 3131 ms returned sat
[2024-06-01 22:49:07] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2596 transitions) in 336 ms.
[2024-06-01 22:49:07] [INFO ] Added : 0 causal constraints over 0 iterations in 501 ms. Result :sat
Minimization took 4501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7811/7811 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 305 transition count 7809
Applied a total of 2 rules in 271 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7811 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 281 ms. Remains : 305/305 places, 7809/7811 transitions.
[2024-06-01 22:49:12] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2024-06-01 22:49:12] [INFO ] Computed 2 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 2360 ms. (423 steps per ms)
BEST_FIRST walk for 5000004 steps (10 resets) in 4988 ms. (1002 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2024-06-01 22:49:19] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-06-01 22:49:19] [INFO ] Invariant cache hit.
[2024-06-01 22:49:19] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 22:49:19] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 22:49:20] [INFO ] [Real]Absence check using state equation in 355 ms returned sat
[2024-06-01 22:49:20] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 22:49:20] [INFO ] [Real]Added 147 Read/Feed constraints in 180 ms returned sat
[2024-06-01 22:49:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 22:49:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-06-01 22:49:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 22:49:20] [INFO ] [Nat]Absence check using state equation in 355 ms returned sat
[2024-06-01 22:49:25] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 22:49:26] [INFO ] [Nat]Added 147 Read/Feed constraints in 5868 ms returned sat
[2024-06-01 22:49:27] [INFO ] Deduced a trap composed of 32 places in 511 ms of which 2 ms to minimize.
[2024-06-01 22:49:27] [INFO ] Deduced a trap composed of 44 places in 486 ms of which 2 ms to minimize.
[2024-06-01 22:49:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1168 ms
[2024-06-01 22:49:28] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2594 transitions) in 297 ms.
[2024-06-01 22:49:28] [INFO ] Added : 0 causal constraints over 0 iterations in 452 ms. Result :sat
Minimization took 4911 ms.
[2024-06-01 22:49:33] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-06-01 22:49:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 22:49:33] [INFO ] [Real]Absence check using state equation in 453 ms returned sat
[2024-06-01 22:49:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 22:49:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 22:49:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 22:49:34] [INFO ] [Nat]Absence check using state equation in 420 ms returned sat
[2024-06-01 22:49:38] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 22:49:40] [INFO ] [Nat]Added 147 Read/Feed constraints in 6554 ms returned sat
[2024-06-01 22:49:41] [INFO ] Deduced a trap composed of 45 places in 539 ms of which 2 ms to minimize.
[2024-06-01 22:49:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 655 ms
[2024-06-01 22:49:41] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2594 transitions) in 300 ms.
[2024-06-01 22:49:42] [INFO ] Added : 0 causal constraints over 0 iterations in 456 ms. Result :sat
Minimization took 4503 ms.
[2024-06-01 22:49:46] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-06-01 22:49:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 22:49:46] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2024-06-01 22:49:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 22:49:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 22:49:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 22:49:47] [INFO ] [Nat]Absence check using state equation in 371 ms returned sat
[2024-06-01 22:49:51] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 22:49:56] [INFO ] [Nat]Added 147 Read/Feed constraints in 9036 ms returned unknown
[2024-06-01 22:49:56] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 22:49:56] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 22:49:56] [INFO ] [Real]Absence check using state equation in 384 ms returned sat
[2024-06-01 22:49:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 22:49:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-06-01 22:49:57] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2024-06-01 22:49:57] [INFO ] [Nat]Absence check using state equation in 386 ms returned sat
[2024-06-01 22:50:01] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 22:50:06] [INFO ] [Nat]Added 147 Read/Feed constraints in 9053 ms returned unknown
[2024-06-01 22:50:06] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-06-01 22:50:06] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 22:50:06] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2024-06-01 22:50:06] [INFO ] [Real]Added 147 Read/Feed constraints in 57 ms returned sat
[2024-06-01 22:50:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 22:50:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 22:50:07] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 22:50:07] [INFO ] [Nat]Absence check using state equation in 322 ms returned sat
[2024-06-01 22:50:11] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 22:50:13] [INFO ] [Nat]Added 147 Read/Feed constraints in 6214 ms returned sat
[2024-06-01 22:50:14] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2594 transitions) in 333 ms.
[2024-06-01 22:50:14] [INFO ] Added : 0 causal constraints over 0 iterations in 488 ms. Result :sat
Minimization took 4681 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 269 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 269 ms. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 193 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2024-06-01 22:50:19] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-06-01 22:50:19] [INFO ] Invariant cache hit.
[2024-06-01 22:50:19] [INFO ] Implicit Places using invariants in 548 ms returned []
[2024-06-01 22:50:19] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-06-01 22:50:19] [INFO ] Invariant cache hit.
[2024-06-01 22:50:20] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 22:50:50] [INFO ] Performed 290/305 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 22:50:54] [INFO ] Implicit Places using invariants and state equation in 35010 ms returned []
Implicit Place search using SMT with State Equation took 35568 ms to find 0 implicit places.
[2024-06-01 22:50:55] [INFO ] Redundant transitions in 903 ms returned []
Running 7807 sub problems to find dead transitions.
[2024-06-01 22:50:56] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-06-01 22:50:56] [INFO ] Invariant cache hit.
[2024-06-01 22:50:56] [INFO ] State equation strengthened by 147 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 timeout
1.0)
(s80 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7807 unsolved
SMT process timed out in 58503ms, After SMT, problems are : Problem set: 0 solved, 7807 unsolved
Search for dead transitions found 0 dead transitions in 58671ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95396 ms. Remains : 305/305 places, 7809/7809 transitions.
RANDOM walk for 40001 steps (8 resets) in 1129 ms. (35 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 259 ms. (153 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 198 ms. (201 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 189 ms. (210 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 135 ms. (294 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 6/6 properties
[2024-06-01 22:51:55] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-06-01 22:51:55] [INFO ] Invariant cache hit.
[2024-06-01 22:51:55] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 283/286 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 22:51:55] [INFO ] Deduced a trap composed of 33 places in 388 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 19/305 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 2605/2910 variables, 305/308 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2910 variables, 147/455 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2910 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/2910 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2910/2910 variables, and 455 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 283/286 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 19/305 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 2605/2910 variables, 305/308 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2910/2910 variables, and 455 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 0/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 10075ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 305 transition count 7808
Applied a total of 1 rules in 185 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7809 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 305/305 places, 7808/7809 transitions.
RANDOM walk for 40002 steps (8 resets) in 325 ms. (122 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 148 ms. (268 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 161 ms. (246 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 135 ms. (294 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 113 ms. (350 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 115 ms. (344 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 127538 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 6
Probabilistic random walk after 127538 steps, saw 44669 distinct states, run finished after 3004 ms. (steps per millisecond=42 ) properties seen :0
[2024-06-01 22:52:09] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-06-01 22:52:09] [INFO ] Computed 3 invariants in 20 ms
[2024-06-01 22:52:09] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 253/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 22:52:09] [INFO ] Deduced a trap composed of 44 places in 446 ms of which 2 ms to minimize.
[2024-06-01 22:52:10] [INFO ] Deduced a trap composed of 92 places in 411 ms of which 2 ms to minimize.
[2024-06-01 22:52:10] [INFO ] Deduced a trap composed of 36 places in 388 ms of which 2 ms to minimize.
[2024-06-01 22:52:11] [INFO ] Deduced a trap composed of 42 places in 397 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 2604/2909 variables, 305/312 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 147/459 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 22:52:14] [INFO ] Deduced a trap composed of 45 places in 554 ms of which 2 ms to minimize.
[2024-06-01 22:52:14] [INFO ] Deduced a trap composed of 144 places in 566 ms of which 3 ms to minimize.
[2024-06-01 22:52:16] [INFO ] Deduced a trap composed of 50 places in 491 ms of which 2 ms to minimize.
[2024-06-01 22:52:16] [INFO ] Deduced a trap composed of 138 places in 559 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 4/463 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/2909 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 463 constraints, problems are : Problem set: 0 solved, 6 unsolved in 13364 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 253/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 22:52:23] [INFO ] Deduced a trap composed of 131 places in 406 ms of which 2 ms to minimize.
[2024-06-01 22:52:23] [INFO ] Deduced a trap composed of 129 places in 451 ms of which 3 ms to minimize.
[2024-06-01 22:52:24] [INFO ] Deduced a trap composed of 129 places in 445 ms of which 2 ms to minimize.
[2024-06-01 22:52:24] [INFO ] Deduced a trap composed of 140 places in 249 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 19/305 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 2604/2909 variables, 305/320 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 147/467 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 473 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45023 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 12/12 constraints]
After SMT, in 58437ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
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 191 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 192 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 189 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-06-01 22:53:08] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 22:53:08] [INFO ] Invariant cache hit.
[2024-06-01 22:53:08] [INFO ] Implicit Places using invariants in 561 ms returned []
[2024-06-01 22:53:08] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 22:53:08] [INFO ] Invariant cache hit.
[2024-06-01 22:53:09] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 22:53:31] [INFO ] Implicit Places using invariants and state equation in 22947 ms returned []
Implicit Place search using SMT with State Equation took 23511 ms to find 0 implicit places.
[2024-06-01 22:53:32] [INFO ] Redundant transitions in 795 ms returned []
Running 7806 sub problems to find dead transitions.
[2024-06-01 22:53:32] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 22:53:32] [INFO ] Invariant cache hit.
[2024-06-01 22:53:32] [INFO ] State equation strengthened by 147 read => feed constraints.
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.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 timeout
0.0 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 30113 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7806/7806 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7806 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2024-06-01 22:54:34] [INFO ] Deduced a trap composed of 108 places in 604 ms of which 2 ms to minimize.
[2024-06-01 22:54:34] [INFO ] Deduced a trap composed of 138 places in 390 ms of which 1 ms to minimize.
[2024-06-01 22:54:36] [INFO ] Deduced a trap composed of 32 places in 482 ms of which 2 ms to minimize.
[2024-06-01 22:54:37] [INFO ] Deduced a trap composed of 39 places in 552 ms of which 2 ms to minimize.
[2024-06-01 22:54:38] [INFO ] Deduced a trap composed of 45 places in 532 ms of which 3 ms to minimize.
[2024-06-01 22:54:38] [INFO ] Deduced a trap composed of 41 places in 513 ms of which 2 ms to minimize.
[2024-06-01 22:54:39] [INFO ] Deduced a trap composed of 80 places in 542 ms of which 2 ms to minimize.
[2024-06-01 22:54:39] [INFO ] Deduced a trap composed of 48 places in 470 ms of which 2 ms to minimize.
[2024-06-01 22:54:40] [INFO ] Deduced a trap composed of 75 places in 389 ms of which 2 ms to minimize.
[2024-06-01 22:54:40] [INFO ] Deduced a trap composed of 31 places in 494 ms of which 5 ms to minimize.
[2024-06-01 22:54:41] [INFO ] Deduced a trap composed of 44 places in 467 ms of which 4 ms to minimize.
[2024-06-01 22:54:41] [INFO ] Deduced a trap composed of 72 places in 417 ms of which 2 ms to minimize.
[2024-06-01 22:54:44] [INFO ] Deduced a trap composed of 91 places in 505 ms of which 2 ms to minimize.
[2024-06-01 22:54:44] [INFO ] Deduced a trap composed of 60 places in 545 ms of which 3 ms to minimize.
[2024-06-01 22:54:45] [INFO ] Deduced a trap composed of 88 places in 536 ms of which 2 ms to minimize.
[2024-06-01 22:54:46] [INFO ] Deduced a trap composed of 51 places in 561 ms of which 2 ms to minimize.
[2024-06-01 22:54:46] [INFO ] Deduced a trap composed of 99 places in 488 ms of which 2 ms to minimize.
[2024-06-01 22:54:47] [INFO ] Deduced a trap composed of 60 places in 546 ms of which 2 ms to minimize.
[2024-06-01 22:54:47] [INFO ] Deduced a trap composed of 107 places in 533 ms of which 3 ms to minimize.
[2024-06-01 22:54:48] [INFO ] Deduced a trap composed of 61 places in 515 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2024-06-01 22:54:53] [INFO ] Deduced a trap composed of 120 places in 411 ms of which 2 ms to minimize.
[2024-06-01 22:54:54] [INFO ] Deduced a trap composed of 140 places in 259 ms of which 1 ms to minimize.
[2024-06-01 22:54:55] [INFO ] Deduced a trap composed of 113 places in 381 ms of which 1 ms to minimize.
[2024-06-01 22:54:56] [INFO ] Deduced a trap composed of 93 places in 453 ms of which 2 ms to minimize.
[2024-06-01 22:54:57] [INFO ] Deduced a trap composed of 93 places in 392 ms of which 2 ms to minimize.
[2024-06-01 22:54:57] [INFO ] Deduced a trap composed of 75 places in 425 ms of which 2 ms to minimize.
[2024-06-01 22:54:58] [INFO ] Deduced a trap composed of 86 places in 414 ms of which 2 ms to minimize.
[2024-06-01 22:54:58] [INFO ] Deduced a trap composed of 94 places in 398 ms of which 1 ms to minimize.
[2024-06-01 22:54:59] [INFO ] Deduced a trap composed of 144 places in 491 ms of which 2 ms to minimize.
[2024-06-01 22:54:59] [INFO ] Deduced a trap composed of 132 places in 480 ms of which 2 ms to minimize.
[2024-06-01 22:55:00] [INFO ] Deduced a trap composed of 116 places in 453 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/2909 variables, and 34 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30098 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7806 constraints, Known Traps: 31/31 constraints]
After SMT, in 88320ms problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 88397ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112937 ms. Remains : 305/305 places, 7808/7808 transitions.
FORMULA Szymanski-PT-b02-UpperBounds-07 1 TECHNIQUES REACHABILITY_MAX
FORMULA Szymanski-PT-b02-UpperBounds-00 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Starting property specific reduction for Szymanski-PT-b02-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 22:55:00] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2024-06-01 22:55:00] [INFO ] Computed 2 invariants in 18 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10001 steps (2 resets) in 27 ms. (357 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 22:55:00] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-06-01 22:55:00] [INFO ] Invariant cache hit.
[2024-06-01 22:55:00] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-06-01 22:55:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 22:55:01] [INFO ] [Real]Absence check using state equation in 521 ms returned sat
[2024-06-01 22:55:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 22:55:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-06-01 22:55:01] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 22:55:01] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2024-06-01 22:55:01] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 22:55:02] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 22:55:03] [INFO ] [Nat]Added 147 Read/Feed constraints in 1045 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 305 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p150) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 305 transition count 7807
Applied a total of 1 rules in 188 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7808 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 305/305 places, 7807/7808 transitions.
[2024-06-01 22:55:03] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
// Phase 1: matrix 2603 rows 305 cols
[2024-06-01 22:55:03] [INFO ] Computed 3 invariants in 21 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 3060 ms. (326 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 1150 ms. (868 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 22:55:07] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2024-06-01 22:55:07] [INFO ] Invariant cache hit.
[2024-06-01 22:55:07] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 22:55:07] [INFO ] [Real]Absence check using state equation in 369 ms returned sat
[2024-06-01 22:55:07] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 22:55:08] [INFO ] [Real]Added 147 Read/Feed constraints in 99 ms returned sat
[2024-06-01 22:55:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 22:55:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 22:55:08] [INFO ] [Nat]Absence check using state equation in 424 ms returned sat
[2024-06-01 22:55:13] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 22:55:17] [INFO ] [Nat]Added 147 Read/Feed constraints in 9042 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 187 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 187 ms. Remains : 305/305 places, 7807/7807 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 176 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
[2024-06-01 22:55:17] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2024-06-01 22:55:17] [INFO ] Invariant cache hit.
[2024-06-01 22:55:18] [INFO ] Implicit Places using invariants in 573 ms returned []
[2024-06-01 22:55:18] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2024-06-01 22:55:18] [INFO ] Invariant cache hit.
[2024-06-01 22:55:18] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 22:56:03] [INFO ] Performed 301/305 implicitness test of which 0 returned IMPLICIT in 44 seconds.
[2024-06-01 22:56:21] [INFO ] Implicit Places using invariants and state equation in 63434 ms returned []
Implicit Place search using SMT with State Equation took 64012 ms to find 0 implicit places.
[2024-06-01 22:56:22] [INFO ] Redundant transitions in 862 ms returned []
Running 7805 sub problems to find dead transitions.
[2024-06-01 22:56:22] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2024-06-01 22:56:22] [INFO ] Invariant cache hit.
[2024-06-01 22:56:22] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/2908 variables, and 2 constraints, problems are : Problem set: 0 solved, 7805 unsolved in 30201 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7805/7805 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7805 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
[2024-06-01 22:57:24] [INFO ] Deduced a trap composed of 81 places in 485 ms of which 2 ms to minimize.
[2024-06-01 22:57:25] [INFO ] Deduced a trap composed of 89 places in 427 ms of which 1 ms to minimize.
[2024-06-01 22:57:25] [INFO ] Deduced a trap composed of 91 places in 406 ms of which 5 ms to minimize.
[2024-06-01 22:57:26] [INFO ] Deduced a trap composed of 91 places in 438 ms of which 1 ms to minimize.
[2024-06-01 22:57:26] [INFO ] Deduced a trap composed of 93 places in 397 ms of which 2 ms to minimize.
[2024-06-01 22:57:27] [INFO ] Deduced a trap composed of 87 places in 399 ms of which 1 ms to minimize.
[2024-06-01 22:57:29] [INFO ] Deduced a trap composed of 36 places in 424 ms of which 1 ms to minimize.
[2024-06-01 22:57:30] [INFO ] Deduced a trap composed of 62 places in 479 ms of which 3 ms to minimize.
[2024-06-01 22:57:30] [INFO ] Deduced a trap composed of 101 places in 462 ms of which 1 ms to minimize.
[2024-06-01 22:57:31] [INFO ] Deduced a trap composed of 123 places in 504 ms of which 2 ms to minimize.
[2024-06-01 22:57:32] [INFO ] Deduced a trap composed of 90 places in 448 ms of which 2 ms to minimize.
[2024-06-01 22:57:33] [INFO ] Deduced a trap composed of 93 places in 467 ms of which 1 ms to minimize.
[2024-06-01 22:57:34] [INFO ] Deduced a trap composed of 116 places in 429 ms of which 1 ms to minimize.
[2024-06-01 22:57:36] [INFO ] Deduced a trap composed of 114 places in 487 ms of which 1 ms to minimize.
[2024-06-01 22:57:38] [INFO ] Deduced a trap composed of 37 places in 366 ms of which 1 ms to minimize.
[2024-06-01 22:57:39] [INFO ] Deduced a trap composed of 132 places in 511 ms of which 1 ms to minimize.
[2024-06-01 22:57:39] [INFO ] Deduced a trap composed of 139 places in 496 ms of which 2 ms to minimize.
[2024-06-01 22:57:40] [INFO ] Deduced a trap composed of 138 places in 488 ms of which 2 ms to minimize.
[2024-06-01 22:57:40] [INFO ] Deduced a trap composed of 139 places in 471 ms of which 1 ms to minimize.
[2024-06-01 22:57:41] [INFO ] Deduced a trap composed of 143 places in 527 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
[2024-06-01 22:57:45] [INFO ] Deduced a trap composed of 44 places in 442 ms of which 1 ms to minimize.
[2024-06-01 22:57:46] [INFO ] Deduced a trap composed of 75 places in 441 ms of which 1 ms to minimize.
[2024-06-01 22:57:46] [INFO ] Deduced a trap composed of 75 places in 236 ms of which 1 ms to minimize.
[2024-06-01 22:57:46] [INFO ] Deduced a trap composed of 113 places in 380 ms of which 1 ms to minimize.
[2024-06-01 22:57:47] [INFO ] Deduced a trap composed of 106 places in 514 ms of which 1 ms to minimize.
[2024-06-01 22:57:51] [INFO ] Deduced a trap composed of 128 places in 532 ms of which 2 ms to minimize.
SMT process timed out in 88774ms, After SMT, problems are : Problem set: 0 solved, 7805 unsolved
Search for dead transitions found 0 dead transitions in 88839ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153912 ms. Remains : 305/305 places, 7807/7807 transitions.
RANDOM walk for 40001 steps (8 resets) in 251 ms. (158 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 144447 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 2
Probabilistic random walk after 144447 steps, saw 49550 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
[2024-06-01 22:57:54] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2024-06-01 22:57:54] [INFO ] Invariant cache hit.
[2024-06-01 22:57:54] [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-06-01 22:57:55] [INFO ] Deduced a trap composed of 48 places in 459 ms of which 2 ms to minimize.
[2024-06-01 22:57:55] [INFO ] Deduced a trap composed of 77 places in 446 ms of which 2 ms to minimize.
[2024-06-01 22:57:56] [INFO ] Deduced a trap composed of 72 places in 437 ms of which 2 ms to minimize.
[2024-06-01 22:57:56] [INFO ] Deduced a trap composed of 129 places in 455 ms of which 2 ms to minimize.
[2024-06-01 22:57:57] [INFO ] Deduced a trap composed of 129 places in 433 ms of which 2 ms to minimize.
[2024-06-01 22:57:57] [INFO ] Deduced a trap composed of 50 places in 381 ms of which 2 ms to minimize.
[2024-06-01 22:57:57] [INFO ] Deduced a trap composed of 78 places in 283 ms of which 2 ms to minimize.
[2024-06-01 22:57:58] [INFO ] Deduced a trap composed of 138 places in 289 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2603/2908 variables, 305/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2908 variables, 147/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2908 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2908 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2908/2908 variables, and 463 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4837 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: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 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, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2908/2908 variables, and 316 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1800 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 6663ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 68 ms.
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 176 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 178 ms. Remains : 305/305 places, 7807/7807 transitions.
RANDOM walk for 40000 steps (8 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 150580 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 2
Probabilistic random walk after 150580 steps, saw 51280 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
[2024-06-01 22:58:04] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2024-06-01 22:58:04] [INFO ] Invariant cache hit.
[2024-06-01 22:58:04] [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-06-01 22:58:05] [INFO ] Deduced a trap composed of 48 places in 461 ms of which 2 ms to minimize.
[2024-06-01 22:58:05] [INFO ] Deduced a trap composed of 77 places in 457 ms of which 3 ms to minimize.
[2024-06-01 22:58:06] [INFO ] Deduced a trap composed of 72 places in 399 ms of which 2 ms to minimize.
[2024-06-01 22:58:06] [INFO ] Deduced a trap composed of 129 places in 414 ms of which 2 ms to minimize.
[2024-06-01 22:58:07] [INFO ] Deduced a trap composed of 129 places in 412 ms of which 3 ms to minimize.
[2024-06-01 22:58:07] [INFO ] Deduced a trap composed of 50 places in 403 ms of which 2 ms to minimize.
[2024-06-01 22:58:07] [INFO ] Deduced a trap composed of 78 places in 327 ms of which 2 ms to minimize.
[2024-06-01 22:58:08] [INFO ] Deduced a trap composed of 138 places in 329 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2603/2908 variables, 305/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2908 variables, 147/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2908 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2908 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2908/2908 variables, and 463 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4914 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: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 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, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2603/2908 variables, 305/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2908/2908 variables, and 463 constraints, problems are : Problem set: 0 solved, 2 unsolved in 12553 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 17496ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 165 ms.
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 178 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 178 ms. Remains : 305/305 places, 7807/7807 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 175 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
[2024-06-01 22:58:22] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2024-06-01 22:58:22] [INFO ] Invariant cache hit.
[2024-06-01 22:58:23] [INFO ] Implicit Places using invariants in 552 ms returned []
[2024-06-01 22:58:23] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2024-06-01 22:58:23] [INFO ] Invariant cache hit.
[2024-06-01 22:58:23] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 22:58:54] [INFO ] Performed 300/305 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 22:59:13] [INFO ] Implicit Places using invariants and state equation in 49852 ms returned []
Implicit Place search using SMT with State Equation took 50405 ms to find 0 implicit places.
[2024-06-01 22:59:14] [INFO ] Redundant transitions in 659 ms returned []
Running 7805 sub problems to find dead transitions.
[2024-06-01 22:59:14] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2024-06-01 22:59:14] [INFO ] Invariant cache hit.
[2024-06-01 22:59:14] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/2908 variables, and 2 constraints, problems are : Problem set: 0 solved, 7805 unsolved in 30116 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7805/7805 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7805 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
[2024-06-01 23:00:16] [INFO ] Deduced a trap composed of 81 places in 484 ms of which 1 ms to minimize.
[2024-06-01 23:00:17] [INFO ] Deduced a trap composed of 89 places in 455 ms of which 1 ms to minimize.
[2024-06-01 23:00:17] [INFO ] Deduced a trap composed of 91 places in 454 ms of which 1 ms to minimize.
[2024-06-01 23:00:18] [INFO ] Deduced a trap composed of 91 places in 437 ms of which 1 ms to minimize.
[2024-06-01 23:00:18] [INFO ] Deduced a trap composed of 93 places in 415 ms of which 1 ms to minimize.
[2024-06-01 23:00:19] [INFO ] Deduced a trap composed of 87 places in 405 ms of which 1 ms to minimize.
[2024-06-01 23:00:21] [INFO ] Deduced a trap composed of 36 places in 459 ms of which 1 ms to minimize.
[2024-06-01 23:00:22] [INFO ] Deduced a trap composed of 62 places in 467 ms of which 1 ms to minimize.
[2024-06-01 23:00:22] [INFO ] Deduced a trap composed of 101 places in 482 ms of which 1 ms to minimize.
[2024-06-01 23:00:23] [INFO ] Deduced a trap composed of 123 places in 518 ms of which 1 ms to minimize.
[2024-06-01 23:00:24] [INFO ] Deduced a trap composed of 90 places in 474 ms of which 1 ms to minimize.
[2024-06-01 23:00:25] [INFO ] Deduced a trap composed of 93 places in 467 ms of which 1 ms to minimize.
[2024-06-01 23:00:26] [INFO ] Deduced a trap composed of 116 places in 464 ms of which 1 ms to minimize.
[2024-06-01 23:00:28] [INFO ] Deduced a trap composed of 114 places in 495 ms of which 1 ms to minimize.
[2024-06-01 23:00:30] [INFO ] Deduced a trap composed of 37 places in 408 ms of which 1 ms to minimize.
[2024-06-01 23:00:31] [INFO ] Deduced a trap composed of 132 places in 511 ms of which 1 ms to minimize.
[2024-06-01 23:00:31] [INFO ] Deduced a trap composed of 139 places in 544 ms of which 1 ms to minimize.
[2024-06-01 23:00:32] [INFO ] Deduced a trap composed of 138 places in 520 ms of which 1 ms to minimize.
[2024-06-01 23:00:33] [INFO ] Deduced a trap composed of 139 places in 490 ms of which 1 ms to minimize.
[2024-06-01 23:00:33] [INFO ] Deduced a trap composed of 143 places in 520 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
[2024-06-01 23:00:37] [INFO ] Deduced a trap composed of 44 places in 439 ms of which 1 ms to minimize.
[2024-06-01 23:00:38] [INFO ] Deduced a trap composed of 75 places in 426 ms of which 1 ms to minimize.
[2024-06-01 23:00:38] [INFO ] Deduced a trap composed of 75 places in 259 ms of which 1 ms to minimize.
[2024-06-01 23:00:38] [INFO ] Deduced a trap composed of 113 places in 375 ms of which 1 ms to minimize.
[2024-06-01 23:00:39] [INFO ] Deduced a trap composed of 106 places in 500 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/2908 variables, and 27 constraints, problems are : Problem set: 0 solved, 7805 unsolved in 30088 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7805 constraints, Known Traps: 25/25 constraints]
After SMT, in 89290ms problems are : Problem set: 0 solved, 7805 unsolved
Search for dead transitions found 0 dead transitions in 89352ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140617 ms. Remains : 305/305 places, 7807/7807 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for Szymanski-PT-b02-UpperBounds-01 in 342594 ms.
Starting property specific reduction for Szymanski-PT-b02-UpperBounds-02
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:00:43] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2024-06-01 23:00:43] [INFO ] Computed 2 invariants in 20 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (2 resets) in 31 ms. (312 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 23:00:43] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-06-01 23:00:43] [INFO ] Invariant cache hit.
[2024-06-01 23:00:43] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-06-01 23:00:43] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 23:00:43] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2024-06-01 23:00:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:00:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-06-01 23:00:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 23:00:44] [INFO ] [Nat]Absence check using state equation in 378 ms returned sat
[2024-06-01 23:00:44] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:00:44] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:00:45] [INFO ] [Nat]Added 147 Read/Feed constraints in 1043 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 305 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p231) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 305 transition count 7807
Applied a total of 1 rules in 206 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7808 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 207 ms. Remains : 305/305 places, 7807/7808 transitions.
[2024-06-01 23:00:45] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
// Phase 1: matrix 2603 rows 305 cols
[2024-06-01 23:00:45] [INFO ] Computed 3 invariants in 18 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000001 steps (2 resets) in 2598 ms. (384 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1194 ms. (836 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 23:00:49] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2024-06-01 23:00:49] [INFO ] Invariant cache hit.
[2024-06-01 23:00:49] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:00:50] [INFO ] [Real]Absence check using state equation in 533 ms returned sat
[2024-06-01 23:00:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:00:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:00:50] [INFO ] [Nat]Absence check using state equation in 582 ms returned sat
[2024-06-01 23:00:50] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:00:55] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:00:59] [INFO ] [Nat]Added 147 Read/Feed constraints in 9051 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 189 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 189 ms. Remains : 305/305 places, 7807/7807 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 183 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
[2024-06-01 23:01:00] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2024-06-01 23:01:00] [INFO ] Invariant cache hit.
[2024-06-01 23:01:00] [INFO ] Implicit Places using invariants in 572 ms returned []
[2024-06-01 23:01:00] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2024-06-01 23:01:00] [INFO ] Invariant cache hit.
[2024-06-01 23:01:01] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:01:21] [INFO ] Implicit Places using invariants and state equation in 20950 ms returned []
Implicit Place search using SMT with State Equation took 21524 ms to find 0 implicit places.
[2024-06-01 23:01:22] [INFO ] Redundant transitions in 650 ms returned []
Running 7805 sub problems to find dead transitions.
[2024-06-01 23:01:22] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2024-06-01 23:01:22] [INFO ] Invariant cache hit.
[2024-06-01 23:01:22] [INFO ] State equation strengthened by 147 read => feed constraints.
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-b02-UpperBounds-00
Could not compute solution for formula : Szymanski-PT-b02-UpperBounds-01
Could not compute solution for formula : Szymanski-PT-b02-UpperBounds-02
Could not compute solution for formula : Szymanski-PT-b02-UpperBounds-03
Could not compute solution for formula : Szymanski-PT-b02-UpperBounds-04
Could not compute solution for formula : Szymanski-PT-b02-UpperBounds-05
Could not compute solution for formula : Szymanski-PT-b02-UpperBounds-06
Could not compute solution for formula : Szymanski-PT-b02-UpperBounds-07
Could not compute solution for formula : Szymanski-PT-b02-UpperBounds-08
Could not compute solution for formula : Szymanski-PT-b02-UpperBounds-09
Could not compute solution for formula : Szymanski-PT-b02-UpperBounds-10
Could not compute solution for formula : Szymanski-PT-b02-UpperBounds-11
Could not compute solution for formula : Szymanski-PT-b02-UpperBounds-12
Could not compute solution for formula : Szymanski-PT-b02-UpperBounds-13
Could not compute solution for formula : Szymanski-PT-b02-UpperBounds-14
Could not compute solution for formula : Szymanski-PT-b02-UpperBounds-15

BK_STOP 1717282896307

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

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