Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r448-tajo-167905989600097.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is ShieldRVs-PT-050B, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r448-tajo-167905989600097
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1020K
-rw-r--r-- 1 mcc users 7.9K Feb 26 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 18:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 18:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 625K Mar 5 18:23 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 1679476732215

Running Version 202205111006
[2023-03-22 09:18:53] [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]
[2023-03-22 09:18:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 09:18:53] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2023-03-22 09:18:54] [INFO ] Transformed 2003 places.
[2023-03-22 09:18:54] [INFO ] Transformed 2253 transitions.
[2023-03-22 09:18:54] [INFO ] Found NUPN structural information;
[2023-03-22 09:18:54] [INFO ] Parsed PT model containing 2003 places and 2253 transitions in 339 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 2003/2003 places, 2253/2253 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2003 transition count 2052
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1802 transition count 2052
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 402 place count 1802 transition count 1802
Deduced a syphon composed of 250 places in 29 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 902 place count 1552 transition count 1802
Discarding 350 places :
Symmetric choice reduction at 2 with 350 rule applications. Total rules 1252 place count 1202 transition count 1452
Iterating global reduction 2 with 350 rules applied. Total rules applied 1602 place count 1202 transition count 1452
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 1602 place count 1202 transition count 1302
Deduced a syphon composed of 150 places in 5 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 1902 place count 1052 transition count 1302
Performed 350 Post agglomeration using F-continuation condition.Transition count delta: 350
Deduced a syphon composed of 350 places in 2 ms
Reduce places removed 350 places and 0 transitions.
Iterating global reduction 2 with 700 rules applied. Total rules applied 2602 place count 702 transition count 952
Renaming transitions due to excessive name length > 1024 char.
Applied a total of 2602 rules in 574 ms. Remains 702 /2003 variables (removed 1301) and now considering 952/2253 (removed 1301) transitions.
// Phase 1: matrix 952 rows 702 cols
[2023-03-22 09:18:54] [INFO ] Computed 201 place invariants in 31 ms
[2023-03-22 09:18:55] [INFO ] Implicit Places using invariants in 584 ms returned []
// Phase 1: matrix 952 rows 702 cols
[2023-03-22 09:18:55] [INFO ] Computed 201 place invariants in 7 ms
[2023-03-22 09:18:56] [INFO ] Implicit Places using invariants and state equation in 805 ms returned []
Implicit Place search using SMT with State Equation took 1436 ms to find 0 implicit places.
// Phase 1: matrix 952 rows 702 cols
[2023-03-22 09:18:56] [INFO ] Computed 201 place invariants in 17 ms
[2023-03-22 09:18:56] [INFO ] Dead Transitions using invariants and state equation in 737 ms found 0 transitions.
Starting structural reductions in LIVENESS mode, iteration 1 : 702/2003 places, 952/2253 transitions.
Finished structural reductions, in 1 iterations. Remains : 702/2003 places, 952/2253 transitions.
Discarding 300 transitions out of 952. Remains 652
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 842 ms. (steps per millisecond=11 ) properties (out of 651) seen :556
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 95) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 95) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 95) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 95) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 95) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 95) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 95) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 95) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 95) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 95) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 95) 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 95) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 95) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 95) 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 95) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 95) 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 95) 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 95) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 95) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 95) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 95) 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 95) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 95) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 95) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 95) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 95) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 94) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 94) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 94) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 93) 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 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 93) 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 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 93) 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 93) 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 93) 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 93) 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 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 93) 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 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 93) 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 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 93) seen :0
Running SMT prover for 93 properties.
// Phase 1: matrix 952 rows 702 cols
[2023-03-22 09:18:59] [INFO ] Computed 201 place invariants in 7 ms
[2023-03-22 09:19:00] [INFO ] [Real]Absence check using 201 positive place invariants in 41 ms returned sat
[2023-03-22 09:19:07] [INFO ] After 7828ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:93
[2023-03-22 09:19:08] [INFO ] [Nat]Absence check using 201 positive place invariants in 30 ms returned sat
[2023-03-22 09:19:13] [INFO ] After 4454ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :93
[2023-03-22 09:19:14] [INFO ] Deduced a trap composed of 7 places in 641 ms of which 11 ms to minimize.
[2023-03-22 09:19:14] [INFO ] Deduced a trap composed of 8 places in 200 ms of which 2 ms to minimize.
[2023-03-22 09:19:14] [INFO ] Deduced a trap composed of 7 places in 187 ms of which 2 ms to minimize.
[2023-03-22 09:19:14] [INFO ] Deduced a trap composed of 11 places in 208 ms of which 2 ms to minimize.
[2023-03-22 09:19:15] [INFO ] Deduced a trap composed of 8 places in 194 ms of which 2 ms to minimize.
[2023-03-22 09:19:15] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 0 ms to minimize.
[2023-03-22 09:19:15] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 1 ms to minimize.
[2023-03-22 09:19:15] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 1 ms to minimize.
[2023-03-22 09:19:15] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 1 ms to minimize.
[2023-03-22 09:19:16] [INFO ] Deduced a trap composed of 27 places in 221 ms of which 0 ms to minimize.
[2023-03-22 09:19:16] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 0 ms to minimize.
[2023-03-22 09:19:16] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 0 ms to minimize.
[2023-03-22 09:19:16] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 1 ms to minimize.
[2023-03-22 09:19:16] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 1 ms to minimize.
[2023-03-22 09:19:17] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 1 ms to minimize.
[2023-03-22 09:19:17] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 0 ms to minimize.
[2023-03-22 09:19:17] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 1 ms to minimize.
[2023-03-22 09:19:17] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 1 ms to minimize.
[2023-03-22 09:19:17] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 1 ms to minimize.
[2023-03-22 09:19:18] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 0 ms to minimize.
[2023-03-22 09:19:18] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2023-03-22 09:19:18] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 1 ms to minimize.
[2023-03-22 09:19:18] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 0 ms to minimize.
[2023-03-22 09:19:18] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 1 ms to minimize.
[2023-03-22 09:19:18] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2023-03-22 09:19:19] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 0 ms to minimize.
[2023-03-22 09:19:19] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 0 ms to minimize.
[2023-03-22 09:19:19] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 0 ms to minimize.
[2023-03-22 09:19:19] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 0 ms to minimize.
[2023-03-22 09:19:19] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 1 ms to minimize.
[2023-03-22 09:19:20] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 0 ms to minimize.
[2023-03-22 09:19:20] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 1 ms to minimize.
[2023-03-22 09:19:20] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 1 ms to minimize.
[2023-03-22 09:19:20] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 0 ms to minimize.
[2023-03-22 09:19:20] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 0 ms to minimize.
[2023-03-22 09:19:20] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 1 ms to minimize.
[2023-03-22 09:19:21] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 0 ms to minimize.
[2023-03-22 09:19:21] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 1 ms to minimize.
[2023-03-22 09:19:21] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 0 ms to minimize.
[2023-03-22 09:19:21] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 2 ms to minimize.
[2023-03-22 09:19:21] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 1 ms to minimize.
[2023-03-22 09:19:22] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 0 ms to minimize.
[2023-03-22 09:19:22] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 2 ms to minimize.
[2023-03-22 09:19:22] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 1 ms to minimize.
[2023-03-22 09:19:22] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 1 ms to minimize.
[2023-03-22 09:19:22] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 1 ms to minimize.
[2023-03-22 09:19:23] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 0 ms to minimize.
[2023-03-22 09:19:23] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 0 ms to minimize.
[2023-03-22 09:19:23] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 1 ms to minimize.
[2023-03-22 09:19:23] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 0 ms to minimize.
[2023-03-22 09:19:23] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 1 ms to minimize.
[2023-03-22 09:19:23] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 0 ms to minimize.
[2023-03-22 09:19:24] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 0 ms to minimize.
[2023-03-22 09:19:24] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 0 ms to minimize.
[2023-03-22 09:19:24] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 0 ms to minimize.
[2023-03-22 09:19:24] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 4 ms to minimize.
[2023-03-22 09:19:24] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 0 ms to minimize.
[2023-03-22 09:19:24] [INFO ] Deduced a trap composed of 43 places in 151 ms of which 0 ms to minimize.
[2023-03-22 09:19:25] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 0 ms to minimize.
[2023-03-22 09:19:25] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 0 ms to minimize.
[2023-03-22 09:19:25] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2023-03-22 09:19:25] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 0 ms to minimize.
[2023-03-22 09:19:25] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 0 ms to minimize.
[2023-03-22 09:19:25] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 1 ms to minimize.
[2023-03-22 09:19:26] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 1 ms to minimize.
[2023-03-22 09:19:26] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 0 ms to minimize.
[2023-03-22 09:19:26] [INFO ] Deduced a trap composed of 47 places in 154 ms of which 1 ms to minimize.
[2023-03-22 09:19:26] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 2 ms to minimize.
[2023-03-22 09:19:26] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 4 ms to minimize.
[2023-03-22 09:19:27] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 1 ms to minimize.
[2023-03-22 09:19:27] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 0 ms to minimize.
[2023-03-22 09:19:27] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 0 ms to minimize.
[2023-03-22 09:19:27] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 1 ms to minimize.
[2023-03-22 09:19:27] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 1 ms to minimize.
[2023-03-22 09:19:27] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 1 ms to minimize.
[2023-03-22 09:19:28] [INFO ] Deduced a trap composed of 47 places in 126 ms of which 0 ms to minimize.
[2023-03-22 09:19:28] [INFO ] Deduced a trap composed of 47 places in 131 ms of which 1 ms to minimize.
[2023-03-22 09:19:28] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 0 ms to minimize.
[2023-03-22 09:19:28] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 1 ms to minimize.
[2023-03-22 09:19:28] [INFO ] Deduced a trap composed of 19 places in 174 ms of which 0 ms to minimize.
[2023-03-22 09:19:29] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 1 ms to minimize.
[2023-03-22 09:19:29] [INFO ] Deduced a trap composed of 28 places in 177 ms of which 1 ms to minimize.
[2023-03-22 09:19:29] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 1 ms to minimize.
[2023-03-22 09:19:29] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 0 ms to minimize.
[2023-03-22 09:19:29] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 1 ms to minimize.
[2023-03-22 09:19:30] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 1 ms to minimize.
[2023-03-22 09:19:30] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 0 ms to minimize.
[2023-03-22 09:19:30] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 1 ms to minimize.
[2023-03-22 09:19:30] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 1 ms to minimize.
[2023-03-22 09:19:30] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 0 ms to minimize.
[2023-03-22 09:19:31] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 0 ms to minimize.
[2023-03-22 09:19:31] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2023-03-22 09:19:31] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 0 ms to minimize.
[2023-03-22 09:19:31] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 1 ms to minimize.
[2023-03-22 09:19:31] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 0 ms to minimize.
[2023-03-22 09:19:31] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 0 ms to minimize.
[2023-03-22 09:19:32] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 1 ms to minimize.
[2023-03-22 09:19:32] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 0 ms to minimize.
[2023-03-22 09:19:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 09:19:32] [INFO ] After 25105ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:93
Parikh walk visited 13 properties in 30406 ms.
Support contains 213 out of 702 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 702/702 places, 952/952 transitions.
Partial Free-agglomeration rule applied 65 times.
Drop transitions removed 65 transitions
Iterating global reduction 0 with 65 rules applied. Total rules applied 65 place count 702 transition count 952
Applied a total of 65 rules in 135 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 702/702 places, 952/952 transitions.
Finished random walk after 33762 steps, including 56 resets, run visited all 80 properties in 1385 ms. (steps per millisecond=24 )
Able to resolve query QuasiLiveness after proving 652 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 70596 ms.

BK_STOP 1679476804531

--------------------
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-050B"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is ShieldRVs-PT-050B, 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 r448-tajo-167905989600097"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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