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.r180-tall-171640604200797.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 HealthRecord-PT-13, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640604200797
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Apr 12 20:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 20:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 20:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 71K May 18 16:42 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 HealthRecord-PT-13-UpperBounds-00
FORMULA_NAME HealthRecord-PT-13-UpperBounds-01
FORMULA_NAME HealthRecord-PT-13-UpperBounds-02
FORMULA_NAME HealthRecord-PT-13-UpperBounds-03
FORMULA_NAME HealthRecord-PT-13-UpperBounds-04
FORMULA_NAME HealthRecord-PT-13-UpperBounds-05
FORMULA_NAME HealthRecord-PT-13-UpperBounds-06
FORMULA_NAME HealthRecord-PT-13-UpperBounds-07
FORMULA_NAME HealthRecord-PT-13-UpperBounds-08
FORMULA_NAME HealthRecord-PT-13-UpperBounds-09
FORMULA_NAME HealthRecord-PT-13-UpperBounds-10
FORMULA_NAME HealthRecord-PT-13-UpperBounds-11
FORMULA_NAME HealthRecord-PT-13-UpperBounds-12
FORMULA_NAME HealthRecord-PT-13-UpperBounds-13
FORMULA_NAME HealthRecord-PT-13-UpperBounds-14
FORMULA_NAME HealthRecord-PT-13-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716520771135

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-24 03:19:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 03:19:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:19:32] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-05-24 03:19:32] [INFO ] Transformed 161 places.
[2024-05-24 03:19:32] [INFO ] Transformed 341 transitions.
[2024-05-24 03:19:32] [INFO ] Found NUPN structural information;
[2024-05-24 03:19:32] [INFO ] Parsed PT model containing 161 places and 341 transitions and 899 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 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-05-24 03:19:32] [INFO ] Flow matrix only has 301 transitions (discarded 12 similar events)
// Phase 1: matrix 301 rows 161 cols
[2024-05-24 03:19:32] [INFO ] Computed 18 invariants in 33 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 (775 resets) in 39 ms. (250 steps per ms)
FORMULA HealthRecord-PT-13-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70006 steps (762 resets) in 61 ms. (1129 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2024-05-24 03:19:32] [INFO ] Flow matrix only has 301 transitions (discarded 12 similar events)
[2024-05-24 03:19:32] [INFO ] Invariant cache hit.
[2024-05-24 03:19:32] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2024-05-24 03:19:32] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2024-05-24 03:19:33] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-05-24 03:19:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:19:33] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2024-05-24 03:19:33] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 10 ms to minimize.
[2024-05-24 03:19:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:19:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-24 03:19:33] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2024-05-24 03:19:33] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-24 03:19:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:19:33] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 1 ms to minimize.
[2024-05-24 03:19:33] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:19:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 193 ms
[2024-05-24 03:19:33] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 23 ms.
[2024-05-24 03:19:33] [INFO ] Added : 16 causal constraints over 4 iterations in 117 ms. Result :sat
Minimization took 238 ms.
[2024-05-24 03:19:34] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 03:19:34] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 03:19:34] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-05-24 03:19:34] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:19:34] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 30 ms.
[2024-05-24 03:19:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:19:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 03:19:34] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-24 03:19:34] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-24 03:19:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 03:19:34] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 24 ms.
[2024-05-24 03:19:34] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:19:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2024-05-24 03:19:34] [INFO ] Added : 34 causal constraints over 8 iterations in 248 ms. Result :sat
Minimization took 130 ms.
[2024-05-24 03:19:34] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 03:19:34] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-24 03:19:34] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-05-24 03:19:34] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:19:34] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 0 ms to minimize.
[2024-05-24 03:19:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:19:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-05-24 03:19:34] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 03:19:35] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-05-24 03:19:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:19:35] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:19:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-05-24 03:19:35] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 22 ms.
[2024-05-24 03:19:35] [INFO ] Added : 22 causal constraints over 5 iterations in 114 ms. Result :sat
Minimization took 123 ms.
[2024-05-24 03:19:35] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-24 03:19:35] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 03:19:35] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-05-24 03:19:35] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-24 03:19:35] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 2 ms to minimize.
[2024-05-24 03:19:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:19:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 03:19:35] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 03:19:35] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-24 03:19:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-24 03:19:35] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 2 ms to minimize.
[2024-05-24 03:19:35] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2024-05-24 03:19:36] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 3 ms to minimize.
[2024-05-24 03:19:36] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:19:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 336 ms
[2024-05-24 03:19:36] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 20 ms.
[2024-05-24 03:19:36] [INFO ] Added : 14 causal constraints over 3 iterations in 83 ms. Result :sat
Minimization took 124 ms.
[2024-05-24 03:19:36] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 03:19:36] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-24 03:19:36] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-05-24 03:19:36] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:19:36] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 22 ms.
[2024-05-24 03:19:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:19:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 03:19:36] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-24 03:19:36] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-05-24 03:19:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:19:36] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 25 ms.
[2024-05-24 03:19:36] [INFO ] Added : 28 causal constraints over 7 iterations in 142 ms. Result :sat
Minimization took 144 ms.
[2024-05-24 03:19:37] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 03:19:37] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2024-05-24 03:19:37] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-24 03:19:37] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:19:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:19:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 03:19:37] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 03:19:37] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-05-24 03:19:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 03:19:37] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 19 ms.
[2024-05-24 03:19:37] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:19:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-24 03:19:37] [INFO ] Added : 30 causal constraints over 7 iterations in 211 ms. Result :sat
Minimization took 139 ms.
[2024-05-24 03:19:37] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-24 03:19:37] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 03:19:37] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-05-24 03:19:37] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 03:19:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:19:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 03:19:37] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 03:19:37] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-24 03:19:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 03:19:37] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 20 ms.
[2024-05-24 03:19:38] [INFO ] Added : 14 causal constraints over 3 iterations in 87 ms. Result :sat
Minimization took 130 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA HealthRecord-PT-13-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-13-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-13-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-13-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-13-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0] Max Struct:[1, 1]
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 313/313 transitions.
Graph (trivial) has 244 edges and 161 vertex of which 8 / 161 are part of one of the 4 SCC in 3 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 681 edges and 157 vertex of which 148 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 0 output 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 0 with 4 rules applied. Total rules applied 6 place count 148 transition count 288
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 16 place count 144 transition count 282
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 19 place count 142 transition count 281
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 19 place count 142 transition count 280
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 141 transition count 280
Discarding 83 places :
Symmetric choice reduction at 3 with 83 rule applications. Total rules 104 place count 58 transition count 114
Iterating global reduction 3 with 83 rules applied. Total rules applied 187 place count 58 transition count 114
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 196 place count 49 transition count 96
Iterating global reduction 3 with 9 rules applied. Total rules applied 205 place count 49 transition count 96
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 214 place count 49 transition count 87
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 216 place count 47 transition count 81
Iterating global reduction 4 with 2 rules applied. Total rules applied 218 place count 47 transition count 81
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 220 place count 45 transition count 77
Iterating global reduction 4 with 2 rules applied. Total rules applied 222 place count 45 transition count 77
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 228 place count 45 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 230 place count 44 transition count 70
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 242 place count 38 transition count 108
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 243 place count 38 transition count 107
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 246 place count 38 transition count 104
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 249 place count 35 transition count 104
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 251 place count 35 transition count 102
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 253 place count 35 transition count 232
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 256 place count 33 transition count 231
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 259 place count 33 transition count 228
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 260 place count 32 transition count 182
Iterating global reduction 7 with 1 rules applied. Total rules applied 261 place count 32 transition count 182
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 262 place count 31 transition count 180
Iterating global reduction 7 with 1 rules applied. Total rules applied 263 place count 31 transition count 180
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 278 place count 31 transition count 165
Applied a total of 278 rules in 99 ms. Remains 31 /161 variables (removed 130) and now considering 165/313 (removed 148) transitions.
Running 149 sub problems to find dead transitions.
[2024-05-24 03:19:38] [INFO ] Flow matrix only has 123 transitions (discarded 42 similar events)
// Phase 1: matrix 123 rows 31 cols
[2024-05-24 03:19:38] [INFO ] Computed 9 invariants in 5 ms
[2024-05-24 03:19:38] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 2/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Problem TDEAD44 is UNSAT
At refinement iteration 4 (OVERLAPS) 123/154 variables, 31/40 constraints. Problems are: Problem set: 1 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 33/73 constraints. Problems are: Problem set: 1 solved, 148 unsolved
[2024-05-24 03:19:39] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 14 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-05-24 03:19:39] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 2/75 constraints. Problems are: Problem set: 4 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/75 constraints. Problems are: Problem set: 4 solved, 145 unsolved
[2024-05-24 03:19:40] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
At refinement iteration 8 (OVERLAPS) 0/154 variables, 1/76 constraints. Problems are: Problem set: 6 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/76 constraints. Problems are: Problem set: 6 solved, 143 unsolved
At refinement iteration 10 (OVERLAPS) 0/154 variables, 0/76 constraints. Problems are: Problem set: 6 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/154 variables, and 76 constraints, problems are : Problem set: 6 solved, 143 unsolved in 3231 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 31/31 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 6 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 2/30 variables, 1/1 constraints. Problems are: Problem set: 6 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 6 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 1/31 variables, 8/9 constraints. Problems are: Problem set: 6 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 3/12 constraints. Problems are: Problem set: 6 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/12 constraints. Problems are: Problem set: 6 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 123/154 variables, 31/43 constraints. Problems are: Problem set: 6 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 33/76 constraints. Problems are: Problem set: 6 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 143/219 constraints. Problems are: Problem set: 6 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/219 constraints. Problems are: Problem set: 6 solved, 143 unsolved
At refinement iteration 10 (OVERLAPS) 0/154 variables, 0/219 constraints. Problems are: Problem set: 6 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 219 constraints, problems are : Problem set: 6 solved, 143 unsolved in 3544 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 31/31 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 143/149 constraints, Known Traps: 3/3 constraints]
After SMT, in 7006ms problems are : Problem set: 6 solved, 143 unsolved
Search for dead transitions found 6 dead transitions in 7022ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 6 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 31/161 places, 159/313 transitions.
Graph (complete) has 140 edges and 31 vertex of which 30 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 30 transition count 150
Applied a total of 10 rules in 11 ms. Remains 30 /31 variables (removed 1) and now considering 150/159 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7147 ms. Remains : 30/161 places, 150/313 transitions.
[2024-05-24 03:19:45] [INFO ] Flow matrix only has 108 transitions (discarded 42 similar events)
// Phase 1: matrix 108 rows 30 cols
[2024-05-24 03:19:45] [INFO ] Computed 9 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0] Max Struct:[1, 1]
FORMULA HealthRecord-PT-13-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (9 resets) in 997 ms. (1002 steps per ms)
BEST_FIRST walk for 1000001 steps (12 resets) in 548 ms. (1821 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 03:19:47] [INFO ] Flow matrix only has 108 transitions (discarded 42 similar events)
[2024-05-24 03:19:47] [INFO ] Invariant cache hit.
[2024-05-24 03:19:47] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 03:19:47] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-24 03:19:47] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-24 03:19:47] [INFO ] [Real]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-24 03:19:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:19:47] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 03:19:47] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-24 03:19:47] [INFO ] [Nat]Added 32 Read/Feed constraints in 5 ms returned sat
[2024-05-24 03:19:47] [INFO ] Computed and/alt/rep : 37/248/35 causal constraints (skipped 57 transitions) in 9 ms.
[2024-05-24 03:19:47] [INFO ] Added : 1 causal constraints over 1 iterations in 27 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 150/150 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 30 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 29 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 29 transition count 148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 29 transition count 147
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 29 transition count 144
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 28 transition count 104
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 28 transition count 104
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 27 transition count 103
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 27 transition count 103
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 21 place count 27 transition count 93
Applied a total of 21 rules in 18 ms. Remains 27 /30 variables (removed 3) and now considering 93/150 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 27/30 places, 93/150 transitions.
[2024-05-24 03:19:47] [INFO ] Flow matrix only has 69 transitions (discarded 24 similar events)
// Phase 1: matrix 69 rows 27 cols
[2024-05-24 03:19:47] [INFO ] Computed 10 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (9 resets) in 868 ms. (1150 steps per ms)
BEST_FIRST walk for 1000000 steps (10 resets) in 804 ms. (1242 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 03:19:48] [INFO ] Flow matrix only has 69 transitions (discarded 24 similar events)
[2024-05-24 03:19:48] [INFO ] Invariant cache hit.
[2024-05-24 03:19:48] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 03:19:49] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-24 03:19:49] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-24 03:19:49] [INFO ] [Real]Added 19 Read/Feed constraints in 3 ms returned sat
[2024-05-24 03:19:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 03:19:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 03:19:49] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-24 03:19:49] [INFO ] [Nat]Added 19 Read/Feed constraints in 4 ms returned sat
[2024-05-24 03:19:49] [INFO ] Computed and/alt/rep : 11/49/11 causal constraints (skipped 42 transitions) in 6 ms.
[2024-05-24 03:19:49] [INFO ] Added : 1 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 93/93 transitions.
Applied a total of 0 rules in 5 ms. Remains 27 /27 variables (removed 0) and now considering 93/93 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 27/27 places, 93/93 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 93/93 transitions.
Applied a total of 0 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 93/93 (removed 0) transitions.
[2024-05-24 03:19:49] [INFO ] Flow matrix only has 69 transitions (discarded 24 similar events)
[2024-05-24 03:19:49] [INFO ] Invariant cache hit.
[2024-05-24 03:19:49] [INFO ] Implicit Places using invariants in 43 ms returned [9, 19]
[2024-05-24 03:19:49] [INFO ] Actually due to overlaps returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 26/27 places, 93/93 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 26 transition count 91
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 24 transition count 91
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 23 transition count 90
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 13 place count 23 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 1 with 42 rules applied. Total rules applied 55 place count 23 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 22 transition count 40
Applied a total of 56 rules in 8 ms. Remains 22 /26 variables (removed 4) and now considering 40/93 (removed 53) transitions.
[2024-05-24 03:19:49] [INFO ] Flow matrix only has 28 transitions (discarded 12 similar events)
// Phase 1: matrix 28 rows 22 cols
[2024-05-24 03:19:49] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:19:49] [INFO ] Implicit Places using invariants in 27 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 21/27 places, 40/93 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 85 ms. Remains : 21/27 places, 40/93 transitions.
[2024-05-24 03:19:49] [INFO ] Flow matrix only has 28 transitions (discarded 12 similar events)
// Phase 1: matrix 28 rows 21 cols
[2024-05-24 03:19:49] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA HealthRecord-PT-13-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (367375 resets) in 1060 ms. (942 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-24 03:19:50] [INFO ] Flatten gal took : 26 ms
[2024-05-24 03:19:50] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:19:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6564042559127342303.gal : 5 ms
[2024-05-24 03:19:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1630187454858856159.prop : 0 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/ReachabilityCardinality6564042559127342303.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1630187454858856159.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
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 18198 ms.

BK_STOP 1716520790620

--------------------
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="HealthRecord-PT-13"
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 HealthRecord-PT-13, 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 r180-tall-171640604200797"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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