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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.4M
-rw-r--r-- 1 mcc users 23K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 175K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 90K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 390K 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 16K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 38K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 139K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 48K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 316K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 362K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.6M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.0K 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 1.2M 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 1748965157257

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-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-03 15:39:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-06-03 15:39:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 15:39:18] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2025-06-03 15:39:18] [INFO ] Transformed 316 places.
[2025-06-03 15:39:18] [INFO ] Transformed 1631 transitions.
[2025-06-03 15:39:18] [INFO ] Found NUPN structural information;
[2025-06-03 15:39:18] [INFO ] Parsed PT model containing 316 places and 1631 transitions and 11384 arcs in 266 ms.
Reduce places removed 10 places and 0 transitions.
Built sparse matrix representations for Structural reductions in 12 ms.30371KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 306/306 places, 1631/1631 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 216 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 230 ms. Remains : 306/306 places, 1631/1631 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 306/306 places, 1631/1631 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 124 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2025-06-03 15:39:19] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2025-06-03 15:39:19] [INFO ] Computed 45 invariants in 32 ms
[2025-06-03 15:39:20] [INFO ] Implicit Places using invariants in 496 ms returned []
[2025-06-03 15:39:20] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2025-06-03 15:39:20] [INFO ] Invariant cache hit.
[2025-06-03 15:39:20] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-03 15:39:20] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 883 ms to find 0 implicit places.
[2025-06-03 15:39:20] [INFO ] Redundant transitions in 94 ms returned []
Running 1621 sub problems to find dead transitions.
[2025-06-03 15:39:20] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2025-06-03 15:39:20] [INFO ] Invariant cache hit.
[2025-06-03 15:39:20] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1621 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1621 unsolved
Problem TDEAD91 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1090 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2025-06-03 15:39:34] [INFO ] Deduced a trap composed of 41 places in 275 ms of which 29 ms to minimize.
[2025-06-03 15:39:44] [INFO ] Deduced a trap composed of 21 places in 254 ms of which 3 ms to minimize.
[2025-06-03 15:39:44] [INFO ] Deduced a trap composed of 21 places in 224 ms of which 2 ms to minimize.
[2025-06-03 15:39:44] [INFO ] Deduced a trap composed of 21 places in 215 ms of which 2 ms to minimize.
[2025-06-03 15:39:45] [INFO ] Deduced a trap composed of 21 places in 241 ms of which 3 ms to minimize.
[2025-06-03 15:39:45] [INFO ] Deduced a trap composed of 30 places in 240 ms of which 3 ms to minimize.
[2025-06-03 15:39:45] [INFO ] Deduced a trap composed of 30 places in 242 ms of which 4 ms to minimize.
[2025-06-03 15:39:45] [INFO ] Deduced a trap composed of 31 places in 224 ms of which 3 ms to minimize.
[2025-06-03 15:39:46] [INFO ] Deduced a trap composed of 30 places in 207 ms of which 2 ms to minimize.
[2025-06-03 15:39:46] [INFO ] Deduced a trap composed of 21 places in 221 ms of which 1 ms to minimize.
[2025-06-03 15:39:47] [INFO ] Deduced a trap composed of 49 places in 232 ms of which 2 ms to minimize.
[2025-06-03 15:39:47] [INFO ] Deduced a trap composed of 41 places in 225 ms of which 2 ms to minimize.
[2025-06-03 15:39:47] [INFO ] Deduced a trap composed of 49 places in 207 ms of which 2 ms to minimize.
[2025-06-03 15:39:48] [INFO ] Deduced a trap composed of 49 places in 232 ms of which 1 ms to minimize.
[2025-06-03 15:39:48] [INFO ] Deduced a trap composed of 49 places in 228 ms of which 2 ms to minimize.
[2025-06-03 15:39:51] [INFO ] Deduced a trap composed of 38 places in 217 ms of which 2 ms to minimize.
[2025-06-03 15:39:51] [INFO ] Deduced a trap composed of 51 places in 229 ms of which 2 ms to minimize.
[2025-06-03 15:39:51] [INFO ] Deduced a trap composed of 37 places in 298 ms of which 2 ms to minimize.
[2025-06-03 15:39:52] [INFO ] Deduced a trap composed of 39 places in 367 ms of which 2 ms to minimize.
[2025-06-03 15:39:52] [INFO ] Deduced a trap composed of 38 places in 350 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 371 constraints, problems are : Problem set: 100 solved, 1521 unsolved in 30060 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1621/1621 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2025-06-03 15:40:08] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 2 ms to minimize.
[2025-06-03 15:40:09] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 2 ms to minimize.
[2025-06-03 15:40:09] [INFO ] Deduced a trap composed of 49 places in 143 ms of which 1 ms to minimize.
[2025-06-03 15:40:09] [INFO ] Deduced a trap composed of 49 places in 145 ms of which 2 ms to minimize.
[2025-06-03 15:40:09] [INFO ] Deduced a trap composed of 53 places in 159 ms of which 2 ms to minimize.
[2025-06-03 15:40:12] [INFO ] Deduced a trap composed of 37 places in 227 ms of which 2 ms to minimize.
[2025-06-03 15:40:13] [INFO ] Deduced a trap composed of 37 places in 218 ms of which 2 ms to minimize.
[2025-06-03 15:40:13] [INFO ] Deduced a trap composed of 44 places in 246 ms of which 2 ms to minimize.
[2025-06-03 15:40:13] [INFO ] Deduced a trap composed of 37 places in 236 ms of which 2 ms to minimize.
[2025-06-03 15:40:13] [INFO ] Deduced a trap composed of 35 places in 211 ms of which 2 ms to minimize.
[2025-06-03 15:40:14] [INFO ] Deduced a trap composed of 57 places in 156 ms of which 2 ms to minimize.
[2025-06-03 15:40:14] [INFO ] Deduced a trap composed of 49 places in 156 ms of which 2 ms to minimize.
[2025-06-03 15:40:14] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 1 ms to minimize.
[2025-06-03 15:40:14] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 2 ms to minimize.
[2025-06-03 15:40:14] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 1 ms to minimize.
[2025-06-03 15:40:14] [INFO ] Deduced a trap composed of 49 places in 146 ms of which 2 ms to minimize.
[2025-06-03 15:40:15] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 2 ms to minimize.
[2025-06-03 15:40:15] [INFO ] Deduced a trap composed of 70 places in 171 ms of which 2 ms to minimize.
[2025-06-03 15:40:15] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 2 ms to minimize.
[2025-06-03 15:40:15] [INFO ] Deduced a trap composed of 69 places in 230 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 20/391 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 391 constraints, problems are : Problem set: 100 solved, 1521 unsolved in 30030 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1621 constraints, Known Traps: 40/40 constraints]
After SMT, in 64297ms problems are : Problem set: 100 solved, 1521 unsolved
Search for dead transitions found 100 dead transitions in 64349ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 306/306 places, 1531/1631 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 88 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-03 15:40:24] [INFO ] Redundant transitions in 25 ms returned []
Finished structural reductions in DEADLOCK mode , in 2 iterations and 65597 ms. Remains : 306/306 places, 1531/1631 transitions.
Random walk for 1250000 steps, including 0 resets, run took 6378 ms (no deadlock found). (steps per millisecond=195 )
Random directed walk for 1250006 steps, including 0 resets, run took 4700 ms (no deadlock found). (steps per millisecond=265 )
[2025-06-03 15:40:36] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2025-06-03 15:40:36] [INFO ] Computed 45 invariants in 26 ms
[2025-06-03 15:40:36] [INFO ] [Real]Absence check using 24 positive place invariants in 37 ms returned sat
[2025-06-03 15:40:38] [INFO ] [Real]Absence check using 24 positive and 21 generalized place invariants in 1834 ms returned sat
[2025-06-03 15:40:38] [INFO ] [Real]Absence check using state equation in 547 ms returned sat
[2025-06-03 15:40:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 15:40:39] [INFO ] [Nat]Absence check using 24 positive place invariants in 24 ms returned sat
[2025-06-03 15:40:39] [INFO ] [Nat]Absence check using 24 positive and 21 generalized place invariants in 144 ms returned sat
[2025-06-03 15:40:39] [INFO ] [Nat]Absence check using state equation in 723 ms returned sat
[2025-06-03 15:40:39] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-03 15:40:40] [INFO ] [Nat]Added 111 Read/Feed constraints in 474 ms returned sat
[2025-06-03 15:40:40] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 1 ms to minimize.
[2025-06-03 15:40:41] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 1 ms to minimize.
[2025-06-03 15:40:41] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 1 ms to minimize.
[2025-06-03 15:40:41] [INFO ] Deduced a trap composed of 49 places in 88 ms of which 2 ms to minimize.
[2025-06-03 15:40:41] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 2 ms to minimize.
[2025-06-03 15:40:41] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 1 ms to minimize.
[2025-06-03 15:40:41] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 1 ms to minimize.
[2025-06-03 15:40:41] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 1 ms to minimize.
[2025-06-03 15:40:41] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 2 ms to minimize.
[2025-06-03 15:40:42] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 1 ms to minimize.
[2025-06-03 15:40:42] [INFO ] Deduced a trap composed of 49 places in 84 ms of which 2 ms to minimize.
[2025-06-03 15:40:42] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 1 ms to minimize.
[2025-06-03 15:40:42] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 1 ms to minimize.
[2025-06-03 15:40:42] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 1 ms to minimize.
[2025-06-03 15:40:42] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 2 ms to minimize.
[2025-06-03 15:40:42] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 2 ms to minimize.
[2025-06-03 15:40:42] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2399 ms
[2025-06-03 15:40:42] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 90 ms.
[2025-06-03 15:40:43] [INFO ] Added : 0 causal constraints over 0 iterations in 175 ms. Result :sat
Parikh directed walk for 14000 steps, including 1000 resets, run took 132 ms. (steps per millisecond=106 )
Random directed walk for 500001 steps, including 0 resets, run took 1896 ms (no deadlock found). (steps per millisecond=263 )
Random walk for 500000 steps, including 0 resets, run took 2443 ms (no deadlock found). (steps per millisecond=204 )
Random directed walk for 500002 steps, including 0 resets, run took 1825 ms (no deadlock found). (steps per millisecond=273 )
Random walk for 500000 steps, including 0 resets, run took 2439 ms (no deadlock found). (steps per millisecond=205 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 306/306 places, 1531/1531 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 91 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-03 15:40:51] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-03 15:40:51] [INFO ] Invariant cache hit.
[2025-06-03 15:40:51] [INFO ] Implicit Places using invariants in 88 ms returned []
[2025-06-03 15:40:51] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-03 15:40:51] [INFO ] Invariant cache hit.
[2025-06-03 15:40:52] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-03 15:40:52] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2025-06-03 15:40:52] [INFO ] Redundant transitions in 19 ms returned []
Running 1521 sub problems to find dead transitions.
[2025-06-03 15:40:52] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-03 15:40:52] [INFO ] Invariant cache hit.
[2025-06-03 15:40:52] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2025-06-03 15:41:05] [INFO ] Deduced a trap composed of 40 places in 232 ms of which 6 ms to minimize.
[2025-06-03 15:41:15] [INFO ] Deduced a trap composed of 49 places in 241 ms of which 2 ms to minimize.
[2025-06-03 15:41:15] [INFO ] Deduced a trap composed of 41 places in 216 ms of which 2 ms to minimize.
[2025-06-03 15:41:15] [INFO ] Deduced a trap composed of 41 places in 227 ms of which 2 ms to minimize.
[2025-06-03 15:41:18] [INFO ] Deduced a trap composed of 42 places in 250 ms of which 2 ms to minimize.
[2025-06-03 15:41:18] [INFO ] Deduced a trap composed of 41 places in 224 ms of which 2 ms to minimize.
[2025-06-03 15:41:19] [INFO ] Deduced a trap composed of 39 places in 223 ms of which 2 ms to minimize.
[2025-06-03 15:41:19] [INFO ] Deduced a trap composed of 41 places in 227 ms of which 2 ms to minimize.
[2025-06-03 15:41:19] [INFO ] Deduced a trap composed of 40 places in 219 ms of which 2 ms to minimize.
[2025-06-03 15:41:19] [INFO ] Deduced a trap composed of 41 places in 223 ms of which 2 ms to minimize.
[2025-06-03 15:41:20] [INFO ] Deduced a trap composed of 38 places in 251 ms of which 2 ms to minimize.
[2025-06-03 15:41:20] [INFO ] Deduced a trap composed of 35 places in 223 ms of which 2 ms to minimize.
[2025-06-03 15:41:20] [INFO ] Deduced a trap composed of 57 places in 174 ms of which 2 ms to minimize.
[2025-06-03 15:41:20] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 2 ms to minimize.
[2025-06-03 15:41:21] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 2 ms to minimize.
[2025-06-03 15:41:21] [INFO ] Deduced a trap composed of 49 places in 136 ms of which 1 ms to minimize.
[2025-06-03 15:41:21] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 1 ms to minimize.
[2025-06-03 15:41:21] [INFO ] Deduced a trap composed of 51 places in 141 ms of which 1 ms to minimize.
[2025-06-03 15:41:21] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 2 ms to minimize.
[2025-06-03 15:41:21] [INFO ] Deduced a trap composed of 34 places in 228 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 371 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30027 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2025-06-03 15:41:41] [INFO ] Deduced a trap composed of 21 places in 223 ms of which 2 ms to minimize.
[2025-06-03 15:41:41] [INFO ] Deduced a trap composed of 21 places in 230 ms of which 2 ms to minimize.
[2025-06-03 15:41:41] [INFO ] Deduced a trap composed of 30 places in 232 ms of which 2 ms to minimize.
[2025-06-03 15:41:42] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 2 ms to minimize.
[2025-06-03 15:41:42] [INFO ] Deduced a trap composed of 31 places in 244 ms of which 2 ms to minimize.
[2025-06-03 15:41:42] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 1 ms to minimize.
[2025-06-03 15:41:42] [INFO ] Deduced a trap composed of 34 places in 228 ms of which 2 ms to minimize.
[2025-06-03 15:41:43] [INFO ] Deduced a trap composed of 21 places in 222 ms of which 2 ms to minimize.
[2025-06-03 15:41:44] [INFO ] Deduced a trap composed of 57 places in 109 ms of which 1 ms to minimize.
[2025-06-03 15:41:45] [INFO ] Deduced a trap composed of 49 places in 113 ms of which 1 ms to minimize.
[2025-06-03 15:41:45] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 1 ms to minimize.
[2025-06-03 15:41:45] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 2 ms to minimize.
[2025-06-03 15:41:50] [INFO ] Deduced a trap composed of 35 places in 164 ms of which 2 ms to minimize.
[2025-06-03 15:41:51] [INFO ] Deduced a trap composed of 30 places in 217 ms of which 2 ms to minimize.
[2025-06-03 15:41:51] [INFO ] Deduced a trap composed of 41 places in 162 ms of which 2 ms to minimize.
[2025-06-03 15:41:51] [INFO ] Deduced a trap composed of 49 places in 153 ms of which 1 ms to minimize.
[2025-06-03 15:41:52] [INFO ] Deduced a trap composed of 49 places in 136 ms of which 2 ms to minimize.
[2025-06-03 15:41:54] [INFO ] Deduced a trap composed of 75 places in 212 ms of which 2 ms to minimize.
[2025-06-03 15:41:55] [INFO ] Deduced a trap composed of 84 places in 205 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 19/390 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 390 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30034 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 63787ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63805ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 64276 ms. Remains : 306/306 places, 1531/1531 transitions.
Random walk for 1250000 steps, including 0 resets, run took 6052 ms (no deadlock found). (steps per millisecond=206 )
Random directed walk for 1250001 steps, including 0 resets, run took 4510 ms (no deadlock found). (steps per millisecond=277 )
[2025-06-03 15:42:06] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-03 15:42:06] [INFO ] Invariant cache hit.
[2025-06-03 15:42:06] [INFO ] [Real]Absence check using 24 positive place invariants in 41 ms returned sat
[2025-06-03 15:42:07] [INFO ] [Real]Absence check using 24 positive and 21 generalized place invariants in 597 ms returned sat
[2025-06-03 15:42:08] [INFO ] [Real]Absence check using state equation in 779 ms returned sat
[2025-06-03 15:42:08] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 15:42:08] [INFO ] [Nat]Absence check using 24 positive place invariants in 24 ms returned sat
[2025-06-03 15:42:08] [INFO ] [Nat]Absence check using 24 positive and 21 generalized place invariants in 89 ms returned sat
[2025-06-03 15:42:09] [INFO ] [Nat]Absence check using state equation in 612 ms returned sat
[2025-06-03 15:42:09] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-03 15:42:09] [INFO ] [Nat]Added 111 Read/Feed constraints in 113 ms returned sat
[2025-06-03 15:42:09] [INFO ] Deduced a trap composed of 57 places in 85 ms of which 2 ms to minimize.
[2025-06-03 15:42:09] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 2 ms to minimize.
[2025-06-03 15:42:09] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 1 ms to minimize.
[2025-06-03 15:42:10] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 1 ms to minimize.
[2025-06-03 15:42:10] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 1 ms to minimize.
[2025-06-03 15:42:10] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 1 ms to minimize.
[2025-06-03 15:42:10] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 1 ms to minimize.
[2025-06-03 15:42:10] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 1 ms to minimize.
[2025-06-03 15:42:11] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 1 ms to minimize.
[2025-06-03 15:42:11] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 1 ms to minimize.
[2025-06-03 15:42:11] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 1 ms to minimize.
[2025-06-03 15:42:11] [INFO ] Deduced a trap composed of 49 places in 96 ms of which 1 ms to minimize.
[2025-06-03 15:42:11] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 1 ms to minimize.
[2025-06-03 15:42:11] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 1 ms to minimize.
[2025-06-03 15:42:11] [INFO ] Deduced a trap composed of 49 places in 90 ms of which 1 ms to minimize.
[2025-06-03 15:42:11] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2441 ms
[2025-06-03 15:42:11] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 68 ms.
[2025-06-03 15:42:12] [INFO ] Added : 2 causal constraints over 2 iterations in 197 ms. Result :sat
Parikh directed walk for 27800 steps, including 1000 resets, run took 179 ms. (steps per millisecond=155 )
Random directed walk for 500003 steps, including 0 resets, run took 1801 ms (no deadlock found). (steps per millisecond=277 )
Random walk for 500000 steps, including 0 resets, run took 2447 ms (no deadlock found). (steps per millisecond=204 )
Random directed walk for 500000 steps, including 0 resets, run took 1810 ms (no deadlock found). (steps per millisecond=276 )
Random walk for 500000 steps, including 0 resets, run took 2421 ms (no deadlock found). (steps per millisecond=206 )
[2025-06-03 15:42:21] [INFO ] Flatten gal took : 393 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 316/316 places, 1631/1631 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 306 transition count 1631
Applied a total of 10 rules in 32 ms. Remains 306 /316 variables (removed 10) and now considering 1631/1631 (removed 0) transitions.
[2025-06-03 15:42:21] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2025-06-03 15:42:21] [INFO ] Computed 45 invariants in 11 ms
[2025-06-03 15:42:22] [INFO ] Implicit Places using invariants in 1327 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1334 ms to find 10 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 296/316 places, 1631/1631 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 296 transition count 1621
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 286 transition count 1621
Applied a total of 20 rules in 33 ms. Remains 286 /296 variables (removed 10) and now considering 1621/1631 (removed 10) transitions.
[2025-06-03 15:42:22] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
// Phase 1: matrix 632 rows 286 cols
[2025-06-03 15:42:22] [INFO ] Computed 35 invariants in 6 ms
[2025-06-03 15:42:24] [INFO ] Implicit Places using invariants in 1272 ms returned []
[2025-06-03 15:42:24] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
[2025-06-03 15:42:24] [INFO ] Invariant cache hit.
[2025-06-03 15:42:24] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-03 15:42:26] [INFO ] Implicit Places using invariants and state equation in 2607 ms returned []
Implicit Place search using SMT with State Equation took 3912 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 286/316 places, 1621/1631 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 5324 ms. Remains : 286/316 places, 1621/1631 transitions.
Discarding 80 transitions out of 1621. Remains 1541
Initial state reduction rules removed 10 formulas.
RANDOM walk for 40000 steps (8 resets) in 5738 ms. (6 steps per ms) remains 100/1531 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 100/100 properties
[2025-06-03 15:42:28] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
[2025-06-03 15:42:28] [INFO ] Invariant cache hit.
[2025-06-03 15:42:28] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 152/273 variables, 12/133 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 152/285 constraints. Problems are: Problem set: 0 solved, 100 unsolved
Problem qltransition_91 is UNSAT
SMT process timed out in 2098ms, After SMT, problems are : Problem set: 0 solved, 100 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 121 out of 286 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 286/286 places, 1621/1621 transitions.
Applied a total of 0 rules in 254 ms. Remains 286 /286 variables (removed 0) and now considering 1621/1621 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 254 ms. Remains : 286/286 places, 1621/1621 transitions.
FORMULA Liveness FALSE TECHNIQUES QUASILIVENESS_TEST
Total runtime 192564 ms.
ITS solved all properties within timeout

BK_STOP 1748965351553

--------------------
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-10"
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-10, 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-174889279200489"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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