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.r100-tall-171624200800357.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 greatspnxred
Input is DBSingleClientW-PT-d2m07, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-tall-171624200800357
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 12:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 12 12:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 12 12:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 12:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1716365428105

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DBSingleClientW-PT-d2m07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 08:10:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-22 08:10:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 08:10:29] [INFO ] Load time of PNML (sax parser for PT used): 196 ms
[2024-05-22 08:10:29] [INFO ] Transformed 4763 places.
[2024-05-22 08:10:29] [INFO ] Transformed 2478 transitions.
[2024-05-22 08:10:29] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 313 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 4763/4763 places, 2478/2478 transitions.
Reduce places removed 3626 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 3825 rules applied. Total rules applied 3825 place count 1137 transition count 2279
Applied a total of 3825 rules in 94 ms. Remains 1137 /4763 variables (removed 3626) and now considering 2279/2478 (removed 199) transitions.
// Phase 1: matrix 2279 rows 1137 cols
[2024-05-22 08:10:29] [INFO ] Computed 2 invariants in 87 ms
[2024-05-22 08:10:30] [INFO ] Implicit Places using invariants in 974 ms returned []
[2024-05-22 08:10:30] [INFO ] Invariant cache hit.
[2024-05-22 08:10:31] [INFO ] State equation strengthened by 1389 read => feed constraints.
[2024-05-22 08:10:45] [INFO ] Implicit Places using invariants and state equation in 15036 ms returned []
Implicit Place search using SMT with State Equation took 16041 ms to find 0 implicit places.
Running 2278 sub problems to find dead transitions.
[2024-05-22 08:10:45] [INFO ] Invariant cache hit.
[2024-05-22 08:10:45] [INFO ] State equation strengthened by 1389 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1136/3416 variables, and 0 constraints, problems are : Problem set: 0 solved, 2278 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1137 constraints, ReadFeed: 0/1389 constraints, PredecessorRefiner: 2278/2270 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2278 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1136/3416 variables, and 0 constraints, problems are : Problem set: 0 solved, 2278 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1137 constraints, ReadFeed: 0/1389 constraints, PredecessorRefiner: 8/2270 constraints, Known Traps: 0/0 constraints]
After SMT, in 87081ms problems are : Problem set: 0 solved, 2278 unsolved
Search for dead transitions found 0 dead transitions in 87122ms
Starting structural reductions in LIVENESS mode, iteration 1 : 1137/4763 places, 2279/2478 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 103299 ms. Remains : 1137/4763 places, 2279/2478 transitions.
Discarding 1145 transitions out of 2279. Remains 1134
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (9254 resets) in 4733 ms. (8 steps per ms) remains 1056/1133 properties
BEST_FIRST walk for 123 steps (10 resets) in 16 ms. (7 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 123 steps (11 resets) in 14 ms. (8 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 122 steps (11 resets) in 14 ms. (8 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 123 steps (9 resets) in 35 ms. (3 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 121 steps (11 resets) in 28 ms. (4 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 122 steps (12 resets) in 53 ms. (2 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 123 steps (9 resets) in 15 ms. (7 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 122 steps (11 resets) in 17 ms. (6 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 123 steps (9 resets) in 11 ms. (10 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 122 steps (11 resets) in 16 ms. (7 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 122 steps (10 resets) in 10 ms. (11 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 122 steps (10 resets) in 10 ms. (11 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 123 steps (11 resets) in 11 ms. (10 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 123 steps (10 resets) in 10 ms. (11 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 123 steps (10 resets) in 12 ms. (9 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 123 steps (9 resets) in 12 ms. (9 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 122 steps (10 resets) in 12 ms. (9 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 121 steps (11 resets) in 9 ms. (12 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 122 steps (12 resets) in 13 ms. (8 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 123 steps (9 resets) in 10 ms. (11 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 121 steps (12 resets) in 10 ms. (11 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 121 steps (11 resets) in 15 ms. (7 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 121 steps (11 resets) in 13 ms. (8 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 121 steps (11 resets) in 10 ms. (11 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 121 steps (11 resets) in 9 ms. (12 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 124 steps (10 resets) in 15 ms. (7 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 123 steps (9 resets) in 11 ms. (10 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 124 steps (9 resets) in 11 ms. (10 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 124 steps (9 resets) in 10 ms. (11 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 122 steps (10 resets) in 10 ms. (11 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 123 steps (9 resets) in 10 ms. (11 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 122 steps (11 resets) in 9 ms. (12 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 123 steps (11 resets) in 9 ms. (12 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 122 steps (10 resets) in 12 ms. (9 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 122 steps (10 resets) in 10 ms. (11 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 123 steps (9 resets) in 13 ms. (8 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 122 steps (10 resets) in 11 ms. (10 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 122 steps (11 resets) in 8 ms. (13 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 123 steps (10 resets) in 11 ms. (10 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 121 steps (11 resets) in 10 ms. (11 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 122 steps (10 resets) in 10 ms. (11 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 122 steps (10 resets) in 10 ms. (11 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 122 steps (10 resets) in 11 ms. (10 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 122 steps (11 resets) in 10 ms. (11 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 120 steps (12 resets) in 10 ms. (10 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 122 steps (11 resets) in 9 ms. (12 steps per ms) remains 1056/1056 properties
BEST_FIRST walk for 121 steps (11 resets) in 10 ms. (11 steps per ms) remains 1056/1056 properties
Probabilistic random walk after 30001 steps, saw 13937 distinct states, run finished after 1293 ms. (steps per millisecond=23 ) properties seen :328
[2024-05-22 08:12:15] [INFO ] Invariant cache hit.
[2024-05-22 08:12:16] [INFO ] State equation strengthened by 1389 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 747/3416 variables, and 0 constraints, problems are : Problem set: 0 solved, 728 unsolved in 5115 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1137 constraints, ReadFeed: 0/1389 constraints, PredecessorRefiner: 728/728 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 728 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 747/3416 variables, and 0 constraints, problems are : Problem set: 0 solved, 728 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1137 constraints, ReadFeed: 0/1389 constraints, PredecessorRefiner: 0/728 constraints, Known Traps: 0/0 constraints]
After SMT, in 16491ms problems are : Problem set: 0 solved, 728 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 747 out of 1137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1137/1137 places, 2279/2279 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 1076 transition count 2080
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 1076 transition count 2080
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 140 place count 1076 transition count 2062
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 181 place count 1035 transition count 2021
Iterating global reduction 1 with 41 rules applied. Total rules applied 222 place count 1035 transition count 2021
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 249 place count 1008 transition count 1987
Iterating global reduction 1 with 27 rules applied. Total rules applied 276 place count 1008 transition count 1987
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 297 place count 1008 transition count 1966
Applied a total of 297 rules in 410 ms. Remains 1008 /1137 variables (removed 129) and now considering 1966/2279 (removed 313) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 411 ms. Remains : 1008/1137 places, 1966/2279 transitions.
RANDOM walk for 3056278 steps (701606 resets) in 120004 ms. (25 steps per ms) remains 698/728 properties
BEST_FIRST walk for 4004 steps (179 resets) in 71 ms. (55 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4004 steps (195 resets) in 52 ms. (75 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4002 steps (181 resets) in 48 ms. (81 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4002 steps (157 resets) in 46 ms. (85 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4002 steps (181 resets) in 50 ms. (78 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4003 steps (180 resets) in 47 ms. (83 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4004 steps (176 resets) in 48 ms. (81 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4003 steps (174 resets) in 48 ms. (81 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4003 steps (189 resets) in 52 ms. (75 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4001 steps (187 resets) in 48 ms. (81 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4003 steps (180 resets) in 47 ms. (83 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4004 steps (169 resets) in 48 ms. (81 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4003 steps (167 resets) in 72 ms. (54 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4003 steps (164 resets) in 68 ms. (58 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4002 steps (182 resets) in 51 ms. (76 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4004 steps (161 resets) in 55 ms. (71 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4002 steps (197 resets) in 82 ms. (48 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4003 steps (192 resets) in 73 ms. (54 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4002 steps (173 resets) in 66 ms. (59 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4004 steps (176 resets) in 58 ms. (67 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4002 steps (153 resets) in 53 ms. (74 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4003 steps (186 resets) in 65 ms. (60 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4003 steps (174 resets) in 70 ms. (56 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4004 steps (172 resets) in 51 ms. (77 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4002 steps (172 resets) in 58 ms. (67 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4004 steps (185 resets) in 56 ms. (70 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4004 steps (187 resets) in 71 ms. (55 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4004 steps (173 resets) in 61 ms. (64 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4004 steps (167 resets) in 62 ms. (63 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4003 steps (181 resets) in 68 ms. (58 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4002 steps (158 resets) in 56 ms. (70 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4002 steps (163 resets) in 70 ms. (56 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4003 steps (188 resets) in 64 ms. (61 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4002 steps (192 resets) in 71 ms. (55 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4003 steps (170 resets) in 63 ms. (62 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4004 steps (171 resets) in 72 ms. (54 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4002 steps (183 resets) in 65 ms. (60 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4002 steps (169 resets) in 72 ms. (54 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4001 steps (165 resets) in 56 ms. (70 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4002 steps (180 resets) in 62 ms. (63 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4004 steps (182 resets) in 56 ms. (70 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4001 steps (164 resets) in 60 ms. (65 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4004 steps (189 resets) in 83 ms. (47 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4002 steps (162 resets) in 73 ms. (54 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4004 steps (163 resets) in 50 ms. (78 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4003 steps (154 resets) in 50 ms. (78 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4004 steps (200 resets) in 71 ms. (55 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4003 steps (187 resets) in 68 ms. (58 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4004 steps (162 resets) in 58 ms. (67 steps per ms) remains 698/698 properties
BEST_FIRST walk for 4004 steps (178 resets) in 57 ms. (69 steps per ms) remains 698/698 properties
Probabilistic random walk after 1000001 steps, saw 395704 distinct states, run finished after 18439 ms. (steps per millisecond=54 ) properties seen :595
// Phase 1: matrix 1966 rows 1008 cols
[2024-05-22 08:13:22] [INFO ] Computed 2 invariants in 36 ms
[2024-05-22 08:13:22] [INFO ] State equation strengthened by 1160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 335/446 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 242/688 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-22 08:13:26] [INFO ] Deduced a trap composed of 271 places in 323 ms of which 41 ms to minimize.
[2024-05-22 08:13:27] [INFO ] Deduced a trap composed of 279 places in 320 ms of which 6 ms to minimize.
[2024-05-22 08:13:27] [INFO ] Deduced a trap composed of 279 places in 249 ms of which 5 ms to minimize.
[2024-05-22 08:13:27] [INFO ] Deduced a trap composed of 279 places in 231 ms of which 5 ms to minimize.
[2024-05-22 08:13:27] [INFO ] Deduced a trap composed of 280 places in 267 ms of which 5 ms to minimize.
[2024-05-22 08:13:28] [INFO ] Deduced a trap composed of 280 places in 241 ms of which 4 ms to minimize.
[2024-05-22 08:13:28] [INFO ] Deduced a trap composed of 271 places in 248 ms of which 4 ms to minimize.
[2024-05-22 08:13:28] [INFO ] Deduced a trap composed of 316 places in 243 ms of which 4 ms to minimize.
[2024-05-22 08:13:28] [INFO ] Deduced a trap composed of 290 places in 216 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/688 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/688 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 1070/1758 variables, 688/699 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1758 variables, 264/963 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1758 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 103 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1166/2924 variables, 295/1258 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2924 variables, 871/2129 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2924 variables, 0/2129 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 12 (OVERLAPS) 50/2974 variables, 25/2154 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2974 variables, 25/2179 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2974/2974 variables, and 2179 constraints, problems are : Problem set: 0 solved, 103 unsolved in 45021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1008/1008 constraints, ReadFeed: 1160/1160 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 335/446 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 242/688 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/688 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-22 08:14:10] [INFO ] Deduced a trap composed of 309 places in 215 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/688 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/688 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 1070/1758 variables, 688/700 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1758 variables, 264/964 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1758 variables, 11/975 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-22 08:14:17] [INFO ] Deduced a trap composed of 152 places in 192 ms of which 5 ms to minimize.
[2024-05-22 08:14:17] [INFO ] Deduced a trap composed of 152 places in 195 ms of which 4 ms to minimize.
[2024-05-22 08:14:17] [INFO ] Deduced a trap composed of 148 places in 186 ms of which 4 ms to minimize.
[2024-05-22 08:14:18] [INFO ] Deduced a trap composed of 199 places in 179 ms of which 4 ms to minimize.
[2024-05-22 08:14:18] [INFO ] Deduced a trap composed of 199 places in 182 ms of which 5 ms to minimize.
[2024-05-22 08:14:18] [INFO ] Deduced a trap composed of 173 places in 178 ms of which 5 ms to minimize.
[2024-05-22 08:14:18] [INFO ] Deduced a trap composed of 162 places in 183 ms of which 4 ms to minimize.
[2024-05-22 08:14:18] [INFO ] Deduced a trap composed of 153 places in 185 ms of which 4 ms to minimize.
[2024-05-22 08:14:19] [INFO ] Deduced a trap composed of 153 places in 186 ms of which 4 ms to minimize.
[2024-05-22 08:14:19] [INFO ] Deduced a trap composed of 149 places in 182 ms of which 4 ms to minimize.
[2024-05-22 08:14:19] [INFO ] Deduced a trap composed of 195 places in 176 ms of which 4 ms to minimize.
[2024-05-22 08:14:19] [INFO ] Deduced a trap composed of 169 places in 177 ms of which 4 ms to minimize.
[2024-05-22 08:14:19] [INFO ] Deduced a trap composed of 158 places in 179 ms of which 4 ms to minimize.
[2024-05-22 08:14:20] [INFO ] Deduced a trap composed of 202 places in 174 ms of which 4 ms to minimize.
[2024-05-22 08:14:20] [INFO ] Deduced a trap composed of 206 places in 174 ms of which 4 ms to minimize.
[2024-05-22 08:14:20] [INFO ] Deduced a trap composed of 218 places in 186 ms of which 4 ms to minimize.
[2024-05-22 08:14:20] [INFO ] Deduced a trap composed of 224 places in 198 ms of which 5 ms to minimize.
[2024-05-22 08:14:21] [INFO ] Deduced a trap composed of 217 places in 183 ms of which 4 ms to minimize.
[2024-05-22 08:14:21] [INFO ] Deduced a trap composed of 180 places in 203 ms of which 4 ms to minimize.
[2024-05-22 08:14:21] [INFO ] Deduced a trap composed of 177 places in 194 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1758 variables, 20/995 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-22 08:14:26] [INFO ] Deduced a trap composed of 152 places in 190 ms of which 4 ms to minimize.
[2024-05-22 08:14:26] [INFO ] Deduced a trap composed of 154 places in 186 ms of which 4 ms to minimize.
[2024-05-22 08:14:26] [INFO ] Deduced a trap composed of 149 places in 187 ms of which 4 ms to minimize.
[2024-05-22 08:14:26] [INFO ] Deduced a trap composed of 148 places in 185 ms of which 4 ms to minimize.
[2024-05-22 08:14:27] [INFO ] Deduced a trap composed of 153 places in 184 ms of which 4 ms to minimize.
[2024-05-22 08:14:27] [INFO ] Deduced a trap composed of 198 places in 175 ms of which 4 ms to minimize.
[2024-05-22 08:14:27] [INFO ] Deduced a trap composed of 200 places in 181 ms of which 3 ms to minimize.
[2024-05-22 08:14:27] [INFO ] Deduced a trap composed of 195 places in 173 ms of which 4 ms to minimize.
[2024-05-22 08:14:27] [INFO ] Deduced a trap composed of 194 places in 178 ms of which 4 ms to minimize.
[2024-05-22 08:14:28] [INFO ] Deduced a trap composed of 199 places in 186 ms of which 5 ms to minimize.
[2024-05-22 08:14:28] [INFO ] Deduced a trap composed of 244 places in 179 ms of which 4 ms to minimize.
[2024-05-22 08:14:28] [INFO ] Deduced a trap composed of 239 places in 169 ms of which 5 ms to minimize.
[2024-05-22 08:14:28] [INFO ] Deduced a trap composed of 243 places in 172 ms of which 4 ms to minimize.
[2024-05-22 08:14:29] [INFO ] Deduced a trap composed of 243 places in 165 ms of which 4 ms to minimize.
[2024-05-22 08:14:29] [INFO ] Deduced a trap composed of 239 places in 174 ms of which 4 ms to minimize.
[2024-05-22 08:14:29] [INFO ] Deduced a trap composed of 244 places in 164 ms of which 4 ms to minimize.
[2024-05-22 08:14:29] [INFO ] Deduced a trap composed of 244 places in 169 ms of which 4 ms to minimize.
[2024-05-22 08:14:29] [INFO ] Deduced a trap composed of 238 places in 170 ms of which 4 ms to minimize.
[2024-05-22 08:14:30] [INFO ] Deduced a trap composed of 207 places in 182 ms of which 4 ms to minimize.
[2024-05-22 08:14:30] [INFO ] Deduced a trap composed of 250 places in 161 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1758 variables, 20/1015 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-22 08:14:36] [INFO ] Deduced a trap composed of 199 places in 171 ms of which 4 ms to minimize.
[2024-05-22 08:14:36] [INFO ] Deduced a trap composed of 199 places in 181 ms of which 4 ms to minimize.
[2024-05-22 08:14:37] [INFO ] Deduced a trap composed of 194 places in 184 ms of which 4 ms to minimize.
[2024-05-22 08:14:37] [INFO ] Deduced a trap composed of 244 places in 172 ms of which 4 ms to minimize.
[2024-05-22 08:14:37] [INFO ] Deduced a trap composed of 206 places in 168 ms of which 4 ms to minimize.
[2024-05-22 08:14:38] [INFO ] Deduced a trap composed of 248 places in 173 ms of which 4 ms to minimize.
[2024-05-22 08:14:38] [INFO ] Deduced a trap composed of 253 places in 164 ms of which 4 ms to minimize.
[2024-05-22 08:14:38] [INFO ] Deduced a trap composed of 217 places in 177 ms of which 4 ms to minimize.
[2024-05-22 08:14:38] [INFO ] Deduced a trap composed of 259 places in 161 ms of which 4 ms to minimize.
[2024-05-22 08:14:38] [INFO ] Deduced a trap composed of 254 places in 166 ms of which 4 ms to minimize.
[2024-05-22 08:14:39] [INFO ] Deduced a trap composed of 264 places in 166 ms of which 4 ms to minimize.
[2024-05-22 08:14:39] [INFO ] Deduced a trap composed of 217 places in 191 ms of which 4 ms to minimize.
[2024-05-22 08:14:39] [INFO ] Deduced a trap composed of 259 places in 164 ms of which 3 ms to minimize.
[2024-05-22 08:14:39] [INFO ] Deduced a trap composed of 264 places in 152 ms of which 4 ms to minimize.
[2024-05-22 08:14:39] [INFO ] Deduced a trap composed of 222 places in 170 ms of which 4 ms to minimize.
[2024-05-22 08:14:40] [INFO ] Deduced a trap composed of 271 places in 170 ms of which 4 ms to minimize.
[2024-05-22 08:14:40] [INFO ] Deduced a trap composed of 227 places in 173 ms of which 3 ms to minimize.
[2024-05-22 08:14:40] [INFO ] Deduced a trap composed of 271 places in 164 ms of which 4 ms to minimize.
[2024-05-22 08:14:41] [INFO ] Deduced a trap composed of 256 places in 167 ms of which 4 ms to minimize.
[2024-05-22 08:14:41] [INFO ] Deduced a trap composed of 262 places in 187 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1758 variables, 20/1035 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1758 variables, 0/1035 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 14 (OVERLAPS) 1166/2924 variables, 295/1330 constraints. Problems are: Problem set: 0 solved, 103 unsolved
SMT process timed out in 90802ms, After SMT, problems are : Problem set: 0 solved, 103 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 111 out of 1008 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1008/1008 places, 1966/1966 transitions.
Graph (complete) has 3634 edges and 1008 vertex of which 1007 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 1007 transition count 1949
Discarding 281 places :
Symmetric choice reduction at 1 with 281 rule applications. Total rules 299 place count 726 transition count 1170
Iterating global reduction 1 with 281 rules applied. Total rules applied 580 place count 726 transition count 1170
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 588 place count 726 transition count 1162
Discarding 226 places :
Symmetric choice reduction at 2 with 226 rule applications. Total rules 814 place count 500 transition count 936
Iterating global reduction 2 with 226 rules applied. Total rules applied 1040 place count 500 transition count 936
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1052 place count 500 transition count 924
Discarding 177 places :
Symmetric choice reduction at 3 with 177 rule applications. Total rules 1229 place count 323 transition count 672
Iterating global reduction 3 with 177 rules applied. Total rules applied 1406 place count 323 transition count 672
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 168 transitions.
Iterating post reduction 3 with 168 rules applied. Total rules applied 1574 place count 323 transition count 504
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 1594 place count 303 transition count 473
Iterating global reduction 4 with 20 rules applied. Total rules applied 1614 place count 303 transition count 473
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1620 place count 303 transition count 467
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1632 place count 291 transition count 455
Iterating global reduction 5 with 12 rules applied. Total rules applied 1644 place count 291 transition count 455
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1645 place count 291 transition count 454
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1656 place count 280 transition count 443
Iterating global reduction 6 with 11 rules applied. Total rules applied 1667 place count 280 transition count 443
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1680 place count 280 transition count 430
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1684 place count 276 transition count 404
Iterating global reduction 7 with 4 rules applied. Total rules applied 1688 place count 276 transition count 404
Applied a total of 1688 rules in 139 ms. Remains 276 /1008 variables (removed 732) and now considering 404/1966 (removed 1562) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 276/1008 places, 404/1966 transitions.
RANDOM walk for 4000000 steps (919436 resets) in 43921 ms. (91 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1793 resets) in 200 ms. (199 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (1775 resets) in 149 ms. (266 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1782 resets) in 152 ms. (261 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1753 resets) in 221 ms. (180 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1757 resets) in 253 ms. (157 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40000 steps (1757 resets) in 152 ms. (261 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1812 resets) in 140 ms. (283 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1848 resets) in 147 ms. (270 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1718 resets) in 185 ms. (215 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (1835 resets) in 218 ms. (182 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1837 resets) in 151 ms. (263 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (1784 resets) in 156 ms. (254 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1753 resets) in 175 ms. (227 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1790 resets) in 121 ms. (327 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1797 resets) in 130 ms. (305 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (1803 resets) in 197 ms. (202 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1771 resets) in 125 ms. (317 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (1743 resets) in 150 ms. (264 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1819 resets) in 131 ms. (303 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40000 steps (1768 resets) in 157 ms. (253 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1780 resets) in 146 ms. (272 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1726 resets) in 189 ms. (210 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (1783 resets) in 211 ms. (188 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (1824 resets) in 171 ms. (232 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (1810 resets) in 120 ms. (330 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1775 resets) in 188 ms. (211 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1787 resets) in 185 ms. (215 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1752 resets) in 215 ms. (185 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1795 resets) in 135 ms. (294 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1798 resets) in 174 ms. (228 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (1795 resets) in 169 ms. (235 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1729 resets) in 152 ms. (261 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (1724 resets) in 151 ms. (263 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1838 resets) in 191 ms. (208 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (1785 resets) in 167 ms. (238 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1778 resets) in 171 ms. (232 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (1764 resets) in 139 ms. (285 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1776 resets) in 133 ms. (298 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1788 resets) in 173 ms. (229 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1863 resets) in 202 ms. (197 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40000 steps (1796 resets) in 180 ms. (220 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1794 resets) in 144 ms. (275 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (1795 resets) in 164 ms. (242 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1769 resets) in 175 ms. (227 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1754 resets) in 136 ms. (291 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1807 resets) in 172 ms. (231 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (1849 resets) in 171 ms. (232 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (1793 resets) in 188 ms. (211 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (3881 resets) in 246 ms. (161 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (3767 resets) in 182 ms. (218 steps per ms) remains 103/103 properties
Finished probabilistic random walk after 342377 steps, run visited all 103 properties in 3731 ms. (steps per millisecond=91 )
Probabilistic random walk after 342377 steps, saw 138363 distinct states, run finished after 3736 ms. (steps per millisecond=91 ) properties seen :103
Able to resolve query QuasiLiveness after proving 1134 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 286227 ms.
ITS solved all properties within timeout

BK_STOP 1716365715498

--------------------
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 QuasiLiveness -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="DBSingleClientW-PT-d2m07"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is DBSingleClientW-PT-d2m07, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r100-tall-171624200800357"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m07.tgz
mv DBSingleClientW-PT-d2m07 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;