Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r223-tall-174902009200053.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is SieveSingleMsgMbox-PT-d1m18, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-174902009200053
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 844K
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 450K May 29 14:33 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

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749106415454

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-05 06:53:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 06:53:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 06:53:36] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2025-06-05 06:53:36] [INFO ] Transformed 1295 places.
[2025-06-05 06:53:36] [INFO ] Transformed 749 transitions.
[2025-06-05 06:53:36] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 1036 places in 8 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
// Phase 1: matrix 749 rows 259 cols
[2025-06-05 06:53:36] [INFO ] Computed 6 invariants in 47 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[29, 45, 1, 1]
RANDOM walk for 10000 steps (2210 resets) in 150 ms. (66 steps per ms)
BEST_FIRST walk for 40004 steps (3781 resets) in 152 ms. (261 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[29, 45, 1, 1]
[2025-06-05 06:53:37] [INFO ] Invariant cache hit.
[2025-06-05 06:53:37] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-05 06:53:37] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 8 ms returned sat
[2025-06-05 06:53:37] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2025-06-05 06:53:37] [INFO ] State equation strengthened by 587 read => feed constraints.
[2025-06-05 06:53:37] [INFO ] [Real]Added 587 Read/Feed constraints in 81 ms returned sat
[2025-06-05 06:53:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:53:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-05 06:53:37] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-05 06:53:38] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2025-06-05 06:53:38] [INFO ] [Nat]Added 587 Read/Feed constraints in 122 ms returned sat
[2025-06-05 06:53:38] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 122 ms.
[2025-06-05 06:53:38] [INFO ] Added : 25 causal constraints over 6 iterations in 457 ms. Result :sat
Minimization took 507 ms.
[2025-06-05 06:53:39] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-05 06:53:39] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-05 06:53:39] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2025-06-05 06:53:39] [INFO ] [Real]Added 587 Read/Feed constraints in 147 ms returned sat
[2025-06-05 06:53:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:53:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-05 06:53:39] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-05 06:53:39] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2025-06-05 06:53:39] [INFO ] [Nat]Added 587 Read/Feed constraints in 122 ms returned sat
[2025-06-05 06:53:39] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 73 ms.
[2025-06-05 06:53:40] [INFO ] Added : 10 causal constraints over 2 iterations in 233 ms. Result :sat
Minimization took 605 ms.
[2025-06-05 06:53:40] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-05 06:53:40] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 06:53:40] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2025-06-05 06:53:41] [INFO ] [Real]Added 587 Read/Feed constraints in 74 ms returned sat
[2025-06-05 06:53:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:53:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-05 06:53:41] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-05 06:53:41] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2025-06-05 06:53:41] [INFO ] [Nat]Added 587 Read/Feed constraints in 82 ms returned sat
[2025-06-05 06:53:41] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 58 ms.
[2025-06-05 06:53:41] [INFO ] Added : 16 causal constraints over 4 iterations in 301 ms. Result :sat
Minimization took 576 ms.
[2025-06-05 06:53:42] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-05 06:53:42] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2025-06-05 06:53:42] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2025-06-05 06:53:42] [INFO ] [Real]Added 587 Read/Feed constraints in 71 ms returned sat
[2025-06-05 06:53:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:53:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-05 06:53:42] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-05 06:53:42] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2025-06-05 06:53:42] [INFO ] [Nat]Added 587 Read/Feed constraints in 81 ms returned sat
[2025-06-05 06:53:42] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 17 ms to minimize.
[2025-06-05 06:53:43] [INFO ] Deduced a trap composed of 53 places in 136 ms of which 3 ms to minimize.
[2025-06-05 06:53:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 413 ms
[2025-06-05 06:53:43] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 96 ms.
[2025-06-05 06:53:43] [INFO ] Deduced a trap composed of 121 places in 114 ms of which 2 ms to minimize.
[2025-06-05 06:53:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2025-06-05 06:53:43] [INFO ] Added : 17 causal constraints over 4 iterations in 509 ms. Result :sat
Minimization took 597 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[29, 45, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[29, 45, 1, 1]
Support contains 4 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 749/749 transitions.
Graph (complete) has 1159 edges and 259 vertex of which 241 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.3 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 242 transitions.
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 241 transition count 507
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 303 place count 181 transition count 232
Iterating global reduction 1 with 60 rules applied. Total rules applied 363 place count 181 transition count 232
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 368 place count 181 transition count 227
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 411 place count 138 transition count 184
Iterating global reduction 2 with 43 rules applied. Total rules applied 454 place count 138 transition count 184
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 469 place count 138 transition count 169
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 493 place count 114 transition count 143
Iterating global reduction 3 with 24 rules applied. Total rules applied 517 place count 114 transition count 143
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 532 place count 114 transition count 128
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 538 place count 108 transition count 119
Iterating global reduction 4 with 6 rules applied. Total rules applied 544 place count 108 transition count 119
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 550 place count 102 transition count 113
Iterating global reduction 4 with 6 rules applied. Total rules applied 556 place count 102 transition count 113
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 559 place count 99 transition count 110
Iterating global reduction 4 with 3 rules applied. Total rules applied 562 place count 99 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 563 place count 99 transition count 109
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 565 place count 97 transition count 107
Iterating global reduction 5 with 2 rules applied. Total rules applied 567 place count 97 transition count 107
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 568 place count 96 transition count 106
Iterating global reduction 5 with 1 rules applied. Total rules applied 569 place count 96 transition count 106
Applied a total of 569 rules in 79 ms. Remains 96 /259 variables (removed 163) and now considering 106/749 (removed 643) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 96/259 places, 106/749 transitions.
// Phase 1: matrix 106 rows 96 cols
[2025-06-05 06:53:44] [INFO ] Computed 4 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[29, 18, 1, 1]
RANDOM walk for 1000000 steps (223915 resets) in 841 ms. (1187 steps per ms)
BEST_FIRST walk for 4000002 steps (413638 resets) in 1845 ms. (2166 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[29, 18, 1, 1]
[2025-06-05 06:53:47] [INFO ] Invariant cache hit.
[2025-06-05 06:53:47] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:53:47] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 06:53:47] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2025-06-05 06:53:47] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-05 06:53:47] [INFO ] [Real]Added 42 Read/Feed constraints in 4 ms returned sat
[2025-06-05 06:53:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:53:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:53:47] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 06:53:47] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-05 06:53:47] [INFO ] [Nat]Added 42 Read/Feed constraints in 8 ms returned sat
[2025-06-05 06:53:47] [INFO ] Computed and/alt/rep : 26/66/26 causal constraints (skipped 79 transitions) in 6 ms.
[2025-06-05 06:53:47] [INFO ] Added : 14 causal constraints over 3 iterations in 39 ms. Result :sat
Minimization took 52 ms.
[2025-06-05 06:53:47] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:53:47] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 06:53:47] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-05 06:53:47] [INFO ] [Real]Added 42 Read/Feed constraints in 7 ms returned sat
[2025-06-05 06:53:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:53:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:53:47] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 06:53:47] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2025-06-05 06:53:47] [INFO ] [Nat]Added 42 Read/Feed constraints in 7 ms returned sat
[2025-06-05 06:53:47] [INFO ] Computed and/alt/rep : 26/66/26 causal constraints (skipped 79 transitions) in 6 ms.
[2025-06-05 06:53:47] [INFO ] Added : 15 causal constraints over 5 iterations in 50 ms. Result :sat
Minimization took 61 ms.
[2025-06-05 06:53:47] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:53:47] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 06:53:47] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-05 06:53:47] [INFO ] [Real]Added 42 Read/Feed constraints in 5 ms returned sat
[2025-06-05 06:53:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:53:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:53:47] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 06:53:47] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-05 06:53:47] [INFO ] [Nat]Added 42 Read/Feed constraints in 6 ms returned sat
[2025-06-05 06:53:47] [INFO ] Computed and/alt/rep : 26/66/26 causal constraints (skipped 79 transitions) in 5 ms.
[2025-06-05 06:53:47] [INFO ] Added : 15 causal constraints over 4 iterations in 49 ms. Result :sat
Minimization took 40 ms.
[2025-06-05 06:53:47] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:53:47] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 4 ms returned sat
[2025-06-05 06:53:47] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-05 06:53:47] [INFO ] [Real]Added 42 Read/Feed constraints in 4 ms returned sat
[2025-06-05 06:53:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:53:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:53:47] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 06:53:47] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-05 06:53:47] [INFO ] [Nat]Added 42 Read/Feed constraints in 5 ms returned sat
[2025-06-05 06:53:47] [INFO ] Computed and/alt/rep : 26/66/26 causal constraints (skipped 79 transitions) in 5 ms.
[2025-06-05 06:53:47] [INFO ] Added : 5 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[29, 18, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[29, 18, 1, 1]
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 106/106 transitions.
Applied a total of 0 rules in 5 ms. Remains 96 /96 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 96/96 places, 106/106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 106/106 transitions.
Applied a total of 0 rules in 5 ms. Remains 96 /96 variables (removed 0) and now considering 106/106 (removed 0) transitions.
[2025-06-05 06:53:48] [INFO ] Invariant cache hit.
[2025-06-05 06:53:48] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-05 06:53:48] [INFO ] Invariant cache hit.
[2025-06-05 06:53:48] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-05 06:53:48] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2025-06-05 06:53:48] [INFO ] Redundant transitions in 2 ms returned []
Running 105 sub problems to find dead transitions.
[2025-06-05 06:53:48] [INFO ] Invariant cache hit.
[2025-06-05 06:53:48] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/202 variables, 96/100 constraints. Problems are: Problem set: 0 solved, 105 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 42/142 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2025-06-05 06:53:50] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/202 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (OVERLAPS) 0/202 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 143 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3184 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 106/202 variables, 96/101 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 42/143 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 105/248 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2025-06-05 06:53:53] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2025-06-05 06:53:53] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 2/250 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (OVERLAPS) 0/202 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 250 constraints, problems are : Problem set: 0 solved, 105 unsolved in 6864 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 3/3 constraints]
After SMT, in 10217ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 10226ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10484 ms. Remains : 96/96 places, 106/106 transitions.
RANDOM walk for 40000 steps (9015 resets) in 995 ms. (40 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (4132 resets) in 305 ms. (130 steps per ms) remains 8/8 properties
[2025-06-05 06:53:58] [INFO ] Flatten gal took : 46 ms
[2025-06-05 06:53:59] [INFO ] Flatten gal took : 34 ms
[2025-06-05 06:53:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13669745107076254484.gal : 17 ms
[2025-06-05 06:53:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4563757395406321593.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13669745107076254484.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4563757395406321593.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality4563757395406321593.prop.
BEST_FIRST walk for 40002 steps (4123 resets) in 274 ms. (145 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :7 after 38
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :38 after 157
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :157 after 193
Invariant property MIN3 does not hold.
Reachability property MAX3 is true.
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :193 after 925
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :925 after 1393
Invariant property MIN1 does not hold.
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :1393 after 3649
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :3649 after 4561
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :4561 after 8437
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :8437 after 42151
BEST_FIRST walk for 40003 steps (4107 resets) in 251 ms. (158 steps per ms) remains 8/8 properties
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :42151 after 137935
BEST_FIRST walk for 40004 steps (4171 resets) in 213 ms. (186 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (4169 resets) in 97 ms. (408 steps per ms) remains 8/8 properties
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :137935 after 1.14349e+06
BEST_FIRST walk for 40002 steps (4177 resets) in 64 ms. (615 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (4128 resets) in 86 ms. (459 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (4124 resets) in 90 ms. (439 steps per ms) remains 8/8 properties
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :1.14349e+06 after 1.06485e+07
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :1.06485e+07 after 1.37531e+08
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :1.37531e+08 after 7.04342e+08
Interrupted probabilistic random walk after 1077071 steps, run timeout after 3001 ms. (steps per millisecond=358 ) properties seen :2 out of 8
Probabilistic random walk after 1077071 steps, saw 445078 distinct states, run finished after 3009 ms. (steps per millisecond=357 ) properties seen :2
[2025-06-05 06:54:02] [INFO ] Invariant cache hit.
[2025-06-05 06:54:02] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 60/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/69 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 82/151 variables, 69/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MAX0 is UNSAT
At refinement iteration 9 (OVERLAPS) 37/188 variables, 16/89 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 39/128 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 0/128 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 14/202 variables, 11/139 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/202 variables, 3/142 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Invariant property MIN0 does not hold.
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :7.04342e+08 after 5.33083e+09
[2025-06-05 06:54:03] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 3 ms to minimize.
Problem MAX1 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/202 variables, 1/143 constraints. Problems are: Problem set: 2 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/202 variables, 0/143 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/202 variables, 0/143 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 143 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1210 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/20 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 46/66 variables, 2/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2025-06-05 06:54:03] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/68 variables, 1/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 81/149 variables, 68/73 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 0/73 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 30/179 variables, 16/89 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 31/120 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/179 variables, 2/122 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/179 variables, 0/122 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 23/202 variables, 12/134 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/202 variables, 11/145 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/202 variables, 1/146 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/202 variables, 0/146 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/202 variables, 0/146 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 146 constraints, problems are : Problem set: 2 solved, 2 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 1494ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 106/106 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 93 transition count 103
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 93 transition count 103
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 9 place count 93 transition count 100
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 91 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 91 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 91 transition count 97
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 89 transition count 95
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 89 transition count 95
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 87 transition count 92
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 87 transition count 92
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 85 transition count 90
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 85 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 85 transition count 89
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 29 place count 83 transition count 87
Iterating global reduction 3 with 2 rules applied. Total rules applied 31 place count 83 transition count 87
Applied a total of 31 rules in 14 ms. Remains 83 /96 variables (removed 13) and now considering 87/106 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 83/96 places, 87/106 transitions.
RANDOM walk for 40000 steps (8989 resets) in 136 ms. (291 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4232 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4181 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :5.33083e+09 after 3.24504e+10
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3.34429e+10,7.6802,176352,2,13508,25,770456,10,0,496,746476,0
Total reachable state count : 33442887165

Verifying 8 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,0,7.68148,176352,1,0,25,770456,10,0,497,746476,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1.10834e+09,7.68309,176352,2,2834,25,770456,11,0,499,746476,0
Reachability property MAX1 does not hold.
No reachable states exhibit your property : MAX1

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,0,7.68343,176352,1,0,25,770456,11,0,499,746476,0
Invariant property MIN1 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,2.33016e+09,7.68585,176352,2,6561,25,770456,12,0,501,746476,0
Reachability property MAX2 does not hold.
No reachable states exhibit your property : MAX2

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,0,7.68874,176352,1,0,25,770456,12,0,501,746476,0
Invariant property MIN2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,0,7.69177,176352,1,0,25,770456,12,0,501,746476,0
Reachability property MAX3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX3,1,7.69218,176352,2,97,25,770456,13,0,503,746476,0
Invariant property MIN3 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN3,1,7.69247,176352,2,97,25,770456,14,0,504,746476,0
ITS tools runner thread asked to quit. Dying gracefully.
Interrupted probabilistic random walk after 1259003 steps, run timeout after 3001 ms. (steps per millisecond=419 ) properties seen :0 out of 2
Probabilistic random walk after 1259003 steps, saw 573832 distinct states, run finished after 3001 ms. (steps per millisecond=419 ) properties seen :0
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-13 1 TECHNIQUES REACHABILITY_MAX
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-08 0 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[0, 0] Max Struct:[29, 18]
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m18-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:[29]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[29]
[2025-06-05 06:54:07] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[29]
RANDOM walk for 10000 steps (2281 resets) in 8 ms. (1111 steps per ms)
BEST_FIRST walk for 10000 steps (1012 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[29]
[2025-06-05 06:54:07] [INFO ] Invariant cache hit.
[2025-06-05 06:54:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:54:07] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2025-06-05 06:54:07] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-05 06:54:07] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-05 06:54:07] [INFO ] [Real]Added 42 Read/Feed constraints in 7 ms returned sat
[2025-06-05 06:54:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:54:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:54:07] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 06:54:07] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-05 06:54:07] [INFO ] [Nat]Added 42 Read/Feed constraints in 6 ms returned sat
[2025-06-05 06:54:07] [INFO ] Computed and/alt/rep : 26/66/26 causal constraints (skipped 79 transitions) in 7 ms.
[2025-06-05 06:54:07] [INFO ] Added : 14 causal constraints over 3 iterations in 59 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[29]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[29]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 106/106 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 93 transition count 103
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 93 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 93 transition count 101
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 91 transition count 99
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 91 transition count 99
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 89 transition count 97
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 89 transition count 97
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 87 transition count 94
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 87 transition count 94
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 85 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 85 transition count 91
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 83 transition count 89
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 83 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 82 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 82 transition count 88
Applied a total of 30 rules in 16 ms. Remains 82 /96 variables (removed 14) and now considering 88/106 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 82/96 places, 88/106 transitions.
// Phase 1: matrix 88 rows 82 cols
[2025-06-05 06:54:07] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[29]
RANDOM walk for 1000000 steps (224387 resets) in 671 ms. (1488 steps per ms)
BEST_FIRST walk for 1000000 steps (103155 resets) in 358 ms. (2785 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[29]
[2025-06-05 06:54:08] [INFO ] Invariant cache hit.
[2025-06-05 06:54:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 06:54:08] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-05 06:54:08] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-05 06:54:08] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-06-05 06:54:08] [INFO ] [Real]Added 34 Read/Feed constraints in 5 ms returned sat
[2025-06-05 06:54:08] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:54:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 06:54:08] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-05 06:54:08] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-05 06:54:08] [INFO ] [Nat]Added 34 Read/Feed constraints in 7 ms returned sat
[2025-06-05 06:54:08] [INFO ] Computed and/alt/rep : 22/52/22 causal constraints (skipped 65 transitions) in 5 ms.
[2025-06-05 06:54:08] [INFO ] Added : 16 causal constraints over 4 iterations in 35 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[29]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[29]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 88/88 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 82/82 places, 88/88 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 88/88 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2025-06-05 06:54:08] [INFO ] Invariant cache hit.
[2025-06-05 06:54:08] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-05 06:54:08] [INFO ] Invariant cache hit.
[2025-06-05 06:54:08] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-06-05 06:54:08] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2025-06-05 06:54:09] [INFO ] Redundant transitions in 1 ms returned []
Running 87 sub problems to find dead transitions.
[2025-06-05 06:54:09] [INFO ] Invariant cache hit.
[2025-06-05 06:54:09] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 1/82 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 88/170 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 34/120 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 0/170 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 120 constraints, problems are : Problem set: 0 solved, 87 unsolved in 1798 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 1/82 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 88/170 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 34/120 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 87/207 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 0/170 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 207 constraints, problems are : Problem set: 0 solved, 87 unsolved in 2808 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints]
After SMT, in 4680ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 4681ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4880 ms. Remains : 82/82 places, 88/88 transitions.
[2025-06-05 06:54:13] [INFO ] Flatten gal took : 26 ms
RANDOM walk for 40000 steps (8957 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
[2025-06-05 06:54:13] [INFO ] Flatten gal took : 11 ms
[2025-06-05 06:54:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10101409612466977292.gal : 19 ms
[2025-06-05 06:54:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14112609809684600149.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10101409612466977292.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14112609809684600149.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality14112609809684600149.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
BEST_FIRST walk for 40001 steps (4097 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 38
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :38 after 157
BEST_FIRST walk for 40000 steps (4172 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :157 after 468
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :468 after 2019
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2019 after 3579
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3579 after 5607
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :5607 after 37755
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :37755 after 238393
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :238393 after 1.95607e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.95607e+06 after 2.61634e+07
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.61634e+07 after 1.88702e+08
Interrupted probabilistic random walk after 3241921 steps, run timeout after 3001 ms. (steps per millisecond=1080 ) properties seen :1 out of 2
Probabilistic random walk after 3241921 steps, saw 1358822 distinct states, run finished after 3001 ms. (steps per millisecond=1080 ) properties seen :1
[2025-06-05 06:54:16] [INFO ] Invariant cache hit.
[2025-06-05 06:54:16] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 66/69 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 38/107 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/115 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/115 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/115 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/121 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/121 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/121 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 170/170 variables, and 95 constraints, problems are : Problem set: 1 solved, 0 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 9/34 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 99ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[29]
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m18-UpperBounds-02 in 9677 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m18-UpperBounds-05
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:[18]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[18]
// Phase 1: matrix 106 rows 96 cols
[2025-06-05 06:54:16] [INFO ] Computed 4 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[18]
RANDOM walk for 10000 steps (2260 resets) in 13 ms. (714 steps per ms)
BEST_FIRST walk for 10000 steps (1023 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[18]
[2025-06-05 06:54:16] [INFO ] Invariant cache hit.
[2025-06-05 06:54:16] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:54:17] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 06:54:17] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-05 06:54:17] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-05 06:54:17] [INFO ] [Real]Added 42 Read/Feed constraints in 11 ms returned sat
[2025-06-05 06:54:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:54:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:54:17] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 06:54:17] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-05 06:54:17] [INFO ] [Nat]Added 42 Read/Feed constraints in 7 ms returned sat
[2025-06-05 06:54:17] [INFO ] Computed and/alt/rep : 26/66/26 causal constraints (skipped 79 transitions) in 6 ms.
[2025-06-05 06:54:17] [INFO ] Added : 15 causal constraints over 5 iterations in 57 ms. Result :sat
Minimization took 58 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[18]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[18]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 106/106 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 93 transition count 103
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 93 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 93 transition count 101
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 90 transition count 98
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 90 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 90 transition count 97
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 18 place count 87 transition count 94
Iterating global reduction 2 with 3 rules applied. Total rules applied 21 place count 87 transition count 94
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 24 place count 84 transition count 90
Iterating global reduction 2 with 3 rules applied. Total rules applied 27 place count 84 transition count 90
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 30 place count 81 transition count 86
Iterating global reduction 2 with 3 rules applied. Total rules applied 33 place count 81 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 81 transition count 85
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 37 place count 78 transition count 82
Iterating global reduction 3 with 3 rules applied. Total rules applied 40 place count 78 transition count 82
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 77 transition count 81
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 77 transition count 81
Applied a total of 42 rules in 15 ms. Remains 77 /96 variables (removed 19) and now considering 81/106 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 77/96 places, 81/106 transitions.
// Phase 1: matrix 81 rows 77 cols
[2025-06-05 06:54:17] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[18]
RANDOM walk for 1000000 steps (224654 resets) in 648 ms. (1540 steps per ms)
BEST_FIRST walk for 1000001 steps (103130 resets) in 343 ms. (2906 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[18]
[2025-06-05 06:54:18] [INFO ] Invariant cache hit.
[2025-06-05 06:54:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 06:54:18] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2025-06-05 06:54:18] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-05 06:54:18] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-06-05 06:54:18] [INFO ] [Real]Added 32 Read/Feed constraints in 3 ms returned sat
[2025-06-05 06:54:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:54:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 06:54:18] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-05 06:54:18] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-05 06:54:18] [INFO ] [Nat]Added 32 Read/Feed constraints in 3 ms returned sat
[2025-06-05 06:54:18] [INFO ] Computed and/alt/rep : 20/44/20 causal constraints (skipped 60 transitions) in 4 ms.
[2025-06-05 06:54:18] [INFO ] Added : 13 causal constraints over 4 iterations in 33 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[18]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[18]
Support contains 1 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 81/81 transitions.
Applied a total of 0 rules in 5 ms. Remains 77 /77 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 77/77 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 81/81 transitions.
Applied a total of 0 rules in 4 ms. Remains 77 /77 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2025-06-05 06:54:18] [INFO ] Invariant cache hit.
[2025-06-05 06:54:18] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-05 06:54:18] [INFO ] Invariant cache hit.
[2025-06-05 06:54:18] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-06-05 06:54:18] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2025-06-05 06:54:18] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2025-06-05 06:54:18] [INFO ] Invariant cache hit.
[2025-06-05 06:54:18] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/158 variables, 77/81 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 32/113 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/158 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 113 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1409 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/158 variables, 77/81 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 32/113 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 80/193 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 0/158 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 193 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2690 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
After SMT, in 4157ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 4159ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4331 ms. Remains : 77/77 places, 81/81 transitions.
[2025-06-05 06:54:22] [INFO ] Flatten gal took : 18 ms
[2025-06-05 06:54:22] [INFO ] Flatten gal took : 6 ms
[2025-06-05 06:54:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1121744115220192968.gal : 3 ms
[2025-06-05 06:54:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10002337874857091481.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1121744115220192968.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10002337874857091481.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (9022 resets) in 98 ms. (404 steps per ms) remains 2/2 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (4126 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality10002337874857091481.prop.
BEST_FIRST walk for 40002 steps (4062 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 38
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :38 after 157
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :157 after 333
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :333 after 1257
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1257 after 3783
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3783 after 4503
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4503 after 10401
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :10401 after 44109
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :44109 after 294461
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :294461 after 2.11563e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.11563e+06 after 2.70738e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.70738e+07 after 2.90006e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.90006e+08 after 1.01896e+09
Interrupted probabilistic random walk after 3347608 steps, run timeout after 3001 ms. (steps per millisecond=1115 ) properties seen :1 out of 2
Probabilistic random walk after 3347608 steps, saw 1483305 distinct states, run finished after 3001 ms. (steps per millisecond=1115 ) properties seen :1
[2025-06-05 06:54:25] [INFO ] Invariant cache hit.
[2025-06-05 06:54:25] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/47 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/53 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 60/113 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 26/139 variables, 14/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-05 06:54:25] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/139 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 158/158 variables, and 105 constraints, problems are : Problem set: 1 solved, 0 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 23/32 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 131ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[18]
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m18-UpperBounds-05 in 9062 ms.
[2025-06-05 06:54:26] [INFO ] Flatten gal took : 13 ms
[2025-06-05 06:54:26] [INFO ] Applying decomposition
[2025-06-05 06:54:26] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18284598606207683989.txt' '-o' '/tmp/graph18284598606207683989.bin' '-w' '/tmp/graph18284598606207683989.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18284598606207683989.bin' '-l' '-1' '-v' '-w' '/tmp/graph18284598606207683989.weights' '-q' '0' '-e' '0.001'
[2025-06-05 06:54:26] [INFO ] Decomposing Gal with order
[2025-06-05 06:54:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 06:54:26] [INFO ] Removed a total of 92 redundant transitions.
[2025-06-05 06:54:26] [INFO ] Flatten gal took : 43 ms
[2025-06-05 06:54:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 69 labels/synchronizations in 8 ms.
[2025-06-05 06:54:26] [INFO ] Time to serialize gal into /tmp/UpperBounds11286001475441449595.gal : 3 ms
[2025-06-05 06:54:26] [INFO ] Time to serialize properties into /tmp/UpperBounds5079174655328828330.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds11286001475441449595.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5079174655328828330.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds5079174655328828330.prop.
Detected timeout of ITS tools.
[2025-06-05 07:14:42] [INFO ] Flatten gal took : 6 ms
[2025-06-05 07:14:42] [INFO ] Time to serialize gal into /tmp/UpperBounds1498929070102903003.gal : 1 ms
[2025-06-05 07:14:42] [INFO ] Time to serialize properties into /tmp/UpperBounds15546001615826839006.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds1498929070102903003.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15546001615826839006.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds15546001615826839006.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3.34429e+10,7.1669,173396,2,13508,5,769517,6,0,492,746476,0
Total reachable state count : 33442887165

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d1m18-UpperBounds-02 :0 <= p71 <= 1
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-02 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d1m18-UpperBounds-02,0,7.16839,173396,1,0,7,769517,9,1,639,746476,4
Min sum of variable value : 0
Maximum sum along a path : 15
Bounds property SieveSingleMsgMbox-PT-d1m18-UpperBounds-05 :0 <= l1209 <= 15
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-05 15 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d1m18-UpperBounds-05,0,7.16995,173396,1,0,8,769517,10,1,710,746476,5
Total runtime 1273431 ms.

BK_STOP 1749107690110

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="SieveSingleMsgMbox-PT-d1m18"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is SieveSingleMsgMbox-PT-d1m18, 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 r223-tall-174902009200053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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