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.r400-tall-171690531700157.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 itstools
Input is StigmergyCommit-PT-06a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690531700157
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 17:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 11 17:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 17:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 17:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.8M 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 StigmergyCommit-PT-06a-UpperBounds-00
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-01
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-02
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-03
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-04
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-05
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-06
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-07
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-08
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-09
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-10
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-11
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-12
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-13
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-14
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716988527170

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-06a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-29 13:15:28] [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]
[2024-05-29 13:15:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 13:15:28] [INFO ] Load time of PNML (sax parser for PT used): 236 ms
[2024-05-29 13:15:28] [INFO ] Transformed 256 places.
[2024-05-29 13:15:28] [INFO ] Transformed 2816 transitions.
[2024-05-29 13:15:28] [INFO ] Found NUPN structural information;
[2024-05-29 13:15:28] [INFO ] Parsed PT model containing 256 places and 2816 transitions and 35321 arcs in 361 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 2229 transitions
Reduce redundant transitions removed 2229 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA StigmergyCommit-PT-06a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-29 13:15:28] [INFO ] Flow matrix only has 566 transitions (discarded 21 similar events)
// Phase 1: matrix 566 rows 256 cols
[2024-05-29 13:15:28] [INFO ] Computed 8 invariants in 28 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 131 ms. (75 steps per ms)
FORMULA StigmergyCommit-PT-06a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-05-29 13:15:28] [INFO ] Flow matrix only has 566 transitions (discarded 21 similar events)
[2024-05-29 13:15:28] [INFO ] Invariant cache hit.
[2024-05-29 13:15:29] [INFO ] [Real]Absence check using 8 positive place invariants in 19 ms returned sat
[2024-05-29 13:15:29] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2024-05-29 13:15:29] [INFO ] State equation strengthened by 351 read => feed constraints.
[2024-05-29 13:15:29] [INFO ] [Real]Added 351 Read/Feed constraints in 45 ms returned sat
[2024-05-29 13:15:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 13:15:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2024-05-29 13:15:29] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2024-05-29 13:15:29] [INFO ] [Nat]Added 351 Read/Feed constraints in 56 ms returned sat
[2024-05-29 13:15:29] [INFO ] Deduced a trap composed of 18 places in 174 ms of which 20 ms to minimize.
[2024-05-29 13:15:30] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 2 ms to minimize.
[2024-05-29 13:15:30] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 2 ms to minimize.
[2024-05-29 13:15:30] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 1 ms to minimize.
[2024-05-29 13:15:30] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
[2024-05-29 13:15:30] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 1 ms to minimize.
[2024-05-29 13:15:30] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 5 ms to minimize.
[2024-05-29 13:15:30] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
[2024-05-29 13:15:30] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2024-05-29 13:15:31] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 3 ms to minimize.
[2024-05-29 13:15:31] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-29 13:15:31] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2024-05-29 13:15:31] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1550 ms
[2024-05-29 13:15:31] [INFO ] Computed and/alt/rep : 289/366/289 causal constraints (skipped 276 transitions) in 71 ms.
[2024-05-29 13:15:31] [INFO ] Added : 51 causal constraints over 11 iterations in 515 ms. Result :sat
Minimization took 148 ms.
[2024-05-29 13:15:32] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-29 13:15:32] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2024-05-29 13:15:32] [INFO ] [Real]Added 351 Read/Feed constraints in 41 ms returned sat
[2024-05-29 13:15:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 13:15:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-29 13:15:32] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2024-05-29 13:15:32] [INFO ] [Nat]Added 351 Read/Feed constraints in 55 ms returned sat
[2024-05-29 13:15:32] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 2 ms to minimize.
[2024-05-29 13:15:32] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 1 ms to minimize.
[2024-05-29 13:15:32] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 1 ms to minimize.
[2024-05-29 13:15:33] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2024-05-29 13:15:33] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-05-29 13:15:33] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2024-05-29 13:15:33] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-29 13:15:33] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:15:33] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:15:33] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:15:33] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1171 ms
[2024-05-29 13:15:33] [INFO ] Computed and/alt/rep : 289/366/289 causal constraints (skipped 276 transitions) in 83 ms.
[2024-05-29 13:15:34] [INFO ] Added : 51 causal constraints over 11 iterations in 445 ms. Result :sat
Minimization took 147 ms.
[2024-05-29 13:15:34] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-29 13:15:34] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2024-05-29 13:15:34] [INFO ] [Real]Added 351 Read/Feed constraints in 43 ms returned sat
[2024-05-29 13:15:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 13:15:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-29 13:15:34] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2024-05-29 13:15:34] [INFO ] [Nat]Added 351 Read/Feed constraints in 45 ms returned sat
[2024-05-29 13:15:34] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 1 ms to minimize.
[2024-05-29 13:15:34] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 1 ms to minimize.
[2024-05-29 13:15:35] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 1 ms to minimize.
[2024-05-29 13:15:35] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-05-29 13:15:35] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:15:35] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:15:35] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:15:35] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 738 ms
[2024-05-29 13:15:35] [INFO ] Computed and/alt/rep : 289/366/289 causal constraints (skipped 276 transitions) in 37 ms.
[2024-05-29 13:15:35] [INFO ] Added : 57 causal constraints over 12 iterations in 433 ms. Result :sat
Minimization took 138 ms.
[2024-05-29 13:15:36] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-29 13:15:36] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2024-05-29 13:15:36] [INFO ] [Real]Added 351 Read/Feed constraints in 40 ms returned sat
[2024-05-29 13:15:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 13:15:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-29 13:15:36] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2024-05-29 13:15:36] [INFO ] [Nat]Added 351 Read/Feed constraints in 41 ms returned sat
[2024-05-29 13:15:36] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 1 ms to minimize.
[2024-05-29 13:15:36] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
[2024-05-29 13:15:36] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-05-29 13:15:36] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2024-05-29 13:15:37] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-05-29 13:15:37] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-29 13:15:37] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:15:37] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 759 ms
[2024-05-29 13:15:37] [INFO ] Computed and/alt/rep : 289/366/289 causal constraints (skipped 276 transitions) in 38 ms.
[2024-05-29 13:15:37] [INFO ] Added : 54 causal constraints over 11 iterations in 357 ms. Result :sat
Minimization took 142 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA StigmergyCommit-PT-06a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 256 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p99) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 586/586 transitions.
Graph (complete) has 547 edges and 256 vertex of which 249 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 248 transition count 513
Reduce places removed 44 places and 1 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 79 rules applied. Total rules applied 146 place count 204 transition count 477
Reduce places removed 8 places and 1 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 154 place count 196 transition count 476
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 155 place count 195 transition count 475
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 156 place count 194 transition count 474
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 47 Pre rules applied. Total rules applied 156 place count 194 transition count 427
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 5 with 94 rules applied. Total rules applied 250 place count 147 transition count 427
Discarding 35 places :
Symmetric choice reduction at 5 with 35 rule applications. Total rules 285 place count 112 transition count 392
Iterating global reduction 5 with 35 rules applied. Total rules applied 320 place count 112 transition count 392
Discarding 35 places :
Symmetric choice reduction at 5 with 35 rule applications. Total rules 355 place count 77 transition count 357
Iterating global reduction 5 with 35 rules applied. Total rules applied 390 place count 77 transition count 357
Ensure Unique test removed 134 transitions
Reduce isomorphic transitions removed 134 transitions.
Iterating post reduction 5 with 134 rules applied. Total rules applied 524 place count 77 transition count 223
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 531 place count 70 transition count 216
Iterating global reduction 6 with 7 rules applied. Total rules applied 538 place count 70 transition count 216
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 545 place count 63 transition count 209
Iterating global reduction 6 with 7 rules applied. Total rules applied 552 place count 63 transition count 209
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 558 place count 63 transition count 203
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 584 place count 50 transition count 190
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 596 place count 50 transition count 178
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 602 place count 44 transition count 172
Iterating global reduction 8 with 6 rules applied. Total rules applied 608 place count 44 transition count 172
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 614 place count 38 transition count 166
Iterating global reduction 8 with 6 rules applied. Total rules applied 620 place count 38 transition count 166
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 626 place count 32 transition count 160
Iterating global reduction 8 with 6 rules applied. Total rules applied 632 place count 32 transition count 160
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 633 place count 32 transition count 159
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 635 place count 32 transition count 159
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 636 place count 32 transition count 158
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 637 place count 31 transition count 157
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 8 with 7 rules applied. Total rules applied 644 place count 30 transition count 151
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 650 place count 24 transition count 151
Performed 8 Post agglomeration using F-continuation condition with reduction of 119 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 10 with 16 rules applied. Total rules applied 666 place count 16 transition count 24
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 674 place count 16 transition count 16
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 11 with 18 rules applied. Total rules applied 692 place count 4 transition count 10
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 3 edges and 4 vertex of which 2 / 4 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Iterating post reduction 11 with 7 rules applied. Total rules applied 699 place count 3 transition count 4
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 701 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 701 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 703 place count 2 transition count 1
Applied a total of 703 rules in 144 ms. Remains 2 /256 variables (removed 254) and now considering 1/586 (removed 585) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 2/256 places, 1/586 transitions.
// Phase 1: matrix 1 rows 2 cols
[2024-05-29 13:15:38] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA StigmergyCommit-PT-06a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (500000 resets) in 234 ms. (4255 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-29 13:15:38] [INFO ] Flatten gal took : 117 ms
[2024-05-29 13:15:38] [INFO ] Flatten gal took : 1 ms
[2024-05-29 13:15:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8429417041135286030.gal : 3 ms
[2024-05-29 13:15:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1936054660936488953.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/ReachabilityCardinality8429417041135286030.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1936054660936488953.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 10200 ms.

BK_STOP 1716988538520

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="StigmergyCommit-PT-06a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is StigmergyCommit-PT-06a, 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 r400-tall-171690531700157"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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