Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r294-smll-165463872500157.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
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 r294-smll-165463872500157
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.3K May 30 14:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 30 14:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 30 14:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 30 14:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 25 13:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 25 13:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 25 13:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 25 13:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 7.4K May 30 14:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K May 30 14:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 30 14:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K May 30 14:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 25 13:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 1.8M May 29 12:20 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 1654782231917

Running Version 202205111006
[2022-06-09 13:43:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 13:43:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 13:43:55] [INFO ] Load time of PNML (sax parser for PT used): 562 ms
[2022-06-09 13:43:55] [INFO ] Transformed 256 places.
[2022-06-09 13:43:55] [INFO ] Transformed 2816 transitions.
[2022-06-09 13:43:55] [INFO ] Found NUPN structural information;
[2022-06-09 13:43:55] [INFO ] Parsed PT model containing 256 places and 2816 transitions in 779 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 83 ms.
Ensure Unique test removed 2229 transitions
Reduce redundant transitions removed 2229 transitions.
Normalized transition count is 566 out of 587 initially.
// Phase 1: matrix 566 rows 256 cols
[2022-06-09 13:43:55] [INFO ] Computed 8 place invariants in 39 ms
Incomplete random walk after 10000 steps, including 5 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 16) seen :8
FORMULA StigmergyCommit-PT-06a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :0
[2022-06-09 13:43:55] [INFO ] Flow matrix only has 566 transitions (discarded 21 similar events)
// Phase 1: matrix 566 rows 256 cols
[2022-06-09 13:43:55] [INFO ] Computed 8 place invariants in 6 ms
[2022-06-09 13:43:56] [INFO ] [Real]Absence check using 8 positive place invariants in 18 ms returned sat
[2022-06-09 13:43:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 13:43:56] [INFO ] [Real]Absence check using state equation in 380 ms returned sat
[2022-06-09 13:43:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 13:43:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2022-06-09 13:43:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 13:43:57] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2022-06-09 13:43:57] [INFO ] State equation strengthened by 351 read => feed constraints.
[2022-06-09 13:43:57] [INFO ] [Nat]Added 351 Read/Feed constraints in 152 ms returned sat
[2022-06-09 13:43:57] [INFO ] Deduced a trap composed of 19 places in 372 ms of which 6 ms to minimize.
[2022-06-09 13:43:58] [INFO ] Deduced a trap composed of 18 places in 326 ms of which 2 ms to minimize.
[2022-06-09 13:43:58] [INFO ] Deduced a trap composed of 16 places in 255 ms of which 1 ms to minimize.
[2022-06-09 13:43:58] [INFO ] Deduced a trap composed of 18 places in 233 ms of which 3 ms to minimize.
[2022-06-09 13:43:59] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 2 ms to minimize.
[2022-06-09 13:43:59] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 1 ms to minimize.
[2022-06-09 13:43:59] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 1 ms to minimize.
[2022-06-09 13:43:59] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 1 ms to minimize.
[2022-06-09 13:43:59] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2022-06-09 13:43:59] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 1 ms to minimize.
[2022-06-09 13:43:59] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 1 ms to minimize.
[2022-06-09 13:43:59] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 0 ms to minimize.
[2022-06-09 13:44:00] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2622 ms
[2022-06-09 13:44:00] [INFO ] Computed and/alt/rep : 289/366/289 causal constraints (skipped 276 transitions) in 169 ms.
[2022-06-09 13:44:00] [INFO ] Added : 52 causal constraints over 11 iterations in 899 ms. Result :sat
Minimization took 147 ms.
[2022-06-09 13:44:01] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2022-06-09 13:44:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 13:44:01] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2022-06-09 13:44:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 13:44:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2022-06-09 13:44:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 13:44:01] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2022-06-09 13:44:01] [INFO ] [Nat]Added 351 Read/Feed constraints in 76 ms returned sat
[2022-06-09 13:44:01] [INFO ] Deduced a trap composed of 16 places in 227 ms of which 1 ms to minimize.
[2022-06-09 13:44:02] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 1 ms to minimize.
[2022-06-09 13:44:02] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 1 ms to minimize.
[2022-06-09 13:44:02] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 0 ms to minimize.
[2022-06-09 13:44:02] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 0 ms to minimize.
[2022-06-09 13:44:02] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2022-06-09 13:44:02] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 0 ms to minimize.
[2022-06-09 13:44:03] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2022-06-09 13:44:03] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2022-06-09 13:44:03] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1484 ms
[2022-06-09 13:44:03] [INFO ] Computed and/alt/rep : 289/366/289 causal constraints (skipped 276 transitions) in 126 ms.
[2022-06-09 13:44:03] [INFO ] Added : 53 causal constraints over 11 iterations in 593 ms. Result :sat
Minimization took 115 ms.
[2022-06-09 13:44:04] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2022-06-09 13:44:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 13:44:04] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2022-06-09 13:44:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 13:44:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2022-06-09 13:44:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 13:44:04] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2022-06-09 13:44:04] [INFO ] [Nat]Added 351 Read/Feed constraints in 68 ms returned sat
[2022-06-09 13:44:04] [INFO ] Deduced a trap composed of 18 places in 182 ms of which 1 ms to minimize.
[2022-06-09 13:44:04] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 0 ms to minimize.
[2022-06-09 13:44:05] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 0 ms to minimize.
[2022-06-09 13:44:05] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 1 ms to minimize.
[2022-06-09 13:44:05] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
[2022-06-09 13:44:05] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 0 ms to minimize.
[2022-06-09 13:44:05] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 0 ms to minimize.
[2022-06-09 13:44:05] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 0 ms to minimize.
[2022-06-09 13:44:05] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2022-06-09 13:44:05] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.
[2022-06-09 13:44:05] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1427 ms
[2022-06-09 13:44:06] [INFO ] Computed and/alt/rep : 289/366/289 causal constraints (skipped 276 transitions) in 54 ms.
[2022-06-09 13:44:06] [INFO ] Added : 52 causal constraints over 11 iterations in 508 ms. Result :sat
Minimization took 119 ms.
[2022-06-09 13:44:06] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2022-06-09 13:44:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 13:44:06] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2022-06-09 13:44:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 13:44:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2022-06-09 13:44:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 13:44:07] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2022-06-09 13:44:07] [INFO ] [Nat]Added 351 Read/Feed constraints in 123 ms returned sat
[2022-06-09 13:44:07] [INFO ] Deduced a trap composed of 18 places in 255 ms of which 3 ms to minimize.
[2022-06-09 13:44:08] [INFO ] Deduced a trap composed of 17 places in 227 ms of which 1 ms to minimize.
[2022-06-09 13:44:08] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 1 ms to minimize.
[2022-06-09 13:44:08] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 1 ms to minimize.
[2022-06-09 13:44:08] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 1 ms to minimize.
[2022-06-09 13:44:08] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 1 ms to minimize.
[2022-06-09 13:44:09] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 1 ms to minimize.
[2022-06-09 13:44:09] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 1 ms to minimize.
[2022-06-09 13:44:09] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 0 ms to minimize.
[2022-06-09 13:44:09] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 1 ms to minimize.
[2022-06-09 13:44:09] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2022-06-09 13:44:09] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2132 ms
[2022-06-09 13:44:09] [INFO ] Computed and/alt/rep : 289/366/289 causal constraints (skipped 276 transitions) in 81 ms.
[2022-06-09 13:44:10] [INFO ] Added : 54 causal constraints over 11 iterations in 749 ms. Result :sat
Minimization took 187 ms.
[2022-06-09 13:44:10] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2022-06-09 13:44:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 13:44:10] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2022-06-09 13:44:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 13:44:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2022-06-09 13:44:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 13:44:11] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2022-06-09 13:44:11] [INFO ] [Nat]Added 351 Read/Feed constraints in 159 ms returned sat
[2022-06-09 13:44:11] [INFO ] Deduced a trap composed of 17 places in 303 ms of which 1 ms to minimize.
[2022-06-09 13:44:12] [INFO ] Deduced a trap composed of 16 places in 324 ms of which 1 ms to minimize.
[2022-06-09 13:44:12] [INFO ] Deduced a trap composed of 16 places in 251 ms of which 1 ms to minimize.
[2022-06-09 13:44:12] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 1 ms to minimize.
[2022-06-09 13:44:12] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 1 ms to minimize.
[2022-06-09 13:44:13] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 1 ms to minimize.
[2022-06-09 13:44:13] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 0 ms to minimize.
[2022-06-09 13:44:13] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1833 ms
[2022-06-09 13:44:13] [INFO ] Computed and/alt/rep : 289/366/289 causal constraints (skipped 276 transitions) in 87 ms.
[2022-06-09 13:44:14] [INFO ] Added : 57 causal constraints over 12 iterations in 972 ms. Result :sat
Minimization took 175 ms.
[2022-06-09 13:44:14] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2022-06-09 13:44:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 13:44:14] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2022-06-09 13:44:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 13:44:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2022-06-09 13:44:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 13:44:15] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2022-06-09 13:44:15] [INFO ] [Nat]Added 351 Read/Feed constraints in 108 ms returned sat
[2022-06-09 13:44:15] [INFO ] Deduced a trap composed of 17 places in 282 ms of which 1 ms to minimize.
[2022-06-09 13:44:15] [INFO ] Deduced a trap composed of 18 places in 230 ms of which 2 ms to minimize.
[2022-06-09 13:44:16] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 1 ms to minimize.
[2022-06-09 13:44:16] [INFO ] Deduced a trap composed of 17 places in 208 ms of which 1 ms to minimize.
[2022-06-09 13:44:16] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 1 ms to minimize.
[2022-06-09 13:44:16] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 0 ms to minimize.
[2022-06-09 13:44:16] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 0 ms to minimize.
[2022-06-09 13:44:17] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 4 ms to minimize.
[2022-06-09 13:44:17] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 1 ms to minimize.
[2022-06-09 13:44:17] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2042 ms
[2022-06-09 13:44:17] [INFO ] Computed and/alt/rep : 289/366/289 causal constraints (skipped 276 transitions) in 84 ms.
[2022-06-09 13:44:18] [INFO ] Added : 53 causal constraints over 11 iterations in 798 ms. Result :sat
Minimization took 197 ms.
[2022-06-09 13:44:18] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2022-06-09 13:44:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 13:44:18] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2022-06-09 13:44:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 13:44:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2022-06-09 13:44:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 13:44:19] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2022-06-09 13:44:19] [INFO ] [Nat]Added 351 Read/Feed constraints in 171 ms returned sat
[2022-06-09 13:44:19] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 0 ms to minimize.
[2022-06-09 13:44:19] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 1 ms to minimize.
[2022-06-09 13:44:19] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 1 ms to minimize.
[2022-06-09 13:44:20] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 1 ms to minimize.
[2022-06-09 13:44:20] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 1 ms to minimize.
[2022-06-09 13:44:20] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2022-06-09 13:44:20] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1203 ms
[2022-06-09 13:44:20] [INFO ] Computed and/alt/rep : 289/366/289 causal constraints (skipped 276 transitions) in 87 ms.
[2022-06-09 13:44:21] [INFO ] Added : 58 causal constraints over 12 iterations in 901 ms. Result :sat
Minimization took 197 ms.
[2022-06-09 13:44:21] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2022-06-09 13:44:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 13:44:21] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2022-06-09 13:44:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 13:44:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 16 ms returned sat
[2022-06-09 13:44:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 13:44:22] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2022-06-09 13:44:22] [INFO ] [Nat]Added 351 Read/Feed constraints in 121 ms returned sat
[2022-06-09 13:44:22] [INFO ] Deduced a trap composed of 19 places in 274 ms of which 1 ms to minimize.
[2022-06-09 13:44:23] [INFO ] Deduced a trap composed of 18 places in 267 ms of which 1 ms to minimize.
[2022-06-09 13:44:23] [INFO ] Deduced a trap composed of 18 places in 231 ms of which 1 ms to minimize.
[2022-06-09 13:44:23] [INFO ] Deduced a trap composed of 18 places in 202 ms of which 4 ms to minimize.
[2022-06-09 13:44:23] [INFO ] Deduced a trap composed of 19 places in 228 ms of which 20 ms to minimize.
[2022-06-09 13:44:24] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 2 ms to minimize.
[2022-06-09 13:44:24] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 1 ms to minimize.
[2022-06-09 13:44:24] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2022-06-09 13:44:24] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 1 ms to minimize.
[2022-06-09 13:44:24] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 0 ms to minimize.
[2022-06-09 13:44:24] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2285 ms
[2022-06-09 13:44:24] [INFO ] Computed and/alt/rep : 289/366/289 causal constraints (skipped 276 transitions) in 100 ms.
[2022-06-09 13:44:25] [INFO ] Added : 54 causal constraints over 11 iterations in 850 ms. Result :sat
Minimization took 182 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
FORMULA StigmergyCommit-PT-06a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
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
FORMULA StigmergyCommit-PT-06a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 31821 ms.

BK_STOP 1654782266387

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-4028"
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 r294-smll-165463872500157"
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 ;