Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r377-smll-171683809600053.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is SieveSingleMsgMbox-PT-d1m04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r377-smll-171683809600053
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 836K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 19:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 19:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 19:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 19:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 450K 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 SieveSingleMsgMbox-PT-d1m04-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716887531379

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 09:12:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-28 09:12:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 09:12:13] [INFO ] Load time of PNML (sax parser for PT used): 240 ms
[2024-05-28 09:12:13] [INFO ] Transformed 1295 places.
[2024-05-28 09:12:13] [INFO ] Transformed 749 transitions.
[2024-05-28 09:12:13] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 442 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 93 ms.
Deduced a syphon composed of 1036 places in 24 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 749 rows 259 cols
[2024-05-28 09:12:13] [INFO ] Computed 6 invariants in 65 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[10, 10, 1, 1, 10]
RANDOM walk for 10000 steps (2231 resets) in 329 ms. (30 steps per ms)
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (3831 resets) in 277 ms. (143 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[10, 10, 1, 10]
[2024-05-28 09:12:14] [INFO ] Invariant cache hit.
[2024-05-28 09:12:14] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2024-05-28 09:12:14] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 10 ms returned sat
[2024-05-28 09:12:15] [INFO ] [Real]Absence check using state equation in 515 ms returned sat
[2024-05-28 09:12:15] [INFO ] State equation strengthened by 587 read => feed constraints.
[2024-05-28 09:12:15] [INFO ] [Real]Added 587 Read/Feed constraints in 157 ms returned sat
[2024-05-28 09:12:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:12:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-28 09:12:15] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 09:12:16] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2024-05-28 09:12:16] [INFO ] [Nat]Added 587 Read/Feed constraints in 210 ms returned sat
[2024-05-28 09:12:16] [INFO ] Deduced a trap composed of 18 places in 243 ms of which 31 ms to minimize.
[2024-05-28 09:12:17] [INFO ] Deduced a trap composed of 17 places in 265 ms of which 4 ms to minimize.
[2024-05-28 09:12:17] [INFO ] Deduced a trap composed of 23 places in 203 ms of which 3 ms to minimize.
[2024-05-28 09:12:17] [INFO ] Deduced a trap composed of 26 places in 195 ms of which 3 ms to minimize.
[2024-05-28 09:12:17] [INFO ] Deduced a trap composed of 26 places in 193 ms of which 3 ms to minimize.
[2024-05-28 09:12:18] [INFO ] Deduced a trap composed of 26 places in 293 ms of which 5 ms to minimize.
[2024-05-28 09:12:18] [INFO ] Deduced a trap composed of 38 places in 223 ms of which 3 ms to minimize.
[2024-05-28 09:12:18] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 3 ms to minimize.
[2024-05-28 09:12:19] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 3 ms to minimize.
[2024-05-28 09:12:19] [INFO ] Deduced a trap composed of 105 places in 312 ms of which 5 ms to minimize.
[2024-05-28 09:12:19] [INFO ] Deduced a trap composed of 156 places in 155 ms of which 3 ms to minimize.
[2024-05-28 09:12:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 3333 ms
[2024-05-28 09:12:19] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-28 09:12:19] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-28 09:12:20] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2024-05-28 09:12:20] [INFO ] [Real]Added 587 Read/Feed constraints in 185 ms returned sat
[2024-05-28 09:12:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:12:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-28 09:12:20] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-28 09:12:20] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2024-05-28 09:12:20] [INFO ] [Nat]Added 587 Read/Feed constraints in 181 ms returned sat
[2024-05-28 09:12:21] [INFO ] Deduced a trap composed of 30 places in 334 ms of which 5 ms to minimize.
[2024-05-28 09:12:21] [INFO ] Deduced a trap composed of 30 places in 258 ms of which 4 ms to minimize.
[2024-05-28 09:12:21] [INFO ] Deduced a trap composed of 18 places in 267 ms of which 3 ms to minimize.
[2024-05-28 09:12:22] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 3 ms to minimize.
[2024-05-28 09:12:22] [INFO ] Deduced a trap composed of 30 places in 249 ms of which 5 ms to minimize.
[2024-05-28 09:12:22] [INFO ] Deduced a trap composed of 27 places in 278 ms of which 4 ms to minimize.
[2024-05-28 09:12:23] [INFO ] Deduced a trap composed of 26 places in 236 ms of which 5 ms to minimize.
[2024-05-28 09:12:23] [INFO ] Deduced a trap composed of 26 places in 230 ms of which 5 ms to minimize.
[2024-05-28 09:12:24] [INFO ] Trap strengthening (SAT) tested/added 8/8 trap constraints in 3453 ms
[2024-05-28 09:12:24] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 09:12:24] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-28 09:12:24] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2024-05-28 09:12:24] [INFO ] [Real]Added 587 Read/Feed constraints in 122 ms returned sat
[2024-05-28 09:12:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:12:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 09:12:24] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 09:12:25] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2024-05-28 09:12:25] [INFO ] [Nat]Added 587 Read/Feed constraints in 184 ms returned sat
[2024-05-28 09:12:25] [INFO ] Deduced a trap composed of 30 places in 278 ms of which 5 ms to minimize.
[2024-05-28 09:12:25] [INFO ] Deduced a trap composed of 28 places in 277 ms of which 4 ms to minimize.
[2024-05-28 09:12:26] [INFO ] Deduced a trap composed of 28 places in 228 ms of which 5 ms to minimize.
[2024-05-28 09:12:26] [INFO ] Deduced a trap composed of 25 places in 277 ms of which 4 ms to minimize.
[2024-05-28 09:12:26] [INFO ] Deduced a trap composed of 38 places in 213 ms of which 3 ms to minimize.
[2024-05-28 09:12:27] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 3 ms to minimize.
[2024-05-28 09:12:27] [INFO ] Deduced a trap composed of 137 places in 199 ms of which 4 ms to minimize.
[2024-05-28 09:12:27] [INFO ] Deduced a trap composed of 138 places in 209 ms of which 3 ms to minimize.
[2024-05-28 09:12:27] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2583 ms
[2024-05-28 09:12:28] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 205 ms.
[2024-05-28 09:12:28] [INFO ] Added : 23 causal constraints over 5 iterations in 581 ms. Result :sat
Minimization took 579 ms.
[2024-05-28 09:12:29] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-28 09:12:29] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 09:12:29] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2024-05-28 09:12:29] [INFO ] [Real]Added 587 Read/Feed constraints in 203 ms returned sat
[2024-05-28 09:12:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:12:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 09:12:29] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 09:12:30] [INFO ] [Nat]Absence check using state equation in 351 ms returned sat
[2024-05-28 09:12:30] [INFO ] [Nat]Added 587 Read/Feed constraints in 340 ms returned sat
[2024-05-28 09:12:30] [INFO ] Deduced a trap composed of 30 places in 256 ms of which 5 ms to minimize.
[2024-05-28 09:12:31] [INFO ] Deduced a trap composed of 30 places in 248 ms of which 6 ms to minimize.
[2024-05-28 09:12:31] [INFO ] Deduced a trap composed of 18 places in 238 ms of which 4 ms to minimize.
[2024-05-28 09:12:31] [INFO ] Deduced a trap composed of 27 places in 314 ms of which 5 ms to minimize.
[2024-05-28 09:12:32] [INFO ] Deduced a trap composed of 33 places in 249 ms of which 3 ms to minimize.
[2024-05-28 09:12:32] [INFO ] Deduced a trap composed of 30 places in 229 ms of which 4 ms to minimize.
[2024-05-28 09:12:33] [INFO ] Deduced a trap composed of 27 places in 261 ms of which 4 ms to minimize.
[2024-05-28 09:12:33] [INFO ] Deduced a trap composed of 30 places in 172 ms of which 5 ms to minimize.
[2024-05-28 09:12:34] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 2 ms to minimize.
[2024-05-28 09:12:34] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 2 ms to minimize.
[2024-05-28 09:12:34] [INFO ] Trap strengthening (SAT) tested/added 10/10 trap constraints in 4231 ms
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[0, 10, 1, 10]
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[10, 1, 10]
Support contains 3 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.4 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 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 302 place count 182 transition count 256
Iterating global reduction 1 with 59 rules applied. Total rules applied 361 place count 182 transition count 256
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 367 place count 182 transition count 250
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 409 place count 140 transition count 208
Iterating global reduction 2 with 42 rules applied. Total rules applied 451 place count 140 transition count 208
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 464 place count 140 transition count 195
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 489 place count 115 transition count 168
Iterating global reduction 3 with 25 rules applied. Total rules applied 514 place count 115 transition count 168
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 537 place count 115 transition count 145
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 543 place count 109 transition count 137
Iterating global reduction 4 with 6 rules applied. Total rules applied 549 place count 109 transition count 137
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 555 place count 103 transition count 131
Iterating global reduction 4 with 6 rules applied. Total rules applied 561 place count 103 transition count 131
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 564 place count 100 transition count 127
Iterating global reduction 4 with 3 rules applied. Total rules applied 567 place count 100 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 570 place count 100 transition count 124
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 573 place count 97 transition count 121
Iterating global reduction 5 with 3 rules applied. Total rules applied 576 place count 97 transition count 121
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 578 place count 95 transition count 119
Iterating global reduction 5 with 2 rules applied. Total rules applied 580 place count 95 transition count 119
Applied a total of 580 rules in 225 ms. Remains 95 /259 variables (removed 164) and now considering 119/749 (removed 630) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 244 ms. Remains : 95/259 places, 119/749 transitions.
// Phase 1: matrix 119 rows 95 cols
[2024-05-28 09:12:35] [INFO ] Computed 4 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[10, 1, 10]
RANDOM walk for 1000000 steps (224320 resets) in 1511 ms. (661 steps per ms)
BEST_FIRST walk for 3000001 steps (310915 resets) in 1747 ms. (1716 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[10, 1, 10]
[2024-05-28 09:12:38] [INFO ] Invariant cache hit.
[2024-05-28 09:12:38] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 09:12:38] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 09:12:38] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-28 09:12:38] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 09:12:38] [INFO ] [Real]Added 55 Read/Feed constraints in 17 ms returned sat
[2024-05-28 09:12:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:12:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 09:12:38] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 09:12:38] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-28 09:12:38] [INFO ] [Nat]Added 55 Read/Feed constraints in 39 ms returned sat
[2024-05-28 09:12:38] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2024-05-28 09:12:38] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-05-28 09:12:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 187 ms
[2024-05-28 09:12:38] [INFO ] Computed and/alt/rep : 26/64/26 causal constraints (skipped 92 transitions) in 14 ms.
[2024-05-28 09:12:39] [INFO ] Added : 16 causal constraints over 4 iterations in 97 ms. Result :sat
Minimization took 149 ms.
[2024-05-28 09:12:39] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 09:12:39] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 09:12:39] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-05-28 09:12:39] [INFO ] [Real]Added 55 Read/Feed constraints in 18 ms returned sat
[2024-05-28 09:12:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:12:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 09:12:39] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 09:12:39] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-28 09:12:39] [INFO ] [Nat]Added 55 Read/Feed constraints in 26 ms returned sat
[2024-05-28 09:12:39] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 3 ms to minimize.
[2024-05-28 09:12:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2024-05-28 09:12:39] [INFO ] Computed and/alt/rep : 26/64/26 causal constraints (skipped 92 transitions) in 13 ms.
[2024-05-28 09:12:39] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 3 ms to minimize.
[2024-05-28 09:12:39] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 3 ms to minimize.
[2024-05-28 09:12:39] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 2 ms to minimize.
[2024-05-28 09:12:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 267 ms
[2024-05-28 09:12:39] [INFO ] Added : 19 causal constraints over 4 iterations in 365 ms. Result :sat
Minimization took 129 ms.
[2024-05-28 09:12:40] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 09:12:40] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 09:12:40] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-05-28 09:12:40] [INFO ] [Real]Added 55 Read/Feed constraints in 28 ms returned sat
[2024-05-28 09:12:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:12:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-28 09:12:40] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 09:12:40] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-05-28 09:12:40] [INFO ] [Nat]Added 55 Read/Feed constraints in 23 ms returned sat
[2024-05-28 09:12:40] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-05-28 09:12:40] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 2 ms to minimize.
[2024-05-28 09:12:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 148 ms
[2024-05-28 09:12:40] [INFO ] Computed and/alt/rep : 26/64/26 causal constraints (skipped 92 transitions) in 13 ms.
[2024-05-28 09:12:40] [INFO ] Added : 16 causal constraints over 4 iterations in 86 ms. Result :sat
Minimization took 135 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[10, 1, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[10, 1, 10]
Support contains 3 out of 95 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 119/119 transitions.
Applied a total of 0 rules in 9 ms. Remains 95 /95 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 95/95 places, 119/119 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 119/119 transitions.
Applied a total of 0 rules in 12 ms. Remains 95 /95 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2024-05-28 09:12:40] [INFO ] Invariant cache hit.
[2024-05-28 09:12:41] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-28 09:12:41] [INFO ] Invariant cache hit.
[2024-05-28 09:12:41] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 09:12:41] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2024-05-28 09:12:41] [INFO ] Redundant transitions in 3 ms returned []
Running 118 sub problems to find dead transitions.
[2024-05-28 09:12:41] [INFO ] Invariant cache hit.
[2024-05-28 09:12:41] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (OVERLAPS) 1/95 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:12:43] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (OVERLAPS) 119/214 variables, 95/100 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 55/155 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 118 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/214 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 155 constraints, problems are : Problem set: 0 solved, 118 unsolved in 6795 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (OVERLAPS) 1/95 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (OVERLAPS) 119/214 variables, 95/100 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 55/155 constraints. Problems are: Problem set: 0 solved, 118 unsolved
Problem TDEAD98 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 118/273 constraints. Problems are: Problem set: 15 solved, 103 unsolved
[2024-05-28 09:12:51] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 1/274 constraints. Problems are: Problem set: 15 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 0/274 constraints. Problems are: Problem set: 15 solved, 103 unsolved
At refinement iteration 11 (OVERLAPS) 0/214 variables, 0/274 constraints. Problems are: Problem set: 15 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 274 constraints, problems are : Problem set: 15 solved, 103 unsolved in 10101 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 2/2 constraints]
After SMT, in 17259ms problems are : Problem set: 15 solved, 103 unsolved
Search for dead transitions found 15 dead transitions in 17280ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 95/95 places, 104/119 transitions.
Graph (complete) has 229 edges and 95 vertex of which 65 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 0 output transitions
Reduce places removed 7 places and 33 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 58 transition count 56
Reduce places removed 8 places and 10 transitions.
Graph (complete) has 119 edges and 50 vertex of which 3 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.0 ms
Discarding 47 places :
Also discarding 46 output transitions
Drop transitions (Output transitions of discarded places.) removed 46 transitions
Iterating post reduction 1 with 9 rules applied. Total rules applied 32 place count 3 transition count 0
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 32 rules in 5 ms. Remains 3 /95 variables (removed 92) and now considering 0/104 (removed 104) transitions.
[2024-05-28 09:12:58] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 09:12:58] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-28 09:12:58] [INFO ] Invariant cache hit.
[2024-05-28 09:12:58] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 3/95 places, 0/119 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 17862 ms. Remains : 3/95 places, 0/119 transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 45602 ms.
ITS solved all properties within timeout

BK_STOP 1716887578811

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is SieveSingleMsgMbox-PT-d1m04, 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 r377-smll-171683809600053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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