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.r222-tall-165286024700111.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldIIPs-PT-020B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286024700111
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 7.7K Apr 29 14:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 29 14:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 29 14:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 29 14:57 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 3.3K May 9 08:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 29 14:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 29 14:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 29 14:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 29 14:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:48 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 332K 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 ShieldIIPs-PT-020B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654264951021

Running Version 202205111006
[2022-06-03 14:02:32] [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-03 14:02:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 14:02:32] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2022-06-03 14:02:32] [INFO ] Transformed 1203 places.
[2022-06-03 14:02:32] [INFO ] Transformed 1183 transitions.
[2022-06-03 14:02:32] [INFO ] Found NUPN structural information;
[2022-06-03 14:02:32] [INFO ] Parsed PT model containing 1203 places and 1183 transitions in 289 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 3 resets, run finished after 482 ms. (steps per millisecond=20 ) properties (out of 16) seen :10
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1183 rows 1203 cols
[2022-06-03 14:02:33] [INFO ] Computed 181 place invariants in 27 ms
[2022-06-03 14:02:33] [INFO ] After 472ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-03 14:02:34] [INFO ] [Nat]Absence check using 181 positive place invariants in 55 ms returned sat
[2022-06-03 14:02:36] [INFO ] After 1839ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-06-03 14:02:36] [INFO ] Deduced a trap composed of 27 places in 262 ms of which 4 ms to minimize.
[2022-06-03 14:02:36] [INFO ] Deduced a trap composed of 12 places in 237 ms of which 2 ms to minimize.
[2022-06-03 14:02:37] [INFO ] Deduced a trap composed of 22 places in 211 ms of which 1 ms to minimize.
[2022-06-03 14:02:37] [INFO ] Deduced a trap composed of 29 places in 208 ms of which 2 ms to minimize.
[2022-06-03 14:02:37] [INFO ] Deduced a trap composed of 22 places in 199 ms of which 1 ms to minimize.
[2022-06-03 14:02:37] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 1 ms to minimize.
[2022-06-03 14:02:38] [INFO ] Deduced a trap composed of 28 places in 209 ms of which 1 ms to minimize.
[2022-06-03 14:02:38] [INFO ] Deduced a trap composed of 24 places in 218 ms of which 1 ms to minimize.
[2022-06-03 14:02:38] [INFO ] Deduced a trap composed of 21 places in 195 ms of which 1 ms to minimize.
[2022-06-03 14:02:38] [INFO ] Deduced a trap composed of 26 places in 186 ms of which 1 ms to minimize.
[2022-06-03 14:02:39] [INFO ] Deduced a trap composed of 27 places in 183 ms of which 2 ms to minimize.
[2022-06-03 14:02:39] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 1 ms to minimize.
[2022-06-03 14:02:39] [INFO ] Deduced a trap composed of 29 places in 166 ms of which 1 ms to minimize.
[2022-06-03 14:02:39] [INFO ] Deduced a trap composed of 29 places in 171 ms of which 1 ms to minimize.
[2022-06-03 14:02:40] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 0 ms to minimize.
[2022-06-03 14:02:40] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 1 ms to minimize.
[2022-06-03 14:02:40] [INFO ] Deduced a trap composed of 30 places in 169 ms of which 1 ms to minimize.
[2022-06-03 14:02:40] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 1 ms to minimize.
[2022-06-03 14:02:40] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 1 ms to minimize.
[2022-06-03 14:02:41] [INFO ] Deduced a trap composed of 21 places in 242 ms of which 1 ms to minimize.
[2022-06-03 14:02:41] [INFO ] Deduced a trap composed of 14 places in 239 ms of which 1 ms to minimize.
[2022-06-03 14:02:41] [INFO ] Deduced a trap composed of 23 places in 238 ms of which 1 ms to minimize.
[2022-06-03 14:02:42] [INFO ] Deduced a trap composed of 23 places in 238 ms of which 0 ms to minimize.
[2022-06-03 14:02:42] [INFO ] Deduced a trap composed of 20 places in 257 ms of which 0 ms to minimize.
[2022-06-03 14:02:42] [INFO ] Deduced a trap composed of 20 places in 253 ms of which 1 ms to minimize.
[2022-06-03 14:02:43] [INFO ] Deduced a trap composed of 21 places in 237 ms of which 1 ms to minimize.
[2022-06-03 14:02:43] [INFO ] Deduced a trap composed of 17 places in 229 ms of which 1 ms to minimize.
[2022-06-03 14:02:43] [INFO ] Deduced a trap composed of 20 places in 226 ms of which 1 ms to minimize.
[2022-06-03 14:02:43] [INFO ] Deduced a trap composed of 20 places in 219 ms of which 1 ms to minimize.
[2022-06-03 14:02:44] [INFO ] Deduced a trap composed of 19 places in 229 ms of which 1 ms to minimize.
[2022-06-03 14:02:44] [INFO ] Deduced a trap composed of 25 places in 215 ms of which 1 ms to minimize.
[2022-06-03 14:02:44] [INFO ] Deduced a trap composed of 33 places in 207 ms of which 1 ms to minimize.
[2022-06-03 14:02:44] [INFO ] Deduced a trap composed of 23 places in 203 ms of which 1 ms to minimize.
[2022-06-03 14:02:45] [INFO ] Deduced a trap composed of 31 places in 211 ms of which 1 ms to minimize.
[2022-06-03 14:02:45] [INFO ] Deduced a trap composed of 22 places in 271 ms of which 1 ms to minimize.
[2022-06-03 14:02:45] [INFO ] Deduced a trap composed of 24 places in 266 ms of which 1 ms to minimize.
[2022-06-03 14:02:46] [INFO ] Deduced a trap composed of 17 places in 273 ms of which 1 ms to minimize.
[2022-06-03 14:02:46] [INFO ] Deduced a trap composed of 20 places in 276 ms of which 1 ms to minimize.
[2022-06-03 14:02:46] [INFO ] Deduced a trap composed of 17 places in 269 ms of which 1 ms to minimize.
[2022-06-03 14:02:47] [INFO ] Deduced a trap composed of 22 places in 276 ms of which 1 ms to minimize.
[2022-06-03 14:02:47] [INFO ] Deduced a trap composed of 19 places in 273 ms of which 1 ms to minimize.
[2022-06-03 14:02:47] [INFO ] Deduced a trap composed of 34 places in 284 ms of which 1 ms to minimize.
[2022-06-03 14:02:48] [INFO ] Deduced a trap composed of 27 places in 247 ms of which 1 ms to minimize.
[2022-06-03 14:02:48] [INFO ] Deduced a trap composed of 24 places in 294 ms of which 1 ms to minimize.
[2022-06-03 14:02:48] [INFO ] Deduced a trap composed of 24 places in 254 ms of which 1 ms to minimize.
[2022-06-03 14:02:49] [INFO ] Deduced a trap composed of 24 places in 253 ms of which 1 ms to minimize.
[2022-06-03 14:02:49] [INFO ] Deduced a trap composed of 22 places in 245 ms of which 1 ms to minimize.
[2022-06-03 14:02:49] [INFO ] Deduced a trap composed of 21 places in 255 ms of which 1 ms to minimize.
[2022-06-03 14:02:50] [INFO ] Deduced a trap composed of 33 places in 249 ms of which 1 ms to minimize.
[2022-06-03 14:02:50] [INFO ] Deduced a trap composed of 26 places in 246 ms of which 1 ms to minimize.
[2022-06-03 14:02:50] [INFO ] Deduced a trap composed of 35 places in 241 ms of which 1 ms to minimize.
[2022-06-03 14:02:51] [INFO ] Deduced a trap composed of 28 places in 248 ms of which 0 ms to minimize.
[2022-06-03 14:02:51] [INFO ] Deduced a trap composed of 21 places in 242 ms of which 0 ms to minimize.
[2022-06-03 14:02:51] [INFO ] Deduced a trap composed of 25 places in 223 ms of which 0 ms to minimize.
[2022-06-03 14:02:51] [INFO ] Deduced a trap composed of 21 places in 231 ms of which 1 ms to minimize.
[2022-06-03 14:02:52] [INFO ] Deduced a trap composed of 26 places in 234 ms of which 1 ms to minimize.
[2022-06-03 14:02:52] [INFO ] Deduced a trap composed of 22 places in 232 ms of which 0 ms to minimize.
[2022-06-03 14:02:52] [INFO ] Deduced a trap composed of 29 places in 221 ms of which 1 ms to minimize.
[2022-06-03 14:02:52] [INFO ] Deduced a trap composed of 38 places in 215 ms of which 1 ms to minimize.
[2022-06-03 14:02:53] [INFO ] Deduced a trap composed of 37 places in 212 ms of which 1 ms to minimize.
[2022-06-03 14:02:53] [INFO ] Deduced a trap composed of 37 places in 211 ms of which 1 ms to minimize.
[2022-06-03 14:02:53] [INFO ] Deduced a trap composed of 31 places in 208 ms of which 0 ms to minimize.
[2022-06-03 14:02:54] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 1 ms to minimize.
[2022-06-03 14:02:54] [INFO ] Deduced a trap composed of 48 places in 213 ms of which 1 ms to minimize.
[2022-06-03 14:02:54] [INFO ] Deduced a trap composed of 32 places in 216 ms of which 1 ms to minimize.
[2022-06-03 14:02:54] [INFO ] Deduced a trap composed of 51 places in 207 ms of which 2 ms to minimize.
[2022-06-03 14:02:55] [INFO ] Deduced a trap composed of 52 places in 211 ms of which 2 ms to minimize.
[2022-06-03 14:02:55] [INFO ] Deduced a trap composed of 31 places in 201 ms of which 3 ms to minimize.
[2022-06-03 14:02:55] [INFO ] Deduced a trap composed of 26 places in 191 ms of which 0 ms to minimize.
[2022-06-03 14:02:55] [INFO ] Deduced a trap composed of 35 places in 179 ms of which 0 ms to minimize.
[2022-06-03 14:02:56] [INFO ] Deduced a trap composed of 17 places in 241 ms of which 1 ms to minimize.
[2022-06-03 14:02:56] [INFO ] Deduced a trap composed of 17 places in 237 ms of which 0 ms to minimize.
[2022-06-03 14:02:56] [INFO ] Deduced a trap composed of 16 places in 230 ms of which 1 ms to minimize.
[2022-06-03 14:02:57] [INFO ] Deduced a trap composed of 27 places in 231 ms of which 1 ms to minimize.
[2022-06-03 14:02:57] [INFO ] Deduced a trap composed of 29 places in 218 ms of which 1 ms to minimize.
[2022-06-03 14:02:57] [INFO ] Deduced a trap composed of 29 places in 217 ms of which 1 ms to minimize.
[2022-06-03 14:02:57] [INFO ] Deduced a trap composed of 25 places in 228 ms of which 1 ms to minimize.
[2022-06-03 14:02:58] [INFO ] Deduced a trap composed of 34 places in 201 ms of which 1 ms to minimize.
[2022-06-03 14:02:58] [INFO ] Deduced a trap composed of 34 places in 205 ms of which 1 ms to minimize.
[2022-06-03 14:02:58] [INFO ] Deduced a trap composed of 24 places in 224 ms of which 1 ms to minimize.
[2022-06-03 14:02:58] [INFO ] Deduced a trap composed of 13 places in 216 ms of which 1 ms to minimize.
[2022-06-03 14:02:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-03 14:02:58] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 10809 ms.
Support contains 141 out of 1203 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1203/1203 places, 1183/1183 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 1203 transition count 1112
Reduce places removed 71 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 81 rules applied. Total rules applied 152 place count 1132 transition count 1102
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 162 place count 1122 transition count 1102
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 162 place count 1122 transition count 1006
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 354 place count 1026 transition count 1006
Discarding 114 places :
Symmetric choice reduction at 3 with 114 rule applications. Total rules 468 place count 912 transition count 892
Iterating global reduction 3 with 114 rules applied. Total rules applied 582 place count 912 transition count 892
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 582 place count 912 transition count 862
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 642 place count 882 transition count 862
Performed 251 Post agglomeration using F-continuation condition.Transition count delta: 251
Deduced a syphon composed of 251 places in 2 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 3 with 502 rules applied. Total rules applied 1144 place count 631 transition count 611
Partial Free-agglomeration rule applied 94 times.
Drop transitions removed 94 transitions
Iterating global reduction 3 with 94 rules applied. Total rules applied 1238 place count 631 transition count 611
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1239 place count 630 transition count 610
Applied a total of 1239 rules in 386 ms. Remains 630 /1203 variables (removed 573) and now considering 610/1183 (removed 573) transitions.
Finished structural reductions, in 1 iterations. Remains : 630/1203 places, 610/1183 transitions.
Incomplete random walk after 1000000 steps, including 621 resets, run finished after 6016 ms. (steps per millisecond=166 ) properties (out of 6) seen :5
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 67 resets, run finished after 4006 ms. (steps per millisecond=249 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 610 rows 630 cols
[2022-06-03 14:03:20] [INFO ] Computed 181 place invariants in 12 ms
[2022-06-03 14:03:20] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 14:03:20] [INFO ] [Nat]Absence check using 179 positive place invariants in 26 ms returned sat
[2022-06-03 14:03:20] [INFO ] [Nat]Absence check using 179 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-03 14:03:20] [INFO ] After 291ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 14:03:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-06-03 14:03:20] [INFO ] After 98ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 14:03:21] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 1 ms to minimize.
[2022-06-03 14:03:21] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 0 ms to minimize.
[2022-06-03 14:03:21] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 0 ms to minimize.
[2022-06-03 14:03:21] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2022-06-03 14:03:21] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 0 ms to minimize.
[2022-06-03 14:03:21] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 0 ms to minimize.
[2022-06-03 14:03:21] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2022-06-03 14:03:21] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 0 ms to minimize.
[2022-06-03 14:03:21] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 0 ms to minimize.
[2022-06-03 14:03:22] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 0 ms to minimize.
[2022-06-03 14:03:22] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 1 ms to minimize.
[2022-06-03 14:03:22] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 0 ms to minimize.
[2022-06-03 14:03:22] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 1 ms to minimize.
[2022-06-03 14:03:22] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 0 ms to minimize.
[2022-06-03 14:03:22] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2022-06-03 14:03:22] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2022-06-03 14:03:22] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 0 ms to minimize.
[2022-06-03 14:03:22] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 0 ms to minimize.
[2022-06-03 14:03:23] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2022-06-03 14:03:23] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2200 ms
[2022-06-03 14:03:23] [INFO ] After 2395ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 119 ms.
[2022-06-03 14:03:23] [INFO ] After 2967ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 211 ms.
Support contains 45 out of 630 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 630/630 places, 610/610 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 630 transition count 599
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 619 transition count 599
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 22 place count 619 transition count 584
Deduced a syphon composed of 15 places in 6 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 52 place count 604 transition count 584
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 602 transition count 582
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 602 transition count 582
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 56 place count 602 transition count 581
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 601 transition count 581
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 150 place count 555 transition count 535
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 2 with 29 rules applied. Total rules applied 179 place count 555 transition count 535
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 180 place count 554 transition count 534
Iterating global reduction 2 with 1 rules applied. Total rules applied 181 place count 554 transition count 534
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 187 place count 548 transition count 528
Applied a total of 187 rules in 176 ms. Remains 548 /630 variables (removed 82) and now considering 528/610 (removed 82) transitions.
Finished structural reductions, in 1 iterations. Remains : 548/630 places, 528/610 transitions.
Incomplete random walk after 1000000 steps, including 583 resets, run finished after 5908 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 82 resets, run finished after 3961 ms. (steps per millisecond=252 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3285054 steps, run timeout after 27001 ms. (steps per millisecond=121 ) properties seen :{}
Probabilistic random walk after 3285054 steps, saw 569219 distinct states, run finished after 27003 ms. (steps per millisecond=121 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 528 rows 548 cols
[2022-06-03 14:04:00] [INFO ] Computed 181 place invariants in 13 ms
[2022-06-03 14:04:00] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 14:04:00] [INFO ] [Nat]Absence check using 175 positive place invariants in 27 ms returned sat
[2022-06-03 14:04:00] [INFO ] [Nat]Absence check using 175 positive and 6 generalized place invariants in 2 ms returned sat
[2022-06-03 14:04:00] [INFO ] After 309ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 14:04:00] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-06-03 14:04:01] [INFO ] After 109ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 14:04:01] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2022-06-03 14:04:01] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
[2022-06-03 14:04:01] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2022-06-03 14:04:01] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2022-06-03 14:04:01] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 1 ms to minimize.
[2022-06-03 14:04:01] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2022-06-03 14:04:01] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2022-06-03 14:04:02] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2022-06-03 14:04:02] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2022-06-03 14:04:02] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
[2022-06-03 14:04:02] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 0 ms to minimize.
[2022-06-03 14:04:02] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
[2022-06-03 14:04:02] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
[2022-06-03 14:04:02] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2022-06-03 14:04:02] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2022-06-03 14:04:02] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 0 ms to minimize.
[2022-06-03 14:04:02] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2022-06-03 14:04:02] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2022-06-03 14:04:02] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1658 ms
[2022-06-03 14:04:02] [INFO ] After 1870ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 111 ms.
[2022-06-03 14:04:02] [INFO ] After 2395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 224 ms.
Support contains 45 out of 548 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 548/548 places, 528/528 transitions.
Applied a total of 0 rules in 13 ms. Remains 548 /548 variables (removed 0) and now considering 528/528 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 548/548 places, 528/528 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 548/548 places, 528/528 transitions.
Applied a total of 0 rules in 18 ms. Remains 548 /548 variables (removed 0) and now considering 528/528 (removed 0) transitions.
// Phase 1: matrix 528 rows 548 cols
[2022-06-03 14:04:03] [INFO ] Computed 181 place invariants in 8 ms
[2022-06-03 14:04:03] [INFO ] Implicit Places using invariants in 318 ms returned [532]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 321 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 547/548 places, 528/528 transitions.
Applied a total of 0 rules in 13 ms. Remains 547 /547 variables (removed 0) and now considering 528/528 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 547/548 places, 528/528 transitions.
Incomplete random walk after 1000000 steps, including 582 resets, run finished after 5866 ms. (steps per millisecond=170 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 80 resets, run finished after 3899 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3366884 steps, run timeout after 27001 ms. (steps per millisecond=124 ) properties seen :{}
Probabilistic random walk after 3366884 steps, saw 585043 distinct states, run finished after 27001 ms. (steps per millisecond=124 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 528 rows 547 cols
[2022-06-03 14:04:40] [INFO ] Computed 180 place invariants in 10 ms
[2022-06-03 14:04:40] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 14:04:40] [INFO ] [Nat]Absence check using 174 positive place invariants in 27 ms returned sat
[2022-06-03 14:04:40] [INFO ] [Nat]Absence check using 174 positive and 6 generalized place invariants in 1 ms returned sat
[2022-06-03 14:04:40] [INFO ] After 281ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 14:04:41] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2022-06-03 14:04:41] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2022-06-03 14:04:41] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 0 ms to minimize.
[2022-06-03 14:04:41] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 0 ms to minimize.
[2022-06-03 14:04:41] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 1 ms to minimize.
[2022-06-03 14:04:41] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 0 ms to minimize.
[2022-06-03 14:04:41] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2022-06-03 14:04:41] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 0 ms to minimize.
[2022-06-03 14:04:42] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 0 ms to minimize.
[2022-06-03 14:04:42] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 0 ms to minimize.
[2022-06-03 14:04:42] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 1 ms to minimize.
[2022-06-03 14:04:42] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 0 ms to minimize.
[2022-06-03 14:04:42] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 0 ms to minimize.
[2022-06-03 14:04:42] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 0 ms to minimize.
[2022-06-03 14:04:42] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2022-06-03 14:04:42] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 0 ms to minimize.
[2022-06-03 14:04:42] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 0 ms to minimize.
[2022-06-03 14:04:43] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2022-06-03 14:04:43] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 0 ms to minimize.
[2022-06-03 14:04:43] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2022-06-03 14:04:43] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 0 ms to minimize.
[2022-06-03 14:04:43] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2022-06-03 14:04:43] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2505 ms
[2022-06-03 14:04:43] [INFO ] After 2888ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 157 ms.
[2022-06-03 14:04:43] [INFO ] After 3164ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 239 ms.
Support contains 45 out of 547 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 547/547 places, 528/528 transitions.
Applied a total of 0 rules in 13 ms. Remains 547 /547 variables (removed 0) and now considering 528/528 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 547/547 places, 528/528 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 547/547 places, 528/528 transitions.
Applied a total of 0 rules in 12 ms. Remains 547 /547 variables (removed 0) and now considering 528/528 (removed 0) transitions.
// Phase 1: matrix 528 rows 547 cols
[2022-06-03 14:04:43] [INFO ] Computed 180 place invariants in 8 ms
[2022-06-03 14:04:44] [INFO ] Implicit Places using invariants in 284 ms returned []
// Phase 1: matrix 528 rows 547 cols
[2022-06-03 14:04:44] [INFO ] Computed 180 place invariants in 3 ms
[2022-06-03 14:04:44] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 824 ms to find 0 implicit places.
[2022-06-03 14:04:44] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 528 rows 547 cols
[2022-06-03 14:04:44] [INFO ] Computed 180 place invariants in 4 ms
[2022-06-03 14:04:45] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 547/547 places, 528/528 transitions.
Incomplete random walk after 1000000 steps, including 584 resets, run finished after 5770 ms. (steps per millisecond=173 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 80 resets, run finished after 3876 ms. (steps per millisecond=257 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3442719 steps, run timeout after 27001 ms. (steps per millisecond=127 ) properties seen :{}
Probabilistic random walk after 3442719 steps, saw 595684 distinct states, run finished after 27001 ms. (steps per millisecond=127 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 528 rows 547 cols
[2022-06-03 14:05:21] [INFO ] Computed 180 place invariants in 8 ms
[2022-06-03 14:05:21] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 14:05:21] [INFO ] [Nat]Absence check using 174 positive place invariants in 23 ms returned sat
[2022-06-03 14:05:21] [INFO ] [Nat]Absence check using 174 positive and 6 generalized place invariants in 1 ms returned sat
[2022-06-03 14:05:22] [INFO ] After 305ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 14:05:22] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2022-06-03 14:05:22] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2022-06-03 14:05:22] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 0 ms to minimize.
[2022-06-03 14:05:22] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 0 ms to minimize.
[2022-06-03 14:05:22] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 1 ms to minimize.
[2022-06-03 14:05:22] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 0 ms to minimize.
[2022-06-03 14:05:23] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2022-06-03 14:05:23] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
[2022-06-03 14:05:23] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2022-06-03 14:05:23] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 0 ms to minimize.
[2022-06-03 14:05:23] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 0 ms to minimize.
[2022-06-03 14:05:23] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 0 ms to minimize.
[2022-06-03 14:05:23] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 0 ms to minimize.
[2022-06-03 14:05:23] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 0 ms to minimize.
[2022-06-03 14:05:23] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 0 ms to minimize.
[2022-06-03 14:05:24] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2022-06-03 14:05:24] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 0 ms to minimize.
[2022-06-03 14:05:24] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 0 ms to minimize.
[2022-06-03 14:05:24] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2022-06-03 14:05:24] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2022-06-03 14:05:24] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 0 ms to minimize.
[2022-06-03 14:05:24] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2022-06-03 14:05:24] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2436 ms
[2022-06-03 14:05:24] [INFO ] After 2841ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 156 ms.
[2022-06-03 14:05:24] [INFO ] After 3093ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 234 ms.
Support contains 45 out of 547 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 547/547 places, 528/528 transitions.
Applied a total of 0 rules in 12 ms. Remains 547 /547 variables (removed 0) and now considering 528/528 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 547/547 places, 528/528 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 547/547 places, 528/528 transitions.
Applied a total of 0 rules in 12 ms. Remains 547 /547 variables (removed 0) and now considering 528/528 (removed 0) transitions.
// Phase 1: matrix 528 rows 547 cols
[2022-06-03 14:05:25] [INFO ] Computed 180 place invariants in 3 ms
[2022-06-03 14:05:25] [INFO ] Implicit Places using invariants in 242 ms returned []
// Phase 1: matrix 528 rows 547 cols
[2022-06-03 14:05:25] [INFO ] Computed 180 place invariants in 2 ms
[2022-06-03 14:05:25] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 807 ms to find 0 implicit places.
[2022-06-03 14:05:25] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 528 rows 547 cols
[2022-06-03 14:05:25] [INFO ] Computed 180 place invariants in 4 ms
[2022-06-03 14:05:26] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 547/547 places, 528/528 transitions.
Applied a total of 0 rules in 12 ms. Remains 547 /547 variables (removed 0) and now considering 528/528 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 528 rows 547 cols
[2022-06-03 14:05:26] [INFO ] Computed 180 place invariants in 4 ms
[2022-06-03 14:05:26] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 14:05:26] [INFO ] [Nat]Absence check using 174 positive place invariants in 26 ms returned sat
[2022-06-03 14:05:26] [INFO ] [Nat]Absence check using 174 positive and 6 generalized place invariants in 3 ms returned sat
[2022-06-03 14:05:26] [INFO ] After 290ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 14:05:26] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2022-06-03 14:05:27] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 0 ms to minimize.
[2022-06-03 14:05:27] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 0 ms to minimize.
[2022-06-03 14:05:27] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 0 ms to minimize.
[2022-06-03 14:05:27] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 0 ms to minimize.
[2022-06-03 14:05:27] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 0 ms to minimize.
[2022-06-03 14:05:27] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2022-06-03 14:05:27] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2022-06-03 14:05:27] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 0 ms to minimize.
[2022-06-03 14:05:27] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 0 ms to minimize.
[2022-06-03 14:05:28] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2022-06-03 14:05:28] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 0 ms to minimize.
[2022-06-03 14:05:28] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 0 ms to minimize.
[2022-06-03 14:05:28] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 0 ms to minimize.
[2022-06-03 14:05:28] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 0 ms to minimize.
[2022-06-03 14:05:28] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 0 ms to minimize.
[2022-06-03 14:05:28] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 0 ms to minimize.
[2022-06-03 14:05:28] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 0 ms to minimize.
[2022-06-03 14:05:28] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 0 ms to minimize.
[2022-06-03 14:05:28] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
[2022-06-03 14:05:29] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2022-06-03 14:05:29] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2022-06-03 14:05:29] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2420 ms
[2022-06-03 14:05:29] [INFO ] After 2818ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 158 ms.
[2022-06-03 14:05:29] [INFO ] After 3086ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-03 14:05:29] [INFO ] Flatten gal took : 90 ms
[2022-06-03 14:05:29] [INFO ] Flatten gal took : 47 ms
[2022-06-03 14:05:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17860549278958340945.gal : 21 ms
[2022-06-03 14:05:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13015598709589509903.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17860549278958340945.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13015598709589509903.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality13015598709589509903.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 84
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :84 after 504
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :504 after 12600
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :12600 after 4.89888e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9.79776e+07 after 4.28507e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.28507e+08 after 4.28514e+08
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.28514e+08 after 4.28588e+08
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :4.28588e+08 after 4.34298e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4.34298e+08 after 9.70646e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :9.70646e+08 after 5.95173e+10
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :5.95173e+10 after 2.23196e+12
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.23196e+12 after 1.53217e+14
Detected timeout of ITS tools.
[2022-06-03 14:05:44] [INFO ] Flatten gal took : 48 ms
[2022-06-03 14:05:44] [INFO ] Applying decomposition
[2022-06-03 14:05:44] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10404658323815465711.txt' '-o' '/tmp/graph10404658323815465711.bin' '-w' '/tmp/graph10404658323815465711.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10404658323815465711.bin' '-l' '-1' '-v' '-w' '/tmp/graph10404658323815465711.weights' '-q' '0' '-e' '0.001'
[2022-06-03 14:05:45] [INFO ] Decomposing Gal with order
[2022-06-03 14:05:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 14:05:45] [INFO ] Removed a total of 408 redundant transitions.
[2022-06-03 14:05:45] [INFO ] Flatten gal took : 104 ms
[2022-06-03 14:05:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 426 labels/synchronizations in 25 ms.
[2022-06-03 14:05:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6436980647992860512.gal : 11 ms
[2022-06-03 14:05:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16346028465439283629.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6436980647992860512.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16346028465439283629.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality16346028465439283629.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 14
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :14 after 84
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :84 after 1.8144e+06
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :7.83821e+08 after 2.69431e+15
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16869459671645516323
[2022-06-03 14:06:00] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16869459671645516323
Running compilation step : cd /tmp/ltsmin16869459671645516323;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1056 ms.
Running link step : cd /tmp/ltsmin16869459671645516323;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin16869459671645516323;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'ShieldIIPsPT020BReachabilityFireability02==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-03 14:06:15] [INFO ] Flatten gal took : 36 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15655748907384095395
[2022-06-03 14:06:15] [INFO ] Computing symmetric may disable matrix : 528 transitions.
[2022-06-03 14:06:15] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 14:06:15] [INFO ] Computing symmetric may enable matrix : 528 transitions.
[2022-06-03 14:06:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 14:06:15] [INFO ] Applying decomposition
[2022-06-03 14:06:15] [INFO ] Flatten gal took : 35 ms
[2022-06-03 14:06:15] [INFO ] Flatten gal took : 63 ms
[2022-06-03 14:06:15] [INFO ] Computing Do-Not-Accords matrix : 528 transitions.
[2022-06-03 14:06:15] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 14:06:15] [INFO ] Input system was already deterministic with 528 transitions.
[2022-06-03 14:06:15] [INFO ] Built C files in 157ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15655748907384095395
Running compilation step : cd /tmp/ltsmin15655748907384095395;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1430676860247605232.txt' '-o' '/tmp/graph1430676860247605232.bin' '-w' '/tmp/graph1430676860247605232.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1430676860247605232.bin' '-l' '-1' '-v' '-w' '/tmp/graph1430676860247605232.weights' '-q' '0' '-e' '0.001'
[2022-06-03 14:06:15] [INFO ] Decomposing Gal with order
[2022-06-03 14:06:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 14:06:15] [INFO ] Removed a total of 400 redundant transitions.
[2022-06-03 14:06:15] [INFO ] Flatten gal took : 89 ms
[2022-06-03 14:06:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 473 labels/synchronizations in 29 ms.
[2022-06-03 14:06:15] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability5848651254276832406.gal : 14 ms
[2022-06-03 14:06:15] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability2492098494189446573.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability5848651254276832406.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability2492098494189446573.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
[2022-06-03 14:06:15] [INFO ] Ran tautology test, simplified 0 / 1 in 388 ms.
[2022-06-03 14:06:16] [INFO ] BMC solution for property ShieldIIPs-PT-020B-ReachabilityFireability-02(UNSAT) depth K=0 took 13 ms
Loading property file /tmp/ReachabilityFireability2492098494189446573.prop.
[2022-06-03 14:06:16] [INFO ] BMC solution for property ShieldIIPs-PT-020B-ReachabilityFireability-02(UNSAT) depth K=1 took 24 ms
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 84
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :84 after 12600
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 528 rows 547 cols
[2022-06-03 14:06:16] [INFO ] Computed 180 place invariants in 3 ms
[2022-06-03 14:06:16] [INFO ] Computed 180 place invariants in 3 ms
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :7.83821e+08 after 4.12976e+11
[2022-06-03 14:06:17] [INFO ] Proved 547 variables to be positive in 913 ms
Compilation finished in 1602 ms.
Running link step : cd /tmp/ltsmin15655748907384095395;'gcc' '-shared' '-o' 'gal.so' 'model.o'
[2022-06-03 14:06:17] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-020B-ReachabilityFireability-02
[2022-06-03 14:06:17] [INFO ] KInduction solution for property ShieldIIPs-PT-020B-ReachabilityFireability-02(SAT) depth K=0 took 57 ms
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin15655748907384095395;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT020BReachabilityFireability02==true'
[2022-06-03 14:06:17] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-020B-ReachabilityFireability-02
[2022-06-03 14:06:17] [INFO ] KInduction solution for property ShieldIIPs-PT-020B-ReachabilityFireability-02(SAT) depth K=1 took 418 ms
[2022-06-03 14:06:18] [INFO ] BMC solution for property ShieldIIPs-PT-020B-ReachabilityFireability-02(UNSAT) depth K=2 took 2522 ms
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4.12976e+11 after 1.44272e+33
[2022-06-03 14:06:34] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-020B-ReachabilityFireability-02
[2022-06-03 14:06:34] [INFO ] KInduction solution for property ShieldIIPs-PT-020B-ReachabilityFireability-02(SAT) depth K=2 took 16358 ms
[2022-06-03 14:08:04] [INFO ] BMC solution for property ShieldIIPs-PT-020B-ReachabilityFireability-02(UNSAT) depth K=3 took 105613 ms
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.44272e+33 after 1.23631e+35
[2022-06-03 14:20:09] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-020B-ReachabilityFireability-02
[2022-06-03 14:20:09] [INFO ] KInduction solution for property ShieldIIPs-PT-020B-ReachabilityFireability-02(SAT) depth K=3 took 815215 ms
Detected timeout of ITS tools.
[2022-06-03 14:27:30] [INFO ] Applying decomposition
[2022-06-03 14:27:30] [INFO ] Flatten gal took : 121 ms
[2022-06-03 14:27:30] [INFO ] Decomposing Gal with order
[2022-06-03 14:27:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 14:27:31] [INFO ] Removed a total of 408 redundant transitions.
[2022-06-03 14:27:31] [INFO ] Flatten gal took : 197 ms
[2022-06-03 14:27:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 426 labels/synchronizations in 30 ms.
[2022-06-03 14:27:31] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability7525289401306683146.gal : 7 ms
[2022-06-03 14:27:31] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability12566788853877792965.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability7525289401306683146.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability12566788853877792965.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityFireability12566788853877792965.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 21
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :21 after 84
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :84 after 151200
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :7.83821e+08 after 1.98219e+15
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.98219e+15 after 8.54359e+30
Detected timeout of ITS tools.
[2022-06-03 14:48:46] [INFO ] Flatten gal took : 100 ms
[2022-06-03 14:48:46] [INFO ] Input system was already deterministic with 528 transitions.
[2022-06-03 14:48:46] [INFO ] Transformed 547 places.
[2022-06-03 14:48:46] [INFO ] Transformed 528 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-03 14:48:46] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability2833417680854765655.gal : 3 ms
[2022-06-03 14:48:46] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability5687889699984381631.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability2833417680854765655.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability5687889699984381631.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...364
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityFireability5687889699984381631.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 14
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :14 after 40
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :40 after 141
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :141 after 426
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :426 after 2496
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2496 after 17417
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :17417 after 94363
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :94363 after 2.17635e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.17635e+06 after 8.02434e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :8.02434e+06 after 1.61336e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.61336e+08 after 5.99008e+09
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :5.99008e+09 after 7.2122e+09
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :7.2122e+09 after 3.30224e+11
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :3.30224e+11 after 1.08908e+13
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :1.08908e+13 after 1.00723e+14
[2022-06-03 14:50:29] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-020B-ReachabilityFireability-02
[2022-06-03 14:50:29] [INFO ] KInduction solution for property ShieldIIPs-PT-020B-ReachabilityFireability-02(SAT) depth K=4 took 1819736 ms
SDD proceeding with computation,1 properties remain. new max is 524288
SDD size :1.00723e+14 after 5.25398e+15
SDD proceeding with computation,1 properties remain. new max is 1048576
SDD size :5.25398e+15 after 6.67041e+17
[2022-06-03 14:58:53] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-020B-ReachabilityFireability-02
[2022-06-03 14:58:53] [INFO ] KInduction solution for property ShieldIIPs-PT-020B-ReachabilityFireability-02(SAT) depth K=5 took 503892 ms
SDD proceeding with computation,1 properties remain. new max is 2097152
SDD size :6.67041e+17 after 6.96019e+17

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination 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=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-020B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldIIPs-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 r222-tall-165286024700111"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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