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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.8M
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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.3K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Apr 11 17:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 17:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 17:48 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 5.4M 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-07a-UpperBounds-00
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-01
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-02
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-03
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-04
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-05
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-06
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-07
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-08
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-09
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-10
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-11
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-12
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-13
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-14
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717232445177

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-07a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 09:00:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 09:00:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 09:00:46] [INFO ] Load time of PNML (sax parser for PT used): 438 ms
[2024-06-01 09:00:46] [INFO ] Transformed 292 places.
[2024-06-01 09:00:46] [INFO ] Transformed 7108 transitions.
[2024-06-01 09:00:46] [INFO ] Found NUPN structural information;
[2024-06-01 09:00:46] [INFO ] Parsed PT model containing 292 places and 7108 transitions and 108222 arcs in 593 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 6218 transitions
Reduce redundant transitions removed 6218 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 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]
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, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-01 09:00:47] [INFO ] Flow matrix only has 866 transitions (discarded 24 similar events)
// Phase 1: matrix 866 rows 292 cols
[2024-06-01 09:00:47] [INFO ] Computed 9 invariants in 29 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, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 374 ms. (26 steps per ms)
FORMULA StigmergyCommit-PT-07a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100010 steps (20 resets) in 96 ms. (1031 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-01 09:00:47] [INFO ] Flow matrix only has 866 transitions (discarded 24 similar events)
[2024-06-01 09:00:47] [INFO ] Invariant cache hit.
[2024-06-01 09:00:47] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-01 09:00:48] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2024-06-01 09:00:48] [INFO ] State equation strengthened by 621 read => feed constraints.
[2024-06-01 09:00:48] [INFO ] [Real]Added 621 Read/Feed constraints in 106 ms returned sat
[2024-06-01 09:00:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:00:48] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-06-01 09:00:48] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2024-06-01 09:00:48] [INFO ] [Nat]Added 621 Read/Feed constraints in 90 ms returned sat
[2024-06-01 09:00:48] [INFO ] Deduced a trap composed of 16 places in 262 ms of which 31 ms to minimize.
[2024-06-01 09:00:49] [INFO ] Deduced a trap composed of 18 places in 223 ms of which 3 ms to minimize.
[2024-06-01 09:00:49] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 2 ms to minimize.
[2024-06-01 09:00:49] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 2 ms to minimize.
[2024-06-01 09:00:49] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 1 ms to minimize.
[2024-06-01 09:00:49] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2024-06-01 09:00:50] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-06-01 09:00:50] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-06-01 09:00:50] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1509 ms
[2024-06-01 09:00:50] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 132 ms.
[2024-06-01 09:00:50] [INFO ] Added : 60 causal constraints over 12 iterations in 791 ms. Result :sat
Minimization took 788 ms.
[2024-06-01 09:00:51] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-06-01 09:00:51] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-06-01 09:00:52] [INFO ] [Real]Added 621 Read/Feed constraints in 77 ms returned sat
[2024-06-01 09:00:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:00:52] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-06-01 09:00:52] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-06-01 09:00:52] [INFO ] [Nat]Added 621 Read/Feed constraints in 92 ms returned sat
[2024-06-01 09:00:52] [INFO ] Deduced a trap composed of 18 places in 214 ms of which 2 ms to minimize.
[2024-06-01 09:00:52] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 2 ms to minimize.
[2024-06-01 09:00:53] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 1 ms to minimize.
[2024-06-01 09:00:53] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 2 ms to minimize.
[2024-06-01 09:00:53] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 1 ms to minimize.
[2024-06-01 09:00:53] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 2 ms to minimize.
[2024-06-01 09:00:53] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 1 ms to minimize.
[2024-06-01 09:00:53] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2024-06-01 09:00:54] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 2 ms to minimize.
[2024-06-01 09:00:54] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 1 ms to minimize.
[2024-06-01 09:00:54] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 1 ms to minimize.
[2024-06-01 09:00:54] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2024-06-01 09:00:54] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-06-01 09:00:54] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2195 ms
[2024-06-01 09:00:54] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 230 ms.
[2024-06-01 09:00:55] [INFO ] Added : 60 causal constraints over 12 iterations in 975 ms. Result :sat
Minimization took 813 ms.
[2024-06-01 09:00:56] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-06-01 09:00:56] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2024-06-01 09:00:56] [INFO ] [Real]Added 621 Read/Feed constraints in 79 ms returned sat
[2024-06-01 09:00:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:00:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-06-01 09:00:57] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-06-01 09:00:57] [INFO ] [Nat]Added 621 Read/Feed constraints in 87 ms returned sat
[2024-06-01 09:00:57] [INFO ] Deduced a trap composed of 16 places in 209 ms of which 3 ms to minimize.
[2024-06-01 09:00:57] [INFO ] Deduced a trap composed of 18 places in 186 ms of which 2 ms to minimize.
[2024-06-01 09:00:57] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 2 ms to minimize.
[2024-06-01 09:00:57] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 1 ms to minimize.
[2024-06-01 09:00:58] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 1 ms to minimize.
[2024-06-01 09:00:58] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 1 ms to minimize.
[2024-06-01 09:00:58] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 1 ms to minimize.
[2024-06-01 09:00:58] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 1 ms to minimize.
[2024-06-01 09:00:58] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 1 ms to minimize.
[2024-06-01 09:00:58] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 1 ms to minimize.
[2024-06-01 09:00:58] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-06-01 09:00:59] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1934 ms
[2024-06-01 09:00:59] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 81 ms.
[2024-06-01 09:00:59] [INFO ] Added : 59 causal constraints over 12 iterations in 747 ms. Result :sat
Minimization took 831 ms.
[2024-06-01 09:01:00] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-06-01 09:01:00] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-06-01 09:01:00] [INFO ] [Real]Added 621 Read/Feed constraints in 102 ms returned sat
[2024-06-01 09:01:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:01:01] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-06-01 09:01:01] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-06-01 09:01:01] [INFO ] [Nat]Added 621 Read/Feed constraints in 77 ms returned sat
[2024-06-01 09:01:01] [INFO ] Deduced a trap composed of 19 places in 181 ms of which 2 ms to minimize.
[2024-06-01 09:01:01] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 1 ms to minimize.
[2024-06-01 09:01:01] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 1 ms to minimize.
[2024-06-01 09:01:02] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 1 ms to minimize.
[2024-06-01 09:01:02] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 1 ms to minimize.
[2024-06-01 09:01:02] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2024-06-01 09:01:02] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-06-01 09:01:02] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2024-06-01 09:01:02] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 0 ms to minimize.
[2024-06-01 09:01:02] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1395 ms
[2024-06-01 09:01:02] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 74 ms.
[2024-06-01 09:01:03] [INFO ] Added : 59 causal constraints over 12 iterations in 685 ms. Result :sat
Minimization took 766 ms.
[2024-06-01 09:01:04] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-06-01 09:01:04] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-06-01 09:01:04] [INFO ] [Real]Added 621 Read/Feed constraints in 84 ms returned sat
[2024-06-01 09:01:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:01:04] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-06-01 09:01:04] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-06-01 09:01:04] [INFO ] [Nat]Added 621 Read/Feed constraints in 108 ms returned sat
[2024-06-01 09:01:05] [INFO ] Deduced a trap composed of 17 places in 213 ms of which 2 ms to minimize.
[2024-06-01 09:01:05] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 2 ms to minimize.
[2024-06-01 09:01:05] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 1 ms to minimize.
[2024-06-01 09:01:05] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 1 ms to minimize.
[2024-06-01 09:01:05] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2024-06-01 09:01:05] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 1 ms to minimize.
[2024-06-01 09:01:06] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 2 ms to minimize.
[2024-06-01 09:01:06] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 2 ms to minimize.
[2024-06-01 09:01:06] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 2 ms to minimize.
[2024-06-01 09:01:06] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 1 ms to minimize.
[2024-06-01 09:01:06] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-06-01 09:01:06] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-06-01 09:01:06] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2024-06-01 09:01:07] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-06-01 09:01:07] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2319 ms
[2024-06-01 09:01:07] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 73 ms.
[2024-06-01 09:01:07] [INFO ] Added : 59 causal constraints over 12 iterations in 771 ms. Result :sat
Minimization took 855 ms.
[2024-06-01 09:01:08] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-06-01 09:01:09] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2024-06-01 09:01:09] [INFO ] [Real]Added 621 Read/Feed constraints in 85 ms returned sat
[2024-06-01 09:01:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:01:09] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-06-01 09:01:09] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-06-01 09:01:09] [INFO ] [Nat]Added 621 Read/Feed constraints in 129 ms returned sat
[2024-06-01 09:01:09] [INFO ] Deduced a trap composed of 19 places in 197 ms of which 2 ms to minimize.
[2024-06-01 09:01:09] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 3 ms to minimize.
[2024-06-01 09:01:10] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 2 ms to minimize.
[2024-06-01 09:01:10] [INFO ] Deduced a trap composed of 18 places in 159 ms of which 1 ms to minimize.
[2024-06-01 09:01:10] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 2 ms to minimize.
[2024-06-01 09:01:10] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 2 ms to minimize.
[2024-06-01 09:01:10] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 1 ms to minimize.
[2024-06-01 09:01:10] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-06-01 09:01:10] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1462 ms
[2024-06-01 09:01:11] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 90 ms.
[2024-06-01 09:01:11] [INFO ] Added : 59 causal constraints over 12 iterations in 802 ms. Result :sat
Minimization took 838 ms.
[2024-06-01 09:01:12] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-06-01 09:01:12] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-06-01 09:01:12] [INFO ] [Real]Added 621 Read/Feed constraints in 110 ms returned sat
[2024-06-01 09:01:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:01:13] [INFO ] [Nat]Absence check using 9 positive place invariants in 15 ms returned sat
[2024-06-01 09:01:13] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2024-06-01 09:01:13] [INFO ] [Nat]Added 621 Read/Feed constraints in 79 ms returned sat
[2024-06-01 09:01:13] [INFO ] Deduced a trap composed of 16 places in 187 ms of which 2 ms to minimize.
[2024-06-01 09:01:13] [INFO ] Deduced a trap composed of 18 places in 184 ms of which 2 ms to minimize.
[2024-06-01 09:01:13] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 2 ms to minimize.
[2024-06-01 09:01:14] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 2 ms to minimize.
[2024-06-01 09:01:14] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 1 ms to minimize.
[2024-06-01 09:01:14] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 1 ms to minimize.
[2024-06-01 09:01:14] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2024-06-01 09:01:14] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-06-01 09:01:14] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-06-01 09:01:14] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1456 ms
[2024-06-01 09:01:14] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 66 ms.
[2024-06-01 09:01:15] [INFO ] Added : 59 causal constraints over 12 iterations in 691 ms. Result :sat
Minimization took 850 ms.
[2024-06-01 09:01:16] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-06-01 09:01:16] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2024-06-01 09:01:16] [INFO ] [Real]Added 621 Read/Feed constraints in 88 ms returned sat
[2024-06-01 09:01:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:01:16] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-06-01 09:01:16] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-06-01 09:01:16] [INFO ] [Nat]Added 621 Read/Feed constraints in 118 ms returned sat
[2024-06-01 09:01:17] [INFO ] Deduced a trap composed of 19 places in 210 ms of which 2 ms to minimize.
[2024-06-01 09:01:17] [INFO ] Deduced a trap composed of 18 places in 179 ms of which 1 ms to minimize.
[2024-06-01 09:01:17] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 1 ms to minimize.
[2024-06-01 09:01:17] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 2 ms to minimize.
[2024-06-01 09:01:17] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 2 ms to minimize.
[2024-06-01 09:01:18] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 1 ms to minimize.
[2024-06-01 09:01:18] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2024-06-01 09:01:18] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2024-06-01 09:01:18] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2024-06-01 09:01:18] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-06-01 09:01:18] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 2 ms to minimize.
[2024-06-01 09:01:18] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2024-06-01 09:01:18] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2024-06-01 09:01:19] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-06-01 09:01:19] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2122 ms
[2024-06-01 09:01:19] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 75 ms.
[2024-06-01 09:01:19] [INFO ] Added : 61 causal constraints over 13 iterations in 668 ms. Result :sat
Minimization took 826 ms.
[2024-06-01 09:01:20] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-06-01 09:01:20] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-06-01 09:01:20] [INFO ] [Real]Added 621 Read/Feed constraints in 89 ms returned sat
[2024-06-01 09:01:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:01:20] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-06-01 09:01:21] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2024-06-01 09:01:21] [INFO ] [Nat]Added 621 Read/Feed constraints in 77 ms returned sat
[2024-06-01 09:01:21] [INFO ] Deduced a trap composed of 17 places in 211 ms of which 2 ms to minimize.
[2024-06-01 09:01:21] [INFO ] Deduced a trap composed of 18 places in 199 ms of which 2 ms to minimize.
[2024-06-01 09:01:21] [INFO ] Deduced a trap composed of 18 places in 171 ms of which 2 ms to minimize.
[2024-06-01 09:01:22] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 1 ms to minimize.
[2024-06-01 09:01:22] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 2 ms to minimize.
[2024-06-01 09:01:22] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 1 ms to minimize.
[2024-06-01 09:01:22] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 1 ms to minimize.
[2024-06-01 09:01:22] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2024-06-01 09:01:22] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-06-01 09:01:22] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-06-01 09:01:23] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 1 ms to minimize.
[2024-06-01 09:01:23] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-06-01 09:01:23] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-06-01 09:01:23] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-06-01 09:01:23] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-06-01 09:01:23] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2343 ms
[2024-06-01 09:01:23] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 72 ms.
[2024-06-01 09:01:24] [INFO ] Added : 61 causal constraints over 13 iterations in 716 ms. Result :sat
Minimization took 768 ms.
[2024-06-01 09:01:25] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-01 09:01:25] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-06-01 09:01:25] [INFO ] [Real]Added 621 Read/Feed constraints in 98 ms returned sat
[2024-06-01 09:01:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:01:25] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-06-01 09:01:25] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-06-01 09:01:25] [INFO ] [Nat]Added 621 Read/Feed constraints in 96 ms returned sat
[2024-06-01 09:01:25] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 2 ms to minimize.
[2024-06-01 09:01:26] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 2 ms to minimize.
[2024-06-01 09:01:26] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 1 ms to minimize.
[2024-06-01 09:01:26] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 1 ms to minimize.
[2024-06-01 09:01:26] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 1 ms to minimize.
[2024-06-01 09:01:26] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 2 ms to minimize.
[2024-06-01 09:01:26] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 1 ms to minimize.
[2024-06-01 09:01:27] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 0 ms to minimize.
[2024-06-01 09:01:27] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-06-01 09:01:27] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1476 ms
[2024-06-01 09:01:27] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 69 ms.
[2024-06-01 09:01:27] [INFO ] Added : 61 causal constraints over 13 iterations in 678 ms. Result :sat
Minimization took 753 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 10 out of 292 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 292/292 places, 890/890 transitions.
Graph (complete) has 651 edges and 292 vertex of which 285 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.7 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 285 transition count 813
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 83 rules applied. Total rules applied 154 place count 240 transition count 775
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 163 place count 232 transition count 774
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 164 place count 231 transition count 774
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 52 Pre rules applied. Total rules applied 164 place count 231 transition count 722
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 4 with 104 rules applied. Total rules applied 268 place count 179 transition count 722
Discarding 40 places :
Symmetric choice reduction at 4 with 40 rule applications. Total rules 308 place count 139 transition count 682
Iterating global reduction 4 with 40 rules applied. Total rules applied 348 place count 139 transition count 682
Discarding 40 places :
Symmetric choice reduction at 4 with 40 rule applications. Total rules 388 place count 99 transition count 642
Iterating global reduction 4 with 40 rules applied. Total rules applied 428 place count 99 transition count 642
Ensure Unique test removed 262 transitions
Reduce isomorphic transitions removed 262 transitions.
Iterating post reduction 4 with 262 rules applied. Total rules applied 690 place count 99 transition count 380
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 696 place count 93 transition count 374
Iterating global reduction 5 with 6 rules applied. Total rules applied 702 place count 93 transition count 374
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 706 place count 89 transition count 370
Iterating global reduction 5 with 4 rules applied. Total rules applied 710 place count 89 transition count 370
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 713 place count 89 transition count 367
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 6 with 26 rules applied. Total rules applied 739 place count 76 transition count 354
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 749 place count 76 transition count 344
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 756 place count 69 transition count 337
Iterating global reduction 7 with 7 rules applied. Total rules applied 763 place count 69 transition count 337
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 770 place count 62 transition count 330
Iterating global reduction 7 with 7 rules applied. Total rules applied 777 place count 62 transition count 330
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 784 place count 55 transition count 323
Iterating global reduction 7 with 7 rules applied. Total rules applied 791 place count 55 transition count 323
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 795 place count 55 transition count 319
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 796 place count 55 transition count 318
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 797 place count 54 transition count 318
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 803 place count 54 transition count 318
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 806 place count 54 transition count 315
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 807 place count 53 transition count 314
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 8 with 5 rules applied. Total rules applied 812 place count 52 transition count 310
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 816 place count 48 transition count 310
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 2 Pre rules applied. Total rules applied 816 place count 48 transition count 308
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 820 place count 46 transition count 308
Performed 12 Post agglomeration using F-continuation condition with reduction of 244 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 10 with 24 rules applied. Total rules applied 844 place count 34 transition count 52
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 854 place count 34 transition count 42
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 11 with 11 rules applied. Total rules applied 865 place count 28 transition count 37
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 870 place count 28 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 872 place count 28 transition count 30
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 873 place count 28 transition count 30
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 874 place count 28 transition count 29
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 13 with 3 rules applied. Total rules applied 877 place count 25 transition count 26
Applied a total of 877 rules in 267 ms. Remains 25 /292 variables (removed 267) and now considering 26/890 (removed 864) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 282 ms. Remains : 25/292 places, 26/890 transitions.
// Phase 1: matrix 26 rows 25 cols
[2024-06-01 09:01:28] [INFO ] Computed 7 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (14452 resets) in 714 ms. (1398 steps per ms)
FORMULA StigmergyCommit-PT-07a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 348 ms. (2865 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 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 43742 ms.
ITS solved all properties within timeout

BK_STOP 1717232490076

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is StigmergyCommit-PT-07a, 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 r536-tall-171690531700173"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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