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.r101-tall-171624201600292.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 itstools
Input is DBSingleClientW-PT-d0m08, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-171624201600292
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 12:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 12 12:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 12 12:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 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 119K 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 1716296721205

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DBSingleClientW-PT-d0m08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
QuasiLiveness PT
Running Version 202405141337
[2024-05-21 13:05:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-21 13:05:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 13:05:22] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-05-21 13:05:22] [INFO ] Transformed 553 places.
[2024-05-21 13:05:22] [INFO ] Transformed 150 transitions.
[2024-05-21 13:05:22] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 173 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 553/553 places, 150/150 transitions.
Reduce places removed 451 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 462 rules applied. Total rules applied 462 place count 102 transition count 139
Applied a total of 462 rules in 28 ms. Remains 102 /553 variables (removed 451) and now considering 139/150 (removed 11) transitions.
// Phase 1: matrix 139 rows 102 cols
[2024-05-21 13:05:22] [INFO ] Computed 2 invariants in 16 ms
[2024-05-21 13:05:22] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-05-21 13:05:22] [INFO ] Invariant cache hit.
[2024-05-21 13:05:22] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-21 13:05:23] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2024-05-21 13:05:23] [INFO ] Invariant cache hit.
[2024-05-21 13:05:23] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/241 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 63/167 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-21 13:05:25] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 24 ms to minimize.
[2024-05-21 13:05:25] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-21 13:05:25] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-21 13:05:25] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-21 13:05:25] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-21 13:05:25] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-21 13:05:25] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-21 13:05:25] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-05-21 13:05:25] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-21 13:05:25] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-21 13:05:25] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-21 13:05:25] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-21 13:05:25] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 13/180 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-21 13:05:28] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-21 13:05:28] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 5 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/241 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (OVERLAPS) 0/241 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 182 constraints, problems are : Problem set: 0 solved, 138 unsolved in 7722 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (OVERLAPS) 139/241 variables, 102/119 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 63/182 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 138/320 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (OVERLAPS) 0/241 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/241 variables, and 320 constraints, problems are : Problem set: 0 solved, 138 unsolved in 8341 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 15/15 constraints]
After SMT, in 16311ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 16325ms
Starting structural reductions in LIVENESS mode, iteration 1 : 102/553 places, 139/150 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 16871 ms. Remains : 102/553 places, 139/150 transitions.
Discarding 48 transitions out of 139. Remains 91
Initial state reduction rules removed 1 formulas.
[2024-05-21 13:05:39] [INFO ] Flatten gal took : 75 ms
[2024-05-21 13:05:39] [INFO ] Flatten gal took : 28 ms
[2024-05-21 13:05:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4376850614357547460.gal : 23 ms
[2024-05-21 13:05:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12056770945088365040.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4376850614357547460.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12056770945088365040.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality12056770945088365040.prop.
Reachability property qltransition_102 is true.
Reachability property qltransition_11 is true.
Reachability property qltransition_10 is true.
Reachability property qltransition_3 is true.
Reachability property qltransition_2 is true.
Reachability property qltransition_1 is true.
SDD proceeding with computation,84 properties remain. new max is 2
SDD size :1 after 5
Reachability property qltransition_103 is true.
Reachability property qltransition_15 is true.
Reachability property qltransition_7 is true.
Reachability property qltransition_5 is true.
Reachability property qltransition_4 is true.
SDD proceeding with computation,79 properties remain. new max is 2
SDD size :5 after 19
SDD proceeding with computation,79 properties remain. new max is 4
SDD size :19 after 50
SDD proceeding with computation,79 properties remain. new max is 8
SDD size :50 after 134
SDD proceeding with computation,79 properties remain. new max is 16
SDD size :134 after 390
Reachability property qltransition_47 is true.
SDD proceeding with computation,78 properties remain. new max is 16
SDD size :390 after 978
RANDOM walk for 40000 steps (9078 resets) in 2726 ms. (14 steps per ms) remains 49/90 properties
BEST_FIRST walk for 4003 steps (201 resets) in 64 ms. (61 steps per ms) remains 48/49 properties
BEST_FIRST walk for 4003 steps (193 resets) in 65 ms. (60 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (196 resets) in 45 ms. (87 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (208 resets) in 79 ms. (50 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (201 resets) in 44 ms. (88 steps per ms) remains 46/48 properties
BEST_FIRST walk for 4003 steps (196 resets) in 25 ms. (153 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4000 steps (191 resets) in 28 ms. (137 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (197 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (206 resets) in 31 ms. (125 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (204 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (205 resets) in 36 ms. (108 steps per ms) remains 45/46 properties
BEST_FIRST walk for 4003 steps (196 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (172 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
Reachability property qltransition_124 is true.
Reachability property qltransition_123 is true.
Reachability property qltransition_122 is true.
Reachability property qltransition_121 is true.
Reachability property qltransition_119 is true.
Reachability property qltransition_117 is true.
BEST_FIRST walk for 4003 steps (190 resets) in 22 ms. (174 steps per ms) remains 45/45 properties
Reachability property qltransition_115 is true.
Reachability property qltransition_111 is true.
Reachability property qltransition_108 is true.
Reachability property qltransition_107 is true.
Reachability property qltransition_45 is true.
Reachability property qltransition_43 is true.
Reachability property qltransition_41 is true.
Reachability property qltransition_39 is true.
Reachability property qltransition_38 is true.
Reachability property qltransition_33 is true.
Reachability property qltransition_25 is true.
BEST_FIRST walk for 4003 steps (197 resets) in 24 ms. (160 steps per ms) remains 45/45 properties
Reachability property qltransition_20 is true.
BEST_FIRST walk for 4004 steps (226 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
Reachability property qltransition_19 is true.
BEST_FIRST walk for 4001 steps (199 resets) in 13 ms. (285 steps per ms) remains 45/45 properties
Reachability property qltransition_12 is true.
SDD proceeding with computation,58 properties remain. new max is 16
SDD size :978 after 10452
BEST_FIRST walk for 4002 steps (188 resets) in 35 ms. (111 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (194 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (194 resets) in 15 ms. (250 steps per ms) remains 44/45 properties
BEST_FIRST walk for 4002 steps (192 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (193 resets) in 13 ms. (285 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (210 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (197 resets) in 24 ms. (160 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (199 resets) in 13 ms. (285 steps per ms) remains 44/44 properties
SDD proceeding with computation,58 properties remain. new max is 32
SDD size :10452 after 52265
BEST_FIRST walk for 4000 steps (800 resets) in 20 ms. (190 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4000 steps (800 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (420 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (418 resets) in 19 ms. (200 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (417 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (409 resets) in 32 ms. (121 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (410 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (399 resets) in 45 ms. (86 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (406 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (407 resets) in 40 ms. (97 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (397 resets) in 29 ms. (133 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (385 resets) in 14 ms. (266 steps per ms) remains 42/44 properties
SDD proceeding with computation,58 properties remain. new max is 64
SDD size :52265 after 84942
BEST_FIRST walk for 4003 steps (425 resets) in 27 ms. (142 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (390 resets) in 23 ms. (166 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (391 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (376 resets) in 25 ms. (153 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (414 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (414 resets) in 32 ms. (121 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (403 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (398 resets) in 44 ms. (88 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (405 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (373 resets) in 12 ms. (307 steps per ms) remains 42/42 properties
[2024-05-21 13:05:40] [INFO ] Invariant cache hit.
[2024-05-21 13:05:40] [INFO ] State equation strengthened by 63 read => feed constraints.
Reachability property qltransition_13 is true.
SDD proceeding with computation,57 properties remain. new max is 64
SDD size :84942 after 249546
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 21/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Reachability property qltransition_85 is true.
SDD proceeding with computation,56 properties remain. new max is 64
SDD size :249546 after 304106
At refinement iteration 3 (OVERLAPS) 21/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
SDD proceeding with computation,56 properties remain. new max is 128
SDD size :304106 after 356068
At refinement iteration 5 (OVERLAPS) 123/212 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 40 unsolved
SDD proceeding with computation,56 properties remain. new max is 256
SDD size :356068 after 402243
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 29/241 variables, 13/151 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Reachability property qltransition_104 is true.
Reachability property qltransition_93 is true.
Reachability property qltransition_89 is true.
Reachability property qltransition_21 is true.
SDD proceeding with computation,52 properties remain. new max is 256
SDD size :402243 after 1.03726e+06
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 16/167 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/167 constraints. Problems are: Problem set: 2 solved, 38 unsolved
SDD proceeding with computation,52 properties remain. new max is 512
SDD size :1.03726e+06 after 1.19278e+06
At refinement iteration 11 (OVERLAPS) 0/241 variables, 0/167 constraints. Problems are: Problem set: 2 solved, 38 unsolved
No progress, stopping.
Reachability property qltransition_128 is true.
Reachability property qltransition_127 is true.
Reachability property qltransition_126 is true.
Reachability property qltransition_125 is true.
Reachability property qltransition_109 is true.
Reachability property qltransition_97 is true.
Reachability property qltransition_94 is true.
Reachability property qltransition_53 is true.
Reachability property qltransition_52 is true.
Reachability property qltransition_51 is true.
After SMT solving in domain Real declared 241/241 variables, and 167 constraints, problems are : Problem set: 2 solved, 38 unsolved in 1105 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 38 unsolved
SDD proceeding with computation,42 properties remain. new max is 512
SDD size :1.19278e+06 after 2.07666e+06
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 21/66 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 21/87 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 123/210 variables, 87/89 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 47/136 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 13/149 constraints. Problems are: Problem set: 2 solved, 38 unsolved
[2024-05-21 13:05:42] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 2 ms to minimize.
[2024-05-21 13:05:42] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-05-21 13:05:42] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 0 ms to minimize.
[2024-05-21 13:05:42] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 1 ms to minimize.
[2024-05-21 13:05:42] [INFO ] Deduced a trap composed of 37 places in 29 ms of which 1 ms to minimize.
[2024-05-21 13:05:42] [INFO ] Deduced a trap composed of 37 places in 28 ms of which 0 ms to minimize.
[2024-05-21 13:05:42] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 1 ms to minimize.
[2024-05-21 13:05:42] [INFO ] Deduced a trap composed of 38 places in 27 ms of which 1 ms to minimize.
[2024-05-21 13:05:42] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
[2024-05-21 13:05:42] [INFO ] Deduced a trap composed of 37 places in 27 ms of which 0 ms to minimize.
[2024-05-21 13:05:42] [INFO ] Deduced a trap composed of 37 places in 28 ms of which 1 ms to minimize.
[2024-05-21 13:05:42] [INFO ] Deduced a trap composed of 37 places in 28 ms of which 1 ms to minimize.
[2024-05-21 13:05:42] [INFO ] Deduced a trap composed of 37 places in 28 ms of which 1 ms to minimize.
Reachability property qltransition_110 is true.
Reachability property qltransition_28 is true.
SDD proceeding with computation,40 properties remain. new max is 512
SDD size :2.07666e+06 after 3.41869e+06
[2024-05-21 13:05:42] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-05-21 13:05:42] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 1 ms to minimize.
[2024-05-21 13:05:42] [INFO ] Deduced a trap composed of 39 places in 29 ms of which 0 ms to minimize.
[2024-05-21 13:05:42] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 1 ms to minimize.
[2024-05-21 13:05:43] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
[2024-05-21 13:05:43] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 1 ms to minimize.
[2024-05-21 13:05:43] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 20/169 constraints. Problems are: Problem set: 2 solved, 38 unsolved
[2024-05-21 13:05:43] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 0 ms to minimize.
Reachability property qltransition_136 is true.
[2024-05-21 13:05:43] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 0 ms to minimize.
Reachability property qltransition_133 is true.
SDD proceeding with computation,38 properties remain. new max is 512
SDD size :3.41869e+06 after 4.02986e+06
[2024-05-21 13:05:43] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 0 ms to minimize.
[2024-05-21 13:05:43] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 0 ms to minimize.
[2024-05-21 13:05:43] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-05-21 13:05:43] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-05-21 13:05:43] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-05-21 13:05:43] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 1 ms to minimize.
[2024-05-21 13:05:43] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 0 ms to minimize.
[2024-05-21 13:05:43] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 0 ms to minimize.
[2024-05-21 13:05:43] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
[2024-05-21 13:05:43] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 0 ms to minimize.
SDD proceeding with computation,38 properties remain. new max is 1024
SDD size :4.02986e+06 after 4.44817e+06
[2024-05-21 13:05:43] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 3 ms to minimize.
[2024-05-21 13:05:43] [INFO ] Deduced a trap composed of 38 places in 27 ms of which 0 ms to minimize.
[2024-05-21 13:05:43] [INFO ] Deduced a trap composed of 39 places in 27 ms of which 0 ms to minimize.
[2024-05-21 13:05:43] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-05-21 13:05:43] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
[2024-05-21 13:05:44] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 1 ms to minimize.
[2024-05-21 13:05:44] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 0 ms to minimize.
[2024-05-21 13:05:44] [INFO ] Deduced a trap composed of 38 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 20/189 constraints. Problems are: Problem set: 4 solved, 36 unsolved
[2024-05-21 13:05:44] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2024-05-21 13:05:44] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 7 ms to minimize.
[2024-05-21 13:05:44] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
[2024-05-21 13:05:44] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 0 ms to minimize.
SDD proceeding with computation,38 properties remain. new max is 2048
SDD size :4.44817e+06 after 6.37294e+06
[2024-05-21 13:05:44] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 1 ms to minimize.
[2024-05-21 13:05:44] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 0 ms to minimize.
[2024-05-21 13:05:44] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 0 ms to minimize.
[2024-05-21 13:05:44] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 0 ms to minimize.
[2024-05-21 13:05:44] [INFO ] Deduced a trap composed of 39 places in 29 ms of which 1 ms to minimize.
[2024-05-21 13:05:44] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
[2024-05-21 13:05:44] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-05-21 13:05:44] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2024-05-21 13:05:44] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 13/202 constraints. Problems are: Problem set: 4 solved, 36 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 0/202 constraints. Problems are: Problem set: 4 solved, 36 unsolved
At refinement iteration 12 (OVERLAPS) 31/241 variables, 15/217 constraints. Problems are: Problem set: 4 solved, 36 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/241 variables, 16/233 constraints. Problems are: Problem set: 4 solved, 36 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/241 variables, 25/258 constraints. Problems are: Problem set: 4 solved, 36 unsolved
SDD proceeding with computation,38 properties remain. new max is 4096
SDD size :6.37294e+06 after 8.08088e+06
At refinement iteration 15 (INCLUDED_ONLY) 0/241 variables, 0/258 constraints. Problems are: Problem set: 4 solved, 36 unsolved
At refinement iteration 16 (OVERLAPS) 0/241 variables, 0/258 constraints. Problems are: Problem set: 4 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/241 variables, and 258 constraints, problems are : Problem set: 4 solved, 36 unsolved in 4925 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 38/40 constraints, Known Traps: 53/53 constraints]
After SMT, in 6077ms problems are : Problem set: 4 solved, 36 unsolved
Fused 36 Parikh solutions to 33 different solutions.
Reachability property qltransition_120 is true.
Reachability property qltransition_118 is true.
Reachability property qltransition_116 is true.
Reachability property qltransition_114 is true.
Reachability property qltransition_86 is true.
Reachability property qltransition_23 is true.
Reachability property qltransition_22 is true.
SDD proceeding with computation,31 properties remain. new max is 4096
SDD size :8.08088e+06 after 1.27079e+07
Parikh walk visited 1 properties in 1526 ms.
Support contains 36 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 139/139 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 93 transition count 124
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 93 transition count 124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 91 transition count 122
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 91 transition count 122
Applied a total of 22 rules in 18 ms. Remains 91 /102 variables (removed 11) and now considering 122/139 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 91/102 places, 122/139 transitions.
Reachability property qltransition_138 is true.
Reachability property qltransition_137 is true.
Reachability property qltransition_135 is true.
Reachability property qltransition_134 is true.
Reachability property qltransition_106 is true.
Reachability property qltransition_105 is true.
Reachability property qltransition_90 is true.
Reachability property qltransition_27 is true.
SDD proceeding with computation,23 properties remain. new max is 4096
SDD size :1.27079e+07 after 2.34261e+07
Reachability property qltransition_73 is true.
SDD proceeding with computation,22 properties remain. new max is 4096
SDD size :2.34261e+07 after 2.85377e+07
RANDOM walk for 4000000 steps (915766 resets) in 22596 ms. (177 steps per ms) remains 11/31 properties
Reachability property qltransition_74 is true.
SDD proceeding with computation,21 properties remain. new max is 4096
SDD size :2.85377e+07 after 3.857e+07
BEST_FIRST walk for 4000001 steps (197226 resets) in 6909 ms. (578 steps per ms) remains 6/11 properties
SDD proceeding with computation,21 properties remain. new max is 8192
SDD size :3.857e+07 after 4.1711e+07
BEST_FIRST walk for 4000003 steps (197951 resets) in 4202 ms. (951 steps per ms) remains 2/6 properties
Reachability property qltransition_78 is true.
Reachability property qltransition_77 is true.
SDD proceeding with computation,19 properties remain. new max is 8192
SDD size :4.1711e+07 after 5.84712e+07
BEST_FIRST walk for 4000000 steps (800000 resets) in 5712 ms. (700 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000003 steps (405819 resets) in 2944 ms. (1358 steps per ms) remains 1/2 properties
// Phase 1: matrix 122 rows 91 cols
[2024-05-21 13:06:04] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 13:06:04] [INFO ] State equation strengthened by 52 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) 33/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 85/146 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 15/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 59/205 variables, 26/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 33/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/213 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/213 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/213 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 145 constraints, problems are : Problem set: 0 solved, 1 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 52/52 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) 33/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 85/146 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 15/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 59/205 variables, 26/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 33/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/213 variables, 4/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/213 variables, 4/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 146 constraints, problems are : Problem set: 0 solved, 1 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 182ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 122/122 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 77 transition count 96
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 77 transition count 96
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 38 place count 67 transition count 86
Iterating global reduction 0 with 10 rules applied. Total rules applied 48 place count 67 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 67 transition count 84
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 53 place count 64 transition count 78
Iterating global reduction 1 with 3 rules applied. Total rules applied 56 place count 64 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 64 transition count 77
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 62 transition count 74
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 62 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 60 transition count 72
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 60 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 60 transition count 70
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 59 transition count 69
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 71 place count 59 transition count 67
Applied a total of 71 rules in 22 ms. Remains 59 /91 variables (removed 32) and now considering 67/122 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 59/91 places, 67/122 transitions.
Reachability property qltransition_79 is true.
SDD proceeding with computation,18 properties remain. new max is 8192
SDD size :5.84712e+07 after 7.14761e+07
RANDOM walk for 3595181 steps (824004 resets) in 4275 ms. (840 steps per ms) remains 0/1 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query QuasiLiveness after proving 91 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK DECISION_DIAGRAMS COLLATERAL_PROCESSING BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 44374 ms.

BK_STOP 1716296766745

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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-d0m08"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="itstools"
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 itstools"
echo " Input is DBSingleClientW-PT-d0m08, 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 r101-tall-171624201600292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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