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-165286033700082.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 ShieldIIPs-PT-040A, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-165286033700082
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.0K Apr 29 15:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 29 15:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 29 15:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 29 15:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 9 08:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 9 08:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:49 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 338K 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 1653032350660

Running Version 202205111006
[2022-05-20 07:39:11] [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 07:39:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 07:39:12] [INFO ] Load time of PNML (sax parser for PT used): 234 ms
[2022-05-20 07:39:12] [INFO ] Transformed 1003 places.
[2022-05-20 07:39:12] [INFO ] Transformed 963 transitions.
[2022-05-20 07:39:12] [INFO ] Found NUPN structural information;
[2022-05-20 07:39:12] [INFO ] Parsed PT model containing 1003 places and 963 transitions in 364 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1003/1003 places, 963/963 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 1003 transition count 962
Deduced a syphon composed of 1 places in 23 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 962
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 4 place count 1001 transition count 961
Applied a total of 4 rules in 198 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
// Phase 1: matrix 961 rows 1001 cols
[2022-05-20 07:39:12] [INFO ] Computed 361 place invariants in 30 ms
[2022-05-20 07:39:13] [INFO ] Implicit Places using invariants in 804 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 834 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 1000/1003 places, 961/963 transitions.
Applied a total of 0 rules in 62 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1000/1003 places, 961/963 transitions.
Discarding 240 transitions out of 961. Remains 721
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 742 ms. (steps per millisecond=13 ) properties (out of 720) seen :676
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 44) 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 44) 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 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 44) 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 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 44) 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 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 44) 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 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 44) 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 44) 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 44) 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 44) 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 44) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 44) 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 44) 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 44) 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 44) 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 44) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 44) 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 44) 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 44) 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 44) seen :0
Running SMT prover for 44 properties.
// Phase 1: matrix 961 rows 1000 cols
[2022-05-20 07:39:14] [INFO ] Computed 360 place invariants in 11 ms
[2022-05-20 07:39:15] [INFO ] [Real]Absence check using 360 positive place invariants in 57 ms returned sat
[2022-05-20 07:39:19] [INFO ] After 4813ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:44
[2022-05-20 07:39:20] [INFO ] [Nat]Absence check using 360 positive place invariants in 63 ms returned sat
[2022-05-20 07:39:26] [INFO ] After 5361ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :44
[2022-05-20 07:39:26] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 11 ms to minimize.
[2022-05-20 07:39:26] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2022-05-20 07:39:26] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2022-05-20 07:39:26] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2022-05-20 07:39:26] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2022-05-20 07:39:27] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 0 ms to minimize.
[2022-05-20 07:39:27] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 0 ms to minimize.
[2022-05-20 07:39:27] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2022-05-20 07:39:27] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2022-05-20 07:39:27] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
[2022-05-20 07:39:27] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2022-05-20 07:39:27] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2022-05-20 07:39:27] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 0 ms to minimize.
[2022-05-20 07:39:27] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1368 ms
[2022-05-20 07:39:28] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2022-05-20 07:39:28] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 0 ms to minimize.
[2022-05-20 07:39:28] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2022-05-20 07:39:28] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2022-05-20 07:39:28] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2022-05-20 07:39:29] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2022-05-20 07:39:29] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 0 ms to minimize.
[2022-05-20 07:39:29] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2022-05-20 07:39:29] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2022-05-20 07:39:29] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2022-05-20 07:39:29] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2022-05-20 07:39:29] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2022-05-20 07:39:29] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 0 ms to minimize.
[2022-05-20 07:39:29] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2022-05-20 07:39:30] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 0 ms to minimize.
[2022-05-20 07:39:30] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 0 ms to minimize.
[2022-05-20 07:39:30] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2022-05-20 07:39:30] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 0 ms to minimize.
[2022-05-20 07:39:30] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2022-05-20 07:39:30] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2022-05-20 07:39:30] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2022-05-20 07:39:31] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 2 ms to minimize.
[2022-05-20 07:39:31] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2022-05-20 07:39:31] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 0 ms to minimize.
[2022-05-20 07:39:31] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2022-05-20 07:39:31] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 0 ms to minimize.
[2022-05-20 07:39:31] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2022-05-20 07:39:31] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2022-05-20 07:39:31] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2022-05-20 07:39:32] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2022-05-20 07:39:32] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 3898 ms
[2022-05-20 07:39:32] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2022-05-20 07:39:32] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2022-05-20 07:39:32] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2022-05-20 07:39:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 279 ms
[2022-05-20 07:39:33] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2022-05-20 07:39:33] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2022-05-20 07:39:33] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2022-05-20 07:39:33] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 0 ms to minimize.
[2022-05-20 07:39:33] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 0 ms to minimize.
[2022-05-20 07:39:33] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 0 ms to minimize.
[2022-05-20 07:39:34] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2022-05-20 07:39:34] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2022-05-20 07:39:34] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2022-05-20 07:39:34] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2022-05-20 07:39:34] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 3 ms to minimize.
[2022-05-20 07:39:34] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2022-05-20 07:39:34] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1728 ms
[2022-05-20 07:39:35] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 0 ms to minimize.
[2022-05-20 07:39:35] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 0 ms to minimize.
[2022-05-20 07:39:35] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 0 ms to minimize.
[2022-05-20 07:39:35] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2022-05-20 07:39:35] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2022-05-20 07:39:35] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
[2022-05-20 07:39:36] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 1 ms to minimize.
[2022-05-20 07:39:36] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2022-05-20 07:39:36] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 909 ms
[2022-05-20 07:39:36] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2022-05-20 07:39:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2022-05-20 07:39:37] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2022-05-20 07:39:37] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2022-05-20 07:39:37] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2022-05-20 07:39:37] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2022-05-20 07:39:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 458 ms
[2022-05-20 07:39:38] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2022-05-20 07:39:41] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2022-05-20 07:39:41] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2022-05-20 07:39:41] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2022-05-20 07:39:41] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2022-05-20 07:39:42] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2022-05-20 07:39:42] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2022-05-20 07:39:42] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2022-05-20 07:39:42] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2022-05-20 07:39:42] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3664 ms
[2022-05-20 07:39:42] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2022-05-20 07:39:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2022-05-20 07:39:43] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
[2022-05-20 07:39:43] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2022-05-20 07:39:43] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2022-05-20 07:39:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 374 ms
[2022-05-20 07:39:44] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2022-05-20 07:39:44] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2022-05-20 07:39:44] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2022-05-20 07:39:44] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 0 ms to minimize.
[2022-05-20 07:39:44] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 0 ms to minimize.
[2022-05-20 07:39:44] [INFO ] Deduced a trap composed of 3 places in 446 ms of which 1 ms to minimize.
[2022-05-20 07:39:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 07:39:44] [INFO ] After 25462ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:44
Parikh walk visited 9 properties in 30828 ms.
Support contains 98 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Partial Free-agglomeration rule applied 219 times.
Drop transitions removed 219 transitions
Iterating global reduction 0 with 219 rules applied. Total rules applied 219 place count 1000 transition count 961
Applied a total of 219 rules in 204 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 961/961 transitions.
Finished random walk after 18872 steps, including 7 resets, run visited all 35 properties in 729 ms. (steps per millisecond=25 )
Able to resolve query QuasiLiveness after proving 721 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 64881 ms.

BK_STOP 1653032416741

--------------------
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="ShieldIIPs-PT-040A"
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 ShieldIIPs-PT-040A, 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-165286033700082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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