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-165286025900839.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-040A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025900839
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 720K
-rw-r--r-- 1 mcc users 6.4K Apr 30 06:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 30 06:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Apr 30 06:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Apr 30 06:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 08:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 30 07:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 30 07:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 30 06:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 30 06:59 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 256K 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-040A-ReachabilityFireability-00
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-01
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-02
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-03
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-04
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-05
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-06
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-07
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-08
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-09
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-10
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-11
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-12
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-13
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-14
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654280001733

Running Version 202205111006
[2022-06-03 18:13:22] [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:13:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 18:13:23] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2022-06-03 18:13:23] [INFO ] Transformed 563 places.
[2022-06-03 18:13:23] [INFO ] Transformed 763 transitions.
[2022-06-03 18:13:23] [INFO ] Found NUPN structural information;
[2022-06-03 18:13:23] [INFO ] Parsed PT model containing 563 places and 763 transitions in 240 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 18 resets, run finished after 526 ms. (steps per millisecond=19 ) properties (out of 16) seen :11
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :1
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 763 rows 563 cols
[2022-06-03 18:13:24] [INFO ] Computed 161 place invariants in 23 ms
[2022-06-03 18:13:24] [INFO ] After 347ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-03 18:13:24] [INFO ] [Nat]Absence check using 161 positive place invariants in 27 ms returned sat
[2022-06-03 18:13:26] [INFO ] After 1147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-03 18:13:26] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 5 ms to minimize.
[2022-06-03 18:13:26] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2022-06-03 18:13:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 227 ms
[2022-06-03 18:13:27] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 0 ms to minimize.
[2022-06-03 18:13:27] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2022-06-03 18:13:27] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2022-06-03 18:13:27] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2022-06-03 18:13:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 414 ms
[2022-06-03 18:13:27] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 0 ms to minimize.
[2022-06-03 18:13:27] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 1 ms to minimize.
[2022-06-03 18:13:27] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 0 ms to minimize.
[2022-06-03 18:13:28] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 1 ms to minimize.
[2022-06-03 18:13:28] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 1 ms to minimize.
[2022-06-03 18:13:28] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 0 ms to minimize.
[2022-06-03 18:13:28] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 0 ms to minimize.
[2022-06-03 18:13:28] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 0 ms to minimize.
[2022-06-03 18:13:29] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
[2022-06-03 18:13:29] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 0 ms to minimize.
[2022-06-03 18:13:29] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 1 ms to minimize.
[2022-06-03 18:13:29] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 1 ms to minimize.
[2022-06-03 18:13:29] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 1 ms to minimize.
[2022-06-03 18:13:29] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 1 ms to minimize.
[2022-06-03 18:13:30] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 1 ms to minimize.
[2022-06-03 18:13:30] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 1 ms to minimize.
[2022-06-03 18:13:30] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2022-06-03 18:13:30] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 0 ms to minimize.
[2022-06-03 18:13:30] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
[2022-06-03 18:13:30] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 0 ms to minimize.
[2022-06-03 18:13:30] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 0 ms to minimize.
[2022-06-03 18:13:30] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 0 ms to minimize.
[2022-06-03 18:13:31] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 0 ms to minimize.
[2022-06-03 18:13:31] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2022-06-03 18:13:31] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 0 ms to minimize.
[2022-06-03 18:13:31] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 1 ms to minimize.
[2022-06-03 18:13:31] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2022-06-03 18:13:31] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2022-06-03 18:13:31] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 4 ms to minimize.
[2022-06-03 18:13:31] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 0 ms to minimize.
[2022-06-03 18:13:32] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 0 ms to minimize.
[2022-06-03 18:13:32] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2022-06-03 18:13:32] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 0 ms to minimize.
[2022-06-03 18:13:32] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2022-06-03 18:13:32] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 1 ms to minimize.
[2022-06-03 18:13:32] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 0 ms to minimize.
[2022-06-03 18:13:32] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 0 ms to minimize.
[2022-06-03 18:13:32] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
[2022-06-03 18:13:33] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 1 ms to minimize.
[2022-06-03 18:13:33] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 1 ms to minimize.
[2022-06-03 18:13:33] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 0 ms to minimize.
[2022-06-03 18:13:33] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 0 ms to minimize.
[2022-06-03 18:13:33] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 0 ms to minimize.
[2022-06-03 18:13:33] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 0 ms to minimize.
[2022-06-03 18:13:33] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 0 ms to minimize.
[2022-06-03 18:13:33] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 0 ms to minimize.
[2022-06-03 18:13:34] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 1 ms to minimize.
[2022-06-03 18:13:34] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2022-06-03 18:13:34] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 0 ms to minimize.
[2022-06-03 18:13:34] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 0 ms to minimize.
[2022-06-03 18:13:34] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 0 ms to minimize.
[2022-06-03 18:13:34] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 0 ms to minimize.
[2022-06-03 18:13:34] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 0 ms to minimize.
[2022-06-03 18:13:34] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 0 ms to minimize.
[2022-06-03 18:13:35] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 0 ms to minimize.
[2022-06-03 18:13:35] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2022-06-03 18:13:35] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2022-06-03 18:13:35] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2022-06-03 18:13:35] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 0 ms to minimize.
[2022-06-03 18:13:35] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 0 ms to minimize.
[2022-06-03 18:13:35] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 0 ms to minimize.
[2022-06-03 18:13:35] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
[2022-06-03 18:13:36] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2022-06-03 18:13:36] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 0 ms to minimize.
[2022-06-03 18:13:36] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 1 ms to minimize.
[2022-06-03 18:13:36] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 1 ms to minimize.
[2022-06-03 18:13:36] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 0 ms to minimize.
[2022-06-03 18:13:36] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2022-06-03 18:13:36] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2022-06-03 18:13:37] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 0 ms to minimize.
[2022-06-03 18:13:37] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
[2022-06-03 18:13:37] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 0 ms to minimize.
[2022-06-03 18:13:37] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 0 ms to minimize.
[2022-06-03 18:13:37] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 0 ms to minimize.
[2022-06-03 18:13:37] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2022-06-03 18:13:37] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 0 ms to minimize.
[2022-06-03 18:13:38] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 1 ms to minimize.
[2022-06-03 18:13:38] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 1 ms to minimize.
[2022-06-03 18:13:38] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 0 ms to minimize.
[2022-06-03 18:13:38] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 1 ms to minimize.
[2022-06-03 18:13:38] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 0 ms to minimize.
[2022-06-03 18:13:38] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 0 ms to minimize.
[2022-06-03 18:13:39] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 0 ms to minimize.
[2022-06-03 18:13:39] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 1 ms to minimize.
[2022-06-03 18:13:39] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 1 ms to minimize.
[2022-06-03 18:13:39] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 0 ms to minimize.
[2022-06-03 18:13:39] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 1 ms to minimize.
[2022-06-03 18:13:39] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 0 ms to minimize.
[2022-06-03 18:13:40] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 0 ms to minimize.
[2022-06-03 18:13:40] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 1 ms to minimize.
[2022-06-03 18:13:40] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 1 ms to minimize.
[2022-06-03 18:13:40] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 1 ms to minimize.
[2022-06-03 18:13:40] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 0 ms to minimize.
[2022-06-03 18:13:40] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 1 ms to minimize.
[2022-06-03 18:13:41] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 0 ms to minimize.
[2022-06-03 18:13:41] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 1 ms to minimize.
[2022-06-03 18:13:41] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 1 ms to minimize.
[2022-06-03 18:13:41] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 1 ms to minimize.
[2022-06-03 18:13:41] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 0 ms to minimize.
[2022-06-03 18:13:41] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 0 ms to minimize.
[2022-06-03 18:13:41] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 0 ms to minimize.
[2022-06-03 18:13:42] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 0 ms to minimize.
[2022-06-03 18:13:42] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 0 ms to minimize.
[2022-06-03 18:13:42] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 1 ms to minimize.
[2022-06-03 18:13:42] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 0 ms to minimize.
[2022-06-03 18:13:42] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 0 ms to minimize.
[2022-06-03 18:13:42] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 0 ms to minimize.
[2022-06-03 18:13:42] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 0 ms to minimize.
[2022-06-03 18:13:43] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 0 ms to minimize.
[2022-06-03 18:13:43] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 0 ms to minimize.
[2022-06-03 18:13:43] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 0 ms to minimize.
[2022-06-03 18:13:43] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 0 ms to minimize.
[2022-06-03 18:13:43] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 0 ms to minimize.
[2022-06-03 18:13:43] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2022-06-03 18:13:43] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 0 ms to minimize.
[2022-06-03 18:13:44] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2022-06-03 18:13:44] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 0 ms to minimize.
[2022-06-03 18:13:44] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 0 ms to minimize.
[2022-06-03 18:13:44] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 0 ms to minimize.
[2022-06-03 18:13:44] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 1 ms to minimize.
[2022-06-03 18:13:44] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 1 ms to minimize.
[2022-06-03 18:13:44] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 0 ms to minimize.
[2022-06-03 18:13:44] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2022-06-03 18:13:45] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2022-06-03 18:13:45] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2022-06-03 18:13:45] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2022-06-03 18:13:45] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2022-06-03 18:13:45] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 0 ms to minimize.
[2022-06-03 18:13:45] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 0 ms to minimize.
[2022-06-03 18:13:45] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 0 ms to minimize.
[2022-06-03 18:13:45] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2022-06-03 18:13:46] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2022-06-03 18:13:46] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 0 ms to minimize.
[2022-06-03 18:13:46] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2022-06-03 18:13:46] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2022-06-03 18:13:46] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 4 ms to minimize.
[2022-06-03 18:13:46] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 0 ms to minimize.
[2022-06-03 18:13:46] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
[2022-06-03 18:13:46] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2022-06-03 18:13:46] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 0 ms to minimize.
[2022-06-03 18:13:47] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 0 ms to minimize.
[2022-06-03 18:13:47] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 0 ms to minimize.
[2022-06-03 18:13:47] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 0 ms to minimize.
[2022-06-03 18:13:47] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 0 ms to minimize.
[2022-06-03 18:13:47] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2022-06-03 18:13:47] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 0 ms to minimize.
[2022-06-03 18:13:47] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 0 ms to minimize.
[2022-06-03 18:13:48] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 0 ms to minimize.
[2022-06-03 18:13:48] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2022-06-03 18:13:48] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 0 ms to minimize.
[2022-06-03 18:13:48] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2022-06-03 18:13:48] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2022-06-03 18:13:48] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
[2022-06-03 18:13:48] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 1 ms to minimize.
[2022-06-03 18:13:48] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2022-06-03 18:13:49] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 1 ms to minimize.
[2022-06-03 18:13:49] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 0 ms to minimize.
[2022-06-03 18:13:49] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 1 ms to minimize.
[2022-06-03 18:13:49] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 0 ms to minimize.
[2022-06-03 18:13:49] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 0 ms to minimize.
[2022-06-03 18:13:49] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 1 ms to minimize.
[2022-06-03 18:13:49] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 0 ms to minimize.
[2022-06-03 18:13:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-03 18:13:49] [INFO ] After 25091ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 6287 ms.
Support contains 198 out of 563 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 563/563 places, 763/763 transitions.
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 0 with 50 rules applied. Total rules applied 50 place count 563 transition count 763
Applied a total of 50 rules in 97 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 563/563 places, 763/763 transitions.
Incomplete random walk after 1000000 steps, including 2046 resets, run finished after 22158 ms. (steps per millisecond=45 ) properties (out of 4) seen :0
Interrupted Best-First random walk after 848508 steps, including 203 resets, run timeout after 5001 ms. (steps per millisecond=169 ) properties seen 1
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 828945 steps, including 183 resets, run timeout after 5001 ms. (steps per millisecond=165 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 239 resets, run finished after 3155 ms. (steps per millisecond=316 ) properties (out of 3) seen :1
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 245 resets, run finished after 3160 ms. (steps per millisecond=316 ) properties (out of 2) seen :1
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 763 rows 563 cols
[2022-06-03 18:14:34] [INFO ] Computed 161 place invariants in 10 ms
[2022-06-03 18:14:34] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 18:14:35] [INFO ] [Nat]Absence check using 161 positive place invariants in 39 ms returned sat
[2022-06-03 18:14:35] [INFO ] After 802ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 18:14:36] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 0 ms to minimize.
[2022-06-03 18:14:36] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 0 ms to minimize.
[2022-06-03 18:14:36] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2022-06-03 18:14:36] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2022-06-03 18:14:36] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2022-06-03 18:14:36] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 0 ms to minimize.
[2022-06-03 18:14:36] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2022-06-03 18:14:36] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2022-06-03 18:14:36] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 792 ms
[2022-06-03 18:14:37] [INFO ] After 1917ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 356 ms.
[2022-06-03 18:14:37] [INFO ] After 2414ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 269 ms.
Support contains 91 out of 563 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 22 place count 562 transition count 762
Applied a total of 22 rules in 67 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 562/563 places, 762/763 transitions.
Incomplete random walk after 1000000 steps, including 2083 resets, run finished after 4386 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 224 resets, run finished after 4688 ms. (steps per millisecond=213 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2880151 steps, run timeout after 27001 ms. (steps per millisecond=106 ) properties seen :{}
Probabilistic random walk after 2880151 steps, saw 518694 distinct states, run finished after 27004 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 762 rows 562 cols
[2022-06-03 18:15:13] [INFO ] Computed 161 place invariants in 8 ms
[2022-06-03 18:15:13] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 18:15:14] [INFO ] [Nat]Absence check using 161 positive place invariants in 26 ms returned sat
[2022-06-03 18:15:14] [INFO ] After 544ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 18:15:15] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2022-06-03 18:15:15] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 0 ms to minimize.
[2022-06-03 18:15:15] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2022-06-03 18:15:15] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2022-06-03 18:15:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 487 ms
[2022-06-03 18:15:15] [INFO ] After 1362ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 264 ms.
[2022-06-03 18:15:15] [INFO ] After 1781ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 302 ms.
Support contains 91 out of 562 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 21 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 562/562 places, 762/762 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 19 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
// Phase 1: matrix 762 rows 562 cols
[2022-06-03 18:15:16] [INFO ] Computed 161 place invariants in 9 ms
[2022-06-03 18:15:16] [INFO ] Implicit Places using invariants in 259 ms returned []
// Phase 1: matrix 762 rows 562 cols
[2022-06-03 18:15:16] [INFO ] Computed 161 place invariants in 3 ms
[2022-06-03 18:15:16] [INFO ] Implicit Places using invariants and state equation in 614 ms returned []
Implicit Place search using SMT with State Equation took 876 ms to find 0 implicit places.
[2022-06-03 18:15:17] [INFO ] Redundant transitions in 129 ms returned []
// Phase 1: matrix 762 rows 562 cols
[2022-06-03 18:15:17] [INFO ] Computed 161 place invariants in 2 ms
[2022-06-03 18:15:17] [INFO ] Dead Transitions using invariants and state equation in 372 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 562/562 places, 762/762 transitions.
Incomplete random walk after 1000000 steps, including 2083 resets, run finished after 4284 ms. (steps per millisecond=233 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 226 resets, run finished after 4670 ms. (steps per millisecond=214 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2547671 steps, run timeout after 24001 ms. (steps per millisecond=106 ) properties seen :{}
Probabilistic random walk after 2547671 steps, saw 466022 distinct states, run finished after 24001 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 762 rows 562 cols
[2022-06-03 18:15:50] [INFO ] Computed 161 place invariants in 8 ms
[2022-06-03 18:15:50] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 18:15:50] [INFO ] [Nat]Absence check using 161 positive place invariants in 25 ms returned sat
[2022-06-03 18:15:51] [INFO ] After 517ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 18:15:51] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 0 ms to minimize.
[2022-06-03 18:15:51] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2022-06-03 18:15:51] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2022-06-03 18:15:51] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
[2022-06-03 18:15:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 496 ms
[2022-06-03 18:15:52] [INFO ] After 1324ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 261 ms.
[2022-06-03 18:15:52] [INFO ] After 1741ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 343 ms.
Support contains 91 out of 562 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 20 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 562/562 places, 762/762 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 17 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
// Phase 1: matrix 762 rows 562 cols
[2022-06-03 18:15:52] [INFO ] Computed 161 place invariants in 2 ms
[2022-06-03 18:15:52] [INFO ] Implicit Places using invariants in 283 ms returned []
// Phase 1: matrix 762 rows 562 cols
[2022-06-03 18:15:52] [INFO ] Computed 161 place invariants in 8 ms
[2022-06-03 18:15:53] [INFO ] Implicit Places using invariants and state equation in 616 ms returned []
Implicit Place search using SMT with State Equation took 900 ms to find 0 implicit places.
[2022-06-03 18:15:53] [INFO ] Redundant transitions in 62 ms returned []
// Phase 1: matrix 762 rows 562 cols
[2022-06-03 18:15:53] [INFO ] Computed 161 place invariants in 2 ms
[2022-06-03 18:15:54] [INFO ] Dead Transitions using invariants and state equation in 359 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 17 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 762 rows 562 cols
[2022-06-03 18:15:54] [INFO ] Computed 161 place invariants in 2 ms
[2022-06-03 18:15:54] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 18:15:54] [INFO ] [Nat]Absence check using 161 positive place invariants in 32 ms returned sat
[2022-06-03 18:15:54] [INFO ] After 525ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 18:15:55] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 0 ms to minimize.
[2022-06-03 18:15:55] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2022-06-03 18:15:55] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2022-06-03 18:15:55] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2022-06-03 18:15:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 517 ms
[2022-06-03 18:15:55] [INFO ] After 1387ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 254 ms.
[2022-06-03 18:15:56] [INFO ] After 1848ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-03 18:15:56] [INFO ] Flatten gal took : 138 ms
[2022-06-03 18:15:56] [INFO ] Flatten gal took : 80 ms
[2022-06-03 18:15:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12357494055427100943.gal : 29 ms
[2022-06-03 18:15:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8379715012006969289.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/ReachabilityCardinality12357494055427100943.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8379715012006969289.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/ReachabilityCardinality8379715012006969289.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :3 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 276
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :276 after 3084
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3084 after 36360
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :36360 after 406083
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :406083 after 4.9578e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :4.9578e+06 after 3.8873e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3.8873e+08 after 3.36151e+10
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3.36151e+10 after 1.39477e+13
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.39477e+13 after 2.13463e+16
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.13463e+16 after 3.16556e+20
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :3.16556e+20 after 1.26221e+29
Detected timeout of ITS tools.
[2022-06-03 18:16:11] [INFO ] Flatten gal took : 61 ms
[2022-06-03 18:16:11] [INFO ] Applying decomposition
[2022-06-03 18:16:11] [INFO ] Flatten gal took : 53 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/graph13056410894072199289.txt' '-o' '/tmp/graph13056410894072199289.bin' '-w' '/tmp/graph13056410894072199289.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13056410894072199289.bin' '-l' '-1' '-v' '-w' '/tmp/graph13056410894072199289.weights' '-q' '0' '-e' '0.001'
[2022-06-03 18:16:11] [INFO ] Decomposing Gal with order
[2022-06-03 18:16:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 18:16:12] [INFO ] Removed a total of 893 redundant transitions.
[2022-06-03 18:16:12] [INFO ] Flatten gal took : 324 ms
[2022-06-03 18:16:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 879 labels/synchronizations in 50 ms.
[2022-06-03 18:16:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6007002250572553782.gal : 10 ms
[2022-06-03 18:16:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3311810759517393834.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/ReachabilityCardinality6007002250572553782.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3311810759517393834.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/ReachabilityCardinality3311810759517393834.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2 after 136238
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin696591812280406151
[2022-06-03 18:16:27] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin696591812280406151
Running compilation step : cd /tmp/ltsmin696591812280406151;'/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 1419 ms.
Running link step : cd /tmp/ltsmin696591812280406151;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin696591812280406151;'/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' 'ShieldRVsPT040AReachabilityFireability07==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-03 18:16:42] [INFO ] Flatten gal took : 41 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7455913022389326140
[2022-06-03 18:16:42] [INFO ] Computing symmetric may disable matrix : 762 transitions.
[2022-06-03 18:16:42] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 18:16:42] [INFO ] Computing symmetric may enable matrix : 762 transitions.
[2022-06-03 18:16:42] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 18:16:42] [INFO ] Applying decomposition
[2022-06-03 18:16:42] [INFO ] Flatten gal took : 59 ms
[2022-06-03 18:16:42] [INFO ] Input system was already deterministic with 762 transitions.
[2022-06-03 18:16:42] [INFO ] Flatten gal took : 111 ms
[2022-06-03 18:16:42] [INFO ] Computing Do-Not-Accords matrix : 762 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/graph1437921811261210210.txt' '-o' '/tmp/graph1437921811261210210.bin' '-w' '/tmp/graph1437921811261210210.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1437921811261210210.bin' '-l' '-1' '-v' '-w' '/tmp/graph1437921811261210210.weights' '-q' '0' '-e' '0.001'
[2022-06-03 18:16:42] [INFO ] Decomposing Gal with order
[2022-06-03 18:16:43] [INFO ] Computation of Completed DNA matrix. took 38 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 18:16:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 18:16:43] [INFO ] Built C files in 286ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7455913022389326140
Running compilation step : cd /tmp/ltsmin7455913022389326140;'/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:16:43] [INFO ] Removed a total of 885 redundant transitions.
[2022-06-03 18:16:43] [INFO ] Flatten gal took : 67 ms
[2022-06-03 18:16:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 899 labels/synchronizations in 23 ms.
[2022-06-03 18:16:43] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability98955633910033223.gal : 8 ms
[2022-06-03 18:16:43] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability16263283907398186399.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/ReachabilityFireability98955633910033223.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability16263283907398186399.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...297
[2022-06-03 18:16:43] [INFO ] Ran tautology test, simplified 0 / 1 in 462 ms.
Loading property file /tmp/ReachabilityFireability16263283907398186399.prop.
[2022-06-03 18:16:43] [INFO ] BMC solution for property ShieldRVs-PT-040A-ReachabilityFireability-07(UNSAT) depth K=0 took 13 ms
[2022-06-03 18:16:43] [INFO ] BMC solution for property ShieldRVs-PT-040A-ReachabilityFireability-07(UNSAT) depth K=1 took 22 ms
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 8
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :8 after 16
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :16 after 1461
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 762 rows 562 cols
[2022-06-03 18:16:43] [INFO ] Computed 161 place invariants in 2 ms
[2022-06-03 18:16:43] [INFO ] Computed 161 place invariants in 14 ms
[2022-06-03 18:16:43] [INFO ] BMC solution for property ShieldRVs-PT-040A-ReachabilityFireability-07(UNSAT) depth K=2 took 666 ms
[2022-06-03 18:16:44] [INFO ] BMC solution for property ShieldRVs-PT-040A-ReachabilityFireability-07(UNSAT) depth K=3 took 80 ms
[2022-06-03 18:16:44] [INFO ] BMC solution for property ShieldRVs-PT-040A-ReachabilityFireability-07(UNSAT) depth K=4 took 311 ms
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1461 after 8.45387e+34
[2022-06-03 18:16:45] [INFO ] Proved 562 variables to be positive in 1698 ms
[2022-06-03 18:16:45] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-040A-ReachabilityFireability-07
[2022-06-03 18:16:45] [INFO ] KInduction solution for property ShieldRVs-PT-040A-ReachabilityFireability-07(SAT) depth K=0 took 122 ms
[2022-06-03 18:16:45] [INFO ] BMC solution for property ShieldRVs-PT-040A-ReachabilityFireability-07(UNSAT) depth K=5 took 1072 ms
Compilation finished in 2749 ms.
Running link step : cd /tmp/ltsmin7455913022389326140;'gcc' '-shared' '-o' 'gal.so' 'model.o'
[2022-06-03 18:16:45] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-040A-ReachabilityFireability-07
[2022-06-03 18:16:45] [INFO ] KInduction solution for property ShieldRVs-PT-040A-ReachabilityFireability-07(SAT) depth K=1 took 297 ms
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin7455913022389326140;'/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' 'ShieldRVsPT040AReachabilityFireability07==true'
[2022-06-03 18:17:01] [INFO ] BMC solution for property ShieldRVs-PT-040A-ReachabilityFireability-07(UNSAT) depth K=6 took 16437 ms
[2022-06-03 18:17:11] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-040A-ReachabilityFireability-07
[2022-06-03 18:17:11] [INFO ] KInduction solution for property ShieldRVs-PT-040A-ReachabilityFireability-07(SAT) depth K=2 took 26131 ms
[2022-06-03 18:21:51] [INFO ] BMC solution for property ShieldRVs-PT-040A-ReachabilityFireability-07(UNSAT) depth K=7 took 289440 ms
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.024: Initializing POR dependencies: labels 763, guards 762
pins2lts-mc-linux64( 4/ 8), 0.029: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.029: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.040: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.040: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.052: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.052: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.060: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.060: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.064: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.064: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.068: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.068: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.077: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.077: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.088: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.092: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.096: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.100: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 3.836: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 1/ 8), 3.846: "ShieldRVsPT040AReachabilityFireability07==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 3.846: "ShieldRVsPT040AReachabilityFireability07==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 3.845: "ShieldRVsPT040AReachabilityFireability07==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 3.846: "ShieldRVsPT040AReachabilityFireability07==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 3.847: "ShieldRVsPT040AReachabilityFireability07==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 3.846: "ShieldRVsPT040AReachabilityFireability07==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 3.846: "ShieldRVsPT040AReachabilityFireability07==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 3.847: There are 763 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 3.847: State length is 562, there are 762 groups
pins2lts-mc-linux64( 0/ 8), 3.847: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 3.847: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 3.847: Successor permutation: none
pins2lts-mc-linux64( 6/ 8), 3.847: "ShieldRVsPT040AReachabilityFireability07==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 3.847: Visible groups: 0 / 762, labels: 1 / 763
pins2lts-mc-linux64( 0/ 8), 3.847: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 3.847: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 3.955: ~11 levels ~960 states ~3840 transitions
pins2lts-mc-linux64( 0/ 8), 4.066: ~12 levels ~1920 states ~8712 transitions
pins2lts-mc-linux64( 0/ 8), 4.235: ~14 levels ~3840 states ~19744 transitions
pins2lts-mc-linux64( 0/ 8), 4.693: ~15 levels ~7680 states ~41848 transitions
pins2lts-mc-linux64( 6/ 8), 5.392: ~12 levels ~15360 states ~84608 transitions
pins2lts-mc-linux64( 6/ 8), 6.925: ~13 levels ~30720 states ~178152 transitions
pins2lts-mc-linux64( 2/ 8), 9.732: ~10 levels ~61440 states ~375088 transitions
pins2lts-mc-linux64( 6/ 8), 15.766: ~16 levels ~122880 states ~786304 transitions
pins2lts-mc-linux64( 6/ 8), 27.669: ~17 levels ~245760 states ~1648384 transitions
pins2lts-mc-linux64( 6/ 8), 51.761: ~18 levels ~491520 states ~3461000 transitions
pins2lts-mc-linux64( 6/ 8), 101.265: ~19 levels ~983040 states ~7206216 transitions
pins2lts-mc-linux64( 6/ 8), 205.289: ~20 levels ~1966080 states ~14985024 transitions
pins2lts-mc-linux64( 6/ 8), 420.282: ~21 levels ~3932160 states ~31254424 transitions
pins2lts-mc-linux64( 2/ 8), 770.434: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 770.666:
pins2lts-mc-linux64( 0/ 8), 770.666: mean standard work distribution: 3.3% (states) 1.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 770.666:
pins2lts-mc-linux64( 0/ 8), 770.666: Explored 6572541 states 56145517 transitions, fanout: 8.542
pins2lts-mc-linux64( 0/ 8), 770.666: Total exploration time 766.820 sec (766.590 sec minimum, 766.696 sec on average)
pins2lts-mc-linux64( 0/ 8), 770.666: States per second: 8571, Transitions per second: 73219
pins2lts-mc-linux64( 0/ 8), 770.666: Ignoring proviso: 970823
pins2lts-mc-linux64( 0/ 8), 770.666:
pins2lts-mc-linux64( 0/ 8), 770.666: Queue width: 8B, total height: 6189750, memory: 47.22MB
pins2lts-mc-linux64( 0/ 8), 770.666: Tree memory: 353.4MB, 29.0 B/state, compr.: 1.3%
pins2lts-mc-linux64( 0/ 8), 770.666: Tree fill ratio (roots/leafs): 9.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 770.666: Stored 769 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 770.666: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 770.666: Est. total memory use: 400.6MB (~1071.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7455913022389326140;'/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' 'ShieldRVsPT040AReachabilityFireability07==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7455913022389326140;'/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' 'ShieldRVsPT040AReachabilityFireability07==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-03 18:29:50] [INFO ] BMC solution for property ShieldRVs-PT-040A-ReachabilityFireability-07(UNSAT) depth K=8 took 478576 ms
[2022-06-03 18:31:14] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-040A-ReachabilityFireability-07
[2022-06-03 18:31:14] [INFO ] KInduction solution for property ShieldRVs-PT-040A-ReachabilityFireability-07(SAT) depth K=3 took 842893 ms
[2022-06-03 18:35:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-040A-ReachabilityFireability-07
[2022-06-03 18:35:28] [INFO ] KInduction solution for property ShieldRVs-PT-040A-ReachabilityFireability-07(SAT) depth K=4 took 253738 ms
Detected timeout of ITS tools.
[2022-06-03 18:37:49] [INFO ] Applying decomposition
[2022-06-03 18:37:49] [INFO ] Flatten gal took : 76 ms
[2022-06-03 18:37:49] [INFO ] Decomposing Gal with order
[2022-06-03 18:37:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 18:37:49] [INFO ] Removed a total of 893 redundant transitions.
[2022-06-03 18:37:49] [INFO ] Flatten gal took : 100 ms
[2022-06-03 18:37:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 879 labels/synchronizations in 38 ms.
[2022-06-03 18:37:50] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability10223269255761897108.gal : 10 ms
[2022-06-03 18:37:50] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability2749677161755538035.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/ReachabilityFireability10223269255761897108.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability2749677161755538035.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityFireability2749677161755538035.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :8 after 24365
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :24365 after 4.91435e+35
[2022-06-03 18:40:55] [INFO ] BMC solution for property ShieldRVs-PT-040A-ReachabilityFireability-07(UNSAT) depth K=9 took 665456 ms
Detected timeout of ITS tools.
[2022-06-03 18:59:13] [INFO ] Flatten gal took : 482 ms
[2022-06-03 18:59:15] [INFO ] Input system was already deterministic with 762 transitions.
[2022-06-03 18:59:15] [INFO ] Transformed 562 places.
[2022-06-03 18:59:15] [INFO ] Transformed 762 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-03 18:59:15] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability15998502892558975778.gal : 13 ms
[2022-06-03 18:59:15] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability11537062345144167264.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/ReachabilityFireability15998502892558975778.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability11537062345144167264.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...366
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityFireability11537062345144167264.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 22
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :22 after 58
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :58 after 134
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :134 after 259
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :259 after 731
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :731 after 43804
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :43804 after 63500
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :63500 after 1.06906e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.06906e+06 after 1.98536e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.98536e+06 after 8.53752e+06
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :8.53752e+06 after 6.10897e+07
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :6.10897e+07 after 1.59151e+08
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.59151e+08 after 4.71789e+09
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :4.71789e+09 after 6.24813e+11
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :6.24813e+11 after 2.75341e+29
[2022-06-03 19:12:13] [INFO ] BMC solution for property ShieldRVs-PT-040A-ReachabilityFireability-07(UNSAT) depth K=10 took 1878182 ms

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-040A"
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-040A, 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-165286025900839"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-040A.tgz
mv ShieldRVs-PT-040A 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 ;