Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r097-smll-174860111800034.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is FireWire-PT-04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r097-smll-174860111800034
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 89K May 29 14:32 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

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

=== Now, execution of the tool begins

BK_START 1748675648117

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 07:14:10] [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]
[2025-05-31 07:14:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 07:14:11] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2025-05-31 07:14:11] [INFO ] Transformed 113 places.
[2025-05-31 07:14:11] [INFO ] Transformed 364 transitions.
[2025-05-31 07:14:11] [INFO ] Found NUPN structural information;
[2025-05-31 07:14:11] [INFO ] Parsed PT model containing 113 places and 364 transitions and 1349 arcs in 382 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 20 ms.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 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]
[2025-05-31 07:14:11] [INFO ] Flow matrix only has 276 transitions (discarded 32 similar events)
// Phase 1: matrix 276 rows 113 cols
[2025-05-31 07:14:11] [INFO ] Computed 8 invariants in 31 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 (558 resets) in 69 ms. (142 steps per ms)
FORMULA FireWire-PT-04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-04-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80007 steps (1175 resets) in 174 ms. (457 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]
[2025-05-31 07:14:11] [INFO ] Flow matrix only has 276 transitions (discarded 32 similar events)
[2025-05-31 07:14:11] [INFO ] Invariant cache hit.
[2025-05-31 07:14:12] [INFO ] [Real]Absence check using 8 positive place invariants in 16 ms returned sat
[2025-05-31 07:14:12] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2025-05-31 07:14:12] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-05-31 07:14:12] [INFO ] [Real]Added 40 Read/Feed constraints in 28 ms returned sat
[2025-05-31 07:14:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:14:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-31 07:14:12] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2025-05-31 07:14:12] [INFO ] [Nat]Added 40 Read/Feed constraints in 22 ms returned sat
[2025-05-31 07:14:12] [INFO ] Computed and/alt/rep : 118/469/118 causal constraints (skipped 157 transitions) in 66 ms.
[2025-05-31 07:14:13] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 34 ms to minimize.
[2025-05-31 07:14:13] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2025-05-31 07:14:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 304 ms
[2025-05-31 07:14:13] [INFO ] Added : 54 causal constraints over 13 iterations in 799 ms. Result :sat
Minimization took 96 ms.
[2025-05-31 07:14:13] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-31 07:14:13] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2025-05-31 07:14:13] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:14:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:14:14] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2025-05-31 07:14:14] [INFO ] [Nat]Added 40 Read/Feed constraints in 23 ms returned sat
[2025-05-31 07:14:14] [INFO ] Computed and/alt/rep : 118/469/118 causal constraints (skipped 157 transitions) in 48 ms.
[2025-05-31 07:14:14] [INFO ] Added : 12 causal constraints over 3 iterations in 158 ms. Result :sat
Minimization took 71 ms.
[2025-05-31 07:14:14] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-31 07:14:14] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2025-05-31 07:14:14] [INFO ] [Real]Added 40 Read/Feed constraints in 17 ms returned sat
[2025-05-31 07:14:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:14:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-31 07:14:14] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2025-05-31 07:14:14] [INFO ] [Nat]Added 40 Read/Feed constraints in 26 ms returned sat
[2025-05-31 07:14:14] [INFO ] Computed and/alt/rep : 118/469/118 causal constraints (skipped 157 transitions) in 41 ms.
[2025-05-31 07:14:15] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 2 ms to minimize.
[2025-05-31 07:14:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2025-05-31 07:14:15] [INFO ] Added : 34 causal constraints over 9 iterations in 447 ms. Result :sat
Minimization took 83 ms.
[2025-05-31 07:14:15] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:14:15] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2025-05-31 07:14:15] [INFO ] [Real]Added 40 Read/Feed constraints in 18 ms returned sat
[2025-05-31 07:14:15] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:14:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:14:15] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2025-05-31 07:14:15] [INFO ] [Nat]Added 40 Read/Feed constraints in 14 ms returned sat
[2025-05-31 07:14:15] [INFO ] Computed and/alt/rep : 118/469/118 causal constraints (skipped 157 transitions) in 46 ms.
[2025-05-31 07:14:16] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2025-05-31 07:14:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2025-05-31 07:14:16] [INFO ] Added : 47 causal constraints over 11 iterations in 397 ms. Result :sat
Minimization took 72 ms.
[2025-05-31 07:14:16] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-31 07:14:16] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2025-05-31 07:14:16] [INFO ] [Real]Added 40 Read/Feed constraints in 10 ms returned sat
[2025-05-31 07:14:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:14:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:14:16] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2025-05-31 07:14:16] [INFO ] [Nat]Added 40 Read/Feed constraints in 11 ms returned sat
[2025-05-31 07:14:16] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2025-05-31 07:14:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2025-05-31 07:14:16] [INFO ] Computed and/alt/rep : 118/469/118 causal constraints (skipped 157 transitions) in 39 ms.
[2025-05-31 07:14:17] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2025-05-31 07:14:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2025-05-31 07:14:17] [INFO ] Added : 46 causal constraints over 11 iterations in 405 ms. Result :sat
Minimization took 84 ms.
[2025-05-31 07:14:17] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-31 07:14:17] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2025-05-31 07:14:17] [INFO ] [Real]Added 40 Read/Feed constraints in 20 ms returned sat
[2025-05-31 07:14:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:14:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-31 07:14:17] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2025-05-31 07:14:17] [INFO ] [Nat]Added 40 Read/Feed constraints in 31 ms returned sat
[2025-05-31 07:14:17] [INFO ] Computed and/alt/rep : 118/469/118 causal constraints (skipped 157 transitions) in 29 ms.
[2025-05-31 07:14:18] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2025-05-31 07:14:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2025-05-31 07:14:18] [INFO ] Added : 55 causal constraints over 12 iterations in 425 ms. Result :sat
Minimization took 99 ms.
[2025-05-31 07:14:18] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:14:18] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2025-05-31 07:14:18] [INFO ] [Real]Added 40 Read/Feed constraints in 16 ms returned sat
[2025-05-31 07:14:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:14:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-31 07:14:18] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2025-05-31 07:14:18] [INFO ] [Nat]Added 40 Read/Feed constraints in 28 ms returned sat
[2025-05-31 07:14:18] [INFO ] Computed and/alt/rep : 118/469/118 causal constraints (skipped 157 transitions) in 34 ms.
[2025-05-31 07:14:18] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 2 ms to minimize.
[2025-05-31 07:14:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2025-05-31 07:14:18] [INFO ] Added : 8 causal constraints over 3 iterations in 193 ms. Result :sat
Minimization took 66 ms.
[2025-05-31 07:14:19] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:14:19] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2025-05-31 07:14:19] [INFO ] [Real]Added 40 Read/Feed constraints in 14 ms returned sat
[2025-05-31 07:14:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:14:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2025-05-31 07:14:19] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2025-05-31 07:14:19] [INFO ] [Nat]Added 40 Read/Feed constraints in 21 ms returned sat
[2025-05-31 07:14:19] [INFO ] Computed and/alt/rep : 118/469/118 causal constraints (skipped 157 transitions) in 38 ms.
[2025-05-31 07:14:19] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 2 ms to minimize.
[2025-05-31 07:14:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2025-05-31 07:14:19] [INFO ] Added : 46 causal constraints over 10 iterations in 423 ms. Result :sat
Minimization took 76 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 FireWire-PT-04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 308/308 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 113 transition count 304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 112 transition count 304
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 112 transition count 303
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 111 transition count 303
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 110 transition count 301
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 110 transition count 301
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 107 transition count 308
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 21 place count 107 transition count 302
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 30 place count 107 transition count 293
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 107 transition count 296
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 37 place count 105 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 39 place count 105 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 40 place count 104 transition count 290
Applied a total of 40 rules in 205 ms. Remains 104 /113 variables (removed 9) and now considering 290/308 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 229 ms. Remains : 104/113 places, 290/308 transitions.
[2025-05-31 07:14:21] [INFO ] Flow matrix only has 261 transitions (discarded 29 similar events)
// Phase 1: matrix 261 rows 104 cols
[2025-05-31 07:14:21] [INFO ] Computed 8 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (64132 resets) in 1549 ms. (645 steps per ms)
BEST_FIRST walk for 2000002 steps (32481 resets) in 1060 ms. (1885 steps per ms)
FORMULA FireWire-PT-04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 07:14:23] [INFO ] Flow matrix only has 261 transitions (discarded 29 similar events)
[2025-05-31 07:14:23] [INFO ] Invariant cache hit.
[2025-05-31 07:14:23] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:14:24] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2025-05-31 07:14:24] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-05-31 07:14:24] [INFO ] [Real]Added 40 Read/Feed constraints in 14 ms returned sat
[2025-05-31 07:14:24] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:14:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:14:24] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2025-05-31 07:14:24] [INFO ] [Nat]Added 40 Read/Feed constraints in 17 ms returned sat
[2025-05-31 07:14:24] [INFO ] Computed and/alt/rep : 114/462/114 causal constraints (skipped 145 transitions) in 29 ms.
[2025-05-31 07:14:24] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2025-05-31 07:14:24] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
[2025-05-31 07:14:24] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 2 ms to minimize.
[2025-05-31 07:14:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 368 ms
[2025-05-31 07:14:25] [INFO ] Added : 56 causal constraints over 12 iterations in 702 ms. Result :sat
Minimization took 169 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 104 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p39) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 288/288 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 286
Applied a total of 1 rules in 14 ms. Remains 103 /104 variables (removed 1) and now considering 286/288 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 103/104 places, 286/288 transitions.
[2025-05-31 07:14:25] [INFO ] Flow matrix only has 257 transitions (discarded 29 similar events)
// Phase 1: matrix 257 rows 103 cols
[2025-05-31 07:14:25] [INFO ] Computed 8 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (64007 resets) in 1431 ms. (698 steps per ms)
BEST_FIRST walk for 1000000 steps (16336 resets) in 516 ms. (1934 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 07:14:27] [INFO ] Flow matrix only has 257 transitions (discarded 29 similar events)
[2025-05-31 07:14:27] [INFO ] Invariant cache hit.
[2025-05-31 07:14:27] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:14:27] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2025-05-31 07:14:27] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-05-31 07:14:27] [INFO ] [Real]Added 40 Read/Feed constraints in 16 ms returned sat
[2025-05-31 07:14:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:14:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-31 07:14:27] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2025-05-31 07:14:27] [INFO ] [Nat]Added 40 Read/Feed constraints in 18 ms returned sat
[2025-05-31 07:14:27] [INFO ] Computed and/alt/rep : 113/459/113 causal constraints (skipped 142 transitions) in 24 ms.
[2025-05-31 07:14:27] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 1 ms to minimize.
[2025-05-31 07:14:28] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2025-05-31 07:14:28] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2025-05-31 07:14:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 297 ms
[2025-05-31 07:14:28] [INFO ] Added : 43 causal constraints over 10 iterations in 560 ms. Result :sat
Minimization took 123 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 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 286/286 transitions.
Applied a total of 0 rules in 11 ms. Remains 103 /103 variables (removed 0) and now considering 286/286 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 103/103 places, 286/286 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 286/286 transitions.
Applied a total of 0 rules in 11 ms. Remains 103 /103 variables (removed 0) and now considering 286/286 (removed 0) transitions.
[2025-05-31 07:14:28] [INFO ] Flow matrix only has 257 transitions (discarded 29 similar events)
[2025-05-31 07:14:28] [INFO ] Invariant cache hit.
[2025-05-31 07:14:28] [INFO ] Implicit Places using invariants in 442 ms returned []
[2025-05-31 07:14:28] [INFO ] Flow matrix only has 257 transitions (discarded 29 similar events)
[2025-05-31 07:14:28] [INFO ] Invariant cache hit.
[2025-05-31 07:14:28] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-05-31 07:14:29] [INFO ] Implicit Places using invariants and state equation in 445 ms returned [34, 57, 98, 101]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 903 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 99/103 places, 286/286 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 99 transition count 283
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 96 transition count 283
Applied a total of 6 rules in 23 ms. Remains 96 /99 variables (removed 3) and now considering 283/286 (removed 3) transitions.
[2025-05-31 07:14:29] [INFO ] Flow matrix only has 254 transitions (discarded 29 similar events)
// Phase 1: matrix 254 rows 96 cols
[2025-05-31 07:14:29] [INFO ] Computed 4 invariants in 3 ms
[2025-05-31 07:14:29] [INFO ] Implicit Places using invariants in 232 ms returned []
[2025-05-31 07:14:29] [INFO ] Flow matrix only has 254 transitions (discarded 29 similar events)
[2025-05-31 07:14:29] [INFO ] Invariant cache hit.
[2025-05-31 07:14:29] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-05-31 07:14:29] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 96/103 places, 283/286 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1509 ms. Remains : 96/103 places, 283/286 transitions.
[2025-05-31 07:14:29] [INFO ] Flow matrix only has 254 transitions (discarded 29 similar events)
[2025-05-31 07:14:29] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (63916 resets) in 1399 ms. (714 steps per ms)
BEST_FIRST walk for 1000001 steps (16319 resets) in 500 ms. (1996 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 07:14:31] [INFO ] Flow matrix only has 254 transitions (discarded 29 similar events)
[2025-05-31 07:14:31] [INFO ] Invariant cache hit.
[2025-05-31 07:14:31] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 07:14:31] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2025-05-31 07:14:31] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-05-31 07:14:31] [INFO ] [Real]Added 40 Read/Feed constraints in 23 ms returned sat
[2025-05-31 07:14:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:14:31] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-31 07:14:32] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2025-05-31 07:14:32] [INFO ] [Nat]Added 40 Read/Feed constraints in 16 ms returned sat
[2025-05-31 07:14:32] [INFO ] Computed and/alt/rep : 110/450/110 causal constraints (skipped 142 transitions) in 19 ms.
[2025-05-31 07:14:32] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2025-05-31 07:14:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2025-05-31 07:14:32] [INFO ] Added : 35 causal constraints over 7 iterations in 311 ms. Result :sat
Minimization took 129 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 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 283/283 transitions.
Applied a total of 0 rules in 21 ms. Remains 96 /96 variables (removed 0) and now considering 283/283 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 96/96 places, 283/283 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 283/283 transitions.
Applied a total of 0 rules in 8 ms. Remains 96 /96 variables (removed 0) and now considering 283/283 (removed 0) transitions.
[2025-05-31 07:14:32] [INFO ] Flow matrix only has 254 transitions (discarded 29 similar events)
[2025-05-31 07:14:32] [INFO ] Invariant cache hit.
[2025-05-31 07:14:32] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-05-31 07:14:32] [INFO ] Flow matrix only has 254 transitions (discarded 29 similar events)
[2025-05-31 07:14:32] [INFO ] Invariant cache hit.
[2025-05-31 07:14:32] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-05-31 07:14:32] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
[2025-05-31 07:14:32] [INFO ] Redundant transitions in 17 ms returned []
Running 281 sub problems to find dead transitions.
[2025-05-31 07:14:33] [INFO ] Flow matrix only has 254 transitions (discarded 29 similar events)
[2025-05-31 07:14:33] [INFO ] Invariant cache hit.
[2025-05-31 07:14:33] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2025-05-31 07:14:36] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 3 ms to minimize.
[2025-05-31 07:14:36] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 2 ms to minimize.
[2025-05-31 07:14:36] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (OVERLAPS) 254/349 variables, 95/102 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 40/142 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2025-05-31 07:14:43] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 9 (OVERLAPS) 1/350 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2025-05-31 07:14:50] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/350 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/350 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2025-05-31 07:14:57] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 3 ms to minimize.
[2025-05-31 07:14:57] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/350 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/350 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 15 (OVERLAPS) 0/350 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 147 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 96/96 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (OVERLAPS) 1/95 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (OVERLAPS) 254/349 variables, 95/106 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 281/427 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2025-05-31 07:15:10] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/349 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 11 (OVERLAPS) 1/350 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2025-05-31 07:15:25] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/350 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/350 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 350/350 variables, and 430 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 96/96 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 9/9 constraints]
After SMT, in 60737ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 60773ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61236 ms. Remains : 96/96 places, 283/283 transitions.
RANDOM walk for 40000 steps (2706 resets) in 1487 ms. (26 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (646 resets) in 229 ms. (173 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (644 resets) in 251 ms. (158 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 14230 steps, run visited all 2 properties in 154 ms. (steps per millisecond=92 )
Probabilistic random walk after 14230 steps, saw 4796 distinct states, run finished after 160 ms. (steps per millisecond=88 ) properties seen :2
[2025-05-31 07:15:34] [INFO ] Flatten gal took : 163 ms
[2025-05-31 07:15:34] [INFO ] Flatten gal took : 40 ms
[2025-05-31 07:15:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4265434874222023776.gal : 22 ms
[2025-05-31 07:15:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5578717909291463205.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/ReachabilityCardinality4265434874222023776.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5578717909291463205.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA FireWire-PT-04-UpperBounds-04 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 83850 ms.

BK_STOP 1748675734870

--------------------
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="FireWire-PT-04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is FireWire-PT-04, 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 r097-smll-174860111800034"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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