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-165286037600371.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 ShieldRVt-PT-020B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-165286037600371
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 5.1K Apr 30 00:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Apr 30 00:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 30 00:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 30 00:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 09:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 09:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 09:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 30 00:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 30 00:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 30 00:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 30 00:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:01 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 239K 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 ShieldRVt-PT-020B-ReachabilityCardinality-00
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-01
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-02
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-03
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-04
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-05
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-06
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-07
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-08
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-09
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-10
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-11
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-12
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-13
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-14
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655081306964

Running Version 0
[2022-06-13 00:48:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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-13 00:48:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 00:48:28] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2022-06-13 00:48:28] [INFO ] Transformed 1003 places.
[2022-06-13 00:48:28] [INFO ] Transformed 1003 transitions.
[2022-06-13 00:48:28] [INFO ] Found NUPN structural information;
[2022-06-13 00:48:28] [INFO ] Parsed PT model containing 1003 places and 1003 transitions in 148 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 90 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 14) seen :3
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1003 rows 1003 cols
[2022-06-13 00:48:29] [INFO ] Computed 81 place invariants in 33 ms
[2022-06-13 00:48:29] [INFO ] [Real]Absence check using 81 positive place invariants in 51 ms returned sat
[2022-06-13 00:48:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:48:29] [INFO ] [Real]Absence check using state equation in 366 ms returned sat
[2022-06-13 00:48:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:48:30] [INFO ] [Real]Absence check using 81 positive place invariants in 42 ms returned sat
[2022-06-13 00:48:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:48:30] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2022-06-13 00:48:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:48:31] [INFO ] [Nat]Absence check using 81 positive place invariants in 36 ms returned sat
[2022-06-13 00:48:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:48:31] [INFO ] [Nat]Absence check using state equation in 389 ms returned sat
[2022-06-13 00:48:31] [INFO ] Deduced a trap composed of 34 places in 260 ms of which 4 ms to minimize.
[2022-06-13 00:48:32] [INFO ] Deduced a trap composed of 35 places in 221 ms of which 2 ms to minimize.
[2022-06-13 00:48:32] [INFO ] Deduced a trap composed of 35 places in 210 ms of which 1 ms to minimize.
[2022-06-13 00:48:32] [INFO ] Deduced a trap composed of 36 places in 207 ms of which 2 ms to minimize.
[2022-06-13 00:48:32] [INFO ] Deduced a trap composed of 35 places in 205 ms of which 1 ms to minimize.
[2022-06-13 00:48:32] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 0 ms to minimize.
[2022-06-13 00:48:33] [INFO ] Deduced a trap composed of 36 places in 204 ms of which 1 ms to minimize.
[2022-06-13 00:48:33] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 1 ms to minimize.
[2022-06-13 00:48:33] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 1 ms to minimize.
[2022-06-13 00:48:33] [INFO ] Deduced a trap composed of 44 places in 165 ms of which 1 ms to minimize.
[2022-06-13 00:48:34] [INFO ] Deduced a trap composed of 45 places in 159 ms of which 1 ms to minimize.
[2022-06-13 00:48:34] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 1 ms to minimize.
[2022-06-13 00:48:34] [INFO ] Deduced a trap composed of 54 places in 140 ms of which 0 ms to minimize.
[2022-06-13 00:48:34] [INFO ] Deduced a trap composed of 46 places in 150 ms of which 0 ms to minimize.
[2022-06-13 00:48:34] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 1 ms to minimize.
[2022-06-13 00:48:35] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 1 ms to minimize.
[2022-06-13 00:48:35] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 0 ms to minimize.
[2022-06-13 00:48:35] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 1 ms to minimize.
[2022-06-13 00:48:35] [INFO ] Deduced a trap composed of 51 places in 133 ms of which 1 ms to minimize.
[2022-06-13 00:48:35] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 1 ms to minimize.
[2022-06-13 00:48:35] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 1 ms to minimize.
[2022-06-13 00:48:35] [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 1
[2022-06-13 00:48:36] [INFO ] [Real]Absence check using 81 positive place invariants in 42 ms returned sat
[2022-06-13 00:48:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:48:36] [INFO ] [Real]Absence check using state equation in 569 ms returned sat
[2022-06-13 00:48:36] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 1 ms to minimize.
[2022-06-13 00:48:37] [INFO ] Deduced a trap composed of 41 places in 202 ms of which 1 ms to minimize.
[2022-06-13 00:48:37] [INFO ] Deduced a trap composed of 30 places in 173 ms of which 1 ms to minimize.
[2022-06-13 00:48:37] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 0 ms to minimize.
[2022-06-13 00:48:37] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 1 ms to minimize.
[2022-06-13 00:48:38] [INFO ] Deduced a trap composed of 36 places in 208 ms of which 1 ms to minimize.
[2022-06-13 00:48:38] [INFO ] Deduced a trap composed of 25 places in 171 ms of which 0 ms to minimize.
[2022-06-13 00:48:38] [INFO ] Deduced a trap composed of 26 places in 170 ms of which 1 ms to minimize.
[2022-06-13 00:48:38] [INFO ] Deduced a trap composed of 29 places in 155 ms of which 1 ms to minimize.
[2022-06-13 00:48:38] [INFO ] Deduced a trap composed of 36 places in 134 ms of which 0 ms to minimize.
[2022-06-13 00:48:39] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 1 ms to minimize.
[2022-06-13 00:48:39] [INFO ] Deduced a trap composed of 37 places in 146 ms of which 1 ms to minimize.
[2022-06-13 00:48:39] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 1 ms to minimize.
[2022-06-13 00:48:39] [INFO ] Deduced a trap composed of 33 places in 149 ms of which 0 ms to minimize.
[2022-06-13 00:48:39] [INFO ] Deduced a trap composed of 44 places in 150 ms of which 1 ms to minimize.
[2022-06-13 00:48:40] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 0 ms to minimize.
[2022-06-13 00:48:40] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 1 ms to minimize.
[2022-06-13 00:48:40] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 1 ms to minimize.
[2022-06-13 00:48:40] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 0 ms to minimize.
[2022-06-13 00:48:40] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 0 ms to minimize.
[2022-06-13 00:48:40] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 0 ms to minimize.
[2022-06-13 00:48:41] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 0 ms to minimize.
[2022-06-13 00:48:41] [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-13 00:48:41] [INFO ] [Real]Absence check using 81 positive place invariants in 33 ms returned sat
[2022-06-13 00:48:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:48:41] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2022-06-13 00:48:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:48:41] [INFO ] [Nat]Absence check using 81 positive place invariants in 37 ms returned sat
[2022-06-13 00:48:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:48:42] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
[2022-06-13 00:48:42] [INFO ] Deduced a trap composed of 51 places in 205 ms of which 1 ms to minimize.
[2022-06-13 00:48:42] [INFO ] Deduced a trap composed of 30 places in 198 ms of which 0 ms to minimize.
[2022-06-13 00:48:42] [INFO ] Deduced a trap composed of 35 places in 197 ms of which 0 ms to minimize.
[2022-06-13 00:48:43] [INFO ] Deduced a trap composed of 29 places in 181 ms of which 1 ms to minimize.
[2022-06-13 00:48:43] [INFO ] Deduced a trap composed of 42 places in 189 ms of which 0 ms to minimize.
[2022-06-13 00:48:43] [INFO ] Deduced a trap composed of 42 places in 185 ms of which 0 ms to minimize.
[2022-06-13 00:48:43] [INFO ] Deduced a trap composed of 52 places in 178 ms of which 1 ms to minimize.
[2022-06-13 00:48:44] [INFO ] Deduced a trap composed of 29 places in 187 ms of which 2 ms to minimize.
[2022-06-13 00:48:44] [INFO ] Deduced a trap composed of 45 places in 174 ms of which 0 ms to minimize.
[2022-06-13 00:48:44] [INFO ] Deduced a trap composed of 36 places in 169 ms of which 1 ms to minimize.
[2022-06-13 00:48:44] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 1 ms to minimize.
[2022-06-13 00:48:44] [INFO ] Deduced a trap composed of 30 places in 159 ms of which 1 ms to minimize.
[2022-06-13 00:48:45] [INFO ] Deduced a trap composed of 40 places in 161 ms of which 1 ms to minimize.
[2022-06-13 00:48:45] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 1 ms to minimize.
[2022-06-13 00:48:45] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 1 ms to minimize.
[2022-06-13 00:48:45] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 0 ms to minimize.
[2022-06-13 00:48:45] [INFO ] Deduced a trap composed of 47 places in 148 ms of which 0 ms to minimize.
[2022-06-13 00:48:45] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 0 ms to minimize.
[2022-06-13 00:48:46] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 0 ms to minimize.
[2022-06-13 00:48:46] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 0 ms to minimize.
[2022-06-13 00:48:46] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 1 ms to minimize.
[2022-06-13 00:48:46] [INFO ] Deduced a trap composed of 42 places in 131 ms of which 0 ms to minimize.
[2022-06-13 00:48:46] [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-13 00:48:46] [INFO ] [Real]Absence check using 81 positive place invariants in 33 ms returned sat
[2022-06-13 00:48:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:48:47] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2022-06-13 00:48:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:48:47] [INFO ] [Nat]Absence check using 81 positive place invariants in 35 ms returned sat
[2022-06-13 00:48:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:48:47] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2022-06-13 00:48:48] [INFO ] Deduced a trap composed of 34 places in 193 ms of which 2 ms to minimize.
[2022-06-13 00:48:48] [INFO ] Deduced a trap composed of 33 places in 195 ms of which 2 ms to minimize.
[2022-06-13 00:48:48] [INFO ] Deduced a trap composed of 32 places in 180 ms of which 0 ms to minimize.
[2022-06-13 00:48:48] [INFO ] Deduced a trap composed of 35 places in 182 ms of which 3 ms to minimize.
[2022-06-13 00:48:48] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 1 ms to minimize.
[2022-06-13 00:48:49] [INFO ] Deduced a trap composed of 40 places in 180 ms of which 1 ms to minimize.
[2022-06-13 00:48:49] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 1 ms to minimize.
[2022-06-13 00:48:49] [INFO ] Deduced a trap composed of 44 places in 178 ms of which 1 ms to minimize.
[2022-06-13 00:48:49] [INFO ] Deduced a trap composed of 31 places in 169 ms of which 0 ms to minimize.
[2022-06-13 00:48:49] [INFO ] Deduced a trap composed of 25 places in 163 ms of which 1 ms to minimize.
[2022-06-13 00:48:50] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 1 ms to minimize.
[2022-06-13 00:48:50] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 1 ms to minimize.
[2022-06-13 00:48:50] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 1 ms to minimize.
[2022-06-13 00:48:50] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 0 ms to minimize.
[2022-06-13 00:48:50] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 0 ms to minimize.
[2022-06-13 00:48:51] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 1 ms to minimize.
[2022-06-13 00:48:51] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 1 ms to minimize.
[2022-06-13 00:48:51] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 1 ms to minimize.
[2022-06-13 00:48:51] [INFO ] Deduced a trap composed of 33 places in 144 ms of which 1 ms to minimize.
[2022-06-13 00:48:51] [INFO ] Deduced a trap composed of 29 places in 146 ms of which 1 ms to minimize.
[2022-06-13 00:48:52] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 1 ms to minimize.
[2022-06-13 00:48:52] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 0 ms to minimize.
[2022-06-13 00:48:52] [INFO ] Deduced a trap composed of 63 places in 140 ms of which 1 ms to minimize.
[2022-06-13 00:48:52] [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-13 00:48:52] [INFO ] [Real]Absence check using 81 positive place invariants in 41 ms returned sat
[2022-06-13 00:48:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:48:53] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2022-06-13 00:48:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:48:53] [INFO ] [Real]Absence check using 81 positive place invariants in 34 ms returned sat
[2022-06-13 00:48:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:48:53] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2022-06-13 00:48:54] [INFO ] Deduced a trap composed of 37 places in 203 ms of which 0 ms to minimize.
[2022-06-13 00:48:54] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 0 ms to minimize.
[2022-06-13 00:48:54] [INFO ] Deduced a trap composed of 40 places in 190 ms of which 1 ms to minimize.
[2022-06-13 00:48:54] [INFO ] Deduced a trap composed of 31 places in 184 ms of which 0 ms to minimize.
[2022-06-13 00:48:54] [INFO ] Deduced a trap composed of 28 places in 185 ms of which 1 ms to minimize.
[2022-06-13 00:48:55] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 1 ms to minimize.
[2022-06-13 00:48:55] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 1 ms to minimize.
[2022-06-13 00:48:55] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 0 ms to minimize.
[2022-06-13 00:48:55] [INFO ] Deduced a trap composed of 33 places in 178 ms of which 1 ms to minimize.
[2022-06-13 00:48:56] [INFO ] Deduced a trap composed of 50 places in 166 ms of which 1 ms to minimize.
[2022-06-13 00:48:56] [INFO ] Deduced a trap composed of 39 places in 166 ms of which 1 ms to minimize.
[2022-06-13 00:48:56] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 1 ms to minimize.
[2022-06-13 00:48:56] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 1 ms to minimize.
[2022-06-13 00:48:56] [INFO ] Deduced a trap composed of 50 places in 148 ms of which 0 ms to minimize.
[2022-06-13 00:48:57] [INFO ] Deduced a trap composed of 34 places in 145 ms of which 1 ms to minimize.
[2022-06-13 00:48:57] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 1 ms to minimize.
[2022-06-13 00:48:57] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 1 ms to minimize.
[2022-06-13 00:48:57] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 1 ms to minimize.
[2022-06-13 00:48:57] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 1 ms to minimize.
[2022-06-13 00:48:57] [INFO ] Deduced a trap composed of 30 places in 143 ms of which 1 ms to minimize.
[2022-06-13 00:48:58] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 0 ms to minimize.
[2022-06-13 00:48:58] [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 6
[2022-06-13 00:48:58] [INFO ] [Real]Absence check using 81 positive place invariants in 37 ms returned sat
[2022-06-13 00:48:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:48:59] [INFO ] [Real]Absence check using state equation in 709 ms returned sat
[2022-06-13 00:48:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:48:59] [INFO ] [Real]Absence check using 81 positive place invariants in 33 ms returned sat
[2022-06-13 00:48:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:48:59] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2022-06-13 00:48:59] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 1 ms to minimize.
[2022-06-13 00:49:00] [INFO ] Deduced a trap composed of 35 places in 194 ms of which 1 ms to minimize.
[2022-06-13 00:49:00] [INFO ] Deduced a trap composed of 43 places in 188 ms of which 1 ms to minimize.
[2022-06-13 00:49:00] [INFO ] Deduced a trap composed of 42 places in 182 ms of which 1 ms to minimize.
[2022-06-13 00:49:00] [INFO ] Deduced a trap composed of 74 places in 182 ms of which 0 ms to minimize.
[2022-06-13 00:49:01] [INFO ] Deduced a trap composed of 53 places in 178 ms of which 1 ms to minimize.
[2022-06-13 00:49:01] [INFO ] Deduced a trap composed of 34 places in 175 ms of which 0 ms to minimize.
[2022-06-13 00:49:01] [INFO ] Deduced a trap composed of 30 places in 174 ms of which 0 ms to minimize.
[2022-06-13 00:49:01] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 1 ms to minimize.
[2022-06-13 00:49:01] [INFO ] Deduced a trap composed of 29 places in 171 ms of which 0 ms to minimize.
[2022-06-13 00:49:02] [INFO ] Deduced a trap composed of 50 places in 171 ms of which 0 ms to minimize.
[2022-06-13 00:49:02] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 1 ms to minimize.
[2022-06-13 00:49:02] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 1 ms to minimize.
[2022-06-13 00:49:02] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 1 ms to minimize.
[2022-06-13 00:49:02] [INFO ] Deduced a trap composed of 26 places in 160 ms of which 1 ms to minimize.
[2022-06-13 00:49:03] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 0 ms to minimize.
[2022-06-13 00:49:03] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 0 ms to minimize.
[2022-06-13 00:49:03] [INFO ] Deduced a trap composed of 42 places in 144 ms of which 1 ms to minimize.
[2022-06-13 00:49:03] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 0 ms to minimize.
[2022-06-13 00:49:03] [INFO ] Deduced a trap composed of 58 places in 145 ms of which 0 ms to minimize.
[2022-06-13 00:49:04] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 0 ms to minimize.
[2022-06-13 00:49:04] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 0 ms to minimize.
[2022-06-13 00:49:04] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 0 ms to minimize.
[2022-06-13 00:49:04] [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 8
[2022-06-13 00:49:04] [INFO ] [Real]Absence check using 81 positive place invariants in 35 ms returned sat
[2022-06-13 00:49:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:49:04] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2022-06-13 00:49:05] [INFO ] Deduced a trap composed of 29 places in 183 ms of which 0 ms to minimize.
[2022-06-13 00:49:05] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 0 ms to minimize.
[2022-06-13 00:49:05] [INFO ] Deduced a trap composed of 34 places in 183 ms of which 1 ms to minimize.
[2022-06-13 00:49:05] [INFO ] Deduced a trap composed of 38 places in 181 ms of which 0 ms to minimize.
[2022-06-13 00:49:06] [INFO ] Deduced a trap composed of 28 places in 176 ms of which 0 ms to minimize.
[2022-06-13 00:49:06] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 1 ms to minimize.
[2022-06-13 00:49:06] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 0 ms to minimize.
[2022-06-13 00:49:06] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 0 ms to minimize.
[2022-06-13 00:49:06] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 1 ms to minimize.
[2022-06-13 00:49:07] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 0 ms to minimize.
[2022-06-13 00:49:07] [INFO ] Deduced a trap composed of 37 places in 143 ms of which 0 ms to minimize.
[2022-06-13 00:49:07] [INFO ] Deduced a trap composed of 42 places in 142 ms of which 1 ms to minimize.
[2022-06-13 00:49:07] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 0 ms to minimize.
[2022-06-13 00:49:07] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 1 ms to minimize.
[2022-06-13 00:49:08] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 0 ms to minimize.
[2022-06-13 00:49:08] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 1 ms to minimize.
[2022-06-13 00:49:08] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 0 ms to minimize.
[2022-06-13 00:49:08] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 0 ms to minimize.
[2022-06-13 00:49:08] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 1 ms to minimize.
[2022-06-13 00:49:08] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 0 ms to minimize.
[2022-06-13 00:49:09] [INFO ] Deduced a trap composed of 47 places in 131 ms of which 1 ms to minimize.
[2022-06-13 00:49:09] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 0 ms to minimize.
[2022-06-13 00:49:09] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 1 ms to minimize.
[2022-06-13 00:49:09] [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 9
[2022-06-13 00:49:09] [INFO ] [Real]Absence check using 81 positive place invariants in 32 ms returned sat
[2022-06-13 00:49:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:49:09] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2022-06-13 00:49:09] [INFO ] Solution in real domain found non-integer solution.
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 1 different solutions.
Support contains 117 out of 1003 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1003/1003 places, 1003/1003 transitions.
Drop transitions removed 225 transitions
Trivial Post-agglo rules discarded 225 transitions
Performed 225 trivial Post agglomeration. Transition count delta: 225
Iterating post reduction 0 with 225 rules applied. Total rules applied 225 place count 1003 transition count 778
Reduce places removed 225 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 227 rules applied. Total rules applied 452 place count 778 transition count 776
Reduce places removed 1 places and 0 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Iterating post reduction 2 with 26 rules applied. Total rules applied 478 place count 777 transition count 751
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 503 place count 752 transition count 751
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 79 Pre rules applied. Total rules applied 503 place count 752 transition count 672
Deduced a syphon composed of 79 places in 2 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 4 with 158 rules applied. Total rules applied 661 place count 673 transition count 672
Discarding 106 places :
Symmetric choice reduction at 4 with 106 rule applications. Total rules 767 place count 567 transition count 566
Iterating global reduction 4 with 106 rules applied. Total rules applied 873 place count 567 transition count 566
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 33 Pre rules applied. Total rules applied 873 place count 567 transition count 533
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 939 place count 534 transition count 533
Performed 156 Post agglomeration using F-continuation condition.Transition count delta: 156
Deduced a syphon composed of 156 places in 1 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 4 with 312 rules applied. Total rules applied 1251 place count 378 transition count 377
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 1323 place count 342 transition count 393
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1329 place count 342 transition count 387
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1335 place count 336 transition count 387
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1336 place count 336 transition count 386
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1339 place count 336 transition count 386
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1340 place count 335 transition count 385
Applied a total of 1340 rules in 271 ms. Remains 335 /1003 variables (removed 668) and now considering 385/1003 (removed 618) transitions.
Finished structural reductions, in 1 iterations. Remains : 335/1003 places, 385/1003 transitions.
[2022-06-13 00:49:10] [INFO ] Flatten gal took : 104 ms
[2022-06-13 00:49:10] [INFO ] Flatten gal took : 43 ms
[2022-06-13 00:49:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13563025609427426950.gal : 38 ms
[2022-06-13 00:49:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2680629014302190156.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/ReachabilityCardinality13563025609427426950.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2680629014302190156.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/ReachabilityCardinality13563025609427426950.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2680629014302190156.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality2680629014302190156.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :10 after 28
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :28 after 109
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :109 after 4537
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :4537 after 9.3312e+06
Invariant property ShieldRVt-PT-020B-ReachabilityCardinality-04 does not hold.
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Detected timeout of ITS tools.
[2022-06-13 00:49:25] [INFO ] Flatten gal took : 24 ms
[2022-06-13 00:49:25] [INFO ] Applying decomposition
[2022-06-13 00:49:25] [INFO ] Flatten gal took : 23 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/graph10702147030627247775.txt, -o, /tmp/graph10702147030627247775.bin, -w, /tmp/graph10702147030627247775.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/graph10702147030627247775.bin, -l, -1, -v, -w, /tmp/graph10702147030627247775.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-13 00:49:26] [INFO ] Decomposing Gal with order
[2022-06-13 00:49:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-13 00:49:26] [INFO ] Removed a total of 223 redundant transitions.
[2022-06-13 00:49:26] [INFO ] Flatten gal took : 157 ms
[2022-06-13 00:49:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 144 labels/synchronizations in 23 ms.
[2022-06-13 00:49:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9315896952128200080.gal : 11 ms
[2022-06-13 00:49:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6970807830551427596.prop : 14 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/ReachabilityCardinality9315896952128200080.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6970807830551427596.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/ReachabilityCardinality9315896952128200080.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6970807830551427596.prop --nowitness
Loading property file /tmp/ReachabilityCardinality6970807830551427596.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 3
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :3 after 1297
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :1297 after 1297
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :1297 after 155521
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :155521 after 4.6656e+07
Reachability property ShieldRVt-PT-020B-ReachabilityCardinality-11 is true.
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :2.07897e+18 after 1.67645e+21
Reachability property ShieldRVt-PT-020B-ReachabilityCardinality-13 is true.
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldRVt-PT-020B-ReachabilityCardinality-09 does not hold.
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldRVt-PT-020B-ReachabilityCardinality-03 is true.
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldRVt-PT-020B-ReachabilityCardinality-02 does not hold.
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.67645e+21 after 4.28564e+31
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4.28564e+31 after 2.34376e+36
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12271378703377635835
[2022-06-13 00:49:41] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12271378703377635835
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/ltsmin12271378703377635835]
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/ltsmin12271378703377635835] 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/ltsmin12271378703377635835] 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 2 resets, run finished after 2206 ms. (steps per millisecond=453 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1081 ms. (steps per millisecond=925 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 8810235 steps, run timeout after 30001 ms. (steps per millisecond=293 ) properties seen :{}
Probabilistic random walk after 8810235 steps, saw 3757566 distinct states, run finished after 30014 ms. (steps per millisecond=293 ) properties seen :{}
Running SMT prover for 1 properties.
// Phase 1: matrix 385 rows 335 cols
[2022-06-13 00:50:15] [INFO ] Computed 81 place invariants in 4 ms
[2022-06-13 00:50:16] [INFO ] [Real]Absence check using 81 positive place invariants in 14 ms returned sat
[2022-06-13 00:50:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:50:16] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2022-06-13 00:50:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:50:16] [INFO ] [Nat]Absence check using 81 positive place invariants in 16 ms returned sat
[2022-06-13 00:50:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:50:16] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2022-06-13 00:50:16] [INFO ] State equation strengthened by 69 read => feed constraints.
[2022-06-13 00:50:16] [INFO ] [Nat]Added 69 Read/Feed constraints in 32 ms returned sat
[2022-06-13 00:50:16] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2022-06-13 00:50:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2022-06-13 00:50:16] [INFO ] Computed and/alt/rep : 359/1224/359 causal constraints (skipped 10 transitions) in 22 ms.
[2022-06-13 00:50:18] [INFO ] Deduced a trap composed of 12 places in 12 ms of which 0 ms to minimize.
[2022-06-13 00:50:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2022-06-13 00:50:18] [INFO ] Added : 312 causal constraints over 64 iterations in 2266 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
Incomplete Parikh walk after 60100 steps, including 415 resets, run finished after 193 ms. (steps per millisecond=311 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 11 out of 335 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 335/335 places, 385/385 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 335 transition count 349
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 299 transition count 349
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 72 place count 299 transition count 324
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 122 place count 274 transition count 324
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 131 place count 265 transition count 315
Iterating global reduction 2 with 9 rules applied. Total rules applied 140 place count 265 transition count 315
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 140 place count 265 transition count 310
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 150 place count 260 transition count 310
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 238 place count 216 transition count 266
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 290 place count 190 transition count 287
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 295 place count 190 transition count 282
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 296 place count 190 transition count 282
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 297 place count 189 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 298 place count 188 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 299 place count 187 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 300 place count 186 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 301 place count 185 transition count 278
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 302 place count 184 transition count 277
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 303 place count 183 transition count 276
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 304 place count 182 transition count 275
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 305 place count 181 transition count 274
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 306 place count 180 transition count 273
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 307 place count 179 transition count 272
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 308 place count 178 transition count 271
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 309 place count 177 transition count 270
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 310 place count 176 transition count 269
Applied a total of 310 rules in 253 ms. Remains 176 /335 variables (removed 159) and now considering 269/385 (removed 116) transitions.
Finished structural reductions, in 1 iterations. Remains : 176/335 places, 269/385 transitions.
[2022-06-13 00:50:19] [INFO ] Flatten gal took : 37 ms
[2022-06-13 00:50:19] [INFO ] Flatten gal took : 29 ms
[2022-06-13 00:50:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4366460368901135547.gal : 7 ms
[2022-06-13 00:50:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8251999226525383095.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/ReachabilityCardinality4366460368901135547.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8251999226525383095.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/ReachabilityCardinality4366460368901135547.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8251999226525383095.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality8251999226525383095.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 74
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :74 after 111
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :333 after 4327
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :4327 after 5792
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :5792 after 2.82939e+06
Detected timeout of ITS tools.
[2022-06-13 00:50:34] [INFO ] Flatten gal took : 13 ms
[2022-06-13 00:50:34] [INFO ] Applying decomposition
[2022-06-13 00:50:34] [INFO ] Flatten gal took : 13 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/graph3630126290717646590.txt, -o, /tmp/graph3630126290717646590.bin, -w, /tmp/graph3630126290717646590.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/graph3630126290717646590.bin, -l, -1, -v, -w, /tmp/graph3630126290717646590.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-13 00:50:34] [INFO ] Decomposing Gal with order
[2022-06-13 00:50:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-13 00:50:34] [INFO ] Removed a total of 444 redundant transitions.
[2022-06-13 00:50:34] [INFO ] Flatten gal took : 43 ms
[2022-06-13 00:50:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 218 labels/synchronizations in 12 ms.
[2022-06-13 00:50:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality488440510010661545.gal : 4 ms
[2022-06-13 00:50:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12814455195630799485.prop : 0 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/ReachabilityCardinality488440510010661545.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12814455195630799485.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/ReachabilityCardinality488440510010661545.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12814455195630799485.prop --nowitness
Loading property file /tmp/ReachabilityCardinality12814455195630799485.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 111
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :111 after 111
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.53446e+06 after 5.47261e+16
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :5.47261e+16 after 3.92821e+24
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,4.81128e+25,0.384222,15712,166,47,21398,688,572,52926,95,3032,0
Total reachable state count : 48112810741398426215251968

Verifying 1 reachability properties.
Invariant property ShieldRVt-PT-020B-ReachabilityCardinality-07 is true.
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-020B-ReachabilityCardinality-07,0,0.395086,15712,1,0,21398,688,599,52926,101,3032,250
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.

BK_STOP 1655081438019

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="ShieldRVt-PT-020B"
export BK_EXAMINATION="ReachabilityCardinality"
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 ShieldRVt-PT-020B, examination is ReachabilityCardinality"
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-165286037600371"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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