About the Execution of LTSMin+red for Anderson-PT-08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2274.163 | 133465.00 | 259781.00 | 435.60 | T | normal |
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.r466-smll-171620124700217.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 Anderson-PT-08, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r466-smll-171620124700217
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 15:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 15:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 15:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 667K 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 1717201142347
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Anderson-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:19:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 00:19:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:19:05] [INFO ] Load time of PNML (sax parser for PT used): 346 ms
[2024-06-01 00:19:05] [INFO ] Transformed 401 places.
[2024-06-01 00:19:05] [INFO ] Transformed 1328 transitions.
[2024-06-01 00:19:05] [INFO ] Found NUPN structural information;
[2024-06-01 00:19:05] [INFO ] Parsed PT model containing 401 places and 1328 transitions and 5088 arcs in 731 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 401/401 places, 1328/1328 transitions.
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 56 Pre rules applied. Total rules applied 0 place count 401 transition count 1272
Deduced a syphon composed of 56 places in 11 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 345 transition count 1272
Applied a total of 112 rules in 159 ms. Remains 345 /401 variables (removed 56) and now considering 1272/1328 (removed 56) transitions.
// Phase 1: matrix 1272 rows 345 cols
[2024-06-01 00:19:06] [INFO ] Computed 19 invariants in 95 ms
[2024-06-01 00:19:08] [INFO ] Implicit Places using invariants in 2224 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2296 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 344/401 places, 1272/1328 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 344 transition count 1208
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 280 transition count 1208
Applied a total of 128 rules in 37 ms. Remains 280 /344 variables (removed 64) and now considering 1208/1272 (removed 64) transitions.
// Phase 1: matrix 1208 rows 280 cols
[2024-06-01 00:19:08] [INFO ] Computed 18 invariants in 29 ms
[2024-06-01 00:19:09] [INFO ] Implicit Places using invariants in 1164 ms returned []
[2024-06-01 00:19:09] [INFO ] Invariant cache hit.
[2024-06-01 00:19:10] [INFO ] State equation strengthened by 104 read => feed constraints.
[2024-06-01 00:19:13] [INFO ] Implicit Places using invariants and state equation in 3914 ms returned []
Implicit Place search using SMT with State Equation took 5085 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 280/401 places, 1208/1328 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 7633 ms. Remains : 280/401 places, 1208/1328 transitions.
Initial state reduction rules removed 8 formulas.
RANDOM walk for 40000 steps (8 resets) in 5163 ms. (7 steps per ms) remains 472/1200 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 19 ms. (20 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 28 ms. (13 steps per ms) remains 472/472 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 472/472 properties
[2024-06-01 00:19:15] [INFO ] Invariant cache hit.
[2024-06-01 00:19:15] [INFO ] State equation strengthened by 104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 118/118 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 472 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 Real declared 118/1488 variables, and 119 constraints, problems are : Problem set: 0 solved, 472 unsolved in 5060 ms.
Refiners :[Domain max(s): 118/280 constraints, Positive P Invariants (semi-flows): 0/9 constraints, Generalized P Invariants (flows): 1/9 constraints, State Equation: 0/280 constraints, ReadFeed: 0/104 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 118/118 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (OVERLAPS) 162/280 variables, 9/128 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 162/290 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 8/298 constraints. Problems are: Problem set: 0 solved, 472 unsolved
[2024-06-01 00:19:26] [INFO ] Deduced a trap composed of 99 places in 358 ms of which 33 ms to minimize.
[2024-06-01 00:19:26] [INFO ] Deduced a trap composed of 54 places in 442 ms of which 5 ms to minimize.
[2024-06-01 00:19:26] [INFO ] Deduced a trap composed of 82 places in 329 ms of which 4 ms to minimize.
[2024-06-01 00:19:27] [INFO ] Deduced a trap composed of 54 places in 371 ms of which 6 ms to minimize.
[2024-06-01 00:19:27] [INFO ] Deduced a trap composed of 60 places in 392 ms of which 3 ms to minimize.
SMT process timed out in 12343ms, After SMT, problems are : Problem set: 0 solved, 472 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 118 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 1208/1208 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 249 transition count 1177
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 249 transition count 1177
Applied a total of 62 rules in 96 ms. Remains 249 /280 variables (removed 31) and now considering 1177/1208 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 249/280 places, 1177/1208 transitions.
RANDOM walk for 4000000 steps (8 resets) in 81308 ms. (49 steps per ms) remains 111/472 properties
BEST_FIRST walk for 40002 steps (8 resets) in 156 ms. (254 steps per ms) remains 107/111 properties
BEST_FIRST walk for 40002 steps (8 resets) in 189 ms. (210 steps per ms) remains 102/107 properties
BEST_FIRST walk for 40003 steps (8 resets) in 289 ms. (137 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40002 steps (8 resets) in 266 ms. (149 steps per ms) remains 100/102 properties
BEST_FIRST walk for 40004 steps (8 resets) in 372 ms. (107 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 350 ms. (113 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 99/100 properties
BEST_FIRST walk for 40003 steps (8 resets) in 153 ms. (259 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40003 steps (8 resets) in 151 ms. (263 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40003 steps (8 resets) in 120 ms. (330 steps per ms) remains 97/99 properties
BEST_FIRST walk for 40002 steps (8 resets) in 117 ms. (339 steps per ms) remains 97/97 properties
BEST_FIRST walk for 40003 steps (8 resets) in 136 ms. (291 steps per ms) remains 97/97 properties
BEST_FIRST walk for 40003 steps (8 resets) in 143 ms. (277 steps per ms) remains 97/97 properties
BEST_FIRST walk for 40003 steps (8 resets) in 141 ms. (281 steps per ms) remains 93/97 properties
BEST_FIRST walk for 40003 steps (8 resets) in 141 ms. (281 steps per ms) remains 92/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 82/92 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 79/82 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 76/79 properties
BEST_FIRST walk for 40003 steps (8 resets) in 131 ms. (303 steps per ms) remains 76/76 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 76/76 properties
BEST_FIRST walk for 40001 steps (8 resets) in 129 ms. (307 steps per ms) remains 75/76 properties
BEST_FIRST walk for 40003 steps (8 resets) in 140 ms. (283 steps per ms) remains 75/75 properties
BEST_FIRST walk for 40003 steps (8 resets) in 129 ms. (307 steps per ms) remains 74/75 properties
BEST_FIRST walk for 40002 steps (8 resets) in 143 ms. (277 steps per ms) remains 74/74 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 72/74 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 68/72 properties
BEST_FIRST walk for 40002 steps (8 resets) in 208 ms. (191 steps per ms) remains 66/68 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 66/66 properties
BEST_FIRST walk for 40002 steps (8 resets) in 133 ms. (298 steps per ms) remains 66/66 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 66/66 properties
BEST_FIRST walk for 40003 steps (8 resets) in 123 ms. (322 steps per ms) remains 66/66 properties
BEST_FIRST walk for 40003 steps (8 resets) in 129 ms. (307 steps per ms) remains 66/66 properties
BEST_FIRST walk for 40003 steps (8 resets) in 119 ms. (333 steps per ms) remains 65/66 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 65/65 properties
BEST_FIRST walk for 40003 steps (8 resets) in 166 ms. (239 steps per ms) remains 65/65 properties
BEST_FIRST walk for 40003 steps (8 resets) in 105 ms. (377 steps per ms) remains 63/65 properties
BEST_FIRST walk for 40001 steps (8 resets) in 98 ms. (404 steps per ms) remains 63/63 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 61/63 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 61/61 properties
BEST_FIRST walk for 40003 steps (8 resets) in 116 ms. (341 steps per ms) remains 61/61 properties
BEST_FIRST walk for 40003 steps (8 resets) in 120 ms. (330 steps per ms) remains 61/61 properties
BEST_FIRST walk for 40003 steps (8 resets) in 130 ms. (305 steps per ms) remains 61/61 properties
BEST_FIRST walk for 40003 steps (8 resets) in 110 ms. (360 steps per ms) remains 58/61 properties
BEST_FIRST walk for 40003 steps (8 resets) in 98 ms. (404 steps per ms) remains 55/58 properties
BEST_FIRST walk for 40002 steps (8 resets) in 118 ms. (336 steps per ms) remains 55/55 properties
BEST_FIRST walk for 40003 steps (8 resets) in 120 ms. (330 steps per ms) remains 54/55 properties
BEST_FIRST walk for 40002 steps (8 resets) in 129 ms. (307 steps per ms) remains 54/54 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 54/54 properties
BEST_FIRST walk for 40003 steps (8 resets) in 104 ms. (380 steps per ms) remains 53/54 properties
BEST_FIRST walk for 40003 steps (8 resets) in 115 ms. (344 steps per ms) remains 53/53 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 39/53 properties
BEST_FIRST walk for 40002 steps (8 resets) in 113 ms. (350 steps per ms) remains 36/39 properties
BEST_FIRST walk for 40000 steps (8 resets) in 168 ms. (236 steps per ms) remains 35/36 properties
BEST_FIRST walk for 40002 steps (8 resets) in 150 ms. (264 steps per ms) remains 35/35 properties
BEST_FIRST walk for 40003 steps (8 resets) in 215 ms. (185 steps per ms) remains 33/35 properties
BEST_FIRST walk for 40003 steps (8 resets) in 191 ms. (208 steps per ms) remains 33/33 properties
BEST_FIRST walk for 40002 steps (8 resets) in 140 ms. (283 steps per ms) remains 31/33 properties
BEST_FIRST walk for 40002 steps (8 resets) in 188 ms. (211 steps per ms) remains 29/31 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 26/29 properties
// Phase 1: matrix 1177 rows 249 cols
[2024-06-01 00:19:51] [INFO ] Computed 18 invariants in 9 ms
[2024-06-01 00:19:51] [INFO ] State equation strengthened by 81 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 177/199 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 41/240 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 9/249 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 00:19:53] [INFO ] Deduced a trap composed of 91 places in 339 ms of which 4 ms to minimize.
[2024-06-01 00:19:53] [INFO ] Deduced a trap composed of 83 places in 387 ms of which 2 ms to minimize.
[2024-06-01 00:19:54] [INFO ] Deduced a trap composed of 41 places in 337 ms of which 3 ms to minimize.
[2024-06-01 00:19:54] [INFO ] Deduced a trap composed of 85 places in 281 ms of which 2 ms to minimize.
[2024-06-01 00:19:55] [INFO ] Deduced a trap composed of 96 places in 361 ms of which 3 ms to minimize.
[2024-06-01 00:19:55] [INFO ] Deduced a trap composed of 114 places in 334 ms of which 4 ms to minimize.
[2024-06-01 00:19:55] [INFO ] Deduced a trap composed of 74 places in 262 ms of which 3 ms to minimize.
[2024-06-01 00:19:55] [INFO ] Deduced a trap composed of 59 places in 322 ms of which 2 ms to minimize.
[2024-06-01 00:19:56] [INFO ] Deduced a trap composed of 74 places in 341 ms of which 3 ms to minimize.
[2024-06-01 00:19:56] [INFO ] Deduced a trap composed of 46 places in 316 ms of which 3 ms to minimize.
[2024-06-01 00:19:57] [INFO ] Deduced a trap composed of 95 places in 393 ms of which 4 ms to minimize.
[2024-06-01 00:19:57] [INFO ] Deduced a trap composed of 52 places in 526 ms of which 4 ms to minimize.
[2024-06-01 00:19:58] [INFO ] Deduced a trap composed of 72 places in 495 ms of which 5 ms to minimize.
[2024-06-01 00:19:58] [INFO ] Deduced a trap composed of 116 places in 520 ms of which 5 ms to minimize.
[2024-06-01 00:19:59] [INFO ] Deduced a trap composed of 81 places in 518 ms of which 4 ms to minimize.
[2024-06-01 00:19:59] [INFO ] Deduced a trap composed of 109 places in 426 ms of which 4 ms to minimize.
[2024-06-01 00:20:00] [INFO ] Deduced a trap composed of 100 places in 433 ms of which 5 ms to minimize.
[2024-06-01 00:20:00] [INFO ] Deduced a trap composed of 67 places in 487 ms of which 5 ms to minimize.
[2024-06-01 00:20:01] [INFO ] Deduced a trap composed of 82 places in 479 ms of which 4 ms to minimize.
[2024-06-01 00:20:01] [INFO ] Deduced a trap composed of 69 places in 428 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 00:20:02] [INFO ] Deduced a trap composed of 73 places in 480 ms of which 5 ms to minimize.
[2024-06-01 00:20:02] [INFO ] Deduced a trap composed of 81 places in 496 ms of which 4 ms to minimize.
[2024-06-01 00:20:03] [INFO ] Deduced a trap composed of 93 places in 480 ms of which 4 ms to minimize.
[2024-06-01 00:20:03] [INFO ] Deduced a trap composed of 113 places in 505 ms of which 4 ms to minimize.
[2024-06-01 00:20:04] [INFO ] Deduced a trap composed of 90 places in 474 ms of which 4 ms to minimize.
[2024-06-01 00:20:04] [INFO ] Deduced a trap composed of 117 places in 490 ms of which 4 ms to minimize.
[2024-06-01 00:20:05] [INFO ] Deduced a trap composed of 113 places in 478 ms of which 4 ms to minimize.
[2024-06-01 00:20:05] [INFO ] Deduced a trap composed of 63 places in 493 ms of which 4 ms to minimize.
[2024-06-01 00:20:06] [INFO ] Deduced a trap composed of 102 places in 462 ms of which 4 ms to minimize.
[2024-06-01 00:20:06] [INFO ] Deduced a trap composed of 92 places in 484 ms of which 5 ms to minimize.
[2024-06-01 00:20:07] [INFO ] Deduced a trap composed of 76 places in 504 ms of which 4 ms to minimize.
[2024-06-01 00:20:08] [INFO ] Deduced a trap composed of 115 places in 503 ms of which 5 ms to minimize.
[2024-06-01 00:20:08] [INFO ] Deduced a trap composed of 105 places in 501 ms of which 5 ms to minimize.
[2024-06-01 00:20:09] [INFO ] Deduced a trap composed of 82 places in 497 ms of which 4 ms to minimize.
[2024-06-01 00:20:09] [INFO ] Deduced a trap composed of 46 places in 511 ms of which 6 ms to minimize.
[2024-06-01 00:20:10] [INFO ] Deduced a trap composed of 105 places in 499 ms of which 4 ms to minimize.
[2024-06-01 00:20:10] [INFO ] Deduced a trap composed of 101 places in 482 ms of which 4 ms to minimize.
[2024-06-01 00:20:11] [INFO ] Deduced a trap composed of 77 places in 499 ms of which 5 ms to minimize.
[2024-06-01 00:20:11] [INFO ] Deduced a trap composed of 72 places in 495 ms of which 5 ms to minimize.
[2024-06-01 00:20:12] [INFO ] Deduced a trap composed of 85 places in 502 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 00:20:13] [INFO ] Deduced a trap composed of 62 places in 497 ms of which 3 ms to minimize.
[2024-06-01 00:20:13] [INFO ] Deduced a trap composed of 79 places in 369 ms of which 3 ms to minimize.
[2024-06-01 00:20:14] [INFO ] Deduced a trap composed of 93 places in 446 ms of which 4 ms to minimize.
[2024-06-01 00:20:14] [INFO ] Deduced a trap composed of 75 places in 411 ms of which 4 ms to minimize.
[2024-06-01 00:20:15] [INFO ] Deduced a trap composed of 77 places in 488 ms of which 4 ms to minimize.
[2024-06-01 00:20:15] [INFO ] Deduced a trap composed of 51 places in 445 ms of which 4 ms to minimize.
[2024-06-01 00:20:16] [INFO ] Deduced a trap composed of 83 places in 494 ms of which 5 ms to minimize.
[2024-06-01 00:20:16] [INFO ] Deduced a trap composed of 118 places in 369 ms of which 3 ms to minimize.
[2024-06-01 00:20:16] [INFO ] Deduced a trap composed of 85 places in 254 ms of which 3 ms to minimize.
[2024-06-01 00:20:17] [INFO ] Deduced a trap composed of 83 places in 305 ms of which 2 ms to minimize.
[2024-06-01 00:20:17] [INFO ] Deduced a trap composed of 103 places in 270 ms of which 3 ms to minimize.
[2024-06-01 00:20:17] [INFO ] Deduced a trap composed of 98 places in 309 ms of which 4 ms to minimize.
[2024-06-01 00:20:18] [INFO ] Deduced a trap composed of 88 places in 353 ms of which 3 ms to minimize.
[2024-06-01 00:20:18] [INFO ] Deduced a trap composed of 80 places in 407 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 00:20:19] [INFO ] Deduced a trap composed of 89 places in 492 ms of which 4 ms to minimize.
[2024-06-01 00:20:20] [INFO ] Deduced a trap composed of 79 places in 494 ms of which 4 ms to minimize.
[2024-06-01 00:20:21] [INFO ] Deduced a trap composed of 89 places in 496 ms of which 4 ms to minimize.
[2024-06-01 00:20:21] [INFO ] Deduced a trap composed of 102 places in 516 ms of which 5 ms to minimize.
[2024-06-01 00:20:22] [INFO ] Deduced a trap composed of 93 places in 493 ms of which 5 ms to minimize.
[2024-06-01 00:20:22] [INFO ] Deduced a trap composed of 95 places in 445 ms of which 4 ms to minimize.
[2024-06-01 00:20:23] [INFO ] Deduced a trap composed of 99 places in 499 ms of which 4 ms to minimize.
[2024-06-01 00:20:23] [INFO ] Deduced a trap composed of 47 places in 517 ms of which 4 ms to minimize.
[2024-06-01 00:20:24] [INFO ] Deduced a trap composed of 58 places in 509 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 9/81 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 00:20:27] [INFO ] Deduced a trap composed of 78 places in 486 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (OVERLAPS) 1177/1426 variables, 249/331 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1426 variables, 81/412 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1426/1426 variables, and 412 constraints, problems are : Problem set: 0 solved, 26 unsolved in 45012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 249/249 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 64/64 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 177/199 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 41/240 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 9/249 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 64/82 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 00:20:40] [INFO ] Deduced a trap composed of 103 places in 516 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (OVERLAPS) 1177/1426 variables, 249/332 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1426 variables, 81/413 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1426 variables, 26/439 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1426 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (OVERLAPS) 0/1426 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1426/1426 variables, and 439 constraints, problems are : Problem set: 0 solved, 26 unsolved in 26880 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 249/249 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 65/65 constraints]
After SMT, in 72107ms problems are : Problem set: 0 solved, 26 unsolved
Parikh walk visited 6 properties in 819 ms.
Support contains 16 out of 249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 1177/1177 transitions.
Discarding 67 places :
Symmetric choice reduction at 0 with 67 rule applications. Total rules 67 place count 182 transition count 522
Iterating global reduction 0 with 67 rules applied. Total rules applied 134 place count 182 transition count 522
Applied a total of 134 rules in 80 ms. Remains 182 /249 variables (removed 67) and now considering 522/1177 (removed 655) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 182/249 places, 522/1177 transitions.
RANDOM walk for 4000000 steps (8 resets) in 20889 ms. (191 steps per ms) remains 19/20 properties
BEST_FIRST walk for 400003 steps (8 resets) in 591 ms. (675 steps per ms) remains 17/19 properties
BEST_FIRST walk for 400003 steps (8 resets) in 603 ms. (662 steps per ms) remains 16/17 properties
BEST_FIRST walk for 400002 steps (8 resets) in 578 ms. (690 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 529 ms. (754 steps per ms) remains 14/16 properties
BEST_FIRST walk for 400003 steps (8 resets) in 506 ms. (788 steps per ms) remains 12/14 properties
BEST_FIRST walk for 400003 steps (8 resets) in 460 ms. (867 steps per ms) remains 10/12 properties
BEST_FIRST walk for 400002 steps (8 resets) in 431 ms. (925 steps per ms) remains 9/10 properties
BEST_FIRST walk for 400003 steps (8 resets) in 416 ms. (959 steps per ms) remains 8/9 properties
BEST_FIRST walk for 400003 steps (8 resets) in 403 ms. (990 steps per ms) remains 7/8 properties
BEST_FIRST walk for 400002 steps (8 resets) in 364 ms. (1095 steps per ms) remains 5/7 properties
BEST_FIRST walk for 400004 steps (8 resets) in 344 ms. (1159 steps per ms) remains 3/5 properties
BEST_FIRST walk for 400002 steps (8 resets) in 307 ms. (1298 steps per ms) remains 2/3 properties
BEST_FIRST walk for 400003 steps (8 resets) in 291 ms. (1369 steps per ms) remains 1/2 properties
// Phase 1: matrix 522 rows 182 cols
[2024-06-01 00:21:12] [INFO ] Computed 18 invariants in 4 ms
[2024-06-01 00:21:12] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 146/167 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 15/182 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 522/704 variables, 182/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/704 variables, 56/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/704 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/704 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 704/704 variables, and 256 constraints, problems are : Problem set: 0 solved, 1 unsolved in 331 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 182/182 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 146/167 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 15/182 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 522/704 variables, 182/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/704 variables, 56/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/704 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/704 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/704 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 704/704 variables, and 257 constraints, problems are : Problem set: 0 solved, 1 unsolved in 486 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 182/182 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 829ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 522/522 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 169 transition count 327
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 169 transition count 327
Applied a total of 26 rules in 28 ms. Remains 169 /182 variables (removed 13) and now considering 327/522 (removed 195) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 169/182 places, 327/522 transitions.
RANDOM walk for 4000000 steps (8 resets) in 6838 ms. (584 steps per ms) remains 1/1 properties
BEST_FIRST walk for 667528 steps (0 resets) in 406 ms. (1640 steps per ms) remains 0/1 properties
Able to resolve query QuasiLiveness after proving 1208 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 130678 ms.
ITS solved all properties within timeout
BK_STOP 1717201275812
--------------------
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="Anderson-PT-08"
export BK_EXAMINATION="QuasiLiveness"
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 Anderson-PT-08, 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 r466-smll-171620124700217"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-08.tgz
mv Anderson-PT-08 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 '
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 ;