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-165286025800815.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 ShieldRVs-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-165286025800815
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 7.7K Apr 30 06:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 30 06:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 30 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 30 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 30 06:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 30 06:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 30 06:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Apr 30 06:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 244K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1654279663739

Running Version 202205111006
[2022-06-03 18:07:44] [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 18:07:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 18:07:45] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2022-06-03 18:07:45] [INFO ] Transformed 803 places.
[2022-06-03 18:07:45] [INFO ] Transformed 903 transitions.
[2022-06-03 18:07:45] [INFO ] Found NUPN structural information;
[2022-06-03 18:07:45] [INFO ] Parsed PT model containing 803 places and 903 transitions in 263 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 11 resets, run finished after 456 ms. (steps per millisecond=21 ) properties (out of 16) seen :10
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 903 rows 803 cols
[2022-06-03 18:07:46] [INFO ] Computed 81 place invariants in 28 ms
[2022-06-03 18:07:46] [INFO ] After 549ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-03 18:07:47] [INFO ] [Nat]Absence check using 81 positive place invariants in 63 ms returned sat
[2022-06-03 18:07:48] [INFO ] After 1313ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-06-03 18:07:49] [INFO ] Deduced a trap composed of 32 places in 233 ms of which 4 ms to minimize.
[2022-06-03 18:07:49] [INFO ] Deduced a trap composed of 45 places in 238 ms of which 2 ms to minimize.
[2022-06-03 18:07:49] [INFO ] Deduced a trap composed of 21 places in 217 ms of which 2 ms to minimize.
[2022-06-03 18:07:49] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 2 ms to minimize.
[2022-06-03 18:07:50] [INFO ] Deduced a trap composed of 25 places in 217 ms of which 1 ms to minimize.
[2022-06-03 18:07:50] [INFO ] Deduced a trap composed of 45 places in 161 ms of which 1 ms to minimize.
[2022-06-03 18:07:50] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 1 ms to minimize.
[2022-06-03 18:07:50] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 1 ms to minimize.
[2022-06-03 18:07:50] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 1 ms to minimize.
[2022-06-03 18:07:51] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 1 ms to minimize.
[2022-06-03 18:07:51] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 1 ms to minimize.
[2022-06-03 18:07:51] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 1 ms to minimize.
[2022-06-03 18:07:51] [INFO ] Deduced a trap composed of 29 places in 248 ms of which 0 ms to minimize.
[2022-06-03 18:07:51] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 1 ms to minimize.
[2022-06-03 18:07:52] [INFO ] Deduced a trap composed of 17 places in 210 ms of which 0 ms to minimize.
[2022-06-03 18:07:52] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 1 ms to minimize.
[2022-06-03 18:07:52] [INFO ] Deduced a trap composed of 33 places in 154 ms of which 0 ms to minimize.
[2022-06-03 18:07:52] [INFO ] Deduced a trap composed of 29 places in 144 ms of which 0 ms to minimize.
[2022-06-03 18:07:53] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 0 ms to minimize.
[2022-06-03 18:07:53] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 1 ms to minimize.
[2022-06-03 18:07:53] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 1 ms to minimize.
[2022-06-03 18:07:53] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 0 ms to minimize.
[2022-06-03 18:07:53] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 1 ms to minimize.
[2022-06-03 18:07:53] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 1 ms to minimize.
[2022-06-03 18:07:54] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 0 ms to minimize.
[2022-06-03 18:07:54] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 1 ms to minimize.
[2022-06-03 18:07:54] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 0 ms to minimize.
[2022-06-03 18:07:54] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 1 ms to minimize.
[2022-06-03 18:07:54] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 1 ms to minimize.
[2022-06-03 18:07:54] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 0 ms to minimize.
[2022-06-03 18:07:54] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 0 ms to minimize.
[2022-06-03 18:07:54] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 0 ms to minimize.
[2022-06-03 18:07:55] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 0 ms to minimize.
[2022-06-03 18:07:55] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2022-06-03 18:07:55] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 6385 ms
[2022-06-03 18:07:55] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 2 ms to minimize.
[2022-06-03 18:07:55] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 0 ms to minimize.
[2022-06-03 18:07:55] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 1 ms to minimize.
[2022-06-03 18:07:55] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 0 ms to minimize.
[2022-06-03 18:07:56] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 0 ms to minimize.
[2022-06-03 18:07:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 812 ms
[2022-06-03 18:07:56] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 1 ms to minimize.
[2022-06-03 18:07:56] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 0 ms to minimize.
[2022-06-03 18:07:56] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 0 ms to minimize.
[2022-06-03 18:07:56] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 0 ms to minimize.
[2022-06-03 18:07:56] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 0 ms to minimize.
[2022-06-03 18:07:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 620 ms
[2022-06-03 18:07:57] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 0 ms to minimize.
[2022-06-03 18:07:57] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 0 ms to minimize.
[2022-06-03 18:07:57] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 1 ms to minimize.
[2022-06-03 18:07:57] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 1 ms to minimize.
[2022-06-03 18:07:57] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 1 ms to minimize.
[2022-06-03 18:07:58] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 0 ms to minimize.
[2022-06-03 18:07:58] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 1 ms to minimize.
[2022-06-03 18:07:58] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 0 ms to minimize.
[2022-06-03 18:07:58] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 1 ms to minimize.
[2022-06-03 18:07:58] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 1 ms to minimize.
[2022-06-03 18:07:58] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 1 ms to minimize.
[2022-06-03 18:07:58] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 1 ms to minimize.
[2022-06-03 18:07:59] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 7 ms to minimize.
[2022-06-03 18:07:59] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 0 ms to minimize.
[2022-06-03 18:07:59] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 1 ms to minimize.
[2022-06-03 18:07:59] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 1 ms to minimize.
[2022-06-03 18:07:59] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 1 ms to minimize.
[2022-06-03 18:07:59] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 0 ms to minimize.
[2022-06-03 18:07:59] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2022-06-03 18:08:00] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 1 ms to minimize.
[2022-06-03 18:08:00] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
[2022-06-03 18:08:00] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 3 ms to minimize.
[2022-06-03 18:08:00] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2022-06-03 18:08:00] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 1 ms to minimize.
[2022-06-03 18:08:00] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 4 ms to minimize.
[2022-06-03 18:08:00] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 3812 ms
[2022-06-03 18:08:01] [INFO ] Deduced a trap composed of 29 places in 194 ms of which 1 ms to minimize.
[2022-06-03 18:08:01] [INFO ] Deduced a trap composed of 33 places in 198 ms of which 0 ms to minimize.
[2022-06-03 18:08:01] [INFO ] Deduced a trap composed of 26 places in 170 ms of which 0 ms to minimize.
[2022-06-03 18:08:01] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 1 ms to minimize.
[2022-06-03 18:08:02] [INFO ] Deduced a trap composed of 21 places in 175 ms of which 0 ms to minimize.
[2022-06-03 18:08:02] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 1 ms to minimize.
[2022-06-03 18:08:02] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 1 ms to minimize.
[2022-06-03 18:08:02] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 0 ms to minimize.
[2022-06-03 18:08:02] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 1 ms to minimize.
[2022-06-03 18:08:03] [INFO ] Deduced a trap composed of 34 places in 131 ms of which 1 ms to minimize.
[2022-06-03 18:08:03] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 1 ms to minimize.
[2022-06-03 18:08:03] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2022-06-03 18:08:03] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2022-06-03 18:08:03] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2022-06-03 18:08:03] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 0 ms to minimize.
[2022-06-03 18:08:04] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 0 ms to minimize.
[2022-06-03 18:08:04] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 0 ms to minimize.
[2022-06-03 18:08:04] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 0 ms to minimize.
[2022-06-03 18:08:04] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 0 ms to minimize.
[2022-06-03 18:08:04] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 0 ms to minimize.
[2022-06-03 18:08:04] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3577 ms
[2022-06-03 18:08:04] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 0 ms to minimize.
[2022-06-03 18:08:05] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 1 ms to minimize.
[2022-06-03 18:08:05] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 0 ms to minimize.
[2022-06-03 18:08:05] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 0 ms to minimize.
[2022-06-03 18:08:05] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 0 ms to minimize.
[2022-06-03 18:08:05] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 0 ms to minimize.
[2022-06-03 18:08:05] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 0 ms to minimize.
[2022-06-03 18:08:05] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 0 ms to minimize.
[2022-06-03 18:08:05] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 0 ms to minimize.
[2022-06-03 18:08:06] [INFO ] Deduced a trap composed of 47 places in 96 ms of which 0 ms to minimize.
[2022-06-03 18:08:06] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 0 ms to minimize.
[2022-06-03 18:08:06] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 0 ms to minimize.
[2022-06-03 18:08:06] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 0 ms to minimize.
[2022-06-03 18:08:06] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 0 ms to minimize.
[2022-06-03 18:08:06] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 0 ms to minimize.
[2022-06-03 18:08:06] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
[2022-06-03 18:08:06] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2142 ms
[2022-06-03 18:08:06] [INFO ] After 19455ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1205 ms.
[2022-06-03 18:08:08] [INFO ] After 21426ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 6973 ms.
Support contains 167 out of 803 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 803/803 places, 903/903 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 803 transition count 844
Reduce places removed 59 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 66 rules applied. Total rules applied 125 place count 744 transition count 837
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 132 place count 737 transition count 837
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 83 Pre rules applied. Total rules applied 132 place count 737 transition count 754
Deduced a syphon composed of 83 places in 3 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 298 place count 654 transition count 754
Discarding 106 places :
Symmetric choice reduction at 3 with 106 rule applications. Total rules 404 place count 548 transition count 648
Iterating global reduction 3 with 106 rules applied. Total rules applied 510 place count 548 transition count 648
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 510 place count 548 transition count 628
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 550 place count 528 transition count 628
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 2 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 222 rules applied. Total rules applied 772 place count 417 transition count 517
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 792 place count 417 transition count 517
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 793 place count 416 transition count 516
Applied a total of 793 rules in 196 ms. Remains 416 /803 variables (removed 387) and now considering 516/903 (removed 387) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/803 places, 516/903 transitions.
Incomplete random walk after 1000000 steps, including 2179 resets, run finished after 19313 ms. (steps per millisecond=51 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 212 resets, run finished after 3733 ms. (steps per millisecond=267 ) properties (out of 6) seen :1
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 222 resets, run finished after 3578 ms. (steps per millisecond=279 ) properties (out of 5) seen :1
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 204 resets, run finished after 2718 ms. (steps per millisecond=367 ) properties (out of 4) seen :1
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 203 resets, run finished after 2432 ms. (steps per millisecond=411 ) properties (out of 3) seen :1
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 218 resets, run finished after 2794 ms. (steps per millisecond=357 ) properties (out of 2) seen :1
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 192 resets, run finished after 1834 ms. (steps per millisecond=545 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 516 rows 416 cols
[2022-06-03 18:08:51] [INFO ] Computed 81 place invariants in 9 ms
[2022-06-03 18:08:51] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 18:08:51] [INFO ] [Nat]Absence check using 81 positive place invariants in 15 ms returned sat
[2022-06-03 18:08:52] [INFO ] After 212ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 18:08:52] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2022-06-03 18:08:52] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 1 ms to minimize.
[2022-06-03 18:08:52] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 0 ms to minimize.
[2022-06-03 18:08:52] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 0 ms to minimize.
[2022-06-03 18:08:52] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 0 ms to minimize.
[2022-06-03 18:08:52] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 0 ms to minimize.
[2022-06-03 18:08:52] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 0 ms to minimize.
[2022-06-03 18:08:52] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2022-06-03 18:08:53] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2022-06-03 18:08:53] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 0 ms to minimize.
[2022-06-03 18:08:53] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 0 ms to minimize.
[2022-06-03 18:08:53] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 0 ms to minimize.
[2022-06-03 18:08:53] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2022-06-03 18:08:53] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1257 ms
[2022-06-03 18:08:53] [INFO ] After 1521ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2022-06-03 18:08:53] [INFO ] After 1651ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 97 ms.
Support contains 24 out of 416 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 416/416 places, 516/516 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 416 transition count 508
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 408 transition count 508
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 16 place count 408 transition count 481
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 70 place count 381 transition count 481
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 74 place count 377 transition count 477
Iterating global reduction 2 with 4 rules applied. Total rules applied 78 place count 377 transition count 477
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 218 place count 307 transition count 407
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 2 with 15 rules applied. Total rules applied 233 place count 307 transition count 407
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 235 place count 305 transition count 405
Applied a total of 235 rules in 83 ms. Remains 305 /416 variables (removed 111) and now considering 405/516 (removed 111) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/416 places, 405/516 transitions.
Incomplete random walk after 1000000 steps, including 3450 resets, run finished after 3160 ms. (steps per millisecond=316 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 383 resets, run finished after 1840 ms. (steps per millisecond=543 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4105797 steps, run timeout after 15001 ms. (steps per millisecond=273 ) properties seen :{}
Probabilistic random walk after 4105797 steps, saw 775085 distinct states, run finished after 15005 ms. (steps per millisecond=273 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 405 rows 305 cols
[2022-06-03 18:09:13] [INFO ] Computed 81 place invariants in 6 ms
[2022-06-03 18:09:13] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 18:09:13] [INFO ] [Nat]Absence check using 81 positive place invariants in 11 ms returned sat
[2022-06-03 18:09:13] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 18:09:13] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2022-06-03 18:09:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2022-06-03 18:09:14] [INFO ] After 246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2022-06-03 18:09:14] [INFO ] After 338ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 58 ms.
Support contains 24 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 405/405 transitions.
Applied a total of 0 rules in 31 ms. Remains 305 /305 variables (removed 0) and now considering 405/405 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 405/405 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 405/405 transitions.
Applied a total of 0 rules in 12 ms. Remains 305 /305 variables (removed 0) and now considering 405/405 (removed 0) transitions.
// Phase 1: matrix 405 rows 305 cols
[2022-06-03 18:09:14] [INFO ] Computed 81 place invariants in 2 ms
[2022-06-03 18:09:14] [INFO ] Implicit Places using invariants in 166 ms returned []
// Phase 1: matrix 405 rows 305 cols
[2022-06-03 18:09:14] [INFO ] Computed 81 place invariants in 16 ms
[2022-06-03 18:09:14] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
[2022-06-03 18:09:14] [INFO ] Redundant transitions in 51 ms returned []
// Phase 1: matrix 405 rows 305 cols
[2022-06-03 18:09:14] [INFO ] Computed 81 place invariants in 1 ms
[2022-06-03 18:09:14] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 405/405 transitions.
Incomplete random walk after 1000000 steps, including 3447 resets, run finished after 3158 ms. (steps per millisecond=316 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 379 resets, run finished after 1826 ms. (steps per millisecond=547 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3253035 steps, run timeout after 12001 ms. (steps per millisecond=271 ) properties seen :{}
Probabilistic random walk after 3253035 steps, saw 625414 distinct states, run finished after 12001 ms. (steps per millisecond=271 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 405 rows 305 cols
[2022-06-03 18:09:31] [INFO ] Computed 81 place invariants in 5 ms
[2022-06-03 18:09:31] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 18:09:32] [INFO ] [Nat]Absence check using 81 positive place invariants in 11 ms returned sat
[2022-06-03 18:09:32] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 18:09:32] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 0 ms to minimize.
[2022-06-03 18:09:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2022-06-03 18:09:32] [INFO ] After 266ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2022-06-03 18:09:32] [INFO ] After 375ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 52 ms.
Support contains 24 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 405/405 transitions.
Applied a total of 0 rules in 11 ms. Remains 305 /305 variables (removed 0) and now considering 405/405 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 405/405 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 405/405 transitions.
Applied a total of 0 rules in 10 ms. Remains 305 /305 variables (removed 0) and now considering 405/405 (removed 0) transitions.
// Phase 1: matrix 405 rows 305 cols
[2022-06-03 18:09:32] [INFO ] Computed 81 place invariants in 2 ms
[2022-06-03 18:09:32] [INFO ] Implicit Places using invariants in 172 ms returned []
// Phase 1: matrix 405 rows 305 cols
[2022-06-03 18:09:32] [INFO ] Computed 81 place invariants in 1 ms
[2022-06-03 18:09:32] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
[2022-06-03 18:09:32] [INFO ] Redundant transitions in 35 ms returned []
// Phase 1: matrix 405 rows 305 cols
[2022-06-03 18:09:32] [INFO ] Computed 81 place invariants in 2 ms
[2022-06-03 18:09:33] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 405/405 transitions.
Applied a total of 0 rules in 9 ms. Remains 305 /305 variables (removed 0) and now considering 405/405 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 405 rows 305 cols
[2022-06-03 18:09:33] [INFO ] Computed 81 place invariants in 1 ms
[2022-06-03 18:09:33] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 18:09:33] [INFO ] [Nat]Absence check using 81 positive place invariants in 10 ms returned sat
[2022-06-03 18:09:33] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 18:09:33] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2022-06-03 18:09:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2022-06-03 18:09:33] [INFO ] After 244ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2022-06-03 18:09:33] [INFO ] After 342ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-03 18:09:33] [INFO ] Flatten gal took : 122 ms
[2022-06-03 18:09:33] [INFO ] Flatten gal took : 41 ms
[2022-06-03 18:09:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6892565693211994921.gal : 46 ms
[2022-06-03 18:09:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16647839801650209807.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/ReachabilityCardinality6892565693211994921.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16647839801650209807.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/ReachabilityCardinality16647839801650209807.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 65
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :65 after 325
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :325 after 1950
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1950 after 20956
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :20956 after 21786
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :21786 after 37894
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :37894 after 70070
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :70070 after 1.50454e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.50454e+06 after 2.00919e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.00919e+07 after 1.17972e+10
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.17972e+10 after 1.57457e+12
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.57457e+12 after 2.22757e+15
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.22757e+15 after 2.84815e+19
Detected timeout of ITS tools.
[2022-06-03 18:09:49] [INFO ] Flatten gal took : 36 ms
[2022-06-03 18:09:49] [INFO ] Applying decomposition
[2022-06-03 18:09:49] [INFO ] Flatten gal took : 32 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/graph5490433275104089941.txt' '-o' '/tmp/graph5490433275104089941.bin' '-w' '/tmp/graph5490433275104089941.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5490433275104089941.bin' '-l' '-1' '-v' '-w' '/tmp/graph5490433275104089941.weights' '-q' '0' '-e' '0.001'
[2022-06-03 18:09:49] [INFO ] Decomposing Gal with order
[2022-06-03 18:09:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 18:09:49] [INFO ] Removed a total of 487 redundant transitions.
[2022-06-03 18:09:49] [INFO ] Flatten gal took : 129 ms
[2022-06-03 18:09:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 393 labels/synchronizations in 28 ms.
[2022-06-03 18:09:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6980421040423905610.gal : 12 ms
[2022-06-03 18:09:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9352929041718916033.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/ReachabilityCardinality6980421040423905610.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9352929041718916033.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/ReachabilityCardinality9352929041718916033.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 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 13
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :13 after 65
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :65 after 189800
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :956800 after 1.3454e+16
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4300266412848454010
[2022-06-03 18:10:04] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4300266412848454010
Running compilation step : cd /tmp/ltsmin4300266412848454010;'/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 728 ms.
Running link step : cd /tmp/ltsmin4300266412848454010;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin4300266412848454010;'/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' 'ShieldRVsPT020BReachabilityFireability14==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-03 18:10:19] [INFO ] Flatten gal took : 26 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6315564282541261169
[2022-06-03 18:10:19] [INFO ] Computing symmetric may disable matrix : 405 transitions.
[2022-06-03 18:10:19] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 18:10:19] [INFO ] Computing symmetric may enable matrix : 405 transitions.
[2022-06-03 18:10:19] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 18:10:19] [INFO ] Applying decomposition
[2022-06-03 18:10:19] [INFO ] Flatten gal took : 24 ms
[2022-06-03 18:10:19] [INFO ] Flatten gal took : 51 ms
[2022-06-03 18:10:19] [INFO ] Computing Do-Not-Accords matrix : 405 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/graph12697812241405247324.txt' '-o' '/tmp/graph12697812241405247324.bin' '-w' '/tmp/graph12697812241405247324.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12697812241405247324.bin' '-l' '-1' '-v' '-w' '/tmp/graph12697812241405247324.weights' '-q' '0' '-e' '0.001'
[2022-06-03 18:10:19] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 18:10:19] [INFO ] Decomposing Gal with order
[2022-06-03 18:10:19] [INFO ] Built C files in 118ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6315564282541261169
[2022-06-03 18:10:19] [INFO ] Input system was already deterministic with 405 transitions.
Running compilation step : cd /tmp/ltsmin6315564282541261169;'/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 18:10:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 18:10:20] [INFO ] Removed a total of 482 redundant transitions.
[2022-06-03 18:10:20] [INFO ] Flatten gal took : 78 ms
[2022-06-03 18:10:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 401 labels/synchronizations in 33 ms.
[2022-06-03 18:10:20] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability5859150448345393145.gal : 7 ms
[2022-06-03 18:10:20] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability18356241024932448148.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/ReachabilityFireability5859150448345393145.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability18356241024932448148.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
[2022-06-03 18:10:20] [INFO ] Ran tautology test, simplified 0 / 1 in 321 ms.
Loading property file /tmp/ReachabilityFireability18356241024932448148.prop.
[2022-06-03 18:10:20] [INFO ] BMC solution for property ShieldRVs-PT-020B-ReachabilityFireability-14(UNSAT) depth K=0 took 16 ms
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
[2022-06-03 18:10:20] [INFO ] BMC solution for property ShieldRVs-PT-020B-ReachabilityFireability-14(UNSAT) depth K=1 took 8 ms
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 13
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :13 after 13
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :13 after 952250
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :952250 after 4.11271e+11
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 405 rows 305 cols
[2022-06-03 18:10:20] [INFO ] Computed 81 place invariants in 7 ms
[2022-06-03 18:10:20] [INFO ] Computed 81 place invariants in 17 ms
[2022-06-03 18:10:20] [INFO ] BMC solution for property ShieldRVs-PT-020B-ReachabilityFireability-14(UNSAT) depth K=2 took 264 ms
[2022-06-03 18:10:21] [INFO ] Proved 305 variables to be positive in 767 ms
[2022-06-03 18:10:21] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-020B-ReachabilityFireability-14
[2022-06-03 18:10:21] [INFO ] KInduction solution for property ShieldRVs-PT-020B-ReachabilityFireability-14(SAT) depth K=0 took 18 ms
[2022-06-03 18:10:21] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-020B-ReachabilityFireability-14
[2022-06-03 18:10:21] [INFO ] KInduction solution for property ShieldRVs-PT-020B-ReachabilityFireability-14(SAT) depth K=1 took 185 ms
Compilation finished in 1544 ms.
Running link step : cd /tmp/ltsmin6315564282541261169;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin6315564282541261169;'/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' 'ShieldRVsPT020BReachabilityFireability14==true'
[2022-06-03 18:10:23] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-020B-ReachabilityFireability-14
[2022-06-03 18:10:23] [INFO ] KInduction solution for property ShieldRVs-PT-020B-ReachabilityFireability-14(SAT) depth K=2 took 1924 ms
[2022-06-03 18:10:23] [INFO ] BMC solution for property ShieldRVs-PT-020B-ReachabilityFireability-14(UNSAT) depth K=3 took 3071 ms
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4.11271e+11 after 5.44844e+21
[2022-06-03 18:12:01] [INFO ] BMC solution for property ShieldRVs-PT-020B-ReachabilityFireability-14(UNSAT) depth K=4 took 97868 ms
[2022-06-03 18:12:03] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-020B-ReachabilityFireability-14
[2022-06-03 18:12:03] [INFO ] KInduction solution for property ShieldRVs-PT-020B-ReachabilityFireability-14(SAT) depth K=3 took 99971 ms
[2022-06-03 18:17:53] [INFO ] BMC solution for property ShieldRVs-PT-020B-ReachabilityFireability-14(UNSAT) depth K=5 took 352476 ms
LTSmin run took 651016 ms.
Found Violation
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
[2022-06-03 18:21:12] [WARNING] Interrupting SMT solver.
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)
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.KInductionSolver.verify(KInductionSolver.java:587)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-03 18:21:12] [WARNING] Unexpected error occurred while running SMT. Was verifying ShieldRVs-PT-020B-ReachabilityFireability-14 K-induction depth 4
Exception in thread "Thread-12" 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.runKInduction(Gal2SMTFrontEnd.java:344)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
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.KInductionSolver.verify(KInductionSolver.java:587)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
... 2 more
[2022-06-03 18:21:12] [WARNING] Unexpected error occurred while running SMT. Was verifying ShieldRVs-PT-020B-ReachabilityFireability-14 SMT depth 6
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 18:21:12] [INFO ] During BMC, SMT solver timed out at depth 6
[2022-06-03 18:21:12] [INFO ] BMC solving timed out (3600000 secs) at depth 6
[2022-06-03 18:21:12] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 807766 ms.

BK_STOP 1654280472774

--------------------
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="ShieldRVs-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 ShieldRVs-PT-020B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286025800815"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-020B.tgz
mv ShieldRVs-PT-020B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;