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.r196-tall-174889279200484.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 SafeBus-PT-06, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r196-tall-174889279200484
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 15K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 40K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 203K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 166K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 791K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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 303K 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 booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1748965033167

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SafeBus-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-03 15:37:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-06-03 15:37:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 15:37:14] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2025-06-03 15:37:14] [INFO ] Transformed 144 places.
[2025-06-03 15:37:14] [INFO ] Transformed 451 transitions.
[2025-06-03 15:37:14] [INFO ] Found NUPN structural information;
[2025-06-03 15:37:14] [INFO ] Parsed PT model containing 144 places and 451 transitions and 2968 arcs in 190 ms.
Reduce places removed 6 places and 0 transitions.
Built sparse matrix representations for Structural reductions in 7 ms.19209KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 138/138 places, 451/451 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 52 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 67 ms. Remains : 138/138 places, 451/451 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 138/138 places, 451/451 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 27 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2025-06-03 15:37:14] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2025-06-03 15:37:14] [INFO ] Computed 29 invariants in 22 ms
[2025-06-03 15:37:15] [INFO ] Implicit Places using invariants in 202 ms returned []
[2025-06-03 15:37:15] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2025-06-03 15:37:15] [INFO ] Invariant cache hit.
[2025-06-03 15:37:15] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-03 15:37:15] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2025-06-03 15:37:15] [INFO ] Redundant transitions in 21 ms returned []
Running 445 sub problems to find dead transitions.
[2025-06-03 15:37:15] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2025-06-03 15:37:15] [INFO ] Invariant cache hit.
[2025-06-03 15:37:15] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Problem TDEAD31 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD246 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2025-06-03 15:37:17] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 17 ms to minimize.
[2025-06-03 15:37:17] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 1 ms to minimize.
[2025-06-03 15:37:17] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2025-06-03 15:37:17] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2025-06-03 15:37:18] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2025-06-03 15:37:18] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 2 ms to minimize.
[2025-06-03 15:37:18] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2025-06-03 15:37:18] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2025-06-03 15:37:19] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2025-06-03 15:37:19] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2025-06-03 15:37:19] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2025-06-03 15:37:19] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2025-06-03 15:37:19] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2025-06-03 15:37:19] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2025-06-03 15:37:20] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2025-06-03 15:37:20] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2025-06-03 15:37:20] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2025-06-03 15:37:20] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2025-06-03 15:37:20] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2025-06-03 15:37:20] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 20/187 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2025-06-03 15:37:22] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2025-06-03 15:37:22] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2025-06-03 15:37:22] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 2 ms to minimize.
[2025-06-03 15:37:22] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2025-06-03 15:37:22] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2025-06-03 15:37:22] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2025-06-03 15:37:22] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2025-06-03 15:37:23] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 1 ms to minimize.
[2025-06-03 15:37:23] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
[2025-06-03 15:37:23] [INFO ] Deduced a trap composed of 47 places in 89 ms of which 1 ms to minimize.
[2025-06-03 15:37:23] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 11/198 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2025-06-03 15:37:24] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2025-06-03 15:37:25] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2025-06-03 15:37:25] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2025-06-03 15:37:25] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2025-06-03 15:37:25] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 5/203 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2025-06-03 15:37:26] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2025-06-03 15:37:26] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2025-06-03 15:37:27] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 0 ms to minimize.
[2025-06-03 15:37:27] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 4/207 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/207 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 8 (OVERLAPS) 242/380 variables, 138/345 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 43/388 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 0/388 constraints. Problems are: Problem set: 36 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 388 constraints, problems are : Problem set: 36 solved, 409 unsolved in 30029 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 36 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 40/207 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2025-06-03 15:37:48] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2025-06-03 15:37:48] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2025-06-03 15:37:48] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2025-06-03 15:37:48] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2025-06-03 15:37:49] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2025-06-03 15:37:49] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2025-06-03 15:37:49] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2025-06-03 15:37:49] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 8/215 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2025-06-03 15:37:54] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2025-06-03 15:37:54] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2025-06-03 15:37:55] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 3/218 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/218 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 7 (OVERLAPS) 242/380 variables, 138/356 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 43/399 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 409/808 constraints. Problems are: Problem set: 36 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 808 constraints, problems are : Problem set: 36 solved, 409 unsolved in 30019 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/445 constraints, Known Traps: 51/51 constraints]
After SMT, in 60655ms problems are : Problem set: 36 solved, 409 unsolved
Search for dead transitions found 36 dead transitions in 60671ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 138/138 places, 415/451 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 12 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2025-06-03 15:38:15] [INFO ] Redundant transitions in 6 ms returned []
Finished structural reductions in DEADLOCK mode , in 2 iterations and 61138 ms. Remains : 138/138 places, 415/451 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2621 ms (no deadlock found). (steps per millisecond=476 )
Random directed walk for 1250002 steps, including 0 resets, run took 1887 ms (no deadlock found). (steps per millisecond=662 )
[2025-06-03 15:38:20] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2025-06-03 15:38:20] [INFO ] Computed 29 invariants in 11 ms
[2025-06-03 15:38:20] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2025-06-03 15:38:20] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 97 ms returned sat
[2025-06-03 15:38:20] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2025-06-03 15:38:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 15:38:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2025-06-03 15:38:20] [INFO ] [Nat]Absence check using 14 positive and 15 generalized place invariants in 31 ms returned sat
[2025-06-03 15:38:20] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2025-06-03 15:38:20] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-03 15:38:21] [INFO ] [Nat]Added 43 Read/Feed constraints in 28 ms returned sat
[2025-06-03 15:38:21] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2025-06-03 15:38:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2025-06-03 15:38:21] [INFO ] Computed and/alt/rep : 30/132/30 causal constraints (skipped 206 transitions) in 20 ms.
[2025-06-03 15:38:21] [INFO ] Added : 5 causal constraints over 1 iterations in 65 ms. Result :sat
Parikh directed walk for 6600 steps, including 760 resets, run took 35 ms. (steps per millisecond=188 )
Random directed walk for 500003 steps, including 0 resets, run took 750 ms (no deadlock found). (steps per millisecond=666 )
Random walk for 500000 steps, including 0 resets, run took 989 ms (no deadlock found). (steps per millisecond=505 )
Random directed walk for 500002 steps, including 0 resets, run took 751 ms (no deadlock found). (steps per millisecond=665 )
Random walk for 500000 steps, including 0 resets, run took 989 ms (no deadlock found). (steps per millisecond=505 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 138/138 places, 415/415 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 13 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2025-06-03 15:38:24] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2025-06-03 15:38:24] [INFO ] Invariant cache hit.
[2025-06-03 15:38:24] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-03 15:38:24] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2025-06-03 15:38:24] [INFO ] Invariant cache hit.
[2025-06-03 15:38:24] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-03 15:38:24] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2025-06-03 15:38:24] [INFO ] Redundant transitions in 2 ms returned []
Running 409 sub problems to find dead transitions.
[2025-06-03 15:38:24] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2025-06-03 15:38:24] [INFO ] Invariant cache hit.
[2025-06-03 15:38:24] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2025-06-03 15:38:26] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 2 ms to minimize.
[2025-06-03 15:38:26] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2025-06-03 15:38:26] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2025-06-03 15:38:26] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2025-06-03 15:38:27] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 8 ms to minimize.
[2025-06-03 15:38:27] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2025-06-03 15:38:27] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2025-06-03 15:38:27] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2025-06-03 15:38:27] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2025-06-03 15:38:27] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2025-06-03 15:38:28] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2025-06-03 15:38:28] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2025-06-03 15:38:28] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2025-06-03 15:38:28] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2025-06-03 15:38:28] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2025-06-03 15:38:28] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2025-06-03 15:38:29] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2025-06-03 15:38:29] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2025-06-03 15:38:29] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2025-06-03 15:38:29] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2025-06-03 15:38:31] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2025-06-03 15:38:33] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2025-06-03 15:38:33] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2025-06-03 15:38:33] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2025-06-03 15:38:33] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2025-06-03 15:38:33] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 4 ms to minimize.
[2025-06-03 15:38:33] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2025-06-03 15:38:33] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2025-06-03 15:38:34] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2025-06-03 15:38:34] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 9/197 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2025-06-03 15:38:35] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2025-06-03 15:38:38] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2025-06-03 15:38:38] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2025-06-03 15:38:40] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2025-06-03 15:38:42] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 11 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 383 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30018 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 35/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 409/792 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2025-06-03 15:39:11] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2025-06-03 15:39:11] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 0 ms to minimize.
[2025-06-03 15:39:11] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2025-06-03 15:39:11] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 4/796 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2025-06-03 15:39:22] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 1/797 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 797 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30020 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 40/40 constraints]
After SMT, in 60431ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60436ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 60619 ms. Remains : 138/138 places, 415/415 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2498 ms (no deadlock found). (steps per millisecond=500 )
Random directed walk for 1250002 steps, including 0 resets, run took 1876 ms (no deadlock found). (steps per millisecond=666 )
[2025-06-03 15:39:29] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2025-06-03 15:39:29] [INFO ] Invariant cache hit.
[2025-06-03 15:39:29] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-06-03 15:39:29] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 103 ms returned sat
[2025-06-03 15:39:30] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2025-06-03 15:39:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 15:39:30] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-03 15:39:30] [INFO ] [Nat]Absence check using 14 positive and 15 generalized place invariants in 28 ms returned sat
[2025-06-03 15:39:30] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2025-06-03 15:39:30] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-03 15:39:30] [INFO ] [Nat]Added 43 Read/Feed constraints in 21 ms returned sat
[2025-06-03 15:39:30] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 0 ms to minimize.
[2025-06-03 15:39:30] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2025-06-03 15:39:30] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2025-06-03 15:39:30] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2025-06-03 15:39:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 237 ms
[2025-06-03 15:39:30] [INFO ] Computed and/alt/rep : 30/132/30 causal constraints (skipped 206 transitions) in 22 ms.
[2025-06-03 15:39:30] [INFO ] Added : 8 causal constraints over 2 iterations in 77 ms. Result :sat
Parikh directed walk for 9800 steps, including 768 resets, run took 38 ms. (steps per millisecond=257 )
Random directed walk for 500001 steps, including 0 resets, run took 747 ms (no deadlock found). (steps per millisecond=669 )
Random walk for 500000 steps, including 0 resets, run took 994 ms (no deadlock found). (steps per millisecond=503 )
Random directed walk for 500000 steps, including 0 resets, run took 747 ms (no deadlock found). (steps per millisecond=669 )
Random walk for 500000 steps, including 0 resets, run took 989 ms (no deadlock found). (steps per millisecond=505 )
[2025-06-03 15:39:34] [INFO ] Flatten gal took : 76 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 144/144 places, 451/451 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 138 transition count 451
Applied a total of 6 rules in 8 ms. Remains 138 /144 variables (removed 6) and now considering 451/451 (removed 0) transitions.
[2025-06-03 15:39:34] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2025-06-03 15:39:34] [INFO ] Computed 29 invariants in 4 ms
[2025-06-03 15:39:34] [INFO ] Implicit Places using invariants in 259 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 263 ms to find 6 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 132/144 places, 451/451 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 445
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 445
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 120 transition count 559
Applied a total of 24 rules in 20 ms. Remains 120 /132 variables (removed 12) and now considering 559/451 (removed -108) transitions.
[2025-06-03 15:39:34] [INFO ] Flow matrix only has 350 transitions (discarded 209 similar events)
// Phase 1: matrix 350 rows 120 cols
[2025-06-03 15:39:34] [INFO ] Computed 23 invariants in 4 ms
[2025-06-03 15:39:34] [INFO ] Implicit Places using invariants in 200 ms returned []
[2025-06-03 15:39:34] [INFO ] Flow matrix only has 350 transitions (discarded 209 similar events)
[2025-06-03 15:39:34] [INFO ] Invariant cache hit.
[2025-06-03 15:39:35] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-03 15:39:35] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 690 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 120/144 places, 559/451 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 982 ms. Remains : 120/144 places, 559/451 transitions.
Discarding 144 transitions out of 559. Remains 415
Initial state reduction rules removed 6 formulas.
RANDOM walk for 40000 steps (8 resets) in 2799 ms. (14 steps per ms) remains 36/409 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 62 ms. (63 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (8 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
[2025-06-03 15:39:36] [INFO ] Flow matrix only has 350 transitions (discarded 209 similar events)
[2025-06-03 15:39:36] [INFO ] Invariant cache hit.
[2025-06-03 15:39:36] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 38/87 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 38/92 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Problem qltransition_38 is UNSAT
SMT process timed out in 302ms, After SMT, problems are : Problem set: 0 solved, 36 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 49 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 559/559 transitions.
Applied a total of 0 rules in 24 ms. Remains 120 /120 variables (removed 0) and now considering 559/559 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 120/120 places, 559/559 transitions.
FORMULA Liveness FALSE TECHNIQUES QUASILIVENESS_TEST
Total runtime 142681 ms.
ITS solved all properties within timeout

BK_STOP 1748965177357

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SafeBus-PT-06"
export BK_EXAMINATION="Liveness"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 SafeBus-PT-06, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r196-tall-174889279200484"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-PT-06.tgz
mv SafeBus-PT-06 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.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 '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;