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.r576-smll-171734919900061.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is MedleyA-PT-08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734919900061
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 90K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717357719996

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-06-02 19:48:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 19:48:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:48:42] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2024-06-02 19:48:42] [INFO ] Transformed 147 places.
[2024-06-02 19:48:42] [INFO ] Transformed 312 transitions.
[2024-06-02 19:48:42] [INFO ] Found NUPN structural information;
[2024-06-02 19:48:42] [INFO ] Parsed PT model containing 147 places and 312 transitions and 1378 arcs in 304 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
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]
// Phase 1: matrix 312 rows 147 cols
[2024-06-02 19:48:42] [INFO ] Computed 11 invariants in 47 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 (492 resets) in 63 ms. (156 steps per ms)
FORMULA MedleyA-PT-08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80007 steps (1050 resets) in 160 ms. (496 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-02 19:48:42] [INFO ] Invariant cache hit.
[2024-06-02 19:48:42] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned sat
[2024-06-02 19:48:42] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 22 ms returned sat
[2024-06-02 19:48:43] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2024-06-02 19:48:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:48:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-06-02 19:48:43] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 19:48:43] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-06-02 19:48:43] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 64 ms.
[2024-06-02 19:48:44] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 23 ms to minimize.
[2024-06-02 19:48:44] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 2 ms to minimize.
[2024-06-02 19:48:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 338 ms
[2024-06-02 19:48:44] [INFO ] Added : 78 causal constraints over 16 iterations in 996 ms. Result :sat
Minimization took 232 ms.
[2024-06-02 19:48:44] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 19:48:44] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 19:48:44] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2024-06-02 19:48:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:48:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 19:48:45] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 19:48:45] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2024-06-02 19:48:45] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 3 ms to minimize.
[2024-06-02 19:48:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2024-06-02 19:48:45] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 80 ms.
[2024-06-02 19:48:46] [INFO ] Deduced a trap composed of 53 places in 137 ms of which 2 ms to minimize.
[2024-06-02 19:48:46] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 1 ms to minimize.
[2024-06-02 19:48:46] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 1 ms to minimize.
[2024-06-02 19:48:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 424 ms
[2024-06-02 19:48:46] [INFO ] Added : 79 causal constraints over 16 iterations in 921 ms. Result :sat
Minimization took 219 ms.
[2024-06-02 19:48:46] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 19:48:46] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 19:48:46] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2024-06-02 19:48:46] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 45 ms.
[2024-06-02 19:48:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:48:46] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 19:48:46] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 19:48:47] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2024-06-02 19:48:47] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 32 ms.
[2024-06-02 19:48:47] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-06-02 19:48:47] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 2 ms to minimize.
[2024-06-02 19:48:47] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 2 ms to minimize.
[2024-06-02 19:48:48] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 2 ms to minimize.
[2024-06-02 19:48:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 637 ms
[2024-06-02 19:48:48] [INFO ] Added : 76 causal constraints over 16 iterations in 1080 ms. Result :sat
Minimization took 331 ms.
[2024-06-02 19:48:48] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-06-02 19:48:48] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 19:48:48] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-06-02 19:48:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:48:48] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2024-06-02 19:48:48] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 5 ms returned sat
[2024-06-02 19:48:48] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-06-02 19:48:49] [INFO ] Deduced a trap composed of 35 places in 172 ms of which 3 ms to minimize.
[2024-06-02 19:48:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2024-06-02 19:48:49] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 37 ms.
[2024-06-02 19:48:49] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
[2024-06-02 19:48:49] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 4 ms to minimize.
[2024-06-02 19:48:50] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 1 ms to minimize.
[2024-06-02 19:48:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 423 ms
[2024-06-02 19:48:50] [INFO ] Added : 77 causal constraints over 17 iterations in 1039 ms. Result :sat
Minimization took 248 ms.
[2024-06-02 19:48:50] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-06-02 19:48:50] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 19:48:50] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-06-02 19:48:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:48:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-06-02 19:48:50] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 19:48:50] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-06-02 19:48:51] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 48 ms.
[2024-06-02 19:48:51] [INFO ] Deduced a trap composed of 28 places in 151 ms of which 2 ms to minimize.
[2024-06-02 19:48:51] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 1 ms to minimize.
[2024-06-02 19:48:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 330 ms
[2024-06-02 19:48:52] [INFO ] Added : 83 causal constraints over 18 iterations in 1028 ms. Result :sat
Minimization took 353 ms.
[2024-06-02 19:48:52] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 19:48:52] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 19:48:52] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-06-02 19:48:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:48:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2024-06-02 19:48:52] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 5 ms returned sat
[2024-06-02 19:48:52] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2024-06-02 19:48:53] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 2 ms to minimize.
[2024-06-02 19:48:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2024-06-02 19:48:53] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 37 ms.
[2024-06-02 19:48:53] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 2 ms to minimize.
[2024-06-02 19:48:54] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 2 ms to minimize.
[2024-06-02 19:48:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 362 ms
[2024-06-02 19:48:54] [INFO ] Added : 87 causal constraints over 18 iterations in 1058 ms. Result :sat
Minimization took 364 ms.
[2024-06-02 19:48:54] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-06-02 19:48:54] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 5 ms returned sat
[2024-06-02 19:48:54] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2024-06-02 19:48:54] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 39 ms.
[2024-06-02 19:48:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:48:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2024-06-02 19:48:55] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 5 ms returned sat
[2024-06-02 19:48:55] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-06-02 19:48:55] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 41 ms.
[2024-06-02 19:48:55] [INFO ] Deduced a trap composed of 33 places in 158 ms of which 3 ms to minimize.
[2024-06-02 19:48:56] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 2 ms to minimize.
[2024-06-02 19:48:56] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
[2024-06-02 19:48:56] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 3 ms to minimize.
[2024-06-02 19:48:56] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2024-06-02 19:48:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 759 ms
[2024-06-02 19:48:56] [INFO ] Added : 75 causal constraints over 16 iterations in 1392 ms. Result :sat
Minimization took 335 ms.
[2024-06-02 19:48:57] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-06-02 19:48:57] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 5 ms returned sat
[2024-06-02 19:48:57] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-06-02 19:48:57] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 3 ms to minimize.
[2024-06-02 19:48:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:48:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-06-02 19:48:57] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 5 ms returned sat
[2024-06-02 19:48:57] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2024-06-02 19:48:57] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 2 ms to minimize.
[2024-06-02 19:48:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2024-06-02 19:48:57] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 39 ms.
[2024-06-02 19:48:58] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 2 ms to minimize.
[2024-06-02 19:48:58] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 2 ms to minimize.
[2024-06-02 19:48:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 327 ms
[2024-06-02 19:48:58] [INFO ] Added : 80 causal constraints over 17 iterations in 952 ms. Result :sat
Minimization took 229 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
FORMULA MedleyA-PT-08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 312/312 transitions.
Graph (complete) has 508 edges and 147 vertex of which 140 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 140 transition count 276
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 29 rules applied. Total rules applied 63 place count 118 transition count 269
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 66 place count 116 transition count 268
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 66 place count 116 transition count 265
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 72 place count 113 transition count 265
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 100 place count 85 transition count 230
Iterating global reduction 3 with 28 rules applied. Total rules applied 128 place count 85 transition count 230
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 128 place count 85 transition count 228
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 132 place count 83 transition count 228
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 140 place count 75 transition count 210
Iterating global reduction 3 with 8 rules applied. Total rules applied 148 place count 75 transition count 210
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 151 place count 72 transition count 202
Iterating global reduction 3 with 3 rules applied. Total rules applied 154 place count 72 transition count 202
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 155 place count 71 transition count 199
Iterating global reduction 3 with 1 rules applied. Total rules applied 156 place count 71 transition count 199
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 180 place count 59 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 181 place count 59 transition count 186
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 183 place count 57 transition count 184
Iterating global reduction 4 with 2 rules applied. Total rules applied 185 place count 57 transition count 184
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 195 place count 52 transition count 205
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 4 with 23 rules applied. Total rules applied 218 place count 52 transition count 182
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 218 place count 52 transition count 181
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 220 place count 51 transition count 181
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 224 place count 49 transition count 204
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 228 place count 49 transition count 200
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 232 place count 45 transition count 200
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 234 place count 45 transition count 199
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 236 place count 43 transition count 199
Applied a total of 236 rules in 183 ms. Remains 43 /147 variables (removed 104) and now considering 199/312 (removed 113) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 43/147 places, 199/312 transitions.
[2024-06-02 19:49:00] [INFO ] Flow matrix only has 163 transitions (discarded 36 similar events)
// Phase 1: matrix 163 rows 43 cols
[2024-06-02 19:49:00] [INFO ] Computed 11 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (11 resets) in 832 ms. (1200 steps per ms)
FORMULA MedleyA-PT-08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 5000002 steps (127 resets) in 2329 ms. (2145 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-06-02 19:49:03] [INFO ] Flow matrix only has 163 transitions (discarded 36 similar events)
[2024-06-02 19:49:03] [INFO ] Invariant cache hit.
[2024-06-02 19:49:03] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-02 19:49:03] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 19:49:03] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-06-02 19:49:03] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-06-02 19:49:03] [INFO ] [Real]Added 86 Read/Feed constraints in 12 ms returned sat
[2024-06-02 19:49:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:49:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-02 19:49:03] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 19:49:03] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-06-02 19:49:03] [INFO ] [Nat]Added 86 Read/Feed constraints in 22 ms returned sat
[2024-06-02 19:49:03] [INFO ] Computed and/alt/rep : 15/86/15 causal constraints (skipped 144 transitions) in 17 ms.
[2024-06-02 19:49:03] [INFO ] Added : 2 causal constraints over 1 iterations in 51 ms. Result :sat
Minimization took 121 ms.
[2024-06-02 19:49:03] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 19:49:03] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 19:49:03] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-06-02 19:49:03] [INFO ] [Real]Added 86 Read/Feed constraints in 11 ms returned sat
[2024-06-02 19:49:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:49:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-02 19:49:04] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 19:49:04] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-06-02 19:49:04] [INFO ] [Nat]Added 86 Read/Feed constraints in 23 ms returned sat
[2024-06-02 19:49:04] [INFO ] Computed and/alt/rep : 15/86/15 causal constraints (skipped 144 transitions) in 17 ms.
[2024-06-02 19:49:04] [INFO ] Added : 2 causal constraints over 1 iterations in 56 ms. Result :sat
Minimization took 118 ms.
[2024-06-02 19:49:04] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-02 19:49:04] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 19:49:04] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-06-02 19:49:04] [INFO ] [Real]Added 86 Read/Feed constraints in 15 ms returned sat
[2024-06-02 19:49:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:49:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-02 19:49:04] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 19:49:04] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-06-02 19:49:04] [INFO ] [Nat]Added 86 Read/Feed constraints in 23 ms returned sat
[2024-06-02 19:49:04] [INFO ] Computed and/alt/rep : 15/86/15 causal constraints (skipped 144 transitions) in 17 ms.
[2024-06-02 19:49:04] [INFO ] Added : 4 causal constraints over 2 iterations in 70 ms. Result :sat
Minimization took 130 ms.
[2024-06-02 19:49:04] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-02 19:49:04] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 19:49:04] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-06-02 19:49:04] [INFO ] [Real]Added 86 Read/Feed constraints in 15 ms returned sat
[2024-06-02 19:49:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:49:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-02 19:49:04] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 19:49:04] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-06-02 19:49:04] [INFO ] [Nat]Added 86 Read/Feed constraints in 25 ms returned sat
[2024-06-02 19:49:05] [INFO ] Computed and/alt/rep : 15/86/15 causal constraints (skipped 144 transitions) in 20 ms.
[2024-06-02 19:49:05] [INFO ] Added : 1 causal constraints over 1 iterations in 59 ms. Result :sat
Minimization took 114 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 199/199 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 42 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 41 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 41 transition count 196
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 41 transition count 195
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 40 transition count 195
Applied a total of 6 rules in 33 ms. Remains 40 /43 variables (removed 3) and now considering 195/199 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 40/43 places, 195/199 transitions.
[2024-06-02 19:49:05] [INFO ] Flow matrix only has 159 transitions (discarded 36 similar events)
// Phase 1: matrix 159 rows 40 cols
[2024-06-02 19:49:05] [INFO ] Computed 11 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (3 resets) in 1166 ms. (856 steps per ms)
BEST_FIRST walk for 4000001 steps (110 resets) in 1831 ms. (2183 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-06-02 19:49:08] [INFO ] Flow matrix only has 159 transitions (discarded 36 similar events)
[2024-06-02 19:49:08] [INFO ] Invariant cache hit.
[2024-06-02 19:49:08] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-02 19:49:08] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2024-06-02 19:49:08] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-06-02 19:49:08] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-06-02 19:49:08] [INFO ] [Real]Added 86 Read/Feed constraints in 11 ms returned sat
[2024-06-02 19:49:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:49:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 19:49:08] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 19:49:08] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-06-02 19:49:08] [INFO ] [Nat]Added 86 Read/Feed constraints in 15 ms returned sat
[2024-06-02 19:49:08] [INFO ] Computed and/alt/rep : 11/64/11 causal constraints (skipped 144 transitions) in 22 ms.
[2024-06-02 19:49:08] [INFO ] Added : 0 causal constraints over 0 iterations in 45 ms. Result :sat
Minimization took 101 ms.
[2024-06-02 19:49:08] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-02 19:49:08] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 13 ms returned sat
[2024-06-02 19:49:08] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-06-02 19:49:08] [INFO ] [Real]Added 86 Read/Feed constraints in 16 ms returned sat
[2024-06-02 19:49:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:49:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-02 19:49:08] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 19:49:08] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-06-02 19:49:08] [INFO ] [Nat]Added 86 Read/Feed constraints in 20 ms returned sat
[2024-06-02 19:49:08] [INFO ] Computed and/alt/rep : 11/64/11 causal constraints (skipped 144 transitions) in 27 ms.
[2024-06-02 19:49:09] [INFO ] Added : 0 causal constraints over 0 iterations in 49 ms. Result :sat
Minimization took 93 ms.
[2024-06-02 19:49:09] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-02 19:49:09] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 19:49:09] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-06-02 19:49:09] [INFO ] [Real]Added 86 Read/Feed constraints in 19 ms returned sat
[2024-06-02 19:49:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:49:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-02 19:49:09] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 19:49:09] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-06-02 19:49:09] [INFO ] [Nat]Added 86 Read/Feed constraints in 20 ms returned sat
[2024-06-02 19:49:09] [INFO ] Computed and/alt/rep : 11/64/11 causal constraints (skipped 144 transitions) in 21 ms.
[2024-06-02 19:49:09] [INFO ] Added : 1 causal constraints over 1 iterations in 56 ms. Result :sat
Minimization took 105 ms.
[2024-06-02 19:49:09] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-02 19:49:09] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 19:49:09] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-06-02 19:49:09] [INFO ] [Real]Added 86 Read/Feed constraints in 16 ms returned sat
[2024-06-02 19:49:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:49:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-02 19:49:09] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 19:49:09] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-06-02 19:49:09] [INFO ] [Nat]Added 86 Read/Feed constraints in 22 ms returned sat
[2024-06-02 19:49:09] [INFO ] Computed and/alt/rep : 11/64/11 causal constraints (skipped 144 transitions) in 20 ms.
[2024-06-02 19:49:09] [INFO ] Added : 1 causal constraints over 1 iterations in 54 ms. Result :sat
Minimization took 96 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA MedleyA-PT-08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-06-02 19:49:10] [INFO ] Flatten gal took : 101 ms
[2024-06-02 19:49:10] [INFO ] Flatten gal took : 34 ms
[2024-06-02 19:49:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9505462379651752995.gal : 22 ms
[2024-06-02 19:49:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4244061226431292550.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9505462379651752995.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4244061226431292550.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 28777 ms.

BK_STOP 1717357750621

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-08, 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 r576-smll-171734919900061"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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