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.r165-tall-167838849900086.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 itstools
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 r165-tall-167838849900086
=====================================================================

--------------------
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 1679428478042

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Echo-PT-d03r03
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-21 19:54:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-21 19:54:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 19:54:39] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2023-03-21 19:54:39] [INFO ] Transformed 265 places.
[2023-03-21 19:54:39] [INFO ] Transformed 206 transitions.
[2023-03-21 19:54:39] [INFO ] Found NUPN structural information;
[2023-03-21 19:54:39] [INFO ] Parsed PT model containing 265 places and 206 transitions and 1252 arcs in 121 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 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 264 ms. (steps per millisecond=37 ) properties (out of 9) seen :7
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-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 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :1
FORMULA Echo-PT-d03r03-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 206 rows 265 cols
[2023-03-21 19:54:40] [INFO ] Computed 135 place invariants in 30 ms
[2023-03-21 19:54:40] [INFO ] Flatten gal took : 90 ms
[2023-03-21 19:54:40] [INFO ] Flatten gal took : 27 ms
[2023-03-21 19:54:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12803518443065503970.gal : 14 ms
[2023-03-21 19:54:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10651321469290800219.prop : 0 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/ReachabilityCardinality12803518443065503970.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10651321469290800219.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 ...330
Loading property file /tmp/ReachabilityCardinality10651321469290800219.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 12
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12 after 56
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :56 after 299
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :299 after 550
[2023-03-21 19:54:40] [INFO ] After 292ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :550 after 1901
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1901 after 2275
[2023-03-21 19:54:40] [INFO ] [Nat]Absence check using 24 positive place invariants in 7 ms returned sat
[2023-03-21 19:54:40] [INFO ] [Nat]Absence check using 24 positive and 111 generalized place invariants in 39 ms returned sat
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2275 after 4151
[2023-03-21 19:54:40] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 19:54:40] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 7 ms to minimize.
[2023-03-21 19:54:40] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 1 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 1024
[2023-03-21 19:54:41] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 4 ms to minimize.
SDD size :4151 after 12944
[2023-03-21 19:54:41] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2023-03-21 19:54:41] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2023-03-21 19:54:41] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 0 ms to minimize.
[2023-03-21 19:54:41] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 0 ms to minimize.
[2023-03-21 19:54:41] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2023-03-21 19:54:41] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 11 ms to minimize.
[2023-03-21 19:54:41] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2023-03-21 19:54:41] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 0 ms to minimize.
[2023-03-21 19:54:41] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2023-03-21 19:54:41] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 0 ms to minimize.
[2023-03-21 19:54:41] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 0 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 2048
[2023-03-21 19:54:41] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 0 ms to minimize.
SDD size :12944 after 44444
[2023-03-21 19:54:41] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2023-03-21 19:54:42] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 1 ms to minimize.
[2023-03-21 19:54:42] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2023-03-21 19:54:42] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 0 ms to minimize.
[2023-03-21 19:54:42] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 0 ms to minimize.
[2023-03-21 19:54:42] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 0 ms to minimize.
[2023-03-21 19:54:42] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 0 ms to minimize.
[2023-03-21 19:54:42] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2023-03-21 19:54:42] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2023-03-21 19:54:42] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 0 ms to minimize.
[2023-03-21 19:54:42] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 0 ms to minimize.
[2023-03-21 19:54:42] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2023-03-21 19:54:42] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 0 ms to minimize.
[2023-03-21 19:54:42] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2023-03-21 19:54:43] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 0 ms to minimize.
[2023-03-21 19:54:43] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
[2023-03-21 19:54:43] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2023-03-21 19:54:43] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 0 ms to minimize.
[2023-03-21 19:54:43] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4096
[2023-03-21 19:54:43] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 4 ms to minimize.
SDD size :44444 after 210199
[2023-03-21 19:54:43] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 0 ms to minimize.
[2023-03-21 19:54:43] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 0 ms to minimize.
[2023-03-21 19:54:43] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2023-03-21 19:54:43] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2023-03-21 19:54:43] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2023-03-21 19:54:43] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2023-03-21 19:54:43] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2023-03-21 19:54:43] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2023-03-21 19:54:43] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2023-03-21 19:54:43] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2023-03-21 19:54:44] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2023-03-21 19:54:44] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2023-03-21 19:54:44] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2023-03-21 19:54:44] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2023-03-21 19:54:44] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2023-03-21 19:54:44] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2023-03-21 19:54:44] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2023-03-21 19:54:44] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2023-03-21 19:54:44] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2023-03-21 19:54:44] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
[2023-03-21 19:54:44] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2023-03-21 19:54:44] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 8 ms to minimize.
[2023-03-21 19:54:44] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 0 ms to minimize.
[2023-03-21 19:54:44] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2023-03-21 19:54:44] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 0 ms to minimize.
[2023-03-21 19:54:45] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2023-03-21 19:54:45] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2023-03-21 19:54:45] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 0 ms to minimize.
[2023-03-21 19:54:45] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2023-03-21 19:54:45] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2023-03-21 19:54:45] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2023-03-21 19:54:45] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2023-03-21 19:54:45] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2023-03-21 19:54:45] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 11 ms to minimize.
[2023-03-21 19:54:45] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2023-03-21 19:54:45] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2023-03-21 19:54:45] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2023-03-21 19:54:45] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 0 ms to minimize.
[2023-03-21 19:54:46] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 0 ms to minimize.
[2023-03-21 19:54:46] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2023-03-21 19:54:46] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 8192
[2023-03-21 19:54:46] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
SDD size :210199 after 275383
[2023-03-21 19:54:46] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2023-03-21 19:54:46] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 0 ms to minimize.
[2023-03-21 19:54:46] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2023-03-21 19:54:46] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2023-03-21 19:54:46] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2023-03-21 19:54:46] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2023-03-21 19:54:46] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2023-03-21 19:54:46] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2023-03-21 19:54:46] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2023-03-21 19:54:46] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2023-03-21 19:54:47] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2023-03-21 19:54:47] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2023-03-21 19:54:47] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2023-03-21 19:54:47] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2023-03-21 19:54:47] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2023-03-21 19:54:47] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2023-03-21 19:54:47] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2023-03-21 19:54:47] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2023-03-21 19:54:47] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 0 ms to minimize.
[2023-03-21 19:54:47] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 0 ms to minimize.
[2023-03-21 19:54:47] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2023-03-21 19:54:47] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 0 ms to minimize.
[2023-03-21 19:54:47] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2023-03-21 19:54:47] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
[2023-03-21 19:54:47] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2023-03-21 19:54:48] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 0 ms to minimize.
[2023-03-21 19:54:48] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
[2023-03-21 19:54:48] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2023-03-21 19:54:48] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2023-03-21 19:54:48] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2023-03-21 19:54:48] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2023-03-21 19:54:48] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
[2023-03-21 19:54:48] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 0 ms to minimize.
[2023-03-21 19:54:48] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 0 ms to minimize.
[2023-03-21 19:54:48] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2023-03-21 19:54:48] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 0 ms to minimize.
[2023-03-21 19:54:48] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2023-03-21 19:54:48] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2023-03-21 19:54:48] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2023-03-21 19:54:49] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
[2023-03-21 19:54:49] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 0 ms to minimize.
[2023-03-21 19:54:49] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2023-03-21 19:54:49] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2023-03-21 19:54:49] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2023-03-21 19:54:49] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2023-03-21 19:54:49] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 0 ms to minimize.
[2023-03-21 19:54:49] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2023-03-21 19:54:49] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2023-03-21 19:54:49] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2023-03-21 19:54:49] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2023-03-21 19:54:49] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2023-03-21 19:54:49] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2023-03-21 19:54:49] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2023-03-21 19:54:50] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2023-03-21 19:54:50] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 0 ms to minimize.
[2023-03-21 19:54:50] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 0 ms to minimize.
[2023-03-21 19:54:50] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 0 ms to minimize.
[2023-03-21 19:54:50] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2023-03-21 19:54:50] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 0 ms to minimize.
[2023-03-21 19:54:50] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 0 ms to minimize.
[2023-03-21 19:54:50] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2023-03-21 19:54:50] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2023-03-21 19:54:50] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2023-03-21 19:54:50] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2023-03-21 19:54:50] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 0 ms to minimize.
[2023-03-21 19:54:50] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2023-03-21 19:54:50] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2023-03-21 19:54:51] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2023-03-21 19:54:51] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 0 ms to minimize.
[2023-03-21 19:54:51] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2023-03-21 19:54:51] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 0 ms to minimize.
[2023-03-21 19:54:51] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 0 ms to minimize.
[2023-03-21 19:54:51] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2023-03-21 19:54:51] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2023-03-21 19:54:51] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2023-03-21 19:54:51] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2023-03-21 19:54:51] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2023-03-21 19:54:51] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2023-03-21 19:54:51] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 0 ms to minimize.
[2023-03-21 19:54:51] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2023-03-21 19:54:52] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 0 ms to minimize.
[2023-03-21 19:54:52] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 0 ms to minimize.
[2023-03-21 19:54:52] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2023-03-21 19:54:52] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 0 ms to minimize.
[2023-03-21 19:54:52] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2023-03-21 19:54:52] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 0 ms to minimize.
[2023-03-21 19:54:52] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 0 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 16384
[2023-03-21 19:54:52] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 0 ms to minimize.
SDD size :275383 after 1.58607e+06
[2023-03-21 19:54:52] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 0 ms to minimize.
[2023-03-21 19:54:52] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2023-03-21 19:54:52] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2023-03-21 19:54:52] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2023-03-21 19:54:52] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2023-03-21 19:54:53] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2023-03-21 19:54:53] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2023-03-21 19:54:53] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2023-03-21 19:54:53] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2023-03-21 19:54:53] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 0 ms to minimize.
[2023-03-21 19:54:53] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 0 ms to minimize.
[2023-03-21 19:54:53] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 0 ms to minimize.
[2023-03-21 19:54:53] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2023-03-21 19:54:53] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 0 ms to minimize.
[2023-03-21 19:54:53] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2023-03-21 19:54:53] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2023-03-21 19:54:53] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2023-03-21 19:54:54] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2023-03-21 19:54:54] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2023-03-21 19:54:54] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 0 ms to minimize.
[2023-03-21 19:54:54] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2023-03-21 19:54:54] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 0 ms to minimize.
[2023-03-21 19:54:54] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 0 ms to minimize.
[2023-03-21 19:54:54] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2023-03-21 19:54:54] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2023-03-21 19:54:54] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2023-03-21 19:54:54] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 0 ms to minimize.
[2023-03-21 19:54:54] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2023-03-21 19:54:54] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2023-03-21 19:54:55] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 0 ms to minimize.
[2023-03-21 19:54:55] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2023-03-21 19:54:55] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
[2023-03-21 19:54:55] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 0 ms to minimize.
[2023-03-21 19:54:55] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 0 ms to minimize.
[2023-03-21 19:54:55] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 0 ms to minimize.
[2023-03-21 19:54:55] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2023-03-21 19:54:55] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 0 ms to minimize.
[2023-03-21 19:54:55] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 0 ms to minimize.
[2023-03-21 19:54:55] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2023-03-21 19:54:55] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 0 ms to minimize.
[2023-03-21 19:54:55] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2023-03-21 19:54:56] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2023-03-21 19:54:56] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 0 ms to minimize.
[2023-03-21 19:54:56] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 0 ms to minimize.
[2023-03-21 19:54:56] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2023-03-21 19:54:56] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 0 ms to minimize.
[2023-03-21 19:54:56] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2023-03-21 19:54:56] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2023-03-21 19:54:56] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 0 ms to minimize.
[2023-03-21 19:54:56] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 0 ms to minimize.
[2023-03-21 19:54:56] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2023-03-21 19:54:56] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2023-03-21 19:54:57] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 0 ms to minimize.
[2023-03-21 19:54:57] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2023-03-21 19:54:57] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2023-03-21 19:54:57] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2023-03-21 19:54:57] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 0 ms to minimize.
[2023-03-21 19:54:57] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2023-03-21 19:54:57] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2023-03-21 19:54:57] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 0 ms to minimize.
[2023-03-21 19:54:57] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2023-03-21 19:54:57] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
[2023-03-21 19:54:58] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 0 ms to minimize.
[2023-03-21 19:54:58] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 0 ms to minimize.
[2023-03-21 19:54:58] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2023-03-21 19:54:58] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 0 ms to minimize.
[2023-03-21 19:54:58] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2023-03-21 19:54:58] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
[2023-03-21 19:54:58] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 0 ms to minimize.
[2023-03-21 19:54:58] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2023-03-21 19:54:58] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 0 ms to minimize.
[2023-03-21 19:54:58] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 0 ms to minimize.
[2023-03-21 19:54:58] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
[2023-03-21 19:54:58] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2023-03-21 19:54:59] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2023-03-21 19:54:59] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2023-03-21 19:54:59] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2023-03-21 19:54:59] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2023-03-21 19:54:59] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2023-03-21 19:54:59] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 0 ms to minimize.
[2023-03-21 19:54:59] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2023-03-21 19:54:59] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 0 ms to minimize.
[2023-03-21 19:54:59] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2023-03-21 19:54:59] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2023-03-21 19:54:59] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 0 ms to minimize.
[2023-03-21 19:55:00] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 0 ms to minimize.
[2023-03-21 19:55:00] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 0 ms to minimize.
[2023-03-21 19:55:00] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2023-03-21 19:55:00] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 0 ms to minimize.
[2023-03-21 19:55:00] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2023-03-21 19:55:00] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 3 ms to minimize.
[2023-03-21 19:55:00] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2023-03-21 19:55:00] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2023-03-21 19:55:00] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2023-03-21 19:55:00] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 0 ms to minimize.
[2023-03-21 19:55:00] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 0 ms to minimize.
[2023-03-21 19:55:00] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2023-03-21 19:55:01] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2023-03-21 19:55:01] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2023-03-21 19:55:01] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 0 ms to minimize.
[2023-03-21 19:55:01] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2023-03-21 19:55:01] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2023-03-21 19:55:01] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2023-03-21 19:55:01] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2023-03-21 19:55:01] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2023-03-21 19:55:01] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2023-03-21 19:55:01] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 0 ms to minimize.
[2023-03-21 19:55:01] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2023-03-21 19:55:02] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 0 ms to minimize.
[2023-03-21 19:55:02] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2023-03-21 19:55:02] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 0 ms to minimize.
[2023-03-21 19:55:02] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2023-03-21 19:55:02] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2023-03-21 19:55:02] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 0 ms to minimize.
[2023-03-21 19:55:02] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
[2023-03-21 19:55:02] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 0 ms to minimize.
[2023-03-21 19:55:02] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 0 ms to minimize.
[2023-03-21 19:55:02] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 0 ms to minimize.
[2023-03-21 19:55:02] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
[2023-03-21 19:55:03] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2023-03-21 19:55:03] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 0 ms to minimize.
[2023-03-21 19:55:03] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 0 ms to minimize.
[2023-03-21 19:55:03] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 0 ms to minimize.
[2023-03-21 19:55:03] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 0 ms to minimize.
[2023-03-21 19:55:03] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2023-03-21 19:55:03] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2023-03-21 19:55:03] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2023-03-21 19:55:03] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 0 ms to minimize.
[2023-03-21 19:55:03] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2023-03-21 19:55:03] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 0 ms to minimize.
[2023-03-21 19:55:04] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2023-03-21 19:55:04] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2023-03-21 19:55:04] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2023-03-21 19:55:04] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2023-03-21 19:55:04] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2023-03-21 19:55:04] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 0 ms to minimize.
[2023-03-21 19:55:04] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 0 ms to minimize.
[2023-03-21 19:55:04] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2023-03-21 19:55:04] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 0 ms to minimize.
[2023-03-21 19:55:04] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 0 ms to minimize.
[2023-03-21 19:55:05] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2023-03-21 19:55:05] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 0 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 32768
[2023-03-21 19:55:05] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2023-03-21 19:55:05] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 0 ms to minimize.
SDD size :1.58607e+06 after 2.68713e+06
[2023-03-21 19:55:05] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 0 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-21 19:55:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 19:55:05] [INFO ] After 25060ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 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 54 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 56 ms. Remains : 239/265 places, 205/206 transitions.
Incomplete random walk after 10000 steps, including 204 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1143961 steps, run timeout after 3001 ms. (steps per millisecond=381 ) properties seen :{}
Probabilistic random walk after 1143961 steps, saw 151539 distinct states, run finished after 3002 ms. (steps per millisecond=381 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 205 rows 239 cols
[2023-03-21 19:55:08] [INFO ] Computed 110 place invariants in 42 ms
[2023-03-21 19:55:08] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:55:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2023-03-21 19:55:08] [INFO ] [Nat]Absence check using 11 positive and 99 generalized place invariants in 130 ms returned sat
[2023-03-21 19:55:08] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 19:55:09] [INFO ] After 178ms 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-21 19:55:09] [INFO ] After 393ms 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 23 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 23 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 31 ms. Remains 239 /239 variables (removed 0) and now considering 205/205 (removed 0) transitions.
[2023-03-21 19:55:09] [INFO ] Invariant cache hit.
[2023-03-21 19:55:09] [INFO ] Implicit Places using invariants in 476 ms returned [16, 164, 184, 206, 214, 225, 233]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 480 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 11 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 523 ms. Remains : 232/239 places, 205/205 transitions.
Incomplete random walk after 10000 steps, including 204 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1240250 steps, run timeout after 3001 ms. (steps per millisecond=413 ) properties seen :{}
Probabilistic random walk after 1240250 steps, saw 164011 distinct states, run finished after 3001 ms. (steps per millisecond=413 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 205 rows 232 cols
[2023-03-21 19:55:12] [INFO ] Computed 103 place invariants in 24 ms
[2023-03-21 19:55:12] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:55:12] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-21 19:55:12] [INFO ] [Nat]Absence check using 9 positive and 94 generalized place invariants in 81 ms returned sat
[2023-03-21 19:55:12] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 19:55:12] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-21 19:55:12] [INFO ] After 245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 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 9 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 10 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-21 19:55:12] [INFO ] Invariant cache hit.
[2023-03-21 19:55:13] [INFO ] Implicit Places using invariants in 415 ms returned []
[2023-03-21 19:55:13] [INFO ] Invariant cache hit.
[2023-03-21 19:55:13] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
[2023-03-21 19:55:13] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-21 19:55:13] [INFO ] Invariant cache hit.
[2023-03-21 19:55:14] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1104 ms. Remains : 232/232 places, 205/205 transitions.
Applied a total of 0 rules in 13 ms. Remains 232 /232 variables (removed 0) and now considering 205/205 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-21 19:55:14] [INFO ] Invariant cache hit.
[2023-03-21 19:55:14] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:55:14] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-21 19:55:14] [INFO ] [Nat]Absence check using 9 positive and 94 generalized place invariants in 74 ms returned sat
[2023-03-21 19:55:14] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 19:55:14] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-21 19:55:14] [INFO ] After 257ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-21 19:55:14] [INFO ] Flatten gal took : 21 ms
[2023-03-21 19:55:14] [INFO ] Flatten gal took : 20 ms
[2023-03-21 19:55:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8710957387698716227.gal : 3 ms
[2023-03-21 19:55:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12653559207378736164.prop : 0 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/ReachabilityCardinality8710957387698716227.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12653559207378736164.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 ...329
Loading property file /tmp/ReachabilityCardinality12653559207378736164.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 16
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :16 after 46
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :46 after 58
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :58 after 325
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :325 after 1848
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1848 after 2018
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2018 after 3810
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3810 after 4460
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4460 after 40716
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :40716 after 47913
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :47913 after 224412
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :224412 after 299547
Detected timeout of ITS tools.
[2023-03-21 19:55:29] [INFO ] Flatten gal took : 17 ms
[2023-03-21 19:55:29] [INFO ] Applying decomposition
[2023-03-21 19:55:29] [INFO ] Flatten gal took : 17 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/graph5840976773373927498.txt' '-o' '/tmp/graph5840976773373927498.bin' '-w' '/tmp/graph5840976773373927498.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5840976773373927498.bin' '-l' '-1' '-v' '-w' '/tmp/graph5840976773373927498.weights' '-q' '0' '-e' '0.001'
[2023-03-21 19:55:29] [INFO ] Decomposing Gal with order
[2023-03-21 19:55:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-21 19:55:29] [INFO ] Removed a total of 251 redundant transitions.
[2023-03-21 19:55:29] [INFO ] Flatten gal took : 60 ms
[2023-03-21 19:55:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2023-03-21 19:55:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18310072928626742915.gal : 6 ms
[2023-03-21 19:55:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13356511480272555883.prop : 0 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/ReachabilityCardinality18310072928626742915.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13356511480272555883.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 ...309
Loading property file /tmp/ReachabilityCardinality13356511480272555883.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 22
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :22 after 746
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :746 after 2130
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2130 after 303676
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :303676 after 1.6661e+06
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.6661e+06 after 1.45544e+08
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.68713e+06 after 9.37823e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.45544e+08 after 2.77786e+08
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16623233024992534752
[2023-03-21 19:55:44] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16623233024992534752
Running compilation step : cd /tmp/ltsmin16623233024992534752;'/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 468 ms.
Running link step : cd /tmp/ltsmin16623233024992534752;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin16623233024992534752;'/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' 'EchoPTd03r03ReachabilityCardinality03==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-21 19:56:00] [INFO ] Flatten gal took : 29 ms
[2023-03-21 19:56:00] [INFO ] Applying decomposition
[2023-03-21 19:56:00] [INFO ] Flatten gal took : 17 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/graph3514943834548311275.txt' '-o' '/tmp/graph3514943834548311275.bin' '-w' '/tmp/graph3514943834548311275.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3514943834548311275.bin' '-l' '-1' '-v' '-w' '/tmp/graph3514943834548311275.weights' '-q' '0' '-e' '0.001'
[2023-03-21 19:56:00] [INFO ] Decomposing Gal with order
[2023-03-21 19:56:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-21 19:56:00] [INFO ] Removed a total of 237 redundant transitions.
[2023-03-21 19:56:00] [INFO ] Flatten gal took : 34 ms
[2023-03-21 19:56:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 7 ms.
[2023-03-21 19:56:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4067837802315168309.gal : 5 ms
[2023-03-21 19:56:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11603230229459772110.prop : 0 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/ReachabilityCardinality4067837802315168309.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11603230229459772110.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/ReachabilityCardinality11603230229459772110.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 30
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :30 after 383101
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :383101 after 999276
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :999276 after 2.86129e+09
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.86129e+09 after 3.7438e+09
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3.7438e+09 after 9.41427e+09
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :9.37823e+06 after 9.50341e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :9.41427e+09 after 2.52497e+10
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :9.50341e+07 after 1.19945e+08
SDD proceeding with computation,1 properties remain. new max is 524288
SDD size :1.19945e+08 after 5.72562e+08
SDD proceeding with computation,1 properties remain. new max is 1048576
SDD size :5.72562e+08 after 1.00537e+09
ITS-tools command line returned an error code 137
Detected timeout of ITS tools.
[2023-03-21 20:26:01] [INFO ] Flatten gal took : 276 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin836481678513954755
[2023-03-21 20:26:01] [INFO ] Computing symmetric may disable matrix : 205 transitions.
[2023-03-21 20:26:02] [INFO ] Computation of Complete disable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 20:26:02] [INFO ] Computing symmetric may enable matrix : 205 transitions.
[2023-03-21 20:26:02] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 20:26:02] [INFO ] Computing Do-Not-Accords matrix : 205 transitions.
[2023-03-21 20:26:02] [INFO ] Applying decomposition
[2023-03-21 20:26:02] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 20:26:02] [INFO ] Built C files in 267ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin836481678513954755
[2023-03-21 20:26:02] [INFO ] Flatten gal took : 189 ms
Running compilation step : cd /tmp/ltsmin836481678513954755;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' '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 1032 ms.
Running link step : cd /tmp/ltsmin836481678513954755;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin836481678513954755;'/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' 'EchoPTd03r03ReachabilityCardinality03==true'
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/graph8209228388991326909.txt' '-o' '/tmp/graph8209228388991326909.bin' '-w' '/tmp/graph8209228388991326909.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8209228388991326909.bin' '-l' '-1' '-v' '-w' '/tmp/graph8209228388991326909.weights' '-q' '0' '-e' '0.001'
[2023-03-21 20:26:05] [INFO ] Decomposing Gal with order
[2023-03-21 20:26:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-21 20:26:05] [INFO ] Removed a total of 253 redundant transitions.
[2023-03-21 20:26:05] [INFO ] Flatten gal took : 211 ms
[2023-03-21 20:26:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2023-03-21 20:26:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9664185804660239354.gal : 7 ms
[2023-03-21 20:26:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11388792920267125811.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/ReachabilityCardinality9664185804660239354.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11388792920267125811.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/ReachabilityCardinality11388792920267125811.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 14
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :14 after 1000
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1000 after 2136
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2136 after 87087
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :87087 after 3.8901e+07
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3.8901e+07 after 4.70142e+08
pins2lts-mc-linux64, 0.001: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.010: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: Initializing POR dependencies: labels 206, guards 205
pins2lts-mc-linux64( 2/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.032: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.033: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.040: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.040: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.042: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.417: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 6/ 8), 0.477: "EchoPTd03r03ReachabilityCardinality03==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.485: "EchoPTd03r03ReachabilityCardinality03==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.478: "EchoPTd03r03ReachabilityCardinality03==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.477: "EchoPTd03r03ReachabilityCardinality03==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.477: "EchoPTd03r03ReachabilityCardinality03==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.485: "EchoPTd03r03ReachabilityCardinality03==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.477: "EchoPTd03r03ReachabilityCardinality03==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.486: "EchoPTd03r03ReachabilityCardinality03==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.487: There are 206 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.487: State length is 232, there are 205 groups
pins2lts-mc-linux64( 0/ 8), 0.487: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.487: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.487: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.487: Visible groups: 0 / 205, labels: 1 / 206
pins2lts-mc-linux64( 0/ 8), 0.487: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 0.487: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 2.445: ~2 levels ~960 states ~13472 transitions
pins2lts-mc-linux64( 7/ 8), 2.613: ~2 levels ~1920 states ~27768 transitions
pins2lts-mc-linux64( 3/ 8), 2.828: ~3 levels ~3840 states ~69328 transitions
pins2lts-mc-linux64( 3/ 8), 3.183: ~3 levels ~7680 states ~137640 transitions
pins2lts-mc-linux64( 7/ 8), 3.702: ~3 levels ~15360 states ~246752 transitions
pins2lts-mc-linux64( 7/ 8), 4.744: ~4 levels ~30720 states ~511256 transitions
pins2lts-mc-linux64( 7/ 8), 6.579: ~4 levels ~61440 states ~1046288 transitions
pins2lts-mc-linux64( 7/ 8), 9.961: ~5 levels ~122880 states ~2154296 transitions
pins2lts-mc-linux64( 0/ 8), 16.059: ~8 levels ~245760 states ~4215792 transitions
pins2lts-mc-linux64( 0/ 8), 28.178: ~8 levels ~491520 states ~8629456 transitions
pins2lts-mc-linux64( 0/ 8), 52.497: ~9 levels ~983040 states ~17497744 transitions
pins2lts-mc-linux64( 0/ 8), 104.737: ~9 levels ~1966080 states ~35717768 transitions
pins2lts-mc-linux64( 3/ 8), 107.930: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 108.331:
pins2lts-mc-linux64( 0/ 8), 108.331: mean standard work distribution: 4.3% (states) 0.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 108.331:
pins2lts-mc-linux64( 0/ 8), 108.331: Explored 1838629 states 35752319 transitions, fanout: 19.445
pins2lts-mc-linux64( 0/ 8), 108.331: Total exploration time 107.840 sec (107.480 sec minimum, 107.619 sec on average)
pins2lts-mc-linux64( 0/ 8), 108.331: States per second: 17050, Transitions per second: 331531
pins2lts-mc-linux64( 0/ 8), 108.331: Ignoring proviso: 0
pins2lts-mc-linux64( 0/ 8), 108.331:
pins2lts-mc-linux64( 0/ 8), 108.331: Queue width: 8B, total height: 7998264, memory: 61.02MB
pins2lts-mc-linux64( 0/ 8), 108.331: Tree memory: 331.1MB, 35.3 B/state, compr.: 3.8%
pins2lts-mc-linux64( 0/ 8), 108.331: Tree fill ratio (roots/leafs): 7.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 108.331: Stored 207 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 108.331: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 108.331: Est. total memory use: 392.1MB (~1085.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin836481678513954755;'/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' 'EchoPTd03r03ReachabilityCardinality03==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin836481678513954755;'/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' 'EchoPTd03r03ReachabilityCardinality03==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)
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :5.1724e+12 after 5.18089e+12
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5.18089e+12 after 5.68929e+12
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 164336 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15907200 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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="Echo-PT-d03r03"
export BK_EXAMINATION="ReachabilityCardinality"
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 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 r165-tall-167838849900086"
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 ;