Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r421-tajo-167905974800151.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldRVs-PT-050A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-tajo-167905974800151
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 6.7K Feb 26 18:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 18:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 18:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 18:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 19:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 19:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 18:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 18:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 320K Mar 5 18:23 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-050A-ReachabilityFireability-00
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-01
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-02
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-03
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-04
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-05
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-06
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-07
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-08
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-09
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-10
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-11
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-12
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-13
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-14
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679167125460

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-050A
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202303021504
[2023-03-18 19:18:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 19:18:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 19:18:47] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2023-03-18 19:18:47] [INFO ] Transformed 703 places.
[2023-03-18 19:18:47] [INFO ] Transformed 953 transitions.
[2023-03-18 19:18:47] [INFO ] Found NUPN structural information;
[2023-03-18 19:18:47] [INFO ] Parsed PT model containing 703 places and 953 transitions and 4600 arcs in 148 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 14 resets, run finished after 435 ms. (steps per millisecond=22 ) properties (out of 16) seen :13
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2023-03-18 19:18:47] [INFO ] Flatten gal took : 201 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :1
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
[2023-03-18 19:18:47] [INFO ] Flatten gal took : 90 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 19:18:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15452547633967025696.gal : 45 ms
[2023-03-18 19:18:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14292027293248691358.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15452547633967025696.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14292027293248691358.prop' '--nowitness' '--gen-order' 'FOLLOW'
// Phase 1: matrix 953 rows 703 cols
[2023-03-18 19:18:47] [INFO ] Computed 201 place invariants in 32 ms

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality14292027293248691358.prop.
[2023-03-18 19:18:48] [INFO ] After 280ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :3 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :69 after 136
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :136 after 1258
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :1258 after 57659
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :57659 after 505385
[2023-03-18 19:18:48] [INFO ] [Nat]Absence check using 201 positive place invariants in 34 ms returned sat
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :505385 after 6.46222e+06
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :6.46222e+06 after 6.06289e+08
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :6.06289e+08 after 5.72653e+10
[2023-03-18 19:18:49] [INFO ] After 814ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :5.72653e+10 after 5.56326e+12
[2023-03-18 19:18:49] [INFO ] Deduced a trap composed of 14 places in 210 ms of which 9 ms to minimize.
[2023-03-18 19:18:49] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 2 ms to minimize.
[2023-03-18 19:18:50] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 2 ms to minimize.
[2023-03-18 19:18:50] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 2 ms to minimize.
[2023-03-18 19:18:50] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 1 ms to minimize.
[2023-03-18 19:18:50] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 1 ms to minimize.
[2023-03-18 19:18:50] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 0 ms to minimize.
[2023-03-18 19:18:50] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 1 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :5.56326e+12 after 6.0254e+15
[2023-03-18 19:18:51] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2023-03-18 19:18:51] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 0 ms to minimize.
[2023-03-18 19:18:51] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 0 ms to minimize.
[2023-03-18 19:18:51] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
[2023-03-18 19:18:51] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 0 ms to minimize.
[2023-03-18 19:18:52] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 1 ms to minimize.
[2023-03-18 19:18:52] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 1 ms to minimize.
[2023-03-18 19:18:52] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 1 ms to minimize.
[2023-03-18 19:18:52] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 0 ms to minimize.
[2023-03-18 19:18:52] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 1 ms to minimize.
[2023-03-18 19:18:52] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 0 ms to minimize.
[2023-03-18 19:18:52] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
[2023-03-18 19:18:53] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 1 ms to minimize.
[2023-03-18 19:18:53] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 1 ms to minimize.
[2023-03-18 19:18:53] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 1 ms to minimize.
[2023-03-18 19:18:53] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
[2023-03-18 19:18:53] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 0 ms to minimize.
[2023-03-18 19:18:53] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2023-03-18 19:18:54] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :6.0254e+15 after 5.47031e+19
[2023-03-18 19:18:54] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 0 ms to minimize.
[2023-03-18 19:18:54] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 1 ms to minimize.
[2023-03-18 19:18:54] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2023-03-18 19:18:54] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 0 ms to minimize.
[2023-03-18 19:18:54] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2023-03-18 19:18:54] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 0 ms to minimize.
[2023-03-18 19:18:55] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2023-03-18 19:18:55] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 5 ms to minimize.
[2023-03-18 19:18:55] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2023-03-18 19:18:55] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 0 ms to minimize.
[2023-03-18 19:18:55] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 0 ms to minimize.
[2023-03-18 19:18:55] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2023-03-18 19:18:55] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2023-03-18 19:18:55] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2023-03-18 19:18:55] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 0 ms to minimize.
[2023-03-18 19:18:56] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 0 ms to minimize.
[2023-03-18 19:18:56] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 0 ms to minimize.
[2023-03-18 19:18:56] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2023-03-18 19:18:56] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 0 ms to minimize.
[2023-03-18 19:18:56] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 1 ms to minimize.
[2023-03-18 19:18:56] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2023-03-18 19:18:56] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2023-03-18 19:18:56] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 0 ms to minimize.
[2023-03-18 19:18:57] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 2 ms to minimize.
[2023-03-18 19:18:57] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2023-03-18 19:18:57] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2023-03-18 19:18:57] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2023-03-18 19:18:57] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2023-03-18 19:18:57] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 15 ms to minimize.
[2023-03-18 19:18:57] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 0 ms to minimize.
[2023-03-18 19:18:57] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 2 ms to minimize.
[2023-03-18 19:18:57] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2023-03-18 19:18:57] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 0 ms to minimize.
[2023-03-18 19:18:57] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2023-03-18 19:18:58] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 0 ms to minimize.
[2023-03-18 19:18:58] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
[2023-03-18 19:18:58] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2023-03-18 19:18:58] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2023-03-18 19:18:58] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 2 ms to minimize.
[2023-03-18 19:18:58] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2023-03-18 19:18:58] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2023-03-18 19:18:58] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 7 ms to minimize.
[2023-03-18 19:18:58] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2023-03-18 19:18:58] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2023-03-18 19:18:59] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 0 ms to minimize.
[2023-03-18 19:18:59] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2023-03-18 19:18:59] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2023-03-18 19:18:59] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2023-03-18 19:18:59] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2023-03-18 19:18:59] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 1 ms to minimize.
[2023-03-18 19:18:59] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 0 ms to minimize.
[2023-03-18 19:18:59] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2023-03-18 19:18:59] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 0 ms to minimize.
[2023-03-18 19:19:00] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 1 ms to minimize.
[2023-03-18 19:19:00] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2023-03-18 19:19:00] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 0 ms to minimize.
[2023-03-18 19:19:00] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 0 ms to minimize.
[2023-03-18 19:19:00] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2023-03-18 19:19:00] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 0 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 131072
SDD size :5.47031e+19 after 3.79023e+26
[2023-03-18 19:19:00] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2023-03-18 19:19:00] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 0 ms to minimize.
[2023-03-18 19:19:01] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2023-03-18 19:19:01] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 0 ms to minimize.
[2023-03-18 19:19:01] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 0 ms to minimize.
[2023-03-18 19:19:01] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 0 ms to minimize.
[2023-03-18 19:19:01] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2023-03-18 19:19:01] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 0 ms to minimize.
[2023-03-18 19:19:01] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 0 ms to minimize.
[2023-03-18 19:19:01] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2023-03-18 19:19:01] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2023-03-18 19:19:02] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2023-03-18 19:19:02] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 0 ms to minimize.
[2023-03-18 19:19:02] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2023-03-18 19:19:02] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2023-03-18 19:19:02] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2023-03-18 19:19:02] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 0 ms to minimize.
[2023-03-18 19:19:02] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2023-03-18 19:19:02] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2023-03-18 19:19:02] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2023-03-18 19:19:02] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2023-03-18 19:19:02] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2023-03-18 19:19:02] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2023-03-18 19:19:03] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2023-03-18 19:19:03] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 0 ms to minimize.
[2023-03-18 19:19:03] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
[2023-03-18 19:19:03] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 0 ms to minimize.
[2023-03-18 19:19:03] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2023-03-18 19:19:03] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 0 ms to minimize.
[2023-03-18 19:19:03] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2023-03-18 19:19:03] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2023-03-18 19:19:03] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2023-03-18 19:19:03] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2023-03-18 19:19:03] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
[2023-03-18 19:19:03] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2023-03-18 19:19:04] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 0 ms to minimize.
[2023-03-18 19:19:04] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2023-03-18 19:19:04] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2023-03-18 19:19:04] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2023-03-18 19:19:04] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2023-03-18 19:19:04] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
[2023-03-18 19:19:04] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2023-03-18 19:19:04] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2023-03-18 19:19:04] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 0 ms to minimize.
[2023-03-18 19:19:04] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2023-03-18 19:19:04] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 0 ms to minimize.
[2023-03-18 19:19:04] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 0 ms to minimize.
[2023-03-18 19:19:05] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2023-03-18 19:19:05] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2023-03-18 19:19:05] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2023-03-18 19:19:05] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 0 ms to minimize.
[2023-03-18 19:19:05] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 0 ms to minimize.
[2023-03-18 19:19:05] [INFO ] Trap strengthening (SAT) tested/added 139/138 trap constraints in 15921 ms
[2023-03-18 19:19:05] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 0 ms to minimize.
[2023-03-18 19:19:05] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 0 ms to minimize.
[2023-03-18 19:19:06] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
[2023-03-18 19:19:06] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2023-03-18 19:19:06] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2023-03-18 19:19:06] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2023-03-18 19:19:06] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
[2023-03-18 19:19:06] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2023-03-18 19:19:06] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2023-03-18 19:19:06] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1010 ms
[2023-03-18 19:19:06] [INFO ] After 18326ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 646 ms.
[2023-03-18 19:19:07] [INFO ] After 19243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 136 ms.
Support contains 123 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 953/953 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 702 transition count 952
Partial Free-agglomeration rule applied 85 times.
Drop transitions removed 85 transitions
Iterating global reduction 0 with 85 rules applied. Total rules applied 87 place count 702 transition count 952
Applied a total of 87 rules in 317 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 332 ms. Remains : 702/703 places, 952/953 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 246164 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 246164 steps, saw 56335 distinct states, run finished after 3003 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 952 rows 702 cols
[2023-03-18 19:19:11] [INFO ] Computed 201 place invariants in 12 ms
[2023-03-18 19:19:11] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 19:19:11] [INFO ] [Nat]Absence check using 201 positive place invariants in 25 ms returned sat
[2023-03-18 19:19:12] [INFO ] After 697ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 19:19:12] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 0 ms to minimize.
[2023-03-18 19:19:12] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 0 ms to minimize.
[2023-03-18 19:19:13] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 1 ms to minimize.
[2023-03-18 19:19:13] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 0 ms to minimize.
[2023-03-18 19:19:13] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 1 ms to minimize.
[2023-03-18 19:19:13] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 0 ms to minimize.
[2023-03-18 19:19:13] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
[2023-03-18 19:19:13] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 0 ms to minimize.
[2023-03-18 19:19:13] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 0 ms to minimize.
[2023-03-18 19:19:13] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2023-03-18 19:19:13] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 0 ms to minimize.
[2023-03-18 19:19:13] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2023-03-18 19:19:14] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 0 ms to minimize.
[2023-03-18 19:19:14] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 0 ms to minimize.
[2023-03-18 19:19:14] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 0 ms to minimize.
[2023-03-18 19:19:14] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2023-03-18 19:19:14] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 0 ms to minimize.
[2023-03-18 19:19:14] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2023-03-18 19:19:14] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 0 ms to minimize.
[2023-03-18 19:19:14] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2023-03-18 19:19:14] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2023-03-18 19:19:14] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2023-03-18 19:19:14] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2375 ms
[2023-03-18 19:19:15] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 0 ms to minimize.
[2023-03-18 19:19:15] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 0 ms to minimize.
[2023-03-18 19:19:15] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2023-03-18 19:19:15] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 0 ms to minimize.
[2023-03-18 19:19:15] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 0 ms to minimize.
[2023-03-18 19:19:16] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2023-03-18 19:19:16] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2023-03-18 19:19:16] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2023-03-18 19:19:16] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2023-03-18 19:19:16] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 0 ms to minimize.
[2023-03-18 19:19:16] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2023-03-18 19:19:16] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2023-03-18 19:19:16] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2023-03-18 19:19:16] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2023-03-18 19:19:16] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2023-03-18 19:19:17] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2023-03-18 19:19:17] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2023-03-18 19:19:17] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1965 ms
[2023-03-18 19:19:17] [INFO ] After 5506ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 636 ms.
[2023-03-18 19:19:17] [INFO ] After 6284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 97 ms.
Support contains 123 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 36 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 702/702 places, 952/952 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 49 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
[2023-03-18 19:19:18] [INFO ] Invariant cache hit.
[2023-03-18 19:19:18] [INFO ] Implicit Places using invariants in 377 ms returned []
[2023-03-18 19:19:18] [INFO ] Invariant cache hit.
[2023-03-18 19:19:19] [INFO ] Implicit Places using invariants and state equation in 636 ms returned []
Implicit Place search using SMT with State Equation took 1030 ms to find 0 implicit places.
[2023-03-18 19:19:20] [INFO ] Redundant transitions in 988 ms returned []
[2023-03-18 19:19:20] [INFO ] Invariant cache hit.
[2023-03-18 19:19:20] [INFO ] Dead Transitions using invariants and state equation in 402 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2490 ms. Remains : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 21 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-18 19:19:20] [INFO ] Invariant cache hit.
[2023-03-18 19:19:20] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 19:19:20] [INFO ] [Nat]Absence check using 201 positive place invariants in 21 ms returned sat
[2023-03-18 19:19:21] [INFO ] After 772ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 19:19:22] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 1 ms to minimize.
[2023-03-18 19:19:22] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 1 ms to minimize.
[2023-03-18 19:19:22] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 1 ms to minimize.
[2023-03-18 19:19:22] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 0 ms to minimize.
[2023-03-18 19:19:22] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 0 ms to minimize.
[2023-03-18 19:19:23] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 0 ms to minimize.
[2023-03-18 19:19:23] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 1 ms to minimize.
[2023-03-18 19:19:23] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 0 ms to minimize.
[2023-03-18 19:19:23] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 0 ms to minimize.
[2023-03-18 19:19:23] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 0 ms to minimize.
[2023-03-18 19:19:24] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 0 ms to minimize.
[2023-03-18 19:19:24] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 0 ms to minimize.
[2023-03-18 19:19:24] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 1 ms to minimize.
[2023-03-18 19:19:24] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 0 ms to minimize.
[2023-03-18 19:19:24] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 0 ms to minimize.
[2023-03-18 19:19:24] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 1 ms to minimize.
[2023-03-18 19:19:24] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 0 ms to minimize.
[2023-03-18 19:19:25] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 1 ms to minimize.
[2023-03-18 19:19:25] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 0 ms to minimize.
[2023-03-18 19:19:25] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 0 ms to minimize.
[2023-03-18 19:19:25] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2023-03-18 19:19:25] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
[2023-03-18 19:19:25] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2023-03-18 19:19:25] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2023-03-18 19:19:26] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2023-03-18 19:19:26] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 0 ms to minimize.
[2023-03-18 19:19:26] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 0 ms to minimize.
[2023-03-18 19:19:26] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 0 ms to minimize.
[2023-03-18 19:19:26] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2023-03-18 19:19:26] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2023-03-18 19:19:26] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 0 ms to minimize.
[2023-03-18 19:19:26] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 0 ms to minimize.
[2023-03-18 19:19:27] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2023-03-18 19:19:27] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 0 ms to minimize.
[2023-03-18 19:19:27] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 0 ms to minimize.
[2023-03-18 19:19:27] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2023-03-18 19:19:27] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2023-03-18 19:19:27] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 0 ms to minimize.
[2023-03-18 19:19:27] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2023-03-18 19:19:27] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 0 ms to minimize.
[2023-03-18 19:19:28] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 0 ms to minimize.
[2023-03-18 19:19:28] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 0 ms to minimize.
[2023-03-18 19:19:28] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2023-03-18 19:19:28] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 2 ms to minimize.
[2023-03-18 19:19:28] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2023-03-18 19:19:28] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2023-03-18 19:19:28] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 0 ms to minimize.
[2023-03-18 19:19:28] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 0 ms to minimize.
[2023-03-18 19:19:28] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2023-03-18 19:19:28] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 0 ms to minimize.
[2023-03-18 19:19:29] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2023-03-18 19:19:29] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 0 ms to minimize.
[2023-03-18 19:19:29] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2023-03-18 19:19:29] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 0 ms to minimize.
[2023-03-18 19:19:29] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2023-03-18 19:19:29] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2023-03-18 19:19:29] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2023-03-18 19:19:29] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 0 ms to minimize.
[2023-03-18 19:19:30] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 0 ms to minimize.
[2023-03-18 19:19:30] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 0 ms to minimize.
[2023-03-18 19:19:30] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2023-03-18 19:19:30] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2023-03-18 19:19:30] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 0 ms to minimize.
[2023-03-18 19:19:30] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 0 ms to minimize.
[2023-03-18 19:19:30] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 0 ms to minimize.
[2023-03-18 19:19:30] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2023-03-18 19:19:30] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2023-03-18 19:19:30] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 2 ms to minimize.
[2023-03-18 19:19:31] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 0 ms to minimize.
[2023-03-18 19:19:31] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2023-03-18 19:19:31] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 0 ms to minimize.
[2023-03-18 19:19:31] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 0 ms to minimize.
[2023-03-18 19:19:31] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2023-03-18 19:19:31] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2023-03-18 19:19:31] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 0 ms to minimize.
[2023-03-18 19:19:31] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 0 ms to minimize.
[2023-03-18 19:19:31] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 0 ms to minimize.
[2023-03-18 19:19:31] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 0 ms to minimize.
[2023-03-18 19:19:32] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 0 ms to minimize.
[2023-03-18 19:19:32] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 0 ms to minimize.
[2023-03-18 19:19:32] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2023-03-18 19:19:32] [INFO ] Trap strengthening (SAT) tested/added 82/81 trap constraints in 10382 ms
[2023-03-18 19:19:32] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2023-03-18 19:19:32] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 0 ms to minimize.
[2023-03-18 19:19:33] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 1 ms to minimize.
[2023-03-18 19:19:33] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 1 ms to minimize.
[2023-03-18 19:19:33] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
[2023-03-18 19:19:33] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 0 ms to minimize.
[2023-03-18 19:19:33] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 0 ms to minimize.
[2023-03-18 19:19:34] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2023-03-18 19:19:34] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2023-03-18 19:19:34] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 0 ms to minimize.
[2023-03-18 19:19:34] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2023-03-18 19:19:34] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 0 ms to minimize.
[2023-03-18 19:19:34] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2023-03-18 19:19:34] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 0 ms to minimize.
[2023-03-18 19:19:35] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2023-03-18 19:19:35] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2023-03-18 19:19:35] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2023-03-18 19:19:35] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2023-03-18 19:19:35] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2023-03-18 19:19:35] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2023-03-18 19:19:35] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2023-03-18 19:19:35] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2023-03-18 19:19:36] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2023-03-18 19:19:36] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2023-03-18 19:19:36] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2023-03-18 19:19:36] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2023-03-18 19:19:36] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2023-03-18 19:19:36] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 3 ms to minimize.
[2023-03-18 19:19:36] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2023-03-18 19:19:36] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2023-03-18 19:19:37] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2023-03-18 19:19:37] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2023-03-18 19:19:37] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2023-03-18 19:19:37] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2023-03-18 19:19:37] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2023-03-18 19:19:37] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2023-03-18 19:19:37] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 4982 ms
[2023-03-18 19:19:37] [INFO ] After 16771ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 642 ms.
[2023-03-18 19:19:38] [INFO ] After 17559ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-18 19:19:38] [INFO ] Flatten gal took : 54 ms
[2023-03-18 19:19:38] [INFO ] Flatten gal took : 51 ms
[2023-03-18 19:19:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9068793125439347141.gal : 8 ms
[2023-03-18 19:19:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7381043121490613150.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9068793125439347141.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7381043121490613150.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality7381043121490613150.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :3 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :69 after 142
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :142 after 992
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :992 after 36383
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :36383 after 252199
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :252199 after 3.84279e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3.84279e+06 after 3.50756e+08
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3.50756e+08 after 3.29473e+10
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :3.29473e+10 after 2.32963e+13
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :2.32963e+13 after 2.27882e+16
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :2.27882e+16 after 4.30048e+20
Detected timeout of ITS tools.
[2023-03-18 19:19:53] [INFO ] Flatten gal took : 75 ms
[2023-03-18 19:19:53] [INFO ] Applying decomposition
[2023-03-18 19:19:53] [INFO ] Flatten gal took : 106 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph18244978168027004299.txt' '-o' '/tmp/graph18244978168027004299.bin' '-w' '/tmp/graph18244978168027004299.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18244978168027004299.bin' '-l' '-1' '-v' '-w' '/tmp/graph18244978168027004299.weights' '-q' '0' '-e' '0.001'
[2023-03-18 19:19:54] [INFO ] Decomposing Gal with order
[2023-03-18 19:19:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 19:19:54] [INFO ] Removed a total of 1101 redundant transitions.
[2023-03-18 19:19:54] [INFO ] Flatten gal took : 384 ms
[2023-03-18 19:19:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 977 labels/synchronizations in 112 ms.
[2023-03-18 19:19:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13835017863396261014.gal : 20 ms
[2023-03-18 19:19:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7158068644943436037.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13835017863396261014.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7158068644943436037.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality7158068644943436037.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 8
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :8 after 8
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :8 after 726313
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :726313 after 7.6313e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18162428087699311524
[2023-03-18 19:20:10] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18162428087699311524
Running compilation step : cd /tmp/ltsmin18162428087699311524;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1802 ms.
Running link step : cd /tmp/ltsmin18162428087699311524;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin18162428087699311524;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'ShieldRVsPT050AReachabilityFireability06==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-18 19:20:25] [INFO ] Flatten gal took : 107 ms
[2023-03-18 19:20:25] [INFO ] Applying decomposition
[2023-03-18 19:20:25] [INFO ] Flatten gal took : 91 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11646189306491613915.txt' '-o' '/tmp/graph11646189306491613915.bin' '-w' '/tmp/graph11646189306491613915.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11646189306491613915.bin' '-l' '-1' '-v' '-w' '/tmp/graph11646189306491613915.weights' '-q' '0' '-e' '0.001'
[2023-03-18 19:20:25] [INFO ] Decomposing Gal with order
[2023-03-18 19:20:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 19:20:25] [INFO ] Removed a total of 1047 redundant transitions.
[2023-03-18 19:20:25] [INFO ] Flatten gal took : 64 ms
[2023-03-18 19:20:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 816 labels/synchronizations in 33 ms.
[2023-03-18 19:20:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4963155512401403335.gal : 10 ms
[2023-03-18 19:20:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7992740220565620884.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4963155512401403335.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7992740220565620884.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality7992740220565620884.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :9 after 45
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :45 after 2.05221e+07
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2023-03-18 19:50:28] [INFO ] Flatten gal took : 511 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5213360623000182884
[2023-03-18 19:50:29] [INFO ] Computing symmetric may disable matrix : 952 transitions.
[2023-03-18 19:50:29] [INFO ] Computation of Complete disable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:50:29] [INFO ] Computing symmetric may enable matrix : 952 transitions.
[2023-03-18 19:50:29] [INFO ] Computation of Complete enable matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:50:29] [INFO ] Applying decomposition
[2023-03-18 19:50:29] [INFO ] Flatten gal took : 335 ms
[2023-03-18 19:50:30] [INFO ] Computing Do-Not-Accords matrix : 952 transitions.
[2023-03-18 19:50:30] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:50:30] [INFO ] Built C files in 1680ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5213360623000182884
Running compilation step : cd /tmp/ltsmin5213360623000182884;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2924737236427206396.txt' '-o' '/tmp/graph2924737236427206396.bin' '-w' '/tmp/graph2924737236427206396.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2924737236427206396.bin' '-l' '-1' '-v' '-w' '/tmp/graph2924737236427206396.weights' '-q' '0' '-e' '0.001'
[2023-03-18 19:50:30] [INFO ] Decomposing Gal with order
[2023-03-18 19:50:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 19:50:30] [INFO ] Removed a total of 1103 redundant transitions.
[2023-03-18 19:50:31] [INFO ] Flatten gal took : 429 ms
[2023-03-18 19:50:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 828 labels/synchronizations in 39 ms.
[2023-03-18 19:50:31] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability9244065509282532851.gal : 16 ms
[2023-03-18 19:50:31] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability2852715067939250746.prop : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability9244065509282532851.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability2852715067939250746.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityFireability2852715067939250746.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 2
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :2 after 2
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :2 after 2
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2 after 2
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2 after 1.41469e+06
Compilation finished in 2880 ms.
Running link step : cd /tmp/ltsmin5213360623000182884;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin5213360623000182884;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldRVsPT050AReachabilityFireability06==true'
pins2lts-mc-linux64, 0.001: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.130: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.221: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.286: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.286: Initializing POR dependencies: labels 954, guards 952
pins2lts-mc-linux64( 5/ 8), 0.601: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.601: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.607: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.992: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 1.879: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 20.677: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 3/ 8), 21.023: "ShieldRVsPT050AReachabilityFireability06==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 21.024: "ShieldRVsPT050AReachabilityFireability06==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 21.024: "ShieldRVsPT050AReachabilityFireability06==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 21.024: "ShieldRVsPT050AReachabilityFireability06==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 21.024: "ShieldRVsPT050AReachabilityFireability06==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 21.025: "ShieldRVsPT050AReachabilityFireability06==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 21.026: "ShieldRVsPT050AReachabilityFireability06==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 21.027: There are 954 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 21.027: State length is 702, there are 952 groups
pins2lts-mc-linux64( 0/ 8), 21.027: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 21.027: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 21.027: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 21.027: Visible groups: 0 / 952, labels: 1 / 954
pins2lts-mc-linux64( 0/ 8), 21.027: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 21.027: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 21.026: "ShieldRVsPT050AReachabilityFireability06==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 21.848: ~11 levels ~960 states ~4400 transitions
pins2lts-mc-linux64( 0/ 8), 22.029: ~13 levels ~1920 states ~9736 transitions
pins2lts-mc-linux64( 3/ 8), 22.644: ~9 levels ~3840 states ~20400 transitions
pins2lts-mc-linux64( 4/ 8), 23.858: ~7 levels ~7680 states ~45920 transitions
pins2lts-mc-linux64( 1/ 8), 25.383: ~10 levels ~15360 states ~89048 transitions
pins2lts-mc-linux64( 4/ 8), 29.510: ~9 levels ~30720 states ~196952 transitions
pins2lts-mc-linux64( 4/ 8), 36.888: ~10 levels ~61440 states ~409632 transitions
pins2lts-mc-linux64( 4/ 8), 48.988: ~11 levels ~122880 states ~863552 transitions
pins2lts-mc-linux64( 1/ 8), 73.189: ~14 levels ~245760 states ~1740112 transitions
pins2lts-mc-linux64( 0/ 8), 118.566: ~21 levels ~491520 states ~3782368 transitions
pins2lts-mc-linux64( 6/ 8), 172.773: ~13 levels ~983040 states ~7807824 transitions
pins2lts-mc-linux64( 6/ 8), 268.228: ~14 levels ~1966080 states ~16053776 transitions
pins2lts-mc-linux64( 4/ 8), 478.428: ~16 levels ~3932160 states ~32283944 transitions
pins2lts-mc-linux64( 4/ 8), 651.900: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 652.015:
pins2lts-mc-linux64( 0/ 8), 652.015: mean standard work distribution: 3.1% (states) 2.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 652.015:
pins2lts-mc-linux64( 0/ 8), 652.015: Explored 5354406 states 45639581 transitions, fanout: 8.524
pins2lts-mc-linux64( 0/ 8), 652.015: Total exploration time 630.990 sec (630.880 sec minimum, 630.926 sec on average)
pins2lts-mc-linux64( 0/ 8), 652.015: States per second: 8486, Transitions per second: 72330
pins2lts-mc-linux64( 0/ 8), 652.015: Ignoring proviso: 350348
pins2lts-mc-linux64( 0/ 8), 652.015:
pins2lts-mc-linux64( 0/ 8), 652.015: Queue width: 8B, total height: 5143500, memory: 39.24MB
pins2lts-mc-linux64( 0/ 8), 652.015: Tree memory: 336.1MB, 33.6 B/state, compr.: 1.2%
pins2lts-mc-linux64( 0/ 8), 652.015: Tree fill ratio (roots/leafs): 7.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 652.015: Stored 959 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 652.015: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 652.015: Est. total memory use: 375.3MB (~1063.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5213360623000182884;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldRVsPT050AReachabilityFireability06==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5213360623000182884;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldRVsPT050AReachabilityFireability06==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 147568 kB
After kill :
MemTotal: 16393340 kB
MemFree: 7541116 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-050A"
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-5348"
echo " Executing tool itstools"
echo " Input is ShieldRVs-PT-050A, 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 r421-tajo-167905974800151"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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