Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654446700253.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-PT-S02J06T08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446700253
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 24K Apr 11 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 11 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 30K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 163K Apr 11 17:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 13K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 35K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 48K Apr 11 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 251K Apr 11 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 58K Apr 11 17:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 295K Apr 11 17:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 807K 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 PolyORBLF-PT-S02J06T08-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717253237432

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J06T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:47:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 14:47:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:47:19] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2024-06-01 14:47:19] [INFO ] Transformed 690 places.
[2024-06-01 14:47:19] [INFO ] Transformed 1434 transitions.
[2024-06-01 14:47:19] [INFO ] Parsed PT model containing 690 places and 1434 transitions and 6564 arcs in 401 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 1, 1, 1, 0, 0, 9, 1, 0, 1, 1, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 1, 1, 1, 0, 0, 9, 1, 0, 1, 1, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 14:47:19] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
// Phase 1: matrix 1290 rows 690 cols
[2024-06-01 14:47:19] [INFO ] Computed 54 invariants in 152 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1, 1, 1, 0, 0, 9, 1, 0, 1, 1, 0, 0, 0, 0] Max Struct:[2464, 108, 1, 1, 8, 72, 64, 18, 1, 1, 1, 16, 8, 8, 8, 1]
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (2 resets) in 161 ms. (61 steps per ms)
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100007 steps (20 resets) in 456 ms. (218 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 7, 1, 1, 10, 1, 1, 1, 1] Max Struct:[2464, 108, 8, 72, 64, 18, 16, 8, 8, 8]
[2024-06-01 14:47:20] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
[2024-06-01 14:47:20] [INFO ] Invariant cache hit.
[2024-06-01 14:47:20] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2024-06-01 14:47:20] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 41 ms returned sat
[2024-06-01 14:47:21] [INFO ] [Real]Absence check using state equation in 1118 ms returned sat
[2024-06-01 14:47:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:47:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 50 ms returned sat
[2024-06-01 14:47:22] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 99 ms returned sat
[2024-06-01 14:47:24] [INFO ] [Nat]Absence check using state equation in 2232 ms returned sat
[2024-06-01 14:47:24] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:47:25] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 14:47:25] [INFO ] [Nat]Added 96 Read/Feed constraints in 1020 ms returned unknown
[2024-06-01 14:47:26] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-06-01 14:47:26] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 25 ms returned sat
[2024-06-01 14:47:26] [INFO ] [Real]Absence check using state equation in 855 ms returned sat
[2024-06-01 14:47:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:47:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-06-01 14:47:27] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 26 ms returned sat
[2024-06-01 14:47:28] [INFO ] [Nat]Absence check using state equation in 1418 ms returned unknown
[2024-06-01 14:47:28] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2024-06-01 14:47:28] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 57 ms returned sat
[2024-06-01 14:47:31] [INFO ] [Real]Absence check using state equation in 2363 ms returned sat
[2024-06-01 14:47:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:47:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-06-01 14:47:31] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 35 ms returned sat
[2024-06-01 14:47:33] [INFO ] [Nat]Absence check using state equation in 2461 ms returned sat
[2024-06-01 14:47:34] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 14:47:34] [INFO ] [Nat]Added 96 Read/Feed constraints in 1065 ms returned unknown
[2024-06-01 14:47:34] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-06-01 14:47:34] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 9 ms returned unsat
[2024-06-01 14:47:35] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-06-01 14:47:35] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 7 ms returned unsat
[2024-06-01 14:47:35] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-06-01 14:47:35] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 23 ms returned unsat
[2024-06-01 14:47:35] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-06-01 14:47:35] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 26 ms returned sat
[2024-06-01 14:47:36] [INFO ] [Real]Absence check using state equation in 1551 ms returned sat
[2024-06-01 14:47:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:47:37] [INFO ] [Nat]Absence check using 13 positive place invariants in 29 ms returned sat
[2024-06-01 14:47:37] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 165 ms returned sat
[2024-06-01 14:47:38] [INFO ] [Nat]Absence check using state equation in 1665 ms returned sat
[2024-06-01 14:47:39] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 14:47:39] [INFO ] [Nat]Added 96 Read/Feed constraints in 1018 ms returned unknown
[2024-06-01 14:47:40] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-06-01 14:47:40] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 9 ms returned unsat
[2024-06-01 14:47:40] [INFO ] [Real]Absence check using 13 positive place invariants in 27 ms returned sat
[2024-06-01 14:47:40] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 28 ms returned unsat
[2024-06-01 14:47:40] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2024-06-01 14:47:40] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 11 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 7, 1, 1, 10, 1, 1, 1, 1] Max Struct:[2464, 108, 8, 1, 1, 10, 16, 1, 1, 1]
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 7, 1] Max Struct:[2464, 108, 8, 16]
Support contains 4 out of 690 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 688 transition count 1234
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 616 transition count 1234
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 146 place count 616 transition count 1154
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 306 place count 536 transition count 1154
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 432 place count 473 transition count 1091
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 448 place count 473 transition count 1075
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 464 place count 457 transition count 1075
Applied a total of 464 rules in 438 ms. Remains 457 /690 variables (removed 233) and now considering 1075/1306 (removed 231) transitions.
Running 1073 sub problems to find dead transitions.
[2024-06-01 14:47:40] [INFO ] Flow matrix only has 1059 transitions (discarded 16 similar events)
// Phase 1: matrix 1059 rows 457 cols
[2024-06-01 14:47:40] [INFO ] Computed 52 invariants in 19 ms
[2024-06-01 14:47:40] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1073 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1073 unsolved
[2024-06-01 14:47:51] [INFO ] Deduced a trap composed of 44 places in 168 ms of which 28 ms to minimize.
[2024-06-01 14:47:51] [INFO ] Deduced a trap composed of 45 places in 204 ms of which 1 ms to minimize.
[2024-06-01 14:47:51] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 1 ms to minimize.
[2024-06-01 14:47:51] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:47:51] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 1 ms to minimize.
[2024-06-01 14:47:52] [INFO ] Deduced a trap composed of 44 places in 196 ms of which 1 ms to minimize.
[2024-06-01 14:47:53] [INFO ] Deduced a trap composed of 45 places in 1048 ms of which 1 ms to minimize.
[2024-06-01 14:47:54] [INFO ] Deduced a trap composed of 46 places in 752 ms of which 1 ms to minimize.
[2024-06-01 14:47:54] [INFO ] Deduced a trap composed of 170 places in 347 ms of which 5 ms to minimize.
[2024-06-01 14:47:56] [INFO ] Deduced a trap composed of 88 places in 377 ms of which 14 ms to minimize.
[2024-06-01 14:47:57] [INFO ] Deduced a trap composed of 67 places in 199 ms of which 2 ms to minimize.
[2024-06-01 14:48:01] [INFO ] Deduced a trap composed of 179 places in 234 ms of which 3 ms to minimize.
[2024-06-01 14:48:01] [INFO ] Deduced a trap composed of 167 places in 225 ms of which 2 ms to minimize.
[2024-06-01 14:48:01] [INFO ] Deduced a trap composed of 19 places in 219 ms of which 3 ms to minimize.
[2024-06-01 14:48:01] [INFO ] Deduced a trap composed of 151 places in 214 ms of which 3 ms to minimize.
[2024-06-01 14:48:02] [INFO ] Deduced a trap composed of 54 places in 123 ms of which 2 ms to minimize.
[2024-06-01 14:48:02] [INFO ] Deduced a trap composed of 54 places in 106 ms of which 2 ms to minimize.
[2024-06-01 14:48:03] [INFO ] Deduced a trap composed of 189 places in 243 ms of which 3 ms to minimize.
[2024-06-01 14:48:03] [INFO ] Deduced a trap composed of 180 places in 228 ms of which 2 ms to minimize.
[2024-06-01 14:48:03] [INFO ] Deduced a trap composed of 209 places in 221 ms of which 2 ms to minimize.
SMT process timed out in 22850ms, After SMT, problems are : Problem set: 0 solved, 1073 unsolved
Search for dead transitions found 0 dead transitions in 22902ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23404 ms. Remains : 457/690 places, 1075/1306 transitions.
[2024-06-01 14:48:03] [INFO ] Flow matrix only has 1059 transitions (discarded 16 similar events)
[2024-06-01 14:48:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 7, 1] Max Struct:[2464, 108, 8, 16]
RANDOM walk for 1000000 steps (443 resets) in 4681 ms. (213 steps per ms)
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-04 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000003 steps (360 resets) in 6381 ms. (470 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1] Max Struct:[2464, 108, 16]
[2024-06-01 14:48:14] [INFO ] Flow matrix only has 1059 transitions (discarded 16 similar events)
[2024-06-01 14:48:14] [INFO ] Invariant cache hit.
[2024-06-01 14:48:14] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-06-01 14:48:14] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 36 ms returned sat
[2024-06-01 14:48:15] [INFO ] [Real]Absence check using state equation in 904 ms returned sat
[2024-06-01 14:48:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:48:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-06-01 14:48:15] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 18 ms returned sat
[2024-06-01 14:48:18] [INFO ] [Nat]Absence check using state equation in 2442 ms returned sat
[2024-06-01 14:48:18] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:48:18] [INFO ] [Nat]Added 96 Read/Feed constraints in 269 ms returned sat
[2024-06-01 14:48:19] [INFO ] Deduced a trap composed of 224 places in 414 ms of which 2 ms to minimize.
[2024-06-01 14:48:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 613 ms
[2024-06-01 14:48:19] [INFO ] Computed and/alt/rep : 417/1527/409 causal constraints (skipped 648 transitions) in 145 ms.
[2024-06-01 14:48:19] [INFO ] Added : 19 causal constraints over 4 iterations in 559 ms. Result :sat
Minimization took 4198 ms.
[2024-06-01 14:48:24] [INFO ] [Real]Absence check using 13 positive place invariants in 124 ms returned sat
[2024-06-01 14:48:24] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 33 ms returned sat
[2024-06-01 14:48:25] [INFO ] [Real]Absence check using state equation in 1248 ms returned sat
[2024-06-01 14:48:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:48:25] [INFO ] [Nat]Absence check using 13 positive place invariants in 23 ms returned sat
[2024-06-01 14:48:25] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 46 ms returned sat
[2024-06-01 14:48:31] [INFO ] [Nat]Absence check using state equation in 5984 ms returned sat
[2024-06-01 14:48:32] [INFO ] [Nat]Added 96 Read/Feed constraints in 510 ms returned sat
[2024-06-01 14:48:32] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 3 ms to minimize.
[2024-06-01 14:48:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 315 ms
[2024-06-01 14:48:32] [INFO ] Computed and/alt/rep : 417/1527/409 causal constraints (skipped 648 transitions) in 85 ms.
[2024-06-01 14:48:44] [INFO ] Added : 30 causal constraints over 6 iterations in 11827 ms. Result :unknown
[2024-06-01 14:48:44] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-06-01 14:48:44] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 32 ms returned sat
[2024-06-01 14:48:46] [INFO ] [Real]Absence check using state equation in 2073 ms returned sat
[2024-06-01 14:48:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:48:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-06-01 14:48:46] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 36 ms returned sat
[2024-06-01 14:48:47] [INFO ] [Nat]Absence check using state equation in 875 ms returned sat
[2024-06-01 14:48:48] [INFO ] [Nat]Added 96 Read/Feed constraints in 580 ms returned sat
[2024-06-01 14:48:48] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 0 ms to minimize.
[2024-06-01 14:48:48] [INFO ] Deduced a trap composed of 44 places in 184 ms of which 2 ms to minimize.
[2024-06-01 14:48:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 612 ms
[2024-06-01 14:48:49] [INFO ] Computed and/alt/rep : 417/1527/409 causal constraints (skipped 648 transitions) in 72 ms.
[2024-06-01 14:48:49] [INFO ] Added : 41 causal constraints over 9 iterations in 871 ms. Result :sat
Minimization took 4528 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1] Max Struct:[2464, 108, 16]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 1] Max Struct:[2464, 108, 16]
Support contains 3 out of 457 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 457/457 places, 1075/1075 transitions.
Applied a total of 0 rules in 57 ms. Remains 457 /457 variables (removed 0) and now considering 1075/1075 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 457/457 places, 1075/1075 transitions.
[2024-06-01 14:48:55] [INFO ] Flow matrix only has 1059 transitions (discarded 16 similar events)
[2024-06-01 14:48:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1] Max Struct:[2464, 108, 16]
RANDOM walk for 1000000 steps (456 resets) in 5165 ms. (193 steps per ms)
BEST_FIRST walk for 3000000 steps (348 resets) in 6352 ms. (472 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1] Max Struct:[2464, 108, 16]
[2024-06-01 14:49:06] [INFO ] Flow matrix only has 1059 transitions (discarded 16 similar events)
[2024-06-01 14:49:06] [INFO ] Invariant cache hit.
[2024-06-01 14:49:06] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-06-01 14:49:06] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 20 ms returned sat
[2024-06-01 14:49:07] [INFO ] [Real]Absence check using state equation in 1004 ms returned sat
[2024-06-01 14:49:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:49:08] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-06-01 14:49:08] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 23 ms returned sat
[2024-06-01 14:49:10] [INFO ] [Nat]Absence check using state equation in 2375 ms returned sat
[2024-06-01 14:49:10] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:49:10] [INFO ] [Nat]Added 96 Read/Feed constraints in 243 ms returned sat
[2024-06-01 14:49:11] [INFO ] Deduced a trap composed of 224 places in 261 ms of which 3 ms to minimize.
[2024-06-01 14:49:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 386 ms
[2024-06-01 14:49:11] [INFO ] Computed and/alt/rep : 417/1527/409 causal constraints (skipped 648 transitions) in 64 ms.
[2024-06-01 14:49:11] [INFO ] Added : 19 causal constraints over 4 iterations in 309 ms. Result :sat
Minimization took 3533 ms.
[2024-06-01 14:49:15] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-06-01 14:49:15] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 27 ms returned sat
[2024-06-01 14:49:16] [INFO ] [Real]Absence check using state equation in 817 ms returned sat
[2024-06-01 14:49:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:49:16] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-06-01 14:49:16] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 32 ms returned sat
[2024-06-01 14:49:22] [INFO ] [Nat]Absence check using state equation in 5837 ms returned sat
[2024-06-01 14:49:23] [INFO ] [Nat]Added 96 Read/Feed constraints in 1046 ms returned sat
[2024-06-01 14:49:23] [INFO ] Deduced a trap composed of 45 places in 284 ms of which 4 ms to minimize.
[2024-06-01 14:49:23] [INFO ] Deduced a trap composed of 44 places in 253 ms of which 2 ms to minimize.
[2024-06-01 14:49:24] [INFO ] Deduced a trap composed of 222 places in 271 ms of which 3 ms to minimize.
[2024-06-01 14:49:24] [INFO ] Deduced a trap composed of 19 places in 244 ms of which 3 ms to minimize.
[2024-06-01 14:49:24] [INFO ] Deduced a trap composed of 182 places in 239 ms of which 2 ms to minimize.
[2024-06-01 14:49:25] [INFO ] Deduced a trap composed of 170 places in 242 ms of which 2 ms to minimize.
[2024-06-01 14:49:25] [INFO ] Deduced a trap composed of 45 places in 250 ms of which 2 ms to minimize.
[2024-06-01 14:49:26] [INFO ] Deduced a trap composed of 155 places in 222 ms of which 2 ms to minimize.
[2024-06-01 14:49:26] [INFO ] Deduced a trap composed of 167 places in 245 ms of which 14 ms to minimize.
[2024-06-01 14:49:29] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 7 ms to minimize.
[2024-06-01 14:49:34] [INFO ] Trap strengthening (SAT) tested/added 10/10 trap constraints in 11321 ms
[2024-06-01 14:49:34] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-06-01 14:49:34] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 18 ms returned sat
[2024-06-01 14:49:36] [INFO ] [Real]Absence check using state equation in 1993 ms returned sat
[2024-06-01 14:49:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:49:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-06-01 14:49:36] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 19 ms returned sat
[2024-06-01 14:49:37] [INFO ] [Nat]Absence check using state equation in 1153 ms returned sat
[2024-06-01 14:49:38] [INFO ] [Nat]Added 96 Read/Feed constraints in 664 ms returned sat
[2024-06-01 14:49:38] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 2 ms to minimize.
[2024-06-01 14:49:38] [INFO ] Deduced a trap composed of 44 places in 210 ms of which 2 ms to minimize.
[2024-06-01 14:49:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 636 ms
[2024-06-01 14:49:39] [INFO ] Computed and/alt/rep : 417/1527/409 causal constraints (skipped 648 transitions) in 95 ms.
[2024-06-01 14:49:39] [INFO ] Added : 41 causal constraints over 9 iterations in 752 ms. Result :sat
Minimization took 4505 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1] Max Struct:[2464, 108, 16]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 1] Max Struct:[2464, 108, 16]
Support contains 3 out of 457 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 457/457 places, 1075/1075 transitions.
Applied a total of 0 rules in 26 ms. Remains 457 /457 variables (removed 0) and now considering 1075/1075 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 457/457 places, 1075/1075 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 457/457 places, 1075/1075 transitions.
Applied a total of 0 rules in 25 ms. Remains 457 /457 variables (removed 0) and now considering 1075/1075 (removed 0) transitions.
[2024-06-01 14:49:44] [INFO ] Flow matrix only has 1059 transitions (discarded 16 similar events)
[2024-06-01 14:49:44] [INFO ] Invariant cache hit.
[2024-06-01 14:49:45] [INFO ] Implicit Places using invariants in 619 ms returned [43, 194, 231, 309, 325, 382, 387]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 626 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 450/457 places, 1075/1075 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 447 transition count 1072
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 447 transition count 1072
Applied a total of 6 rules in 51 ms. Remains 447 /450 variables (removed 3) and now considering 1072/1075 (removed 3) transitions.
[2024-06-01 14:49:45] [INFO ] Flow matrix only has 1056 transitions (discarded 16 similar events)
// Phase 1: matrix 1056 rows 447 cols
[2024-06-01 14:49:45] [INFO ] Computed 45 invariants in 15 ms
[2024-06-01 14:49:45] [INFO ] Implicit Places using invariants in 494 ms returned []
[2024-06-01 14:49:45] [INFO ] Flow matrix only has 1056 transitions (discarded 16 similar events)
[2024-06-01 14:49:45] [INFO ] Invariant cache hit.
[2024-06-01 14:49:47] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:49:53] [INFO ] Implicit Places using invariants and state equation in 7215 ms returned []
Implicit Place search using SMT with State Equation took 7724 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 447/457 places, 1072/1075 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 8428 ms. Remains : 447/457 places, 1072/1075 transitions.
[2024-06-01 14:49:53] [INFO ] Flow matrix only has 1056 transitions (discarded 16 similar events)
[2024-06-01 14:49:53] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1] Max Struct:[2464, 108, 16]
RANDOM walk for 1000000 steps (431 resets) in 4560 ms. (219 steps per ms)
BEST_FIRST walk for 3000002 steps (354 resets) in 5894 ms. (508 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1] Max Struct:[2464, 108, 16]
[2024-06-01 14:50:03] [INFO ] Flow matrix only has 1056 transitions (discarded 16 similar events)
[2024-06-01 14:50:03] [INFO ] Invariant cache hit.
[2024-06-01 14:50:03] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-06-01 14:50:03] [INFO ] [Real]Absence check using 12 positive and 33 generalized place invariants in 32 ms returned sat
[2024-06-01 14:50:04] [INFO ] [Real]Absence check using state equation in 396 ms returned sat
[2024-06-01 14:50:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:50:04] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-06-01 14:50:04] [INFO ] [Nat]Absence check using 12 positive and 33 generalized place invariants in 18 ms returned sat
[2024-06-01 14:50:07] [INFO ] [Nat]Absence check using state equation in 2950 ms returned sat
[2024-06-01 14:50:07] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:50:11] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 14:50:16] [INFO ] [Nat]Added 96 Read/Feed constraints in 9011 ms returned unknown
[2024-06-01 14:50:16] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-06-01 14:50:16] [INFO ] [Real]Absence check using 12 positive and 33 generalized place invariants in 31 ms returned sat
[2024-06-01 14:50:16] [INFO ] [Real]Absence check using state equation in 529 ms returned sat
[2024-06-01 14:50:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:50:16] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-06-01 14:50:16] [INFO ] [Nat]Absence check using 12 positive and 33 generalized place invariants in 24 ms returned sat
[2024-06-01 14:50:22] [INFO ] [Nat]Absence check using state equation in 5252 ms returned sat
[2024-06-01 14:50:22] [INFO ] [Nat]Added 96 Read/Feed constraints in 261 ms returned sat
[2024-06-01 14:50:22] [INFO ] Computed and/alt/rep : 411/1496/403 causal constraints (skipped 651 transitions) in 68 ms.
[2024-06-01 14:50:23] [INFO ] Deduced a trap composed of 153 places in 204 ms of which 11 ms to minimize.
[2024-06-01 14:50:23] [INFO ] Deduced a trap composed of 197 places in 190 ms of which 3 ms to minimize.
[2024-06-01 14:50:24] [INFO ] Deduced a trap composed of 186 places in 270 ms of which 2 ms to minimize.
[2024-06-01 14:50:24] [INFO ] Deduced a trap composed of 189 places in 279 ms of which 3 ms to minimize.
[2024-06-01 14:50:25] [INFO ] Deduced a trap composed of 184 places in 272 ms of which 4 ms to minimize.
[2024-06-01 14:50:25] [INFO ] Deduced a trap composed of 183 places in 329 ms of which 4 ms to minimize.
[2024-06-01 14:50:26] [INFO ] Deduced a trap composed of 177 places in 350 ms of which 3 ms to minimize.
[2024-06-01 14:50:27] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4178 ms
[2024-06-01 14:50:28] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 1 ms to minimize.
[2024-06-01 14:50:28] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 0 ms to minimize.
[2024-06-01 14:50:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 287 ms
[2024-06-01 14:50:28] [INFO ] Added : 122 causal constraints over 26 iterations in 6439 ms. Result :sat
Minimization took 4682 ms.
[2024-06-01 14:50:33] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-06-01 14:50:33] [INFO ] [Real]Absence check using 12 positive and 33 generalized place invariants in 30 ms returned sat
[2024-06-01 14:50:34] [INFO ] [Real]Absence check using state equation in 1176 ms returned sat
[2024-06-01 14:50:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:50:35] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-06-01 14:50:35] [INFO ] [Nat]Absence check using 12 positive and 33 generalized place invariants in 25 ms returned sat
[2024-06-01 14:50:37] [INFO ] [Nat]Absence check using state equation in 2283 ms returned sat
[2024-06-01 14:50:37] [INFO ] [Nat]Added 96 Read/Feed constraints in 343 ms returned sat
[2024-06-01 14:50:37] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 0 ms to minimize.
[2024-06-01 14:50:37] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:50:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 320 ms
[2024-06-01 14:50:38] [INFO ] Computed and/alt/rep : 411/1496/403 causal constraints (skipped 651 transitions) in 74 ms.
[2024-06-01 14:50:39] [INFO ] Deduced a trap composed of 19 places in 200 ms of which 2 ms to minimize.
[2024-06-01 14:50:39] [INFO ] Deduced a trap composed of 185 places in 195 ms of which 3 ms to minimize.
[2024-06-01 14:50:40] [INFO ] Deduced a trap composed of 163 places in 260 ms of which 2 ms to minimize.
[2024-06-01 14:50:41] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:50:41] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:50:42] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:50:42] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:50:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3300 ms
[2024-06-01 14:50:42] [INFO ] Added : 87 causal constraints over 18 iterations in 5013 ms. Result :sat
Minimization took 4503 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1] Max Struct:[2464, 108, 16]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 1] Max Struct:[2464, 108, 16]
Support contains 3 out of 447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 1072/1072 transitions.
Applied a total of 0 rules in 33 ms. Remains 447 /447 variables (removed 0) and now considering 1072/1072 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 447/447 places, 1072/1072 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 1072/1072 transitions.
Applied a total of 0 rules in 30 ms. Remains 447 /447 variables (removed 0) and now considering 1072/1072 (removed 0) transitions.
[2024-06-01 14:50:47] [INFO ] Flow matrix only has 1056 transitions (discarded 16 similar events)
[2024-06-01 14:50:47] [INFO ] Invariant cache hit.
[2024-06-01 14:50:48] [INFO ] Implicit Places using invariants in 524 ms returned []
[2024-06-01 14:50:48] [INFO ] Flow matrix only has 1056 transitions (discarded 16 similar events)
[2024-06-01 14:50:48] [INFO ] Invariant cache hit.
[2024-06-01 14:50:49] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:50:56] [INFO ] Implicit Places using invariants and state equation in 8104 ms returned []
Implicit Place search using SMT with State Equation took 8645 ms to find 0 implicit places.
[2024-06-01 14:50:56] [INFO ] Redundant transitions in 105 ms returned []
Running 1070 sub problems to find dead transitions.
[2024-06-01 14:50:56] [INFO ] Flow matrix only has 1056 transitions (discarded 16 similar events)
[2024-06-01 14:50:56] [INFO ] Invariant cache hit.
[2024-06-01 14:50:56] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1070 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 31/43 constraints. Problems are: Problem set: 0 solved, 1070 unsolved
[2024-06-01 14:51:04] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 16 ms to minimize.
[2024-06-01 14:51:04] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:51:04] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 0 ms to minimize.
[2024-06-01 14:51:04] [INFO ] Deduced a trap composed of 44 places in 25 ms of which 0 ms to minimize.
[2024-06-01 14:51:04] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:51:04] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 0 ms to minimize.
[2024-06-01 14:51:04] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:51:04] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:51:05] [INFO ] Deduced a trap composed of 151 places in 175 ms of which 2 ms to minimize.
[2024-06-01 14:51:05] [INFO ] Deduced a trap composed of 173 places in 187 ms of which 2 ms to minimize.
[2024-06-01 14:51:06] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 2 ms to minimize.
[2024-06-01 14:51:07] [INFO ] Deduced a trap composed of 64 places in 193 ms of which 2 ms to minimize.
[2024-06-01 14:51:09] [INFO ] Deduced a trap composed of 269 places in 175 ms of which 2 ms to minimize.
[2024-06-01 14:51:10] [INFO ] Deduced a trap composed of 185 places in 177 ms of which 2 ms to minimize.
[2024-06-01 14:51:10] [INFO ] Deduced a trap composed of 197 places in 205 ms of which 2 ms to minimize.
[2024-06-01 14:51:11] [INFO ] Deduced a trap composed of 197 places in 197 ms of which 2 ms to minimize.
[2024-06-01 14:51:11] [INFO ] Deduced a trap composed of 135 places in 201 ms of which 2 ms to minimize.
[2024-06-01 14:51:12] [INFO ] Deduced a trap composed of 191 places in 187 ms of which 2 ms to minimize.
[2024-06-01 14:51:12] [INFO ] Deduced a trap composed of 171 places in 190 ms of which 3 ms to minimize.
[2024-06-01 14:51:13] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1070 unsolved
[2024-06-01 14:51:14] [INFO ] Deduced a trap composed of 55 places in 147 ms of which 2 ms to minimize.
[2024-06-01 14:51:20] [INFO ] Deduced a trap composed of 170 places in 205 ms of which 2 ms to minimize.
[2024-06-01 14:51:22] [INFO ] Deduced a trap composed of 207 places in 229 ms of which 3 ms to minimize.
[2024-06-01 14:51:22] [INFO ] Deduced a trap composed of 200 places in 212 ms of which 3 ms to minimize.
(s315 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.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 1.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 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 5.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 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 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 1.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 1.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 10.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 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 (/ 2.0 3.0))
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 9.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/445 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 1070 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/1503 variables, and 67 constraints, problems are : Problem set: 0 solved, 1070 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/447 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1070/1070 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1070 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1070 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 31/43 constraints. Problems are: Problem set: 0 solved, 1070 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 24/67 constraints. Problems are: Problem set: 0 solved, 1070 unsolved
[2024-06-01 14:51:45] [INFO ] Deduced a trap composed of 208 places in 199 ms of which 3 ms to minimize.
[2024-06-01 14:51:45] [INFO ] Deduced a trap composed of 170 places in 275 ms of which 3 ms to minimize.
[2024-06-01 14:51:46] [INFO ] Deduced a trap composed of 180 places in 216 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/445 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 1070 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 6)
(s43 0)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/1503 variables, and 70 constraints, problems are : Problem set: 0 solved, 1070 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/447 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1070 constraints, Known Traps: 27/27 constraints]
After SMT, in 62352ms problems are : Problem set: 0 solved, 1070 unsolved
Search for dead transitions found 0 dead transitions in 62368ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71166 ms. Remains : 447/447 places, 1072/1072 transitions.
RANDOM walk for 40000 steps (19 resets) in 1248 ms. (32 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (13 resets) in 337 ms. (118 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (13 resets) in 389 ms. (102 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (15 resets) in 329 ms. (121 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (11 resets) in 316 ms. (126 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 283 ms. (140 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 66696 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 6
Probabilistic random walk after 66696 steps, saw 41636 distinct states, run finished after 3004 ms. (steps per millisecond=22 ) properties seen :0
[2024-06-01 14:52:02] [INFO ] Flow matrix only has 1056 transitions (discarded 16 similar events)
[2024-06-01 14:52:02] [INFO ] Invariant cache hit.
[2024-06-01 14:52:02] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
At refinement iteration 1 (OVERLAPS) 248/251 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 64/315 variables, 8/14 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/317 variables, 1/15 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Problem MAX2 is UNSAT
At refinement iteration 7 (OVERLAPS) 126/443 variables, 27/42 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 0/42 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/445 variables, 2/44 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 0/44 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1056/1501 variables, 445/489 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1501 variables, 96/585 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1501 variables, 0/585 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/1503 variables, 2/587 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1503 variables, 1/588 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1503 variables, 0/588 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1503 variables, 0/588 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1503/1503 variables, and 588 constraints, problems are : Problem set: 3 solved, 3 unsolved in 2388 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 447/447 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 248/251 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 64/315 variables, 8/14 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/317 variables, 1/15 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 126/443 variables, 27/42 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-06-01 14:52:05] [INFO ] Deduced a trap composed of 44 places in 154 ms of which 3 ms to minimize.
[2024-06-01 14:52:06] [INFO ] Deduced a trap composed of 45 places in 430 ms of which 2 ms to minimize.
[2024-06-01 14:52:06] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 1 ms to minimize.
[2024-06-01 14:52:06] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 2 ms to minimize.
[2024-06-01 14:52:06] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 1 ms to minimize.
[2024-06-01 14:52:06] [INFO ] Deduced a trap composed of 45 places in 148 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 6/48 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 0/48 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/445 variables, 2/50 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/445 variables, 0/50 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1056/1501 variables, 445/495 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1501 variables, 96/591 constraints. Problems are: Problem set: 3 solved, 3 unsolved
Problem MIN1 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/1501 variables, 3/594 constraints. Problems are: Problem set: 4 solved, 2 unsolved
[2024-06-01 14:52:09] [INFO ] Deduced a trap composed of 55 places in 200 ms of which 2 ms to minimize.
[2024-06-01 14:52:09] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
Problem MIN2 is UNSAT
Solver is answering 'unknown', stopping.
Problem MIN0 is UNSAT
After SMT solving in domain Int declared 1501/1503 variables, and 596 constraints, problems are : Problem set: 5 solved, 1 unsolved in 4505 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 445/447 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 8/8 constraints]
After SMT, in 6919ms problems are : Problem set: 5 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-11 1 TECHNIQUES REACHABILITY_MIN
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-01 0 TECHNIQUES REACHABILITY_MIN
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-00 0 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 3 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 290872 ms.
ITS solved all properties within timeout

BK_STOP 1717253529957

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S02J06T08"
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 PolyORBLF-PT-S02J06T08, 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 r516-tajo-171654446700253"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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