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.r530-tall-171683778800187.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 ShieldIIPt-PT-030B, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r530-tall-171683778800187
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 20:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 12 20:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 20:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 20:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 512K 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717223580160

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldIIPt-PT-030B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:33:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 06:33:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:33:01] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2024-06-01 06:33:01] [INFO ] Transformed 2103 places.
[2024-06-01 06:33:01] [INFO ] Transformed 1953 transitions.
[2024-06-01 06:33:01] [INFO ] Found NUPN structural information;
[2024-06-01 06:33:01] [INFO ] Parsed PT model containing 2103 places and 1953 transitions and 4866 arcs in 336 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 2103/2103 places, 1953/1953 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 512 transitions
Trivial Post-agglo rules discarded 512 transitions
Performed 512 trivial Post agglomeration. Transition count delta: 512
Iterating post reduction 0 with 512 rules applied. Total rules applied 512 place count 2103 transition count 1441
Reduce places removed 512 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 514 rules applied. Total rules applied 1026 place count 1591 transition count 1439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1027 place count 1590 transition count 1439
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 121 Pre rules applied. Total rules applied 1027 place count 1590 transition count 1318
Deduced a syphon composed of 121 places in 21 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 1269 place count 1469 transition count 1318
Performed 809 Post agglomeration using F-continuation condition.Transition count delta: 809
Deduced a syphon composed of 809 places in 3 ms
Reduce places removed 809 places and 0 transitions.
Iterating global reduction 3 with 1618 rules applied. Total rules applied 2887 place count 660 transition count 509
Renaming transitions due to excessive name length > 1024 char.
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 2 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 3065 place count 571 transition count 568
Applied a total of 3065 rules in 388 ms. Remains 571 /2103 variables (removed 1532) and now considering 568/1953 (removed 1385) transitions.
// Phase 1: matrix 568 rows 571 cols
[2024-06-01 06:33:02] [INFO ] Computed 271 invariants in 22 ms
[2024-06-01 06:33:02] [INFO ] Implicit Places using invariants in 670 ms returned [563, 564]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 704 ms to find 2 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 569/2103 places, 568/1953 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 569 transition count 567
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 568 transition count 567
Applied a total of 2 rules in 20 ms. Remains 568 /569 variables (removed 1) and now considering 567/568 (removed 1) transitions.
// Phase 1: matrix 567 rows 568 cols
[2024-06-01 06:33:02] [INFO ] Computed 269 invariants in 4 ms
[2024-06-01 06:33:03] [INFO ] Implicit Places using invariants in 363 ms returned [557]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 365 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 567/2103 places, 567/1953 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 566 transition count 566
Applied a total of 2 rules in 14 ms. Remains 566 /567 variables (removed 1) and now considering 566/567 (removed 1) transitions.
// Phase 1: matrix 566 rows 566 cols
[2024-06-01 06:33:03] [INFO ] Computed 268 invariants in 4 ms
[2024-06-01 06:33:03] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-06-01 06:33:03] [INFO ] Invariant cache hit.
[2024-06-01 06:33:03] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-06-01 06:33:06] [INFO ] Implicit Places using invariants and state equation in 3332 ms returned []
Implicit Place search using SMT with State Equation took 3685 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 3 : 566/2103 places, 566/1953 transitions.
Finished structural reductions in LIVENESS mode , in 3 iterations and 5198 ms. Remains : 566/2103 places, 566/1953 transitions.
Discarding 267 transitions out of 566. Remains 299
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (8 resets) in 2637 ms. (15 steps per ms) remains 117/298 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 117/117 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 117/117 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 117/117 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 117/117 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 117/117 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 117/117 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 117/117 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 117/117 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 117/117 properties
BEST_FIRST walk for 401 steps (8 resets) in 15 ms. (25 steps per ms) remains 117/117 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 117/117 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 117/117 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 117/117 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 117/117 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 117/117 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 117/117 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 117/117 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 117/117 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 117/117 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 117/117 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 117/117 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 117/117 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 117/117 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 117/117 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 117/117 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 117/117 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 117/117 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 117/117 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 117/117 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 117/117 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 117/117 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 117/117 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 117/117 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 117/117 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 117/117 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 117/117 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 117/117 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 117/117 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 117/117 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 117/117 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 117/117 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 117/117 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 117/117 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 117/117 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 117/117 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 117/117 properties
BEST_FIRST walk for 401 steps (8 resets) in 7 ms. (50 steps per ms) remains 117/117 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 117/117 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 117/117 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 117/117 properties
[2024-06-01 06:33:07] [INFO ] Invariant cache hit.
[2024-06-01 06:33:07] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 227/227 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 14/241 variables, 114/341 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/355 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 325/566 variables, 154/509 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 325/834 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 565/1131 variables, 566/1400 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1131 variables, 266/1666 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1131/1132 variables, and 1666 constraints, problems are : Problem set: 0 solved, 117 unsolved in 5026 ms.
Refiners :[Domain max(s): 566/566 constraints, Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 566/566 constraints, ReadFeed: 266/267 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 227/227 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 14/241 variables, 114/341 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/355 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 325/566 variables, 154/509 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 325/834 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 565/1131 variables, 566/1400 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1131 variables, 266/1666 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1131 variables, 117/1783 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1131/1132 variables, and 1783 constraints, problems are : Problem set: 0 solved, 117 unsolved in 5012 ms.
Refiners :[Domain max(s): 566/566 constraints, Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 566/566 constraints, ReadFeed: 266/267 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
After SMT, in 10139ms problems are : Problem set: 0 solved, 117 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 227 out of 566 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 566/566 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 566 transition count 565
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 1 with 17 rules applied. Total rules applied 18 place count 566 transition count 565
Applied a total of 18 rules in 61 ms. Remains 566 /566 variables (removed 0) and now considering 565/566 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 566/566 places, 565/566 transitions.
RANDOM walk for 4000000 steps (8 resets) in 44979 ms. (88 steps per ms) remains 23/117 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1704 ms. (234 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1611 ms. (248 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1601 ms. (249 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1582 ms. (252 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1626 ms. (245 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1576 ms. (253 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1571 ms. (254 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1599 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1589 ms. (251 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1578 ms. (253 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1602 ms. (249 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1630 ms. (245 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1648 ms. (242 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1649 ms. (242 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1640 ms. (243 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1627 ms. (245 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1600 ms. (249 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1643 ms. (243 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1655 ms. (241 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1614 ms. (247 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1628 ms. (245 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1643 ms. (243 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1635 ms. (244 steps per ms) remains 23/23 properties
// Phase 1: matrix 565 rows 566 cols
[2024-06-01 06:33:39] [INFO ] Computed 268 invariants in 2 ms
[2024-06-01 06:33:39] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 14/62 variables, 29/77 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 14/91 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 504/566 variables, 239/330 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 504/834 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 565/1131 variables, 566/1400 constraints. Problems are: Problem set: 0 solved, 23 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1131 variables, 266/1666 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1131 variables, 0/1666 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 0/1131 variables, 0/1666 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1131/1131 variables, and 1666 constraints, problems are : Problem set: 0 solved, 23 unsolved in 2116 ms.
Refiners :[Domain max(s): 566/566 constraints, Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 566/566 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 14/62 variables, 29/77 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 14/91 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 504/566 variables, 239/330 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 504/834 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 565/1131 variables, 566/1400 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1131 variables, 266/1666 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1131 variables, 23/1689 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1131 variables, 0/1689 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (OVERLAPS) 0/1131 variables, 0/1689 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1131/1131 variables, and 1689 constraints, problems are : Problem set: 0 solved, 23 unsolved in 12716 ms.
Refiners :[Domain max(s): 566/566 constraints, Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 566/566 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
After SMT, in 14867ms problems are : Problem set: 0 solved, 23 unsolved
Fused 23 Parikh solutions to 20 different solutions.
Parikh walk visited 0 properties in 6490 ms.
Support contains 48 out of 566 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 565/565 transitions.
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 566 transition count 565
Applied a total of 9 rules in 43 ms. Remains 566 /566 variables (removed 0) and now considering 565/565 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 566/566 places, 565/565 transitions.
RANDOM walk for 4000000 steps (8 resets) in 38547 ms. (103 steps per ms) remains 15/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1559 ms. (256 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1544 ms. (258 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1541 ms. (259 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1543 ms. (259 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1541 ms. (259 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1539 ms. (259 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1563 ms. (255 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1548 ms. (258 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1545 ms. (258 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1554 ms. (257 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1556 ms. (256 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1524 ms. (262 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1526 ms. (261 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1519 ms. (263 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1539 ms. (259 steps per ms) remains 15/15 properties
// Phase 1: matrix 565 rows 566 cols
[2024-06-01 06:34:17] [INFO ] Computed 268 invariants in 3 ms
[2024-06-01 06:34:17] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 8/39 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 527/566 variables, 250/307 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 527/834 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 565/1131 variables, 566/1400 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1131 variables, 266/1666 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1131 variables, 0/1666 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 0/1131 variables, 0/1666 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1131/1131 variables, and 1666 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1533 ms.
Refiners :[Domain max(s): 566/566 constraints, Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 566/566 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 8/39 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 527/566 variables, 250/307 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 527/834 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 565/1131 variables, 566/1400 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1131 variables, 266/1666 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1131 variables, 15/1681 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1131 variables, 0/1681 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 0/1131 variables, 0/1681 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1131/1131 variables, and 1681 constraints, problems are : Problem set: 0 solved, 15 unsolved in 26588 ms.
Refiners :[Domain max(s): 566/566 constraints, Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 566/566 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 28158ms problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 24877 ms.
Support contains 31 out of 566 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 565/565 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 566 transition count 565
Applied a total of 1 rules in 39 ms. Remains 566 /566 variables (removed 0) and now considering 565/565 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 566/566 places, 565/565 transitions.
RANDOM walk for 4000000 steps (8 resets) in 32116 ms. (124 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1515 ms. (263 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1507 ms. (265 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1521 ms. (262 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1522 ms. (262 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1510 ms. (264 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1503 ms. (265 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1517 ms. (263 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1541 ms. (259 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1537 ms. (260 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1533 ms. (260 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1523 ms. (262 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1528 ms. (261 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1532 ms. (260 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1532 ms. (260 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1555 ms. (257 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 1644542 steps, run timeout after 42001 ms. (steps per millisecond=39 ) properties seen :0 out of 15
Probabilistic random walk after 1644542 steps, saw 1267677 distinct states, run finished after 42006 ms. (steps per millisecond=39 ) properties seen :0
// Phase 1: matrix 565 rows 566 cols
[2024-06-01 06:36:07] [INFO ] Computed 268 invariants in 3 ms
[2024-06-01 06:36:07] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 8/39 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 527/566 variables, 250/307 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 527/834 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 565/1131 variables, 566/1400 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1131 variables, 266/1666 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1131 variables, 0/1666 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 0/1131 variables, 0/1666 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1131/1131 variables, and 1666 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1488 ms.
Refiners :[Domain max(s): 566/566 constraints, Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 566/566 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 8/39 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 527/566 variables, 250/307 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 527/834 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 565/1131 variables, 566/1400 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1131 variables, 266/1666 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1131 variables, 15/1681 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1131 variables, 0/1681 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 0/1131 variables, 0/1681 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1131/1131 variables, and 1681 constraints, problems are : Problem set: 0 solved, 15 unsolved in 30173 ms.
Refiners :[Domain max(s): 566/566 constraints, Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 566/566 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 31706ms problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 12 different solutions.
Finished Parikh walk after 53484 steps, including 495 resets, run visited all 15 properties in 1419 ms. (steps per millisecond=37 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 15 properties in 1426 ms.
Able to resolve query QuasiLiveness after proving 299 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 219012 ms.
ITS solved all properties within timeout

BK_STOP 1717223800394

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="ShieldIIPt-PT-030B"
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 ShieldIIPt-PT-030B, 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 r530-tall-171683778800187"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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