Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r526-tall-171679094400269.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
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 r526-tall-171679094400269
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 21K Apr 12 15:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 147K Apr 12 15:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 145K Apr 12 15:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 605K Apr 12 15:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 8.4K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 79K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 245K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 25K Apr 12 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 218K Apr 12 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 989K Apr 12 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.1K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.2M May 18 16:43 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 1717219740156

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:29:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-06-01 05:29:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:29:01] [INFO ] Load time of PNML (sax parser for PT used): 241 ms
[2024-06-01 05:29:01] [INFO ] Transformed 316 places.
[2024-06-01 05:29:01] [INFO ] Transformed 1631 transitions.
[2024-06-01 05:29:01] [INFO ] Found NUPN structural information;
[2024-06-01 05:29:01] [INFO ] Parsed PT model containing 316 places and 1631 transitions and 11384 arcs in 406 ms.
Reduce places removed 10 places and 0 transitions.
Built sparse matrix representations for Structural reductions in 19 ms.29660KB 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 281 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 296 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 198 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-06-01 05:29:02] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-06-01 05:29:02] [INFO ] Computed 45 invariants in 37 ms
[2024-06-01 05:29:03] [INFO ] Implicit Places using invariants in 309 ms returned []
[2024-06-01 05:29:03] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-06-01 05:29:03] [INFO ] Invariant cache hit.
[2024-06-01 05:29:03] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 05:29:03] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 678 ms to find 0 implicit places.
[2024-06-01 05:29:03] [INFO ] Redundant transitions in 99 ms returned []
Running 1621 sub problems to find dead transitions.
[2024-06-01 05:29:03] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-06-01 05:29:03] [INFO ] Invariant cache hit.
[2024-06-01 05:29:03] [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
[2024-06-01 05:29:18] [INFO ] Deduced a trap composed of 41 places in 401 ms of which 21 ms to minimize.
[2024-06-01 05:29:29] [INFO ] Deduced a trap composed of 21 places in 282 ms of which 3 ms to minimize.
[2024-06-01 05:29:29] [INFO ] Deduced a trap composed of 21 places in 239 ms of which 2 ms to minimize.
[2024-06-01 05:29:29] [INFO ] Deduced a trap composed of 21 places in 234 ms of which 2 ms to minimize.
[2024-06-01 05:29:29] [INFO ] Deduced a trap composed of 21 places in 240 ms of which 2 ms to minimize.
[2024-06-01 05:29:30] [INFO ] Deduced a trap composed of 30 places in 222 ms of which 2 ms to minimize.
[2024-06-01 05:29:30] [INFO ] Deduced a trap composed of 30 places in 242 ms of which 2 ms to minimize.
[2024-06-01 05:29:30] [INFO ] Deduced a trap composed of 31 places in 246 ms of which 5 ms to minimize.
[2024-06-01 05:29:30] [INFO ] Deduced a trap composed of 30 places in 233 ms of which 2 ms to minimize.
[2024-06-01 05:29:31] [INFO ] Deduced a trap composed of 21 places in 215 ms of which 2 ms to minimize.
[2024-06-01 05:29:32] [INFO ] Deduced a trap composed of 49 places in 234 ms of which 2 ms to minimize.
[2024-06-01 05:29:32] [INFO ] Deduced a trap composed of 41 places in 226 ms of which 1 ms to minimize.
[2024-06-01 05:29:32] [INFO ] Deduced a trap composed of 49 places in 230 ms of which 2 ms to minimize.
[2024-06-01 05:29:33] [INFO ] Deduced a trap composed of 49 places in 233 ms of which 2 ms to minimize.
[2024-06-01 05:29:33] [INFO ] Deduced a trap composed of 49 places in 253 ms of which 2 ms to minimize.
[2024-06-01 05:29:36] [INFO ] Deduced a trap composed of 38 places in 223 ms of which 2 ms to minimize.
[2024-06-01 05:29:36] [INFO ] Deduced a trap composed of 51 places in 215 ms of which 2 ms to minimize.
[2024-06-01 05:29:36] [INFO ] Deduced a trap composed of 37 places in 227 ms of which 2 ms to minimize.
[2024-06-01 05:29:37] [INFO ] Deduced a trap composed of 39 places in 238 ms of which 2 ms to minimize.
[2024-06-01 05:29:37] [INFO ] Deduced a trap composed of 38 places in 238 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 30059 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
[2024-06-01 05:29:52] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 2 ms to minimize.
[2024-06-01 05:29:52] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 3 ms to minimize.
[2024-06-01 05:29:52] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 2 ms to minimize.
[2024-06-01 05:29:52] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 1 ms to minimize.
[2024-06-01 05:29:52] [INFO ] Deduced a trap composed of 53 places in 174 ms of which 1 ms to minimize.
[2024-06-01 05:29:55] [INFO ] Deduced a trap composed of 37 places in 244 ms of which 3 ms to minimize.
[2024-06-01 05:29:56] [INFO ] Deduced a trap composed of 37 places in 242 ms of which 3 ms to minimize.
[2024-06-01 05:29:56] [INFO ] Deduced a trap composed of 44 places in 244 ms of which 2 ms to minimize.
[2024-06-01 05:29:56] [INFO ] Deduced a trap composed of 37 places in 236 ms of which 2 ms to minimize.
[2024-06-01 05:29:57] [INFO ] Deduced a trap composed of 35 places in 235 ms of which 2 ms to minimize.
[2024-06-01 05:29:57] [INFO ] Deduced a trap composed of 57 places in 156 ms of which 2 ms to minimize.
[2024-06-01 05:29:57] [INFO ] Deduced a trap composed of 49 places in 156 ms of which 2 ms to minimize.
[2024-06-01 05:29:57] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 1 ms to minimize.
[2024-06-01 05:29:57] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 2 ms to minimize.
[2024-06-01 05:29:57] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 9 ms to minimize.
[2024-06-01 05:29:58] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 2 ms to minimize.
[2024-06-01 05:29:58] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 1 ms to minimize.
[2024-06-01 05:29:58] [INFO ] Deduced a trap composed of 70 places in 175 ms of which 2 ms to minimize.
[2024-06-01 05:29:58] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 2 ms to minimize.
[2024-06-01 05:29:58] [INFO ] Deduced a trap composed of 69 places in 206 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 30044 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 64779ms problems are : Problem set: 100 solved, 1521 unsolved
Search for dead transitions found 100 dead transitions in 64915ms
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 104 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 05:30:08] [INFO ] Redundant transitions in 27 ms returned []
Finished structural reductions in DEADLOCK mode , in 2 iterations and 66058 ms. Remains : 306/306 places, 1531/1631 transitions.
Random walk for 1250000 steps, including 0 resets, run took 6217 ms (no deadlock found). (steps per millisecond=201 )
Random directed walk for 1250001 steps, including 0 resets, run took 4607 ms (no deadlock found). (steps per millisecond=271 )
[2024-06-01 05:30:19] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-06-01 05:30:19] [INFO ] Computed 45 invariants in 16 ms
[2024-06-01 05:30:19] [INFO ] [Real]Absence check using 24 positive place invariants in 34 ms returned sat
[2024-06-01 05:30:21] [INFO ] [Real]Absence check using 24 positive and 21 generalized place invariants in 1860 ms returned sat
[2024-06-01 05:30:22] [INFO ] [Real]Absence check using state equation in 553 ms returned sat
[2024-06-01 05:30:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:30:22] [INFO ] [Nat]Absence check using 24 positive place invariants in 24 ms returned sat
[2024-06-01 05:30:22] [INFO ] [Nat]Absence check using 24 positive and 21 generalized place invariants in 146 ms returned sat
[2024-06-01 05:30:23] [INFO ] [Nat]Absence check using state equation in 714 ms returned sat
[2024-06-01 05:30:23] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 05:30:23] [INFO ] [Nat]Added 111 Read/Feed constraints in 484 ms returned sat
[2024-06-01 05:30:23] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 1 ms to minimize.
[2024-06-01 05:30:24] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 1 ms to minimize.
[2024-06-01 05:30:24] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 1 ms to minimize.
[2024-06-01 05:30:24] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 1 ms to minimize.
[2024-06-01 05:30:24] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 1 ms to minimize.
[2024-06-01 05:30:24] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 1 ms to minimize.
[2024-06-01 05:30:25] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 1 ms to minimize.
[2024-06-01 05:30:25] [INFO ] Deduced a trap composed of 49 places in 84 ms of which 1 ms to minimize.
[2024-06-01 05:30:25] [INFO ] Deduced a trap composed of 49 places in 81 ms of which 1 ms to minimize.
[2024-06-01 05:30:25] [INFO ] Deduced a trap composed of 49 places in 81 ms of which 1 ms to minimize.
[2024-06-01 05:30:25] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 2 ms to minimize.
[2024-06-01 05:30:25] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 1 ms to minimize.
[2024-06-01 05:30:25] [INFO ] Deduced a trap composed of 49 places in 84 ms of which 1 ms to minimize.
[2024-06-01 05:30:25] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 1 ms to minimize.
[2024-06-01 05:30:25] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 1 ms to minimize.
[2024-06-01 05:30:26] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 1 ms to minimize.
[2024-06-01 05:30:26] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2390 ms
[2024-06-01 05:30:26] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 92 ms.
[2024-06-01 05:30:26] [INFO ] Added : 0 causal constraints over 0 iterations in 168 ms. Result :sat
Parikh directed walk for 14000 steps, including 1000 resets, run took 125 ms. (steps per millisecond=112 )
Random directed walk for 500000 steps, including 0 resets, run took 1846 ms (no deadlock found). (steps per millisecond=270 )
Random walk for 500000 steps, including 0 resets, run took 2419 ms (no deadlock found). (steps per millisecond=206 )
Random directed walk for 500001 steps, including 0 resets, run took 1807 ms (no deadlock found). (steps per millisecond=276 )
Random walk for 500000 steps, including 0 resets, run took 2418 ms (no deadlock found). (steps per millisecond=206 )
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 84 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 05:30:35] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 05:30:35] [INFO ] Invariant cache hit.
[2024-06-01 05:30:35] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-01 05:30:35] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 05:30:35] [INFO ] Invariant cache hit.
[2024-06-01 05:30:35] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 05:30:35] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2024-06-01 05:30:35] [INFO ] Redundant transitions in 25 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-06-01 05:30:35] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 05:30:35] [INFO ] Invariant cache hit.
[2024-06-01 05:30:35] [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
[2024-06-01 05:30:48] [INFO ] Deduced a trap composed of 40 places in 225 ms of which 2 ms to minimize.
[2024-06-01 05:30:57] [INFO ] Deduced a trap composed of 49 places in 226 ms of which 2 ms to minimize.
[2024-06-01 05:30:58] [INFO ] Deduced a trap composed of 41 places in 229 ms of which 2 ms to minimize.
[2024-06-01 05:30:58] [INFO ] Deduced a trap composed of 41 places in 224 ms of which 1 ms to minimize.
[2024-06-01 05:31:01] [INFO ] Deduced a trap composed of 42 places in 227 ms of which 2 ms to minimize.
[2024-06-01 05:31:01] [INFO ] Deduced a trap composed of 41 places in 222 ms of which 2 ms to minimize.
[2024-06-01 05:31:01] [INFO ] Deduced a trap composed of 39 places in 231 ms of which 2 ms to minimize.
[2024-06-01 05:31:02] [INFO ] Deduced a trap composed of 41 places in 229 ms of which 2 ms to minimize.
[2024-06-01 05:31:02] [INFO ] Deduced a trap composed of 40 places in 227 ms of which 2 ms to minimize.
[2024-06-01 05:31:02] [INFO ] Deduced a trap composed of 41 places in 225 ms of which 2 ms to minimize.
[2024-06-01 05:31:02] [INFO ] Deduced a trap composed of 38 places in 224 ms of which 2 ms to minimize.
[2024-06-01 05:31:03] [INFO ] Deduced a trap composed of 35 places in 230 ms of which 2 ms to minimize.
[2024-06-01 05:31:03] [INFO ] Deduced a trap composed of 57 places in 164 ms of which 1 ms to minimize.
[2024-06-01 05:31:03] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 2 ms to minimize.
[2024-06-01 05:31:03] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 1 ms to minimize.
[2024-06-01 05:31:03] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 1 ms to minimize.
[2024-06-01 05:31:04] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 2 ms to minimize.
[2024-06-01 05:31:04] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 1 ms to minimize.
[2024-06-01 05:31:04] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 2 ms to minimize.
[2024-06-01 05:31:04] [INFO ] Deduced a trap composed of 34 places in 241 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 30035 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
[2024-06-01 05:31:24] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 2 ms to minimize.
[2024-06-01 05:31:25] [INFO ] Deduced a trap composed of 21 places in 231 ms of which 2 ms to minimize.
[2024-06-01 05:31:25] [INFO ] Deduced a trap composed of 30 places in 224 ms of which 2 ms to minimize.
[2024-06-01 05:31:25] [INFO ] Deduced a trap composed of 21 places in 230 ms of which 2 ms to minimize.
[2024-06-01 05:31:25] [INFO ] Deduced a trap composed of 31 places in 227 ms of which 2 ms to minimize.
[2024-06-01 05:31:26] [INFO ] Deduced a trap composed of 21 places in 227 ms of which 2 ms to minimize.
[2024-06-01 05:31:26] [INFO ] Deduced a trap composed of 34 places in 224 ms of which 2 ms to minimize.
[2024-06-01 05:31:26] [INFO ] Deduced a trap composed of 21 places in 224 ms of which 2 ms to minimize.
[2024-06-01 05:31:28] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 2 ms to minimize.
[2024-06-01 05:31:28] [INFO ] Deduced a trap composed of 49 places in 102 ms of which 1 ms to minimize.
[2024-06-01 05:31:28] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 1 ms to minimize.
[2024-06-01 05:31:28] [INFO ] Deduced a trap composed of 49 places in 149 ms of which 1 ms to minimize.
[2024-06-01 05:31:34] [INFO ] Deduced a trap composed of 35 places in 155 ms of which 2 ms to minimize.
[2024-06-01 05:31:34] [INFO ] Deduced a trap composed of 30 places in 230 ms of which 2 ms to minimize.
[2024-06-01 05:31:35] [INFO ] Deduced a trap composed of 41 places in 162 ms of which 2 ms to minimize.
[2024-06-01 05:31:35] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 1 ms to minimize.
[2024-06-01 05:31:35] [INFO ] Deduced a trap composed of 49 places in 142 ms of which 2 ms to minimize.
[2024-06-01 05:31:38] [INFO ] Deduced a trap composed of 75 places in 196 ms of which 2 ms to minimize.
[2024-06-01 05:31:38] [INFO ] Deduced a trap composed of 84 places in 213 ms of which 2 ms to minimize.
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 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: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 63838ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63857ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 64312 ms. Remains : 306/306 places, 1531/1531 transitions.
Random walk for 1250000 steps, including 0 resets, run took 5924 ms (no deadlock found). (steps per millisecond=211 )
Random directed walk for 1250000 steps, including 0 resets, run took 4581 ms (no deadlock found). (steps per millisecond=272 )
[2024-06-01 05:31:49] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 05:31:49] [INFO ] Invariant cache hit.
[2024-06-01 05:31:50] [INFO ] [Real]Absence check using 24 positive place invariants in 42 ms returned sat
[2024-06-01 05:31:50] [INFO ] [Real]Absence check using 24 positive and 21 generalized place invariants in 601 ms returned sat
[2024-06-01 05:31:51] [INFO ] [Real]Absence check using state equation in 775 ms returned sat
[2024-06-01 05:31:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:31:51] [INFO ] [Nat]Absence check using 24 positive place invariants in 25 ms returned sat
[2024-06-01 05:31:51] [INFO ] [Nat]Absence check using 24 positive and 21 generalized place invariants in 91 ms returned sat
[2024-06-01 05:31:52] [INFO ] [Nat]Absence check using state equation in 653 ms returned sat
[2024-06-01 05:31:52] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 05:31:52] [INFO ] [Nat]Added 111 Read/Feed constraints in 120 ms returned sat
[2024-06-01 05:31:52] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 1 ms to minimize.
[2024-06-01 05:31:52] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 1 ms to minimize.
[2024-06-01 05:31:52] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 1 ms to minimize.
[2024-06-01 05:31:53] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 1 ms to minimize.
[2024-06-01 05:31:53] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 2 ms to minimize.
[2024-06-01 05:31:53] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 1 ms to minimize.
[2024-06-01 05:31:53] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 1 ms to minimize.
[2024-06-01 05:31:54] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 1 ms to minimize.
[2024-06-01 05:31:54] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 1 ms to minimize.
[2024-06-01 05:31:54] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 1 ms to minimize.
[2024-06-01 05:31:54] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 1 ms to minimize.
[2024-06-01 05:31:54] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 1 ms to minimize.
[2024-06-01 05:31:54] [INFO ] Deduced a trap composed of 49 places in 81 ms of which 1 ms to minimize.
[2024-06-01 05:31:54] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 1 ms to minimize.
[2024-06-01 05:31:54] [INFO ] Deduced a trap composed of 49 places in 84 ms of which 1 ms to minimize.
[2024-06-01 05:31:54] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2334 ms
[2024-06-01 05:31:55] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 77 ms.
[2024-06-01 05:31:55] [INFO ] Added : 2 causal constraints over 2 iterations in 249 ms. Result :sat
Parikh directed walk for 27800 steps, including 1000 resets, run took 178 ms. (steps per millisecond=156 )
Random directed walk for 500002 steps, including 0 resets, run took 1822 ms (no deadlock found). (steps per millisecond=274 )
Random walk for 500000 steps, including 0 resets, run took 2346 ms (no deadlock found). (steps per millisecond=213 )
Random directed walk for 500001 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 2329 ms (no deadlock found). (steps per millisecond=214 )
[2024-06-01 05:32:04] [INFO ] Flatten gal took : 245 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 15 ms. Remains 306 /316 variables (removed 10) and now considering 1631/1631 (removed 0) transitions.
[2024-06-01 05:32:04] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-06-01 05:32:04] [INFO ] Computed 45 invariants in 11 ms
[2024-06-01 05:32:05] [INFO ] Implicit Places using invariants in 1115 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1121 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 1 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 22 ms. Remains 286 /296 variables (removed 10) and now considering 1621/1631 (removed 10) transitions.
[2024-06-01 05:32:05] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
// Phase 1: matrix 632 rows 286 cols
[2024-06-01 05:32:05] [INFO ] Computed 35 invariants in 6 ms
[2024-06-01 05:32:06] [INFO ] Implicit Places using invariants in 885 ms returned []
[2024-06-01 05:32:06] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
[2024-06-01 05:32:06] [INFO ] Invariant cache hit.
[2024-06-01 05:32:06] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 05:32:08] [INFO ] Implicit Places using invariants and state equation in 2329 ms returned []
Implicit Place search using SMT with State Equation took 3216 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 4375 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 2851 ms. (14 steps per ms) remains 101/1531 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 101/101 properties
[2024-06-01 05:32:09] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
[2024-06-01 05:32:09] [INFO ] Invariant cache hit.
[2024-06-01 05:32:09] [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, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 152/273 variables, 12/133 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 152/285 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Problem qltransition_91 is UNSAT
SMT process timed out in 1351ms, After SMT, problems are : Problem set: 0 solved, 101 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 175 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 176 ms. Remains : 286/286 places, 1621/1621 transitions.
FORMULA Liveness FALSE TECHNIQUES QUASILIVENESS_TEST
Total runtime 189832 ms.
ITS solved all properties within timeout

BK_STOP 1717219931518

--------------------
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="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
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 r526-tall-171679094400269"
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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;