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.r233-tall-165286037500306.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 gold2021
Input is ShieldRVs-PT-020B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-165286037500306
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 7.7K Apr 30 06:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 30 06:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 30 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 30 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 30 06:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 30 06:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 30 06:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Apr 30 06:40 ReachabilityFireability.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 244K 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

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-00
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-01
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-02
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-03
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-04
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-05
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-06
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-07
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-08
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-09
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-10
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-11
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-12
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-13
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-14
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655078340832

Running Version 0
[2022-06-12 23:59:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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, 3600]
[2022-06-12 23:59:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 23:59:02] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2022-06-12 23:59:02] [INFO ] Transformed 803 places.
[2022-06-12 23:59:02] [INFO ] Transformed 903 transitions.
[2022-06-12 23:59:02] [INFO ] Found NUPN structural information;
[2022-06-12 23:59:02] [INFO ] Parsed PT model containing 803 places and 903 transitions in 146 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 11 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 16) seen :8
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :1
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :1
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 903 rows 803 cols
[2022-06-12 23:59:03] [INFO ] Computed 81 place invariants in 33 ms
[2022-06-12 23:59:03] [INFO ] [Real]Absence check using 81 positive place invariants in 44 ms returned sat
[2022-06-12 23:59:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:59:03] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2022-06-12 23:59:04] [INFO ] Deduced a trap composed of 28 places in 269 ms of which 4 ms to minimize.
[2022-06-12 23:59:04] [INFO ] Deduced a trap composed of 28 places in 234 ms of which 2 ms to minimize.
[2022-06-12 23:59:04] [INFO ] Deduced a trap composed of 20 places in 208 ms of which 1 ms to minimize.
[2022-06-12 23:59:04] [INFO ] Deduced a trap composed of 20 places in 205 ms of which 2 ms to minimize.
[2022-06-12 23:59:05] [INFO ] Deduced a trap composed of 20 places in 198 ms of which 1 ms to minimize.
[2022-06-12 23:59:05] [INFO ] Deduced a trap composed of 29 places in 199 ms of which 1 ms to minimize.
[2022-06-12 23:59:05] [INFO ] Deduced a trap composed of 28 places in 173 ms of which 1 ms to minimize.
[2022-06-12 23:59:05] [INFO ] Deduced a trap composed of 27 places in 177 ms of which 2 ms to minimize.
[2022-06-12 23:59:06] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 1 ms to minimize.
[2022-06-12 23:59:06] [INFO ] Deduced a trap composed of 25 places in 153 ms of which 1 ms to minimize.
[2022-06-12 23:59:06] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 1 ms to minimize.
[2022-06-12 23:59:06] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 1 ms to minimize.
[2022-06-12 23:59:06] [INFO ] Deduced a trap composed of 35 places in 138 ms of which 0 ms to minimize.
[2022-06-12 23:59:07] [INFO ] Deduced a trap composed of 47 places in 146 ms of which 1 ms to minimize.
[2022-06-12 23:59:07] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 0 ms to minimize.
[2022-06-12 23:59:07] [INFO ] Deduced a trap composed of 53 places in 115 ms of which 0 ms to minimize.
[2022-06-12 23:59:07] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 0 ms to minimize.
[2022-06-12 23:59:07] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 1 ms to minimize.
[2022-06-12 23:59:07] [INFO ] Deduced a trap composed of 55 places in 111 ms of which 1 ms to minimize.
[2022-06-12 23:59:07] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 0 ms to minimize.
[2022-06-12 23:59:08] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 0 ms to minimize.
[2022-06-12 23:59:08] [INFO ] Deduced a trap composed of 14 places in 265 ms of which 1 ms to minimize.
[2022-06-12 23:59:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2022-06-12 23:59:08] [INFO ] [Real]Absence check using 81 positive place invariants in 29 ms returned sat
[2022-06-12 23:59:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:59:08] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2022-06-12 23:59:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:59:09] [INFO ] [Nat]Absence check using 81 positive place invariants in 33 ms returned sat
[2022-06-12 23:59:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:59:09] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2022-06-12 23:59:09] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 1 ms to minimize.
[2022-06-12 23:59:09] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 0 ms to minimize.
[2022-06-12 23:59:09] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 1 ms to minimize.
[2022-06-12 23:59:09] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 1 ms to minimize.
[2022-06-12 23:59:10] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 1 ms to minimize.
[2022-06-12 23:59:10] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 0 ms to minimize.
[2022-06-12 23:59:10] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 0 ms to minimize.
[2022-06-12 23:59:10] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 0 ms to minimize.
[2022-06-12 23:59:10] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 0 ms to minimize.
[2022-06-12 23:59:10] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 1 ms to minimize.
[2022-06-12 23:59:10] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 0 ms to minimize.
[2022-06-12 23:59:11] [INFO ] Deduced a trap composed of 54 places in 102 ms of which 1 ms to minimize.
[2022-06-12 23:59:11] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 5 ms to minimize.
[2022-06-12 23:59:11] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 0 ms to minimize.
[2022-06-12 23:59:11] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 0 ms to minimize.
[2022-06-12 23:59:11] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2022-06-12 23:59:11] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2022-06-12 23:59:11] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 1 ms to minimize.
[2022-06-12 23:59:12] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 1 ms to minimize.
[2022-06-12 23:59:12] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2022-06-12 23:59:12] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 0 ms to minimize.
[2022-06-12 23:59:12] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2022-06-12 23:59:12] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 0 ms to minimize.
[2022-06-12 23:59:12] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2022-06-12 23:59:12] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
[2022-06-12 23:59:12] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 0 ms to minimize.
[2022-06-12 23:59:12] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 1 ms to minimize.
[2022-06-12 23:59:12] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2022-06-12 23:59:12] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 0 ms to minimize.
[2022-06-12 23:59:13] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 0 ms to minimize.
[2022-06-12 23:59:13] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 0 ms to minimize.
[2022-06-12 23:59:13] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 0 ms to minimize.
[2022-06-12 23:59:13] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 0 ms to minimize.
[2022-06-12 23:59:13] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 2 ms to minimize.
[2022-06-12 23:59:13] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 0 ms to minimize.
[2022-06-12 23:59:13] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 0 ms to minimize.
[2022-06-12 23:59:13] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 1 ms to minimize.
[2022-06-12 23:59:13] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
[2022-06-12 23:59:13] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 4548 ms
[2022-06-12 23:59:13] [INFO ] Computed and/alt/rep : 902/2659/902 causal constraints (skipped 0 transitions) in 49 ms.
[2022-06-12 23:59:13] [INFO ] Added : 0 causal constraints over 0 iterations in 50 ms. Result :unknown
[2022-06-12 23:59:14] [INFO ] [Real]Absence check using 81 positive place invariants in 30 ms returned sat
[2022-06-12 23:59:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:59:14] [INFO ] [Real]Absence check using state equation in 355 ms returned sat
[2022-06-12 23:59:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:59:14] [INFO ] [Nat]Absence check using 81 positive place invariants in 36 ms returned sat
[2022-06-12 23:59:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:59:14] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2022-06-12 23:59:15] [INFO ] Deduced a trap composed of 30 places in 154 ms of which 0 ms to minimize.
[2022-06-12 23:59:15] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 0 ms to minimize.
[2022-06-12 23:59:15] [INFO ] Deduced a trap composed of 40 places in 155 ms of which 0 ms to minimize.
[2022-06-12 23:59:15] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 1 ms to minimize.
[2022-06-12 23:59:15] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 0 ms to minimize.
[2022-06-12 23:59:16] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 1 ms to minimize.
[2022-06-12 23:59:16] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 0 ms to minimize.
[2022-06-12 23:59:16] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 1 ms to minimize.
[2022-06-12 23:59:16] [INFO ] Deduced a trap composed of 28 places in 154 ms of which 0 ms to minimize.
[2022-06-12 23:59:16] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 1 ms to minimize.
[2022-06-12 23:59:16] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 1 ms to minimize.
[2022-06-12 23:59:17] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 0 ms to minimize.
[2022-06-12 23:59:17] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 1 ms to minimize.
[2022-06-12 23:59:17] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 1 ms to minimize.
[2022-06-12 23:59:17] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 0 ms to minimize.
[2022-06-12 23:59:17] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 1 ms to minimize.
[2022-06-12 23:59:18] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 1 ms to minimize.
[2022-06-12 23:59:18] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 0 ms to minimize.
[2022-06-12 23:59:18] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 1 ms to minimize.
[2022-06-12 23:59:18] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 1 ms to minimize.
[2022-06-12 23:59:18] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 1 ms to minimize.
[2022-06-12 23:59:18] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 0 ms to minimize.
[2022-06-12 23:59:19] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 1 ms to minimize.
[2022-06-12 23:59:19] [INFO ] Deduced a trap composed of 67 places in 118 ms of which 1 ms to minimize.
[2022-06-12 23:59:19] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 0 ms to minimize.
[2022-06-12 23:59:19] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 1 ms to minimize.
[2022-06-12 23:59:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2022-06-12 23:59:19] [INFO ] [Real]Absence check using 81 positive place invariants in 30 ms returned sat
[2022-06-12 23:59:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:59:19] [INFO ] [Real]Absence check using state equation in 336 ms returned sat
[2022-06-12 23:59:20] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 1 ms to minimize.
[2022-06-12 23:59:20] [INFO ] Deduced a trap composed of 33 places in 172 ms of which 1 ms to minimize.
[2022-06-12 23:59:20] [INFO ] Deduced a trap composed of 33 places in 165 ms of which 1 ms to minimize.
[2022-06-12 23:59:20] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 0 ms to minimize.
[2022-06-12 23:59:20] [INFO ] Deduced a trap composed of 28 places in 164 ms of which 1 ms to minimize.
[2022-06-12 23:59:21] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 1 ms to minimize.
[2022-06-12 23:59:21] [INFO ] Deduced a trap composed of 34 places in 137 ms of which 1 ms to minimize.
[2022-06-12 23:59:21] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 0 ms to minimize.
[2022-06-12 23:59:21] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 1 ms to minimize.
[2022-06-12 23:59:21] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 1 ms to minimize.
[2022-06-12 23:59:21] [INFO ] Deduced a trap composed of 48 places in 107 ms of which 1 ms to minimize.
[2022-06-12 23:59:22] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 0 ms to minimize.
[2022-06-12 23:59:22] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 1 ms to minimize.
[2022-06-12 23:59:22] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 1 ms to minimize.
[2022-06-12 23:59:22] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 1 ms to minimize.
[2022-06-12 23:59:22] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 0 ms to minimize.
[2022-06-12 23:59:22] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 1 ms to minimize.
[2022-06-12 23:59:22] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 3 ms to minimize.
[2022-06-12 23:59:22] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 0 ms to minimize.
[2022-06-12 23:59:23] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 0 ms to minimize.
[2022-06-12 23:59:23] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 1 ms to minimize.
[2022-06-12 23:59:23] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 1 ms to minimize.
[2022-06-12 23:59:23] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2022-06-12 23:59:23] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2022-06-12 23:59:23] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3600 ms
[2022-06-12 23:59:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:59:23] [INFO ] [Nat]Absence check using 81 positive place invariants in 34 ms returned sat
[2022-06-12 23:59:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:59:24] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
[2022-06-12 23:59:24] [INFO ] Deduced a trap composed of 34 places in 151 ms of which 1 ms to minimize.
[2022-06-12 23:59:24] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 1 ms to minimize.
[2022-06-12 23:59:24] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 1 ms to minimize.
[2022-06-12 23:59:24] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 1 ms to minimize.
[2022-06-12 23:59:24] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 1 ms to minimize.
[2022-06-12 23:59:25] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 1 ms to minimize.
[2022-06-12 23:59:25] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 0 ms to minimize.
[2022-06-12 23:59:25] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 0 ms to minimize.
[2022-06-12 23:59:25] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 1 ms to minimize.
[2022-06-12 23:59:25] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 1 ms to minimize.
[2022-06-12 23:59:25] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 0 ms to minimize.
[2022-06-12 23:59:25] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2022-06-12 23:59:25] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2022-06-12 23:59:26] [INFO ] Deduced a trap composed of 46 places in 32 ms of which 0 ms to minimize.
[2022-06-12 23:59:26] [INFO ] Deduced a trap composed of 45 places in 31 ms of which 0 ms to minimize.
[2022-06-12 23:59:26] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 0 ms to minimize.
[2022-06-12 23:59:26] [INFO ] Deduced a trap composed of 43 places in 28 ms of which 0 ms to minimize.
[2022-06-12 23:59:26] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2158 ms
[2022-06-12 23:59:26] [INFO ] Computed and/alt/rep : 902/2659/902 causal constraints (skipped 0 transitions) in 55 ms.
[2022-06-12 23:59:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2022-06-12 23:59:28] [INFO ] [Real]Absence check using 81 positive place invariants in 38 ms returned sat
[2022-06-12 23:59:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:59:29] [INFO ] [Real]Absence check using state equation in 708 ms returned sat
[2022-06-12 23:59:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:59:29] [INFO ] [Nat]Absence check using 81 positive place invariants in 40 ms returned sat
[2022-06-12 23:59:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:59:30] [INFO ] [Nat]Absence check using state equation in 703 ms returned sat
[2022-06-12 23:59:30] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 0 ms to minimize.
[2022-06-12 23:59:30] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 0 ms to minimize.
[2022-06-12 23:59:30] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 0 ms to minimize.
[2022-06-12 23:59:31] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 0 ms to minimize.
[2022-06-12 23:59:31] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 1 ms to minimize.
[2022-06-12 23:59:31] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 0 ms to minimize.
[2022-06-12 23:59:31] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 1 ms to minimize.
[2022-06-12 23:59:31] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 0 ms to minimize.
[2022-06-12 23:59:31] [INFO ] Deduced a trap composed of 51 places in 132 ms of which 1 ms to minimize.
[2022-06-12 23:59:32] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 0 ms to minimize.
[2022-06-12 23:59:32] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 1 ms to minimize.
[2022-06-12 23:59:32] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 1 ms to minimize.
[2022-06-12 23:59:32] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 1 ms to minimize.
[2022-06-12 23:59:32] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 1 ms to minimize.
[2022-06-12 23:59:32] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 1 ms to minimize.
[2022-06-12 23:59:32] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 0 ms to minimize.
[2022-06-12 23:59:33] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 0 ms to minimize.
[2022-06-12 23:59:33] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2022-06-12 23:59:33] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 0 ms to minimize.
[2022-06-12 23:59:33] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 0 ms to minimize.
[2022-06-12 23:59:33] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 1 ms to minimize.
[2022-06-12 23:59:33] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 1 ms to minimize.
[2022-06-12 23:59:33] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 1 ms to minimize.
[2022-06-12 23:59:34] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 0 ms to minimize.
[2022-06-12 23:59:34] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 0 ms to minimize.
[2022-06-12 23:59:34] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 1 ms to minimize.
[2022-06-12 23:59:34] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 0 ms to minimize.
[2022-06-12 23:59:34] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 0 ms to minimize.
[2022-06-12 23:59:34] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 0 ms to minimize.
[2022-06-12 23:59:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2022-06-12 23:59:34] [INFO ] [Real]Absence check using 81 positive place invariants in 30 ms returned sat
[2022-06-12 23:59:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:59:35] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2022-06-12 23:59:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:59:35] [INFO ] [Nat]Absence check using 81 positive place invariants in 61 ms returned sat
[2022-06-12 23:59:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:59:35] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2022-06-12 23:59:35] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 1 ms to minimize.
[2022-06-12 23:59:36] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 0 ms to minimize.
[2022-06-12 23:59:36] [INFO ] Deduced a trap composed of 28 places in 150 ms of which 0 ms to minimize.
[2022-06-12 23:59:36] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 0 ms to minimize.
[2022-06-12 23:59:36] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 1 ms to minimize.
[2022-06-12 23:59:36] [INFO ] Deduced a trap composed of 65 places in 128 ms of which 0 ms to minimize.
[2022-06-12 23:59:36] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 1 ms to minimize.
[2022-06-12 23:59:37] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 0 ms to minimize.
[2022-06-12 23:59:37] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 1 ms to minimize.
[2022-06-12 23:59:37] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 1 ms to minimize.
[2022-06-12 23:59:37] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 0 ms to minimize.
[2022-06-12 23:59:37] [INFO ] Deduced a trap composed of 51 places in 125 ms of which 0 ms to minimize.
[2022-06-12 23:59:37] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 1 ms to minimize.
[2022-06-12 23:59:37] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 1 ms to minimize.
[2022-06-12 23:59:38] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 0 ms to minimize.
[2022-06-12 23:59:38] [INFO ] Deduced a trap composed of 46 places in 110 ms of which 1 ms to minimize.
[2022-06-12 23:59:38] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 1 ms to minimize.
[2022-06-12 23:59:38] [INFO ] Deduced a trap composed of 63 places in 116 ms of which 0 ms to minimize.
[2022-06-12 23:59:38] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 0 ms to minimize.
[2022-06-12 23:59:38] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2022-06-12 23:59:38] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 0 ms to minimize.
[2022-06-12 23:59:39] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 1 ms to minimize.
[2022-06-12 23:59:39] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 0 ms to minimize.
[2022-06-12 23:59:39] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2022-06-12 23:59:39] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 0 ms to minimize.
[2022-06-12 23:59:39] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 3734 ms
[2022-06-12 23:59:39] [INFO ] Computed and/alt/rep : 902/2659/902 causal constraints (skipped 0 transitions) in 46 ms.
[2022-06-12 23:59:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
Fused 6 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 51300 steps, including 183 resets, run finished after 177 ms. (steps per millisecond=289 ) properties (out of 6) seen :0 could not realise parikh vector
Support contains 167 out of 803 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 803/803 places, 903/903 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 803 transition count 844
Reduce places removed 59 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 66 rules applied. Total rules applied 125 place count 744 transition count 837
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 132 place count 737 transition count 837
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 83 Pre rules applied. Total rules applied 132 place count 737 transition count 754
Deduced a syphon composed of 83 places in 3 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 298 place count 654 transition count 754
Discarding 106 places :
Symmetric choice reduction at 3 with 106 rule applications. Total rules 404 place count 548 transition count 648
Iterating global reduction 3 with 106 rules applied. Total rules applied 510 place count 548 transition count 648
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 510 place count 548 transition count 628
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 550 place count 528 transition count 628
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 2 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 222 rules applied. Total rules applied 772 place count 417 transition count 517
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 792 place count 417 transition count 517
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 793 place count 416 transition count 516
Applied a total of 793 rules in 181 ms. Remains 416 /803 variables (removed 387) and now considering 516/903 (removed 387) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/803 places, 516/903 transitions.
[2022-06-12 23:59:40] [INFO ] Flatten gal took : 81 ms
[2022-06-12 23:59:40] [INFO ] Flatten gal took : 42 ms
[2022-06-12 23:59:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11848118201405974220.gal : 22 ms
[2022-06-12 23:59:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5199643156124005508.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality11848118201405974220.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5199643156124005508.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality11848118201405974220.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5199643156124005508.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality5199643156124005508.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :7 after 13
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :13 after 108
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :108 after 5620
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :5620 after 2.42612e+06
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :2.42612e+06 after 1.57369e+12
Detected timeout of ITS tools.
[2022-06-12 23:59:55] [INFO ] Flatten gal took : 38 ms
[2022-06-12 23:59:55] [INFO ] Applying decomposition
[2022-06-12 23:59:55] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16841940430453861169.txt, -o, /tmp/graph16841940430453861169.bin, -w, /tmp/graph16841940430453861169.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph16841940430453861169.bin, -l, -1, -v, -w, /tmp/graph16841940430453861169.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 23:59:56] [INFO ] Decomposing Gal with order
[2022-06-12 23:59:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 23:59:56] [INFO ] Removed a total of 663 redundant transitions.
[2022-06-12 23:59:56] [INFO ] Flatten gal took : 128 ms
[2022-06-12 23:59:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 87 labels/synchronizations in 27 ms.
[2022-06-12 23:59:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11274965848069157049.gal : 10 ms
[2022-06-12 23:59:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7270133911577834677.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality11274965848069157049.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7270133911577834677.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality11274965848069157049.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7270133911577834677.prop --nowitness
Loading property file /tmp/ReachabilityCardinality7270133911577834677.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1 after 21
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :21 after 178
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :178 after 4605
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :4605 after 3.06011e+08
Reachability property ShieldRVs-PT-020B-ReachabilityFireability-14 is true.
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :3.55894e+18 after 3.01245e+20
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11510057428110903176
[2022-06-13 00:00:11] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11510057428110903176
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11510057428110903176]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11510057428110903176] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11510057428110903176] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2179 resets, run finished after 3129 ms. (steps per millisecond=319 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 214 resets, run finished after 2119 ms. (steps per millisecond=471 ) properties (out of 5) seen :1
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 224 resets, run finished after 1454 ms. (steps per millisecond=687 ) properties (out of 4) seen :1
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 206 resets, run finished after 1662 ms. (steps per millisecond=601 ) properties (out of 3) seen :1
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 203 resets, run finished after 1904 ms. (steps per millisecond=525 ) properties (out of 2) seen :1
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 50909 steps, including 10 resets, run visited all 1 properties in 146 ms. (steps per millisecond=348 )
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.

BK_STOP 1655078423732

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -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 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-020B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 gold2021"
echo " Input is ShieldRVs-PT-020B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r233-tall-165286037500306"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-020B.tgz
mv ShieldRVs-PT-020B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;