Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r229-tall-165286034500512.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldRVs-PT-030A, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-165286034500512
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 7.4K Apr 30 06:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 30 06:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 30 06:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 30 06:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 08:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 191K May 10 09:34 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 1653037946787

Running Version 202205111006
[2022-05-20 09:12:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2022-05-20 09:12:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 09:12:28] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2022-05-20 09:12:28] [INFO ] Transformed 423 places.
[2022-05-20 09:12:28] [INFO ] Transformed 573 transitions.
[2022-05-20 09:12:28] [INFO ] Found NUPN structural information;
[2022-05-20 09:12:28] [INFO ] Parsed PT model containing 423 places and 573 transitions in 219 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 423/423 places, 573/573 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 422 transition count 572
Applied a total of 2 rules in 94 ms. Remains 422 /423 variables (removed 1) and now considering 572/573 (removed 1) transitions.
// Phase 1: matrix 572 rows 422 cols
[2022-05-20 09:12:28] [INFO ] Computed 121 place invariants in 17 ms
[2022-05-20 09:12:28] [INFO ] Implicit Places using invariants in 397 ms returned []
// Phase 1: matrix 572 rows 422 cols
[2022-05-20 09:12:28] [INFO ] Computed 121 place invariants in 5 ms
[2022-05-20 09:12:29] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 830 ms to find 0 implicit places.
// Phase 1: matrix 572 rows 422 cols
[2022-05-20 09:12:29] [INFO ] Computed 121 place invariants in 11 ms
[2022-05-20 09:12:29] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Starting structural reductions in LIVENESS mode, iteration 1 : 422/423 places, 572/573 transitions.
Finished structural reductions, in 1 iterations. Remains : 422/423 places, 572/573 transitions.
Discarding 180 transitions out of 572. Remains 392
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 24 resets, run finished after 548 ms. (steps per millisecond=18 ) properties (out of 391) seen :370
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
// Phase 1: matrix 572 rows 422 cols
[2022-05-20 09:12:30] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 09:12:30] [INFO ] [Real]Absence check using 121 positive place invariants in 14 ms returned sat
[2022-05-20 09:12:31] [INFO ] After 1094ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2022-05-20 09:12:31] [INFO ] [Nat]Absence check using 121 positive place invariants in 27 ms returned sat
[2022-05-20 09:12:32] [INFO ] After 864ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2022-05-20 09:12:32] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 4 ms to minimize.
[2022-05-20 09:12:32] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 2 ms to minimize.
[2022-05-20 09:12:32] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2022-05-20 09:12:32] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2022-05-20 09:12:33] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 0 ms to minimize.
[2022-05-20 09:12:33] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 0 ms to minimize.
[2022-05-20 09:12:33] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 0 ms to minimize.
[2022-05-20 09:12:33] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 0 ms to minimize.
[2022-05-20 09:12:33] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2022-05-20 09:12:33] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 826 ms
[2022-05-20 09:12:33] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2022-05-20 09:12:33] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2022-05-20 09:12:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 129 ms
[2022-05-20 09:12:33] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2022-05-20 09:12:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2022-05-20 09:12:34] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 0 ms to minimize.
[2022-05-20 09:12:34] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 0 ms to minimize.
[2022-05-20 09:12:34] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 0 ms to minimize.
[2022-05-20 09:12:34] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 0 ms to minimize.
[2022-05-20 09:12:34] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 0 ms to minimize.
[2022-05-20 09:12:35] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 1 ms to minimize.
[2022-05-20 09:12:35] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 1 ms to minimize.
[2022-05-20 09:12:35] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2022-05-20 09:12:35] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 0 ms to minimize.
[2022-05-20 09:12:35] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 0 ms to minimize.
[2022-05-20 09:12:35] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 0 ms to minimize.
[2022-05-20 09:12:35] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2022-05-20 09:12:35] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 0 ms to minimize.
[2022-05-20 09:12:35] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 0 ms to minimize.
[2022-05-20 09:12:35] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 0 ms to minimize.
[2022-05-20 09:12:36] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 0 ms to minimize.
[2022-05-20 09:12:36] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2022-05-20 09:12:36] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2022-05-20 09:12:36] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2022-05-20 09:12:36] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2022-05-20 09:12:36] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 0 ms to minimize.
[2022-05-20 09:12:36] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2022-05-20 09:12:36] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 0 ms to minimize.
[2022-05-20 09:12:36] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 0 ms to minimize.
[2022-05-20 09:12:36] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2022-05-20 09:12:37] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2022-05-20 09:12:37] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 0 ms to minimize.
[2022-05-20 09:12:37] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2022-05-20 09:12:37] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 0 ms to minimize.
[2022-05-20 09:12:37] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 0 ms to minimize.
[2022-05-20 09:12:37] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2022-05-20 09:12:37] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 0 ms to minimize.
[2022-05-20 09:12:37] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2022-05-20 09:12:37] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 0 ms to minimize.
[2022-05-20 09:12:37] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 0 ms to minimize.
[2022-05-20 09:12:38] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 0 ms to minimize.
[2022-05-20 09:12:38] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2022-05-20 09:12:38] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2022-05-20 09:12:38] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2022-05-20 09:12:38] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 0 ms to minimize.
[2022-05-20 09:12:38] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
[2022-05-20 09:12:38] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2022-05-20 09:12:38] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2022-05-20 09:12:38] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 3 ms to minimize.
[2022-05-20 09:12:38] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 1 ms to minimize.
[2022-05-20 09:12:39] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 0 ms to minimize.
[2022-05-20 09:12:39] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 0 ms to minimize.
[2022-05-20 09:12:39] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 0 ms to minimize.
[2022-05-20 09:12:39] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 0 ms to minimize.
[2022-05-20 09:12:39] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 1 ms to minimize.
[2022-05-20 09:12:39] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2022-05-20 09:12:39] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2022-05-20 09:12:39] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2022-05-20 09:12:39] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 1 ms to minimize.
[2022-05-20 09:12:40] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2022-05-20 09:12:40] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 0 ms to minimize.
[2022-05-20 09:12:40] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 0 ms to minimize.
[2022-05-20 09:12:40] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 0 ms to minimize.
[2022-05-20 09:12:40] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 0 ms to minimize.
[2022-05-20 09:12:40] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 0 ms to minimize.
[2022-05-20 09:12:40] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 0 ms to minimize.
[2022-05-20 09:12:40] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 0 ms to minimize.
[2022-05-20 09:12:40] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 0 ms to minimize.
[2022-05-20 09:12:41] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 0 ms to minimize.
[2022-05-20 09:12:41] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 0 ms to minimize.
[2022-05-20 09:12:41] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 1 ms to minimize.
[2022-05-20 09:12:41] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 0 ms to minimize.
[2022-05-20 09:12:41] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 0 ms to minimize.
[2022-05-20 09:12:41] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 1 ms to minimize.
[2022-05-20 09:12:41] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 0 ms to minimize.
[2022-05-20 09:12:41] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 0 ms to minimize.
[2022-05-20 09:12:42] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 0 ms to minimize.
[2022-05-20 09:12:42] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 0 ms to minimize.
[2022-05-20 09:12:42] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 0 ms to minimize.
[2022-05-20 09:12:42] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 0 ms to minimize.
[2022-05-20 09:12:42] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 0 ms to minimize.
[2022-05-20 09:12:42] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 0 ms to minimize.
[2022-05-20 09:12:42] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 0 ms to minimize.
[2022-05-20 09:12:42] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 1 ms to minimize.
[2022-05-20 09:12:42] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 0 ms to minimize.
[2022-05-20 09:12:43] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 0 ms to minimize.
[2022-05-20 09:12:43] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 1 ms to minimize.
[2022-05-20 09:12:43] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 0 ms to minimize.
[2022-05-20 09:12:43] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 0 ms to minimize.
[2022-05-20 09:12:43] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 0 ms to minimize.
[2022-05-20 09:12:43] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 1 ms to minimize.
[2022-05-20 09:12:43] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 1 ms to minimize.
[2022-05-20 09:12:43] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 0 ms to minimize.
[2022-05-20 09:12:43] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2022-05-20 09:12:44] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 0 ms to minimize.
[2022-05-20 09:12:44] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 1 ms to minimize.
[2022-05-20 09:12:44] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 1 ms to minimize.
[2022-05-20 09:12:44] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 0 ms to minimize.
[2022-05-20 09:12:44] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 0 ms to minimize.
[2022-05-20 09:12:44] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
[2022-05-20 09:12:44] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 0 ms to minimize.
[2022-05-20 09:12:44] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 0 ms to minimize.
[2022-05-20 09:12:45] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2022-05-20 09:12:45] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 0 ms to minimize.
[2022-05-20 09:12:45] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 0 ms to minimize.
[2022-05-20 09:12:45] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 1 ms to minimize.
[2022-05-20 09:12:45] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 0 ms to minimize.
[2022-05-20 09:12:45] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 0 ms to minimize.
[2022-05-20 09:12:45] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 0 ms to minimize.
[2022-05-20 09:12:45] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 0 ms to minimize.
[2022-05-20 09:12:45] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 1 ms to minimize.
[2022-05-20 09:12:45] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2022-05-20 09:12:46] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2022-05-20 09:12:46] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 0 ms to minimize.
[2022-05-20 09:12:46] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 0 ms to minimize.
[2022-05-20 09:12:46] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2022-05-20 09:12:46] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2022-05-20 09:12:46] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2022-05-20 09:12:46] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 0 ms to minimize.
[2022-05-20 09:12:46] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2022-05-20 09:12:46] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 0 ms to minimize.
[2022-05-20 09:12:46] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 0 ms to minimize.
[2022-05-20 09:12:46] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 0 ms to minimize.
[2022-05-20 09:12:47] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
[2022-05-20 09:12:47] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2022-05-20 09:12:47] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2022-05-20 09:12:47] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2022-05-20 09:12:47] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2022-05-20 09:12:47] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2022-05-20 09:12:47] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2022-05-20 09:12:47] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2022-05-20 09:12:47] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 0 ms to minimize.
[2022-05-20 09:12:47] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2022-05-20 09:12:47] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 0 ms to minimize.
[2022-05-20 09:12:47] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 0 ms to minimize.
[2022-05-20 09:12:47] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2022-05-20 09:12:48] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2022-05-20 09:12:48] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2022-05-20 09:12:48] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2022-05-20 09:12:48] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2022-05-20 09:12:48] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2022-05-20 09:12:48] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2022-05-20 09:12:48] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2022-05-20 09:12:48] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2022-05-20 09:12:48] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2022-05-20 09:12:48] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2022-05-20 09:12:48] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2022-05-20 09:12:48] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 0 ms to minimize.
[2022-05-20 09:12:48] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 0 ms to minimize.
[2022-05-20 09:12:49] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 0 ms to minimize.
[2022-05-20 09:12:49] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 0 ms to minimize.
[2022-05-20 09:12:49] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2022-05-20 09:12:49] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 0 ms to minimize.
[2022-05-20 09:12:49] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 0 ms to minimize.
[2022-05-20 09:12:49] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 0 ms to minimize.
[2022-05-20 09:12:49] [INFO ] Trap strengthening (SAT) tested/added 151/150 trap constraints in 15159 ms
[2022-05-20 09:12:49] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2022-05-20 09:12:49] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2022-05-20 09:12:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 120 ms
[2022-05-20 09:12:49] [INFO ] After 18007ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :21
Attempting to minimize the solution found.
Minimization took 791 ms.
[2022-05-20 09:12:50] [INFO ] After 19254ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :21
Parikh walk visited 0 properties in 2933 ms.
Support contains 63 out of 422 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 422/422 places, 572/572 transitions.
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 0 with 50 rules applied. Total rules applied 50 place count 422 transition count 572
Applied a total of 50 rules in 55 ms. Remains 422 /422 variables (removed 0) and now considering 572/572 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 422/422 places, 572/572 transitions.
Finished random walk after 7142 steps, including 19 resets, run visited all 21 properties in 237 ms. (steps per millisecond=30 )
Able to resolve query QuasiLiveness after proving 392 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 25830 ms.

BK_STOP 1653037973842

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination QuasiLiveness -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="ShieldRVs-PT-030A"
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-4028"
echo " Executing tool itstools"
echo " Input is ShieldRVs-PT-030A, 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 r229-tall-165286034500512"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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