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-165286026101007.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 ShieldRVt-PT-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286026101007
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 892K
-rw-r--r-- 1 mcc users 8.1K Apr 30 01:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 30 01:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 30 01:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 30 01:08 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 3.7K May 9 09:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 01:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 30 01:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 30 01:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 30 01:08 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 364K 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-030B-ReachabilityFireability-00
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-01
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-02
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-03
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-04
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-05
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-06
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-07
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-08
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-09
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-10
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-11
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-12
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-13
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-14
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654283095685

Running Version 202205111006
[2022-06-03 19:04:56] [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 19:04:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 19:04:57] [INFO ] Load time of PNML (sax parser for PT used): 163 ms
[2022-06-03 19:04:57] [INFO ] Transformed 1503 places.
[2022-06-03 19:04:57] [INFO ] Transformed 1503 transitions.
[2022-06-03 19:04:57] [INFO ] Found NUPN structural information;
[2022-06-03 19:04:57] [INFO ] Parsed PT model containing 1503 places and 1503 transitions in 294 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 2 resets, run finished after 507 ms. (steps per millisecond=19 ) properties (out of 16) seen :8
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1503 rows 1503 cols
[2022-06-03 19:04:58] [INFO ] Computed 121 place invariants in 40 ms
[2022-06-03 19:04:59] [INFO ] [Real]Absence check using 121 positive place invariants in 53 ms returned sat
[2022-06-03 19:04:59] [INFO ] After 807ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-03 19:04:59] [INFO ] [Nat]Absence check using 121 positive place invariants in 52 ms returned sat
[2022-06-03 19:05:02] [INFO ] After 3075ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :6
[2022-06-03 19:05:03] [INFO ] Deduced a trap composed of 29 places in 335 ms of which 6 ms to minimize.
[2022-06-03 19:05:03] [INFO ] Deduced a trap composed of 45 places in 328 ms of which 1 ms to minimize.
[2022-06-03 19:05:04] [INFO ] Deduced a trap composed of 29 places in 291 ms of which 1 ms to minimize.
[2022-06-03 19:05:04] [INFO ] Deduced a trap composed of 46 places in 277 ms of which 2 ms to minimize.
[2022-06-03 19:05:04] [INFO ] Deduced a trap composed of 29 places in 298 ms of which 2 ms to minimize.
[2022-06-03 19:05:05] [INFO ] Deduced a trap composed of 26 places in 298 ms of which 1 ms to minimize.
[2022-06-03 19:05:05] [INFO ] Deduced a trap composed of 31 places in 239 ms of which 1 ms to minimize.
[2022-06-03 19:05:05] [INFO ] Deduced a trap composed of 30 places in 252 ms of which 1 ms to minimize.
[2022-06-03 19:05:06] [INFO ] Deduced a trap composed of 53 places in 254 ms of which 1 ms to minimize.
[2022-06-03 19:05:06] [INFO ] Deduced a trap composed of 27 places in 237 ms of which 1 ms to minimize.
[2022-06-03 19:05:06] [INFO ] Deduced a trap composed of 54 places in 242 ms of which 2 ms to minimize.
[2022-06-03 19:05:06] [INFO ] Deduced a trap composed of 40 places in 216 ms of which 0 ms to minimize.
[2022-06-03 19:05:07] [INFO ] Deduced a trap composed of 59 places in 198 ms of which 1 ms to minimize.
[2022-06-03 19:05:07] [INFO ] Deduced a trap composed of 74 places in 197 ms of which 1 ms to minimize.
[2022-06-03 19:05:07] [INFO ] Deduced a trap composed of 65 places in 184 ms of which 1 ms to minimize.
[2022-06-03 19:05:07] [INFO ] Deduced a trap composed of 63 places in 183 ms of which 2 ms to minimize.
[2022-06-03 19:05:08] [INFO ] Deduced a trap composed of 59 places in 180 ms of which 1 ms to minimize.
[2022-06-03 19:05:08] [INFO ] Deduced a trap composed of 54 places in 191 ms of which 0 ms to minimize.
[2022-06-03 19:05:08] [INFO ] Deduced a trap composed of 45 places in 188 ms of which 1 ms to minimize.
[2022-06-03 19:05:08] [INFO ] Deduced a trap composed of 58 places in 200 ms of which 1 ms to minimize.
[2022-06-03 19:05:09] [INFO ] Deduced a trap composed of 60 places in 200 ms of which 1 ms to minimize.
[2022-06-03 19:05:09] [INFO ] Deduced a trap composed of 51 places in 196 ms of which 1 ms to minimize.
[2022-06-03 19:05:09] [INFO ] Deduced a trap composed of 61 places in 198 ms of which 1 ms to minimize.
[2022-06-03 19:05:09] [INFO ] Deduced a trap composed of 25 places in 190 ms of which 1 ms to minimize.
[2022-06-03 19:05:10] [INFO ] Deduced a trap composed of 50 places in 191 ms of which 1 ms to minimize.
[2022-06-03 19:05:10] [INFO ] Deduced a trap composed of 59 places in 181 ms of which 1 ms to minimize.
[2022-06-03 19:05:10] [INFO ] Deduced a trap composed of 51 places in 178 ms of which 1 ms to minimize.
[2022-06-03 19:05:10] [INFO ] Deduced a trap composed of 50 places in 175 ms of which 1 ms to minimize.
[2022-06-03 19:05:11] [INFO ] Deduced a trap composed of 53 places in 177 ms of which 0 ms to minimize.
[2022-06-03 19:05:11] [INFO ] Deduced a trap composed of 51 places in 170 ms of which 2 ms to minimize.
[2022-06-03 19:05:11] [INFO ] Deduced a trap composed of 51 places in 172 ms of which 1 ms to minimize.
[2022-06-03 19:05:11] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 8697 ms
[2022-06-03 19:05:12] [INFO ] Deduced a trap composed of 26 places in 319 ms of which 1 ms to minimize.
[2022-06-03 19:05:13] [INFO ] Deduced a trap composed of 22 places in 318 ms of which 1 ms to minimize.
[2022-06-03 19:05:13] [INFO ] Deduced a trap composed of 29 places in 302 ms of which 1 ms to minimize.
[2022-06-03 19:05:13] [INFO ] Deduced a trap composed of 42 places in 298 ms of which 1 ms to minimize.
[2022-06-03 19:05:14] [INFO ] Deduced a trap composed of 43 places in 289 ms of which 0 ms to minimize.
[2022-06-03 19:05:14] [INFO ] Deduced a trap composed of 53 places in 276 ms of which 1 ms to minimize.
[2022-06-03 19:05:14] [INFO ] Deduced a trap composed of 35 places in 275 ms of which 1 ms to minimize.
[2022-06-03 19:05:15] [INFO ] Deduced a trap composed of 35 places in 276 ms of which 1 ms to minimize.
[2022-06-03 19:05:15] [INFO ] Deduced a trap composed of 34 places in 278 ms of which 1 ms to minimize.
[2022-06-03 19:05:15] [INFO ] Deduced a trap composed of 42 places in 352 ms of which 1 ms to minimize.
[2022-06-03 19:05:16] [INFO ] Deduced a trap composed of 32 places in 341 ms of which 1 ms to minimize.
[2022-06-03 19:05:16] [INFO ] Deduced a trap composed of 38 places in 335 ms of which 1 ms to minimize.
[2022-06-03 19:05:17] [INFO ] Deduced a trap composed of 43 places in 321 ms of which 1 ms to minimize.
[2022-06-03 19:05:17] [INFO ] Deduced a trap composed of 24 places in 313 ms of which 0 ms to minimize.
[2022-06-03 19:05:17] [INFO ] Deduced a trap composed of 30 places in 323 ms of which 1 ms to minimize.
[2022-06-03 19:05:18] [INFO ] Deduced a trap composed of 38 places in 301 ms of which 1 ms to minimize.
[2022-06-03 19:05:18] [INFO ] Deduced a trap composed of 45 places in 286 ms of which 1 ms to minimize.
[2022-06-03 19:05:18] [INFO ] Deduced a trap composed of 53 places in 289 ms of which 1 ms to minimize.
[2022-06-03 19:05:19] [INFO ] Deduced a trap composed of 46 places in 287 ms of which 0 ms to minimize.
[2022-06-03 19:05:19] [INFO ] Deduced a trap composed of 44 places in 284 ms of which 1 ms to minimize.
[2022-06-03 19:05:19] [INFO ] Deduced a trap composed of 52 places in 268 ms of which 1 ms to minimize.
[2022-06-03 19:05:20] [INFO ] Deduced a trap composed of 40 places in 256 ms of which 1 ms to minimize.
[2022-06-03 19:05:20] [INFO ] Deduced a trap composed of 40 places in 253 ms of which 0 ms to minimize.
[2022-06-03 19:05:20] [INFO ] Deduced a trap composed of 41 places in 248 ms of which 1 ms to minimize.
[2022-06-03 19:05:21] [INFO ] Deduced a trap composed of 46 places in 248 ms of which 0 ms to minimize.
[2022-06-03 19:05:21] [INFO ] Deduced a trap composed of 46 places in 248 ms of which 0 ms to minimize.
[2022-06-03 19:05:21] [INFO ] Deduced a trap composed of 44 places in 237 ms of which 1 ms to minimize.
[2022-06-03 19:05:22] [INFO ] Deduced a trap composed of 60 places in 245 ms of which 1 ms to minimize.
[2022-06-03 19:05:22] [INFO ] Deduced a trap composed of 46 places in 239 ms of which 1 ms to minimize.
[2022-06-03 19:05:22] [INFO ] Deduced a trap composed of 43 places in 237 ms of which 1 ms to minimize.
[2022-06-03 19:05:23] [INFO ] Deduced a trap composed of 76 places in 230 ms of which 0 ms to minimize.
[2022-06-03 19:05:23] [INFO ] Deduced a trap composed of 56 places in 220 ms of which 1 ms to minimize.
[2022-06-03 19:05:24] [INFO ] Deduced a trap composed of 30 places in 324 ms of which 1 ms to minimize.
[2022-06-03 19:05:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-03 19:05:24] [INFO ] After 25225ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 12703 ms.
Support contains 157 out of 1503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Drop transitions removed 331 transitions
Trivial Post-agglo rules discarded 331 transitions
Performed 331 trivial Post agglomeration. Transition count delta: 331
Iterating post reduction 0 with 331 rules applied. Total rules applied 331 place count 1503 transition count 1172
Reduce places removed 331 places and 0 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Iterating post reduction 1 with 366 rules applied. Total rules applied 697 place count 1172 transition count 1137
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 732 place count 1137 transition count 1137
Performed 135 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 135 Pre rules applied. Total rules applied 732 place count 1137 transition count 1002
Deduced a syphon composed of 135 places in 2 ms
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 3 with 270 rules applied. Total rules applied 1002 place count 1002 transition count 1002
Discarding 187 places :
Symmetric choice reduction at 3 with 187 rule applications. Total rules 1189 place count 815 transition count 815
Iterating global reduction 3 with 187 rules applied. Total rules applied 1376 place count 815 transition count 815
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 53 Pre rules applied. Total rules applied 1376 place count 815 transition count 762
Deduced a syphon composed of 53 places in 3 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 1482 place count 762 transition count 762
Performed 230 Post agglomeration using F-continuation condition.Transition count delta: 230
Deduced a syphon composed of 230 places in 2 ms
Reduce places removed 230 places and 0 transitions.
Iterating global reduction 3 with 460 rules applied. Total rules applied 1942 place count 532 transition count 532
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 54 places in 2 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 2050 place count 478 transition count 558
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 2054 place count 478 transition count 554
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 2058 place count 474 transition count 554
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 2060 place count 474 transition count 552
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 2062 place count 474 transition count 552
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2063 place count 473 transition count 551
Applied a total of 2063 rules in 414 ms. Remains 473 /1503 variables (removed 1030) and now considering 551/1503 (removed 952) transitions.
Finished structural reductions, in 1 iterations. Remains : 473/1503 places, 551/1503 transitions.
Incomplete random walk after 1000000 steps, including 51 resets, run finished after 20437 ms. (steps per millisecond=48 ) properties (out of 6) seen :2
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 6 resets, run finished after 4275 ms. (steps per millisecond=233 ) properties (out of 4) seen :1
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 10 resets, run finished after 3692 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 8 resets, run finished after 3733 ms. (steps per millisecond=267 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 12 resets, run finished after 4383 ms. (steps per millisecond=228 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 551 rows 473 cols
[2022-06-03 19:06:14] [INFO ] Computed 121 place invariants in 6 ms
[2022-06-03 19:06:14] [INFO ] [Real]Absence check using 121 positive place invariants in 21 ms returned sat
[2022-06-03 19:06:14] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-03 19:06:14] [INFO ] [Nat]Absence check using 121 positive place invariants in 26 ms returned sat
[2022-06-03 19:06:14] [INFO ] After 326ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-03 19:06:14] [INFO ] State equation strengthened by 92 read => feed constraints.
[2022-06-03 19:06:14] [INFO ] After 244ms SMT Verify possible using 92 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-03 19:06:15] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 0 ms to minimize.
[2022-06-03 19:06:15] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2022-06-03 19:06:15] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2022-06-03 19:06:15] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2022-06-03 19:06:15] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2022-06-03 19:06:15] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 0 ms to minimize.
[2022-06-03 19:06:15] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 1 ms to minimize.
[2022-06-03 19:06:15] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 0 ms to minimize.
[2022-06-03 19:06:15] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 0 ms to minimize.
[2022-06-03 19:06:15] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 956 ms
[2022-06-03 19:06:16] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
[2022-06-03 19:06:16] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 0 ms to minimize.
[2022-06-03 19:06:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 242 ms
[2022-06-03 19:06:16] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 0 ms to minimize.
[2022-06-03 19:06:16] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 0 ms to minimize.
[2022-06-03 19:06:16] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2022-06-03 19:06:16] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2022-06-03 19:06:16] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2022-06-03 19:06:16] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2022-06-03 19:06:17] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 0 ms to minimize.
[2022-06-03 19:06:17] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2022-06-03 19:06:17] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 0 ms to minimize.
[2022-06-03 19:06:17] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 0 ms to minimize.
[2022-06-03 19:06:17] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 6 ms to minimize.
[2022-06-03 19:06:17] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1228 ms
[2022-06-03 19:06:17] [INFO ] After 2845ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 215 ms.
[2022-06-03 19:06:17] [INFO ] After 3526ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1725 ms.
Support contains 68 out of 473 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 473/473 places, 551/551 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 473 transition count 529
Reduce places removed 22 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 25 rules applied. Total rules applied 47 place count 451 transition count 526
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 50 place count 448 transition count 526
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 50 place count 448 transition count 489
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 124 place count 411 transition count 489
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 131 place count 404 transition count 481
Iterating global reduction 3 with 7 rules applied. Total rules applied 138 place count 404 transition count 481
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 138 place count 404 transition count 478
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 144 place count 401 transition count 478
Performed 27 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 199 place count 373 transition count 450
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 201 place count 373 transition count 448
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 243 place count 352 transition count 464
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 245 place count 352 transition count 462
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 247 place count 350 transition count 462
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 249 place count 348 transition count 460
Applied a total of 249 rules in 85 ms. Remains 348 /473 variables (removed 125) and now considering 460/551 (removed 91) transitions.
Finished structural reductions, in 1 iterations. Remains : 348/473 places, 460/551 transitions.
Incomplete random walk after 1000000 steps, including 126 resets, run finished after 15503 ms. (steps per millisecond=64 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 15 resets, run finished after 4678 ms. (steps per millisecond=213 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 10 resets, run finished after 3775 ms. (steps per millisecond=264 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 19 resets, run finished after 4247 ms. (steps per millisecond=235 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 9675280 steps, run timeout after 84001 ms. (steps per millisecond=115 ) properties seen :{0=1}
Probabilistic random walk after 9675280 steps, saw 4746829 distinct states, run finished after 84002 ms. (steps per millisecond=115 ) properties seen :1
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 460 rows 348 cols
[2022-06-03 19:08:11] [INFO ] Computed 120 place invariants in 5 ms
[2022-06-03 19:08:11] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 19:08:11] [INFO ] [Nat]Absence check using 120 positive place invariants in 16 ms returned sat
[2022-06-03 19:08:12] [INFO ] After 214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 19:08:12] [INFO ] State equation strengthened by 131 read => feed constraints.
[2022-06-03 19:08:12] [INFO ] After 248ms SMT Verify possible using 131 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 19:08:12] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 0 ms to minimize.
[2022-06-03 19:08:12] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2022-06-03 19:08:12] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2022-06-03 19:08:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 231 ms
[2022-06-03 19:08:12] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2022-06-03 19:08:12] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2022-06-03 19:08:13] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 0 ms to minimize.
[2022-06-03 19:08:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 245 ms
[2022-06-03 19:08:13] [INFO ] After 916ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 269 ms.
[2022-06-03 19:08:13] [INFO ] After 1501ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 417 ms.
Support contains 67 out of 348 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 348/348 places, 460/460 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 348 transition count 459
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 347 transition count 459
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 346 transition count 461
Applied a total of 4 rules in 20 ms. Remains 346 /348 variables (removed 2) and now considering 461/460 (removed -1) transitions.
Finished structural reductions, in 1 iterations. Remains : 346/348 places, 461/460 transitions.
Incomplete random walk after 1000000 steps, including 98 resets, run finished after 10153 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 19 resets, run finished after 2995 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 27 resets, run finished after 3709 ms. (steps per millisecond=269 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 4997016 steps, run timeout after 48001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 4997016 steps, saw 3078202 distinct states, run finished after 48003 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 461 rows 346 cols
[2022-06-03 19:09:18] [INFO ] Computed 120 place invariants in 2 ms
[2022-06-03 19:09:18] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 19:09:18] [INFO ] [Nat]Absence check using 120 positive place invariants in 15 ms returned sat
[2022-06-03 19:09:19] [INFO ] After 207ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 19:09:19] [INFO ] State equation strengthened by 135 read => feed constraints.
[2022-06-03 19:09:19] [INFO ] After 289ms SMT Verify possible using 135 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 19:09:19] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 1 ms to minimize.
[2022-06-03 19:09:19] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 0 ms to minimize.
[2022-06-03 19:09:19] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 0 ms to minimize.
[2022-06-03 19:09:19] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2022-06-03 19:09:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 413 ms
[2022-06-03 19:09:20] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2022-06-03 19:09:20] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 0 ms to minimize.
[2022-06-03 19:09:20] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2022-06-03 19:09:20] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2022-06-03 19:09:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 446 ms
[2022-06-03 19:09:20] [INFO ] After 1435ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 394 ms.
[2022-06-03 19:09:20] [INFO ] After 2115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 591 ms.
Support contains 67 out of 346 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 346/346 places, 461/461 transitions.
Applied a total of 0 rules in 12 ms. Remains 346 /346 variables (removed 0) and now considering 461/461 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 346/346 places, 461/461 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 346/346 places, 461/461 transitions.
Applied a total of 0 rules in 8 ms. Remains 346 /346 variables (removed 0) and now considering 461/461 (removed 0) transitions.
// Phase 1: matrix 461 rows 346 cols
[2022-06-03 19:09:21] [INFO ] Computed 120 place invariants in 1 ms
[2022-06-03 19:09:21] [INFO ] Implicit Places using invariants in 264 ms returned []
// Phase 1: matrix 461 rows 346 cols
[2022-06-03 19:09:21] [INFO ] Computed 120 place invariants in 2 ms
[2022-06-03 19:09:21] [INFO ] State equation strengthened by 135 read => feed constraints.
[2022-06-03 19:09:22] [INFO ] Implicit Places using invariants and state equation in 580 ms returned []
Implicit Place search using SMT with State Equation took 847 ms to find 0 implicit places.
[2022-06-03 19:09:22] [INFO ] Redundant transitions in 38 ms returned []
// Phase 1: matrix 461 rows 346 cols
[2022-06-03 19:09:22] [INFO ] Computed 120 place invariants in 4 ms
[2022-06-03 19:09:22] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 346/346 places, 461/461 transitions.
Incomplete random walk after 1000000 steps, including 103 resets, run finished after 9439 ms. (steps per millisecond=105 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 15 resets, run finished after 3189 ms. (steps per millisecond=313 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 16 resets, run finished after 3714 ms. (steps per millisecond=269 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 5499340 steps, run timeout after 48001 ms. (steps per millisecond=114 ) properties seen :{}
Probabilistic random walk after 5499340 steps, saw 3337511 distinct states, run finished after 48001 ms. (steps per millisecond=114 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 461 rows 346 cols
[2022-06-03 19:10:26] [INFO ] Computed 120 place invariants in 1 ms
[2022-06-03 19:10:27] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 19:10:27] [INFO ] [Nat]Absence check using 120 positive place invariants in 15 ms returned sat
[2022-06-03 19:10:27] [INFO ] After 217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 19:10:27] [INFO ] State equation strengthened by 135 read => feed constraints.
[2022-06-03 19:10:27] [INFO ] After 296ms SMT Verify possible using 135 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 19:10:27] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2022-06-03 19:10:27] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2022-06-03 19:10:27] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2022-06-03 19:10:27] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2022-06-03 19:10:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 317 ms
[2022-06-03 19:10:28] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2022-06-03 19:10:28] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 0 ms to minimize.
[2022-06-03 19:10:28] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2022-06-03 19:10:28] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2022-06-03 19:10:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 371 ms
[2022-06-03 19:10:28] [INFO ] After 1263ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 400 ms.
[2022-06-03 19:10:28] [INFO ] After 1968ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 522 ms.
Support contains 67 out of 346 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 346/346 places, 461/461 transitions.
Applied a total of 0 rules in 8 ms. Remains 346 /346 variables (removed 0) and now considering 461/461 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 346/346 places, 461/461 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 346/346 places, 461/461 transitions.
Applied a total of 0 rules in 8 ms. Remains 346 /346 variables (removed 0) and now considering 461/461 (removed 0) transitions.
// Phase 1: matrix 461 rows 346 cols
[2022-06-03 19:10:29] [INFO ] Computed 120 place invariants in 3 ms
[2022-06-03 19:10:29] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 461 rows 346 cols
[2022-06-03 19:10:29] [INFO ] Computed 120 place invariants in 5 ms
[2022-06-03 19:10:29] [INFO ] State equation strengthened by 135 read => feed constraints.
[2022-06-03 19:10:30] [INFO ] Implicit Places using invariants and state equation in 562 ms returned []
Implicit Place search using SMT with State Equation took 712 ms to find 0 implicit places.
[2022-06-03 19:10:30] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 461 rows 346 cols
[2022-06-03 19:10:30] [INFO ] Computed 120 place invariants in 2 ms
[2022-06-03 19:10:30] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 346/346 places, 461/461 transitions.
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 346 transition count 449
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 22 place count 346 transition count 449
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 346 transition count 448
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 346 transition count 442
Applied a total of 29 rules in 30 ms. Remains 346 /346 variables (removed 0) and now considering 442/461 (removed 19) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 442 rows 346 cols
[2022-06-03 19:10:30] [INFO ] Computed 120 place invariants in 1 ms
[2022-06-03 19:10:30] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 19:10:30] [INFO ] [Nat]Absence check using 120 positive place invariants in 16 ms returned sat
[2022-06-03 19:10:30] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 19:10:30] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 0 ms to minimize.
[2022-06-03 19:10:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2022-06-03 19:10:31] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2022-06-03 19:10:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2022-06-03 19:10:31] [INFO ] After 438ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 102 ms.
[2022-06-03 19:10:31] [INFO ] After 627ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-03 19:10:31] [INFO ] Flatten gal took : 73 ms
[2022-06-03 19:10:31] [INFO ] Flatten gal took : 33 ms
[2022-06-03 19:10:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7549602441593871191.gal : 16 ms
[2022-06-03 19:10:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11996934349534778420.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/ReachabilityCardinality7549602441593871191.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11996934349534778420.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...320
Loading property file /tmp/ReachabilityCardinality11996934349534778420.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 14
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :14 after 290
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :290 after 22682
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :22682 after 1.10225e+07
Detected timeout of ITS tools.
[2022-06-03 19:10:46] [INFO ] Flatten gal took : 31 ms
[2022-06-03 19:10:46] [INFO ] Applying decomposition
[2022-06-03 19:10:46] [INFO ] Flatten gal took : 30 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/graph13055802774907904127.txt' '-o' '/tmp/graph13055802774907904127.bin' '-w' '/tmp/graph13055802774907904127.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13055802774907904127.bin' '-l' '-1' '-v' '-w' '/tmp/graph13055802774907904127.weights' '-q' '0' '-e' '0.001'
[2022-06-03 19:10:46] [INFO ] Decomposing Gal with order
[2022-06-03 19:10:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 19:10:46] [INFO ] Removed a total of 379 redundant transitions.
[2022-06-03 19:10:46] [INFO ] Flatten gal took : 85 ms
[2022-06-03 19:10:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 20 ms.
[2022-06-03 19:10:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13285831043304533192.gal : 11 ms
[2022-06-03 19:10:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10463149647211654285.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/ReachabilityCardinality13285831043304533192.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10463149647211654285.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...300
Loading property file /tmp/ReachabilityCardinality10463149647211654285.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 220
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :220 after 4540
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :4540 after 2.48006e+08
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.62916e+47,2.55926,74300,562,30,135132,347,1075,402307,89,869,0
Total reachable state count : 4.629157628697481549689160188281256741838e+47

Verifying 2 reachability properties.
Invariant property ShieldRVt-PT-030B-ReachabilityFireability-07 is true.

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-030B-ReachabilityFireability-07,0,2.56641,74300,1,0,135132,347,1099,402307,95,869,700
Reachability property ShieldRVt-PT-030B-ReachabilityFireability-14 is true.

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-030B-ReachabilityFireability-14,5.21518e+40,2.57632,74300,199,25,135132,347,1204,402307,99,869,2808
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-07 TRUE TECHNIQUES OVER_APPROXIMATION
[2022-06-03 19:10:49] [INFO ] Flatten gal took : 27 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16886992691350278414
[2022-06-03 19:10:49] [INFO ] Applying decomposition
[2022-06-03 19:10:49] [INFO ] Computing symmetric may disable matrix : 461 transitions.
[2022-06-03 19:10:49] [INFO ] Computation of Complete disable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 19:10:49] [INFO ] Computing symmetric may enable matrix : 461 transitions.
[2022-06-03 19:10:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 19:10:49] [INFO ] Flatten gal took : 50 ms
[2022-06-03 19:10:49] [INFO ] Flatten gal took : 61 ms
[2022-06-03 19:10:49] [INFO ] Input system was already deterministic with 461 transitions.
[2022-06-03 19:10:49] [INFO ] Computing Do-Not-Accords matrix : 461 transitions.
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/graph3742418351716689853.txt' '-o' '/tmp/graph3742418351716689853.bin' '-w' '/tmp/graph3742418351716689853.weights'
[2022-06-03 19:10:49] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3742418351716689853.bin' '-l' '-1' '-v' '-w' '/tmp/graph3742418351716689853.weights' '-q' '0' '-e' '0.001'
[2022-06-03 19:10:49] [INFO ] Decomposing Gal with order
[2022-06-03 19:10:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 19:10:49] [INFO ] Built C files in 176ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16886992691350278414
Running compilation step : cd /tmp/ltsmin16886992691350278414;'/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'
[2022-06-03 19:10:49] [INFO ] Removed a total of 529 redundant transitions.
[2022-06-03 19:10:49] [INFO ] Flatten gal took : 51 ms
[2022-06-03 19:10:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 310 labels/synchronizations in 30 ms.
[2022-06-03 19:10:49] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability1446623591085202468.gal : 7 ms
[2022-06-03 19:10:49] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability4096723154623550956.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/ReachabilityFireability1446623591085202468.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability4096723154623550956.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
Loading property file /tmp/ReachabilityFireability4096723154623550956.prop.
[2022-06-03 19:10:50] [INFO ] Ran tautology test, simplified 0 / 1 in 366 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 166
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :166 after 220
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :220 after 612364
[2022-06-03 19:10:50] [INFO ] BMC solution for property ShieldRVt-PT-030B-ReachabilityFireability-14(UNSAT) depth K=0 took 6 ms
[2022-06-03 19:10:50] [INFO ] BMC solution for property ShieldRVt-PT-030B-ReachabilityFireability-14(UNSAT) depth K=1 took 14 ms
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :612364 after 1.48804e+08
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 461 rows 346 cols
[2022-06-03 19:10:50] [INFO ] Computed 120 place invariants in 1 ms
[2022-06-03 19:10:50] [INFO ] Computed 120 place invariants in 2 ms
Reachability property ShieldRVt-PT-030B-ReachabilityFireability-14 is true.
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
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,5.04233e+38,0.341045,12000,953,128,15659,484,876,26343,136,1653,0
Total reachable state count : 504232559998445550531350261164805193728

Verifying 1 reachability properties.
Reachability property ShieldRVt-PT-030B-ReachabilityFireability-14 is true.

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-030B-ReachabilityFireability-14,3.83166e+30,0.408022,12264,367,77,15659,484,1133,26343,155,1653,0
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-03 19:10:50] [WARNING] Interrupting SMT solver.
[2022-06-03 19:10:50] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
Exception in thread "Thread-11" java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:320)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:117)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:283)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-03 19:10:50] [WARNING] Unexpected error occurred while running SMT. Was verifying ShieldRVt-PT-030B-ReachabilityFireability-14 SMT depth 2
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:411)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
... 2 more
[2022-06-03 19:10:50] [INFO ] During BMC, SMT solver timed out at depth 2
[2022-06-03 19:10:50] [INFO ] BMC solving timed out (3600000 secs) at depth 2
[2022-06-03 19:10:50] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.
Total runtime 353562 ms.

BK_STOP 1654283450554

--------------------
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="ShieldRVt-PT-030B"
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 ShieldRVt-PT-030B, 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-165286026101007"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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