Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r169-tall-167838855300086.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is Echo-PT-d03r03, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855300086
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.4K Feb 25 14:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 14:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 14:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 14:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 14:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 14:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 14:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 14:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 114K Mar 5 18:22 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 Echo-PT-d03r03-ReachabilityCardinality-00
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-01
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-02
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-03
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-04
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-05
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-06
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-07
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-08
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-09
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-10
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-11
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-12
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-13
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-14
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678476462459

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=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Echo-PT-d03r03
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-10 19:27:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 19:27:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 19:27:44] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2023-03-10 19:27:44] [INFO ] Transformed 265 places.
[2023-03-10 19:27:44] [INFO ] Transformed 206 transitions.
[2023-03-10 19:27:44] [INFO ] Found NUPN structural information;
[2023-03-10 19:27:44] [INFO ] Parsed PT model containing 265 places and 206 transitions and 1252 arcs in 134 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Echo-PT-d03r03-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 181 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 9) seen :8
FORMULA Echo-PT-d03r03-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d03r03-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d03r03-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d03r03-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d03r03-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d03r03-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d03r03-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d03r03-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 206 rows 265 cols
[2023-03-10 19:27:44] [INFO ] Computed 135 place invariants in 38 ms
[2023-03-10 19:27:44] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 19:27:45] [INFO ] [Nat]Absence check using 24 positive place invariants in 7 ms returned sat
[2023-03-10 19:27:45] [INFO ] [Nat]Absence check using 24 positive and 111 generalized place invariants in 23 ms returned sat
[2023-03-10 19:27:45] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 19:27:45] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 5 ms to minimize.
[2023-03-10 19:27:45] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2023-03-10 19:27:45] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2023-03-10 19:27:45] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2023-03-10 19:27:45] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2023-03-10 19:27:45] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2023-03-10 19:27:45] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2023-03-10 19:27:45] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2023-03-10 19:27:45] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2023-03-10 19:27:45] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2023-03-10 19:27:45] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2023-03-10 19:27:45] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2023-03-10 19:27:46] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 0 ms to minimize.
[2023-03-10 19:27:46] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 0 ms to minimize.
[2023-03-10 19:27:46] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 0 ms to minimize.
[2023-03-10 19:27:46] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2023-03-10 19:27:46] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2023-03-10 19:27:46] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2023-03-10 19:27:46] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2023-03-10 19:27:46] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 0 ms to minimize.
[2023-03-10 19:27:46] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2023-03-10 19:27:46] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2023-03-10 19:27:46] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 0 ms to minimize.
[2023-03-10 19:27:46] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 0 ms to minimize.
[2023-03-10 19:27:47] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 0 ms to minimize.
[2023-03-10 19:27:47] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 0 ms to minimize.
[2023-03-10 19:27:47] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2023-03-10 19:27:47] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2023-03-10 19:27:47] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 0 ms to minimize.
[2023-03-10 19:27:47] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2023-03-10 19:27:47] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 0 ms to minimize.
[2023-03-10 19:27:47] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 0 ms to minimize.
[2023-03-10 19:27:47] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2023-03-10 19:27:47] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2023-03-10 19:27:47] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 5 ms to minimize.
[2023-03-10 19:27:47] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2023-03-10 19:27:47] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 0 ms to minimize.
[2023-03-10 19:27:48] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2023-03-10 19:27:48] [INFO ] Deduced a trap composed of 11 places in 284 ms of which 0 ms to minimize.
[2023-03-10 19:27:48] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2023-03-10 19:27:48] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2023-03-10 19:27:48] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2023-03-10 19:27:48] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 0 ms to minimize.
[2023-03-10 19:27:48] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 0 ms to minimize.
[2023-03-10 19:27:48] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2023-03-10 19:27:48] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
[2023-03-10 19:27:48] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 0 ms to minimize.
[2023-03-10 19:27:48] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2023-03-10 19:27:49] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2023-03-10 19:27:49] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2023-03-10 19:27:49] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2023-03-10 19:27:49] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2023-03-10 19:27:49] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2023-03-10 19:27:49] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 0 ms to minimize.
[2023-03-10 19:27:49] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 0 ms to minimize.
[2023-03-10 19:27:49] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 4 ms to minimize.
[2023-03-10 19:27:49] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2023-03-10 19:27:49] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2023-03-10 19:27:49] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 0 ms to minimize.
[2023-03-10 19:27:49] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 0 ms to minimize.
[2023-03-10 19:27:49] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 0 ms to minimize.
[2023-03-10 19:27:50] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2023-03-10 19:27:50] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2023-03-10 19:27:50] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2023-03-10 19:27:50] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2023-03-10 19:27:50] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 0 ms to minimize.
[2023-03-10 19:27:50] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 0 ms to minimize.
[2023-03-10 19:27:50] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 0 ms to minimize.
[2023-03-10 19:27:50] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 0 ms to minimize.
[2023-03-10 19:27:50] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2023-03-10 19:27:50] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2023-03-10 19:27:50] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2023-03-10 19:27:50] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 0 ms to minimize.
[2023-03-10 19:27:50] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 0 ms to minimize.
[2023-03-10 19:27:51] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 0 ms to minimize.
[2023-03-10 19:27:51] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2023-03-10 19:27:51] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2023-03-10 19:27:51] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2023-03-10 19:27:51] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2023-03-10 19:27:51] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 0 ms to minimize.
[2023-03-10 19:27:51] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2023-03-10 19:27:51] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2023-03-10 19:27:51] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2023-03-10 19:27:51] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2023-03-10 19:27:51] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 0 ms to minimize.
[2023-03-10 19:27:51] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2023-03-10 19:27:51] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 0 ms to minimize.
[2023-03-10 19:27:52] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2023-03-10 19:27:52] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 0 ms to minimize.
[2023-03-10 19:27:52] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 0 ms to minimize.
[2023-03-10 19:27:52] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 0 ms to minimize.
[2023-03-10 19:27:52] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2023-03-10 19:27:52] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2023-03-10 19:27:52] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2023-03-10 19:27:52] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 0 ms to minimize.
[2023-03-10 19:27:52] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 0 ms to minimize.
[2023-03-10 19:27:52] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 0 ms to minimize.
[2023-03-10 19:27:52] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2023-03-10 19:27:52] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2023-03-10 19:27:53] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2023-03-10 19:27:53] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 0 ms to minimize.
[2023-03-10 19:27:53] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2023-03-10 19:27:53] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2023-03-10 19:27:53] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 0 ms to minimize.
[2023-03-10 19:27:53] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 0 ms to minimize.
[2023-03-10 19:27:53] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2023-03-10 19:27:53] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 0 ms to minimize.
[2023-03-10 19:27:53] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2023-03-10 19:27:53] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2023-03-10 19:27:53] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2023-03-10 19:27:53] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 0 ms to minimize.
[2023-03-10 19:27:54] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 0 ms to minimize.
[2023-03-10 19:27:54] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 0 ms to minimize.
[2023-03-10 19:27:54] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2023-03-10 19:27:54] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2023-03-10 19:27:54] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 0 ms to minimize.
[2023-03-10 19:27:54] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 0 ms to minimize.
[2023-03-10 19:27:54] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 0 ms to minimize.
[2023-03-10 19:27:54] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 0 ms to minimize.
[2023-03-10 19:27:54] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 0 ms to minimize.
[2023-03-10 19:27:54] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2023-03-10 19:27:54] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2023-03-10 19:27:55] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2023-03-10 19:27:55] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 0 ms to minimize.
[2023-03-10 19:27:55] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
[2023-03-10 19:27:55] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2023-03-10 19:27:55] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2023-03-10 19:27:55] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 0 ms to minimize.
[2023-03-10 19:27:55] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2023-03-10 19:27:55] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 0 ms to minimize.
[2023-03-10 19:27:55] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2023-03-10 19:27:55] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 0 ms to minimize.
[2023-03-10 19:27:55] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 0 ms to minimize.
[2023-03-10 19:27:55] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2023-03-10 19:27:55] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2023-03-10 19:27:56] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 0 ms to minimize.
[2023-03-10 19:27:56] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 0 ms to minimize.
[2023-03-10 19:27:56] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2023-03-10 19:27:56] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 0 ms to minimize.
[2023-03-10 19:27:56] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2023-03-10 19:27:56] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2023-03-10 19:27:56] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2023-03-10 19:27:56] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2023-03-10 19:27:56] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 0 ms to minimize.
[2023-03-10 19:27:56] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2023-03-10 19:27:56] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 0 ms to minimize.
[2023-03-10 19:27:56] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2023-03-10 19:27:56] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2023-03-10 19:27:57] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 0 ms to minimize.
[2023-03-10 19:27:57] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2023-03-10 19:27:57] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2023-03-10 19:27:57] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2023-03-10 19:27:57] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2023-03-10 19:27:57] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2023-03-10 19:27:57] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2023-03-10 19:27:57] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 0 ms to minimize.
[2023-03-10 19:27:57] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 0 ms to minimize.
[2023-03-10 19:27:57] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 0 ms to minimize.
[2023-03-10 19:27:57] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 0 ms to minimize.
[2023-03-10 19:27:58] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2023-03-10 19:27:58] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2023-03-10 19:27:58] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2023-03-10 19:27:58] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2023-03-10 19:27:58] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2023-03-10 19:27:58] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 0 ms to minimize.
[2023-03-10 19:27:58] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2023-03-10 19:27:58] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2023-03-10 19:27:58] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2023-03-10 19:27:58] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 0 ms to minimize.
[2023-03-10 19:27:58] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 0 ms to minimize.
[2023-03-10 19:27:58] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 0 ms to minimize.
[2023-03-10 19:27:59] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2023-03-10 19:27:59] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2023-03-10 19:27:59] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 0 ms to minimize.
[2023-03-10 19:27:59] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2023-03-10 19:27:59] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2023-03-10 19:27:59] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2023-03-10 19:27:59] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 0 ms to minimize.
[2023-03-10 19:27:59] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 0 ms to minimize.
[2023-03-10 19:27:59] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 0 ms to minimize.
[2023-03-10 19:27:59] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 0 ms to minimize.
[2023-03-10 19:28:00] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 0 ms to minimize.
[2023-03-10 19:28:00] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 0 ms to minimize.
[2023-03-10 19:28:00] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 0 ms to minimize.
[2023-03-10 19:28:00] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 0 ms to minimize.
[2023-03-10 19:28:00] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2023-03-10 19:28:00] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 0 ms to minimize.
[2023-03-10 19:28:00] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2023-03-10 19:28:00] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2023-03-10 19:28:00] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2023-03-10 19:28:00] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 0 ms to minimize.
[2023-03-10 19:28:00] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 0 ms to minimize.
[2023-03-10 19:28:01] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 0 ms to minimize.
[2023-03-10 19:28:01] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2023-03-10 19:28:01] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 0 ms to minimize.
[2023-03-10 19:28:01] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 0 ms to minimize.
[2023-03-10 19:28:01] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 0 ms to minimize.
[2023-03-10 19:28:01] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2023-03-10 19:28:01] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 0 ms to minimize.
[2023-03-10 19:28:01] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 0 ms to minimize.
[2023-03-10 19:28:01] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2023-03-10 19:28:01] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2023-03-10 19:28:01] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 0 ms to minimize.
[2023-03-10 19:28:02] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2023-03-10 19:28:02] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2023-03-10 19:28:02] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2023-03-10 19:28:02] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2023-03-10 19:28:02] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 0 ms to minimize.
[2023-03-10 19:28:02] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 0 ms to minimize.
[2023-03-10 19:28:02] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 0 ms to minimize.
[2023-03-10 19:28:02] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 0 ms to minimize.
[2023-03-10 19:28:02] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2023-03-10 19:28:02] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 0 ms to minimize.
[2023-03-10 19:28:02] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2023-03-10 19:28:03] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
[2023-03-10 19:28:03] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 0 ms to minimize.
[2023-03-10 19:28:03] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 0 ms to minimize.
[2023-03-10 19:28:03] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2023-03-10 19:28:03] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
[2023-03-10 19:28:03] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2023-03-10 19:28:03] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2023-03-10 19:28:03] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 0 ms to minimize.
[2023-03-10 19:28:03] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2023-03-10 19:28:03] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2023-03-10 19:28:04] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 0 ms to minimize.
[2023-03-10 19:28:04] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2023-03-10 19:28:04] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
[2023-03-10 19:28:04] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 0 ms to minimize.
[2023-03-10 19:28:04] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 0 ms to minimize.
[2023-03-10 19:28:04] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 0 ms to minimize.
[2023-03-10 19:28:04] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 2 ms to minimize.
[2023-03-10 19:28:04] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2023-03-10 19:28:04] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2023-03-10 19:28:05] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 0 ms to minimize.
[2023-03-10 19:28:05] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 0 ms to minimize.
[2023-03-10 19:28:05] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 0 ms to minimize.
[2023-03-10 19:28:05] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2023-03-10 19:28:05] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2023-03-10 19:28:05] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2023-03-10 19:28:05] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 0 ms to minimize.
[2023-03-10 19:28:05] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 0 ms to minimize.
[2023-03-10 19:28:05] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2023-03-10 19:28:05] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 0 ms to minimize.
[2023-03-10 19:28:05] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2023-03-10 19:28:06] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2023-03-10 19:28:06] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2023-03-10 19:28:06] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 0 ms to minimize.
[2023-03-10 19:28:06] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2023-03-10 19:28:06] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 0 ms to minimize.
[2023-03-10 19:28:06] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 0 ms to minimize.
[2023-03-10 19:28:06] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 0 ms to minimize.
[2023-03-10 19:28:06] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 0 ms to minimize.
[2023-03-10 19:28:06] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 0 ms to minimize.
[2023-03-10 19:28:06] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 0 ms to minimize.
[2023-03-10 19:28:07] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 0 ms to minimize.
[2023-03-10 19:28:07] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 0 ms to minimize.
[2023-03-10 19:28:07] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2023-03-10 19:28:07] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2023-03-10 19:28:07] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2023-03-10 19:28:07] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 0 ms to minimize.
[2023-03-10 19:28:07] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2023-03-10 19:28:07] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2023-03-10 19:28:07] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 0 ms to minimize.
[2023-03-10 19:28:07] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2023-03-10 19:28:08] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 0 ms to minimize.
[2023-03-10 19:28:08] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2023-03-10 19:28:08] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2023-03-10 19:28:08] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2023-03-10 19:28:08] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2023-03-10 19:28:08] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2023-03-10 19:28:08] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 0 ms to minimize.
[2023-03-10 19:28:08] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2023-03-10 19:28:08] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2023-03-10 19:28:08] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2023-03-10 19:28:08] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 0 ms to minimize.
[2023-03-10 19:28:08] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 0 ms to minimize.
[2023-03-10 19:28:09] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2023-03-10 19:28:09] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2023-03-10 19:28:09] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 0 ms to minimize.
[2023-03-10 19:28:09] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
[2023-03-10 19:28:09] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 0 ms to minimize.
[2023-03-10 19:28:09] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 0 ms to minimize.
[2023-03-10 19:28:09] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2023-03-10 19:28:09] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2023-03-10 19:28:09] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2023-03-10 19:28:09] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 19:28:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-10 19:28:09] [INFO ] After 25059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 265 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 265/265 places, 206/206 transitions.
Graph (complete) has 938 edges and 265 vertex of which 240 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.2 ms
Discarding 25 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 240 transition count 206
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 239 transition count 205
Applied a total of 8 rules in 53 ms. Remains 239 /265 variables (removed 26) and now considering 205/206 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 239/265 places, 205/206 transitions.
Incomplete random walk after 10000 steps, including 203 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1113200 steps, run timeout after 3001 ms. (steps per millisecond=370 ) properties seen :{}
Probabilistic random walk after 1113200 steps, saw 147537 distinct states, run finished after 3002 ms. (steps per millisecond=370 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 205 rows 239 cols
[2023-03-10 19:28:13] [INFO ] Computed 110 place invariants in 44 ms
[2023-03-10 19:28:13] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 19:28:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2023-03-10 19:28:13] [INFO ] [Nat]Absence check using 11 positive and 99 generalized place invariants in 116 ms returned sat
[2023-03-10 19:28:13] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 19:28:13] [INFO ] After 159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-10 19:28:13] [INFO ] After 368ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 205/205 transitions.
Applied a total of 0 rules in 10 ms. Remains 239 /239 variables (removed 0) and now considering 205/205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 239/239 places, 205/205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 205/205 transitions.
Applied a total of 0 rules in 8 ms. Remains 239 /239 variables (removed 0) and now considering 205/205 (removed 0) transitions.
[2023-03-10 19:28:13] [INFO ] Invariant cache hit.
[2023-03-10 19:28:14] [INFO ] Implicit Places using invariants in 481 ms returned [16, 164, 184, 206, 214, 225, 233]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 488 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 232/239 places, 205/205 transitions.
Applied a total of 0 rules in 10 ms. Remains 232 /232 variables (removed 0) and now considering 205/205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 508 ms. Remains : 232/239 places, 205/205 transitions.
Incomplete random walk after 10000 steps, including 204 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1181118 steps, run timeout after 3001 ms. (steps per millisecond=393 ) properties seen :{}
Probabilistic random walk after 1181118 steps, saw 156607 distinct states, run finished after 3001 ms. (steps per millisecond=393 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 205 rows 232 cols
[2023-03-10 19:28:17] [INFO ] Computed 103 place invariants in 35 ms
[2023-03-10 19:28:17] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 19:28:17] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-10 19:28:17] [INFO ] [Nat]Absence check using 9 positive and 94 generalized place invariants in 91 ms returned sat
[2023-03-10 19:28:17] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 19:28:17] [INFO ] After 125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-10 19:28:17] [INFO ] After 304ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 205/205 transitions.
Applied a total of 0 rules in 8 ms. Remains 232 /232 variables (removed 0) and now considering 205/205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 232/232 places, 205/205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 205/205 transitions.
Applied a total of 0 rules in 8 ms. Remains 232 /232 variables (removed 0) and now considering 205/205 (removed 0) transitions.
[2023-03-10 19:28:17] [INFO ] Invariant cache hit.
[2023-03-10 19:28:18] [INFO ] Implicit Places using invariants in 468 ms returned []
[2023-03-10 19:28:18] [INFO ] Invariant cache hit.
[2023-03-10 19:28:18] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 914 ms to find 0 implicit places.
[2023-03-10 19:28:18] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-10 19:28:18] [INFO ] Invariant cache hit.
[2023-03-10 19:28:18] [INFO ] Dead Transitions using invariants and state equation in 285 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1228 ms. Remains : 232/232 places, 205/205 transitions.
Applied a total of 0 rules in 10 ms. Remains 232 /232 variables (removed 0) and now considering 205/205 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-10 19:28:18] [INFO ] Invariant cache hit.
[2023-03-10 19:28:18] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 19:28:19] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-10 19:28:19] [INFO ] [Nat]Absence check using 9 positive and 94 generalized place invariants in 81 ms returned sat
[2023-03-10 19:28:19] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 19:28:19] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-10 19:28:19] [INFO ] After 282ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-10 19:28:19] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2023-03-10 19:28:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 232 places, 205 transitions and 1144 arcs took 6 ms.
[2023-03-10 19:28:19] [INFO ] Flatten gal took : 61 ms
Total runtime 35298 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/1360/inv_0_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8941072 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16099536 kB

BK_TIME_CONFINEMENT_REACHED

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023

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="Echo-PT-d03r03"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Echo-PT-d03r03, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r169-tall-167838855300086"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Echo-PT-d03r03.tgz
mv Echo-PT-d03r03 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;