MCC'2021- Execution of r140-tall-162089128100575

About the Execution of ITS-Tools for Peterson-COL-4

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
4067.016	1929318.00	4536282.00	35377.40	FFTTFFTFTTFTTFFF	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162089128100575.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Peterson-COL-4, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089128100575
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 22K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 168K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 74K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 07:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 07:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 08:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 08:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 44K May 5 16:51 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 Peterson-COL-4-ReachabilityFireability-00
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-01
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-02
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-03
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-04
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-05
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-06
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-07
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-08
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-09
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-10
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-11
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-12
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-13
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-14
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621009480158

Running Version 0
[2021-05-14 16:24:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 16:24:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 16:24:41] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-14 16:24:42] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-14 16:24:42] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 556 ms
[2021-05-14 16:24:42] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 500 PT places and 795.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-COL-4-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 16:24:42] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions in 3 ms.
[2021-05-14 16:24:42] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_3478690874632794456.dot
Reduce places removed 2 places and 0 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2021-05-14 16:24:42] [INFO ] Flatten gal took : 26 ms
[2021-05-14 16:24:42] [INFO ] Flatten gal took : 2 ms
[2021-05-14 16:24:42] [INFO ] Unfolded HLPN to a Petri net with 500 places and 730 transitions in 22 ms.
[2021-05-14 16:24:42] [INFO ] Unfolded HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1001_10475148640319806636.dot
Deduced a syphon composed of 20 places in 6 ms
Reduce places removed 20 places and 40 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 15) seen :9
FORMULA Peterson-COL-4-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2021-05-14 16:24:43] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2021-05-14 16:24:43] [INFO ] Computed 19 place invariants in 15 ms
[2021-05-14 16:24:43] [INFO ] [Real]Absence check using 14 positive place invariants in 17 ms returned sat
[2021-05-14 16:24:43] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 7 ms returned sat
[2021-05-14 16:24:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 16:24:44] [INFO ] [Real]Absence check using state equation in 461 ms returned sat
[2021-05-14 16:24:44] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-14 16:24:44] [INFO ] [Real]Added 132 Read/Feed constraints in 23 ms returned sat
[2021-05-14 16:24:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 16:24:44] [INFO ] [Nat]Absence check using 14 positive place invariants in 15 ms returned sat
[2021-05-14 16:24:44] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 6 ms returned sat
[2021-05-14 16:24:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 16:24:44] [INFO ] [Nat]Absence check using state equation in 439 ms returned sat
[2021-05-14 16:24:45] [INFO ] [Nat]Added 132 Read/Feed constraints in 23 ms returned sat
[2021-05-14 16:24:45] [INFO ] Deduced a trap composed of 31 places in 183 ms of which 4 ms to minimize.
[2021-05-14 16:24:45] [INFO ] Deduced a trap composed of 66 places in 145 ms of which 2 ms to minimize.
[2021-05-14 16:24:45] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 1 ms to minimize.
[2021-05-14 16:24:45] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 1 ms to minimize.
[2021-05-14 16:24:45] [INFO ] Deduced a trap composed of 85 places in 124 ms of which 0 ms to minimize.
[2021-05-14 16:24:46] [INFO ] Deduced a trap composed of 63 places in 127 ms of which 1 ms to minimize.
[2021-05-14 16:24:46] [INFO ] Deduced a trap composed of 86 places in 142 ms of which 1 ms to minimize.
[2021-05-14 16:24:46] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 1 ms to minimize.
[2021-05-14 16:24:46] [INFO ] Deduced a trap composed of 70 places in 125 ms of which 1 ms to minimize.
[2021-05-14 16:24:46] [INFO ] Deduced a trap composed of 63 places in 115 ms of which 0 ms to minimize.
[2021-05-14 16:24:46] [INFO ] Deduced a trap composed of 114 places in 123 ms of which 1 ms to minimize.
[2021-05-14 16:24:46] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 1 ms to minimize.
[2021-05-14 16:24:47] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 0 ms to minimize.
[2021-05-14 16:24:47] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 0 ms to minimize.
[2021-05-14 16:24:47] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 1 ms to minimize.
[2021-05-14 16:24:47] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 1 ms to minimize.
[2021-05-14 16:24:47] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 1 ms to minimize.
[2021-05-14 16:24:47] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 0 ms to minimize.
[2021-05-14 16:24:47] [INFO ] Deduced a trap composed of 47 places in 125 ms of which 1 ms to minimize.
[2021-05-14 16:24:48] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 1 ms to minimize.
[2021-05-14 16:24:48] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 0 ms to minimize.
[2021-05-14 16:24:48] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 0 ms to minimize.
[2021-05-14 16:24:48] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 0 ms to minimize.
[2021-05-14 16:24:48] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 1 ms to minimize.
[2021-05-14 16:24:48] [INFO ] Deduced a trap composed of 84 places in 117 ms of which 1 ms to minimize.
[2021-05-14 16:24:49] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 0 ms to minimize.
[2021-05-14 16:24:49] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 0 ms to minimize.
[2021-05-14 16:24:49] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 1 ms to minimize.
[2021-05-14 16:24:49] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 1 ms to minimize.
[2021-05-14 16:24:49] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2021-05-14 16:24:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-14 16:24:49] [INFO ] [Real]Absence check using 14 positive place invariants in 46 ms returned sat
[2021-05-14 16:24:49] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 7 ms returned sat
[2021-05-14 16:24:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 16:24:50] [INFO ] [Real]Absence check using state equation in 337 ms returned sat
[2021-05-14 16:24:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 16:24:50] [INFO ] [Nat]Absence check using 14 positive place invariants in 38 ms returned sat
[2021-05-14 16:24:50] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 5 ms returned sat
[2021-05-14 16:24:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 16:24:50] [INFO ] [Nat]Absence check using state equation in 343 ms returned sat
[2021-05-14 16:24:50] [INFO ] [Nat]Added 132 Read/Feed constraints in 22 ms returned sat
[2021-05-14 16:24:50] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 0 ms to minimize.
[2021-05-14 16:24:50] [INFO ] Deduced a trap composed of 62 places in 120 ms of which 0 ms to minimize.
[2021-05-14 16:24:51] [INFO ] Deduced a trap composed of 75 places in 127 ms of which 1 ms to minimize.
[2021-05-14 16:24:51] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 1 ms to minimize.
[2021-05-14 16:24:51] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 7 ms to minimize.
[2021-05-14 16:24:51] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 0 ms to minimize.
[2021-05-14 16:24:51] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 0 ms to minimize.
[2021-05-14 16:24:51] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 0 ms to minimize.
[2021-05-14 16:24:51] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 0 ms to minimize.
[2021-05-14 16:24:52] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2021-05-14 16:24:52] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 0 ms to minimize.
[2021-05-14 16:24:52] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 1 ms to minimize.
[2021-05-14 16:24:52] [INFO ] Deduced a trap composed of 47 places in 124 ms of which 0 ms to minimize.
[2021-05-14 16:24:52] [INFO ] Deduced a trap composed of 112 places in 127 ms of which 1 ms to minimize.
[2021-05-14 16:24:52] [INFO ] Deduced a trap composed of 48 places in 113 ms of which 1 ms to minimize.
[2021-05-14 16:24:53] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 1 ms to minimize.
[2021-05-14 16:24:53] [INFO ] Deduced a trap composed of 58 places in 121 ms of which 0 ms to minimize.
[2021-05-14 16:24:53] [INFO ] Deduced a trap composed of 58 places in 128 ms of which 0 ms to minimize.
[2021-05-14 16:24:53] [INFO ] Deduced a trap composed of 49 places in 114 ms of which 2 ms to minimize.
[2021-05-14 16:24:53] [INFO ] Deduced a trap composed of 73 places in 128 ms of which 0 ms to minimize.
[2021-05-14 16:24:53] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 1 ms to minimize.
[2021-05-14 16:24:54] [INFO ] Deduced a trap composed of 47 places in 131 ms of which 0 ms to minimize.
[2021-05-14 16:24:54] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 0 ms to minimize.
[2021-05-14 16:24:54] [INFO ] Deduced a trap composed of 120 places in 119 ms of which 1 ms to minimize.
[2021-05-14 16:24:54] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 0 ms to minimize.
[2021-05-14 16:24:54] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 2 ms to minimize.
[2021-05-14 16:24:54] [INFO ] Deduced a trap composed of 103 places in 122 ms of which 6 ms to minimize.
[2021-05-14 16:24:55] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 1 ms to minimize.
[2021-05-14 16:24:55] [INFO ] Deduced a trap composed of 109 places in 115 ms of which 1 ms to minimize.
[2021-05-14 16:24:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-14 16:24:55] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2021-05-14 16:24:55] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2021-05-14 16:24:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 16:24:55] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2021-05-14 16:24:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 16:24:55] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2021-05-14 16:24:55] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2021-05-14 16:24:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 16:24:55] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2021-05-14 16:24:55] [INFO ] [Nat]Added 132 Read/Feed constraints in 26 ms returned sat
[2021-05-14 16:24:55] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 0 ms to minimize.
[2021-05-14 16:24:55] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 0 ms to minimize.
[2021-05-14 16:24:56] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 0 ms to minimize.
[2021-05-14 16:24:56] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 1 ms to minimize.
[2021-05-14 16:24:56] [INFO ] Deduced a trap composed of 106 places in 82 ms of which 1 ms to minimize.
[2021-05-14 16:24:56] [INFO ] Deduced a trap composed of 69 places in 92 ms of which 0 ms to minimize.
[2021-05-14 16:24:56] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 9 ms to minimize.
[2021-05-14 16:24:56] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 8 ms to minimize.
[2021-05-14 16:24:56] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 7 ms to minimize.
[2021-05-14 16:24:56] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2021-05-14 16:24:57] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 1 ms to minimize.
[2021-05-14 16:24:57] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 0 ms to minimize.
[2021-05-14 16:24:57] [INFO ] Deduced a trap composed of 80 places in 73 ms of which 0 ms to minimize.
[2021-05-14 16:24:57] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 1 ms to minimize.
[2021-05-14 16:24:57] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2021-05-14 16:24:57] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 0 ms to minimize.
[2021-05-14 16:24:57] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 0 ms to minimize.
[2021-05-14 16:24:57] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2021-05-14 16:24:57] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1977 ms
[2021-05-14 16:24:57] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 42 ms.
[2021-05-14 16:25:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2021-05-14 16:25:00] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2021-05-14 16:25:00] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 6 ms returned sat
[2021-05-14 16:25:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 16:25:00] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2021-05-14 16:25:00] [INFO ] [Real]Added 132 Read/Feed constraints in 21 ms returned sat
[2021-05-14 16:25:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 16:25:00] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2021-05-14 16:25:00] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2021-05-14 16:25:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 16:25:01] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2021-05-14 16:25:01] [INFO ] [Nat]Added 132 Read/Feed constraints in 27 ms returned sat
[2021-05-14 16:25:01] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 1 ms to minimize.
[2021-05-14 16:25:01] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 1 ms to minimize.
[2021-05-14 16:25:01] [INFO ] Deduced a trap composed of 58 places in 128 ms of which 0 ms to minimize.
[2021-05-14 16:25:01] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 0 ms to minimize.
[2021-05-14 16:25:01] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 0 ms to minimize.
[2021-05-14 16:25:01] [INFO ] Deduced a trap composed of 54 places in 117 ms of which 1 ms to minimize.
[2021-05-14 16:25:02] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 1 ms to minimize.
[2021-05-14 16:25:02] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 1 ms to minimize.
[2021-05-14 16:25:02] [INFO ] Deduced a trap composed of 79 places in 127 ms of which 0 ms to minimize.
[2021-05-14 16:25:02] [INFO ] Deduced a trap composed of 78 places in 124 ms of which 0 ms to minimize.
[2021-05-14 16:25:02] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 1 ms to minimize.
[2021-05-14 16:25:02] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 0 ms to minimize.
[2021-05-14 16:25:03] [INFO ] Deduced a trap composed of 56 places in 119 ms of which 1 ms to minimize.
[2021-05-14 16:25:03] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 0 ms to minimize.
[2021-05-14 16:25:03] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 0 ms to minimize.
[2021-05-14 16:25:03] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 1 ms to minimize.
[2021-05-14 16:25:03] [INFO ] Deduced a trap composed of 105 places in 115 ms of which 1 ms to minimize.
[2021-05-14 16:25:03] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 0 ms to minimize.
[2021-05-14 16:25:03] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 0 ms to minimize.
[2021-05-14 16:25:03] [INFO ] Deduced a trap composed of 76 places in 136 ms of which 0 ms to minimize.
[2021-05-14 16:25:04] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 0 ms to minimize.
[2021-05-14 16:25:04] [INFO ] Deduced a trap composed of 130 places in 130 ms of which 0 ms to minimize.
[2021-05-14 16:25:04] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 1 ms to minimize.
[2021-05-14 16:25:04] [INFO ] Deduced a trap composed of 55 places in 139 ms of which 1 ms to minimize.
[2021-05-14 16:25:04] [INFO ] Deduced a trap composed of 115 places in 126 ms of which 1 ms to minimize.
[2021-05-14 16:25:04] [INFO ] Deduced a trap composed of 111 places in 127 ms of which 0 ms to minimize.
[2021-05-14 16:25:05] [INFO ] Deduced a trap composed of 72 places in 122 ms of which 0 ms to minimize.
[2021-05-14 16:25:05] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 0 ms to minimize.
[2021-05-14 16:25:05] [INFO ] Deduced a trap composed of 116 places in 128 ms of which 0 ms to minimize.
[2021-05-14 16:25:05] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 1 ms to minimize.
[2021-05-14 16:25:05] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 0 ms to minimize.
[2021-05-14 16:25:05] [INFO ] Deduced a trap composed of 54 places in 134 ms of which 1 ms to minimize.
[2021-05-14 16:25:05] [INFO ] Deduced a trap composed of 69 places in 101 ms of which 0 ms to minimize.
[2021-05-14 16:25:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2021-05-14 16:25:05] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2021-05-14 16:25:05] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 6 ms returned sat
[2021-05-14 16:25:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 16:25:06] [INFO ] [Real]Absence check using state equation in 401 ms returned sat
[2021-05-14 16:25:06] [INFO ] [Real]Added 132 Read/Feed constraints in 23 ms returned sat
[2021-05-14 16:25:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 16:25:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 15 ms returned sat
[2021-05-14 16:25:06] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 9 ms returned sat
[2021-05-14 16:25:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 16:25:06] [INFO ] [Nat]Absence check using state equation in 455 ms returned sat
[2021-05-14 16:25:07] [INFO ] [Nat]Added 132 Read/Feed constraints in 31 ms returned sat
[2021-05-14 16:25:07] [INFO ] Deduced a trap composed of 112 places in 140 ms of which 0 ms to minimize.
[2021-05-14 16:25:07] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 0 ms to minimize.
[2021-05-14 16:25:07] [INFO ] Deduced a trap composed of 69 places in 144 ms of which 1 ms to minimize.
[2021-05-14 16:25:07] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 0 ms to minimize.
[2021-05-14 16:25:07] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 1 ms to minimize.
[2021-05-14 16:25:08] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 1 ms to minimize.
[2021-05-14 16:25:08] [INFO ] Deduced a trap composed of 158 places in 119 ms of which 0 ms to minimize.
[2021-05-14 16:25:08] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 0 ms to minimize.
[2021-05-14 16:25:08] [INFO ] Deduced a trap composed of 54 places in 117 ms of which 0 ms to minimize.
[2021-05-14 16:25:08] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 0 ms to minimize.
[2021-05-14 16:25:08] [INFO ] Deduced a trap composed of 123 places in 113 ms of which 0 ms to minimize.
[2021-05-14 16:25:08] [INFO ] Deduced a trap composed of 47 places in 125 ms of which 1 ms to minimize.
[2021-05-14 16:25:09] [INFO ] Deduced a trap composed of 69 places in 112 ms of which 1 ms to minimize.
[2021-05-14 16:25:09] [INFO ] Deduced a trap composed of 86 places in 132 ms of which 0 ms to minimize.
[2021-05-14 16:25:09] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 1 ms to minimize.
[2021-05-14 16:25:09] [INFO ] Deduced a trap composed of 62 places in 118 ms of which 6 ms to minimize.
[2021-05-14 16:25:09] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 2 ms to minimize.
[2021-05-14 16:25:09] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 0 ms to minimize.
[2021-05-14 16:25:10] [INFO ] Deduced a trap composed of 66 places in 116 ms of which 1 ms to minimize.
[2021-05-14 16:25:10] [INFO ] Deduced a trap composed of 123 places in 97 ms of which 0 ms to minimize.
[2021-05-14 16:25:10] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 0 ms to minimize.
[2021-05-14 16:25:10] [INFO ] Deduced a trap composed of 78 places in 94 ms of which 0 ms to minimize.
[2021-05-14 16:25:10] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 1 ms to minimize.
[2021-05-14 16:25:10] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 1 ms to minimize.
[2021-05-14 16:25:10] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 0 ms to minimize.
[2021-05-14 16:25:10] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 1 ms to minimize.
[2021-05-14 16:25:11] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 1 ms to minimize.
[2021-05-14 16:25:11] [INFO ] Deduced a trap composed of 54 places in 114 ms of which 0 ms to minimize.
[2021-05-14 16:25:11] [INFO ] Deduced a trap composed of 62 places in 110 ms of which 0 ms to minimize.
[2021-05-14 16:25:11] [INFO ] Deduced a trap composed of 2 places in 170 ms of which 1 ms to minimize.
[2021-05-14 16:25:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2021-05-14 16:25:11] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2021-05-14 16:25:11] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2021-05-14 16:25:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 16:25:11] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2021-05-14 16:25:12] [INFO ] [Real]Added 132 Read/Feed constraints in 38 ms returned sat
[2021-05-14 16:25:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 16:25:12] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2021-05-14 16:25:12] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 5 ms returned sat
[2021-05-14 16:25:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 16:25:12] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2021-05-14 16:25:12] [INFO ] [Nat]Added 132 Read/Feed constraints in 25 ms returned sat
[2021-05-14 16:25:12] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 1 ms to minimize.
[2021-05-14 16:25:12] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 0 ms to minimize.
[2021-05-14 16:25:12] [INFO ] Deduced a trap composed of 140 places in 129 ms of which 0 ms to minimize.
[2021-05-14 16:25:12] [INFO ] Deduced a trap composed of 103 places in 132 ms of which 1 ms to minimize.
[2021-05-14 16:25:13] [INFO ] Deduced a trap composed of 66 places in 122 ms of which 0 ms to minimize.
[2021-05-14 16:25:13] [INFO ] Deduced a trap composed of 71 places in 114 ms of which 0 ms to minimize.
[2021-05-14 16:25:13] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 0 ms to minimize.
[2021-05-14 16:25:13] [INFO ] Deduced a trap composed of 145 places in 119 ms of which 1 ms to minimize.
[2021-05-14 16:25:13] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 0 ms to minimize.
[2021-05-14 16:25:13] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 1 ms to minimize.
[2021-05-14 16:25:13] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2021-05-14 16:25:14] [INFO ] Deduced a trap composed of 78 places in 118 ms of which 0 ms to minimize.
[2021-05-14 16:25:14] [INFO ] Deduced a trap composed of 59 places in 117 ms of which 1 ms to minimize.
[2021-05-14 16:25:14] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 0 ms to minimize.
[2021-05-14 16:25:14] [INFO ] Deduced a trap composed of 79 places in 127 ms of which 0 ms to minimize.
[2021-05-14 16:25:14] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 0 ms to minimize.
[2021-05-14 16:25:14] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 1 ms to minimize.
[2021-05-14 16:25:15] [INFO ] Deduced a trap composed of 76 places in 126 ms of which 1 ms to minimize.
[2021-05-14 16:25:15] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 2 ms to minimize.
[2021-05-14 16:25:15] [INFO ] Deduced a trap composed of 65 places in 99 ms of which 0 ms to minimize.
[2021-05-14 16:25:15] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 0 ms to minimize.
[2021-05-14 16:25:15] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 1 ms to minimize.
[2021-05-14 16:25:15] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 1 ms to minimize.
[2021-05-14 16:25:15] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 0 ms to minimize.
[2021-05-14 16:25:16] [INFO ] Deduced a trap composed of 62 places in 104 ms of which 0 ms to minimize.
[2021-05-14 16:25:16] [INFO ] Deduced a trap composed of 137 places in 109 ms of which 0 ms to minimize.
[2021-05-14 16:25:16] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 0 ms to minimize.
[2021-05-14 16:25:16] [INFO ] Deduced a trap composed of 139 places in 105 ms of which 0 ms to minimize.
[2021-05-14 16:25:16] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 1 ms to minimize.
[2021-05-14 16:25:16] [INFO ] Deduced a trap composed of 98 places in 116 ms of which 0 ms to minimize.
[2021-05-14 16:25:16] [INFO ] Deduced a trap composed of 85 places in 115 ms of which 0 ms to minimize.
[2021-05-14 16:25:17] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 1 ms to minimize.
[2021-05-14 16:25:17] [INFO ] Deduced a trap composed of 2 places in 166 ms of which 1 ms to minimize.
[2021-05-14 16:25:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
Fused 6 Parikh solutions to 1 different solutions.
Support contains 400 out of 480 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 30 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 480/480 places, 690/690 transitions.
[2021-05-14 16:25:17] [INFO ] Flatten gal took : 58 ms
[2021-05-14 16:25:17] [INFO ] Flatten gal took : 42 ms
[2021-05-14 16:25:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12961969508582607035.gal : 14 ms
[2021-05-14 16:25:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4514222682438150932.prop : 5 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality12961969508582607035.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4514222682438150932.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality12961969508582607035.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4514222682438150932.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality4514222682438150932.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :5 after 6
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :6 after 16
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :16 after 37
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :37 after 69
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :69 after 212
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :212 after 624
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :624 after 1768
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :1768 after 4220
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :4220 after 25994
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :25994 after 68803
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :68803 after 139526
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :139526 after 660694
Detected timeout of ITS tools.
[2021-05-14 16:25:32] [INFO ] Flatten gal took : 54 ms
[2021-05-14 16:25:32] [INFO ] Applying decomposition
[2021-05-14 16:25:32] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17294237285964737724.txt, -o, /tmp/graph17294237285964737724.bin, -w, /tmp/graph17294237285964737724.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17294237285964737724.bin, -l, -1, -v, -w, /tmp/graph17294237285964737724.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 16:25:32] [INFO ] Decomposing Gal with order
[2021-05-14 16:25:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 16:25:32] [INFO ] Removed a total of 487 redundant transitions.
[2021-05-14 16:25:32] [INFO ] Flatten gal took : 93 ms
[2021-05-14 16:25:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 12 ms.
[2021-05-14 16:25:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14844776389318190603.gal : 8 ms
[2021-05-14 16:25:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11834569125538789914.prop : 7 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality14844776389318190603.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11834569125538789914.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality14844776389318190603.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11834569125538789914.prop --nowitness
Loading property file /tmp/ReachabilityCardinality11834569125538789914.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 55
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :55 after 247
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :247 after 494
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :494 after 6344
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :6344 after 6536
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :6536 after 257466
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12068710549187858200
[2021-05-14 16:25:48] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12068710549187858200
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12068710549187858200]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12068710549187858200] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12068710549187858200] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 13389 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Interrupted Best-First random walk after 303918 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=60 ) properties seen :{}
Interrupted Best-First random walk after 253848 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=50 ) properties seen :{}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4115 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2818 ms. (steps per millisecond=354 ) properties (out of 6) seen :0
Interrupted Best-First random walk after 522583 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=104 ) properties seen :{}
Interrupted Best-First random walk after 579799 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=115 ) properties seen :{}
Interrupted probabilistic random walk after 6310188 steps, run timeout after 30001 ms. (steps per millisecond=210 ) properties seen :{2=1, 3=1}
Probabilistic random walk after 6310188 steps, saw 1085543 distinct states, run finished after 30001 ms. (steps per millisecond=210 ) properties seen :{2=1, 3=1}
FORMULA Peterson-COL-4-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 4 properties.
[2021-05-14 16:26:59] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2021-05-14 16:26:59] [INFO ] Computed 19 place invariants in 12 ms
[2021-05-14 16:26:59] [INFO ] [Real]Absence check using 14 positive place invariants in 17 ms returned sat
[2021-05-14 16:26:59] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 6 ms returned sat
[2021-05-14 16:26:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 16:27:00] [INFO ] [Real]Absence check using state equation in 511 ms returned sat
[2021-05-14 16:27:00] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-14 16:27:00] [INFO ] [Real]Added 132 Read/Feed constraints in 21 ms returned sat
[2021-05-14 16:27:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 16:27:00] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2021-05-14 16:27:00] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 13 ms returned sat
[2021-05-14 16:27:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 16:27:00] [INFO ] [Nat]Absence check using state equation in 392 ms returned sat
[2021-05-14 16:27:00] [INFO ] [Nat]Added 132 Read/Feed constraints in 21 ms returned sat
[2021-05-14 16:27:00] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 8 ms to minimize.
[2021-05-14 16:27:01] [INFO ] Deduced a trap composed of 66 places in 128 ms of which 0 ms to minimize.
[2021-05-14 16:27:01] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 1 ms to minimize.
[2021-05-14 16:27:01] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 1 ms to minimize.
[2021-05-14 16:27:01] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 0 ms to minimize.
[2021-05-14 16:27:01] [INFO ] Deduced a trap composed of 63 places in 119 ms of which 0 ms to minimize.
[2021-05-14 16:27:01] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 1 ms to minimize.
[2021-05-14 16:27:01] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 0 ms to minimize.
[2021-05-14 16:27:02] [INFO ] Deduced a trap composed of 70 places in 121 ms of which 0 ms to minimize.
[2021-05-14 16:27:02] [INFO ] Deduced a trap composed of 63 places in 118 ms of which 0 ms to minimize.
[2021-05-14 16:27:02] [INFO ] Deduced a trap composed of 114 places in 122 ms of which 1 ms to minimize.
[2021-05-14 16:27:02] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 1 ms to minimize.
[2021-05-14 16:27:02] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 0 ms to minimize.
[2021-05-14 16:27:02] [INFO ] Deduced a trap composed of 62 places in 108 ms of which 0 ms to minimize.
[2021-05-14 16:27:02] [INFO ] Deduced a trap composed of 62 places in 95 ms of which 0 ms to minimize.
[2021-05-14 16:27:03] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 1 ms to minimize.
[2021-05-14 16:27:03] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 0 ms to minimize.
[2021-05-14 16:27:03] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 0 ms to minimize.
[2021-05-14 16:27:03] [INFO ] Deduced a trap composed of 47 places in 130 ms of which 0 ms to minimize.
[2021-05-14 16:27:03] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 0 ms to minimize.
[2021-05-14 16:27:03] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 1 ms to minimize.
[2021-05-14 16:27:03] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 1 ms to minimize.
[2021-05-14 16:27:04] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 1 ms to minimize.
[2021-05-14 16:27:04] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 0 ms to minimize.
[2021-05-14 16:27:04] [INFO ] Deduced a trap composed of 84 places in 137 ms of which 0 ms to minimize.
[2021-05-14 16:27:04] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 0 ms to minimize.
[2021-05-14 16:27:04] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 1 ms to minimize.
[2021-05-14 16:27:04] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 0 ms to minimize.
[2021-05-14 16:27:05] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 0 ms to minimize.
[2021-05-14 16:27:05] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 1 ms to minimize.
[2021-05-14 16:27:05] [INFO ] Deduced a trap composed of 62 places in 122 ms of which 1 ms to minimize.
[2021-05-14 16:27:05] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 0 ms to minimize.
[2021-05-14 16:27:05] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 1 ms to minimize.
[2021-05-14 16:27:05] [INFO ] Deduced a trap composed of 47 places in 119 ms of which 1 ms to minimize.
[2021-05-14 16:27:06] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 0 ms to minimize.
[2021-05-14 16:27:06] [INFO ] Deduced a trap composed of 80 places in 100 ms of which 1 ms to minimize.
[2021-05-14 16:27:06] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 1 ms to minimize.
[2021-05-14 16:27:06] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 1 ms to minimize.
[2021-05-14 16:27:06] [INFO ] Deduced a trap composed of 64 places in 125 ms of which 0 ms to minimize.
[2021-05-14 16:27:06] [INFO ] Deduced a trap composed of 61 places in 126 ms of which 1 ms to minimize.
[2021-05-14 16:27:07] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 0 ms to minimize.
[2021-05-14 16:27:07] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 0 ms to minimize.
[2021-05-14 16:27:07] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 1 ms to minimize.
[2021-05-14 16:27:07] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 1 ms to minimize.
[2021-05-14 16:27:07] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 0 ms to minimize.
[2021-05-14 16:27:07] [INFO ] Deduced a trap composed of 54 places in 121 ms of which 0 ms to minimize.
[2021-05-14 16:27:07] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 1 ms to minimize.
[2021-05-14 16:27:08] [INFO ] Deduced a trap composed of 131 places in 111 ms of which 1 ms to minimize.
[2021-05-14 16:27:08] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 0 ms to minimize.
[2021-05-14 16:27:08] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 0 ms to minimize.
[2021-05-14 16:27:08] [INFO ] Deduced a trap composed of 54 places in 110 ms of which 0 ms to minimize.
[2021-05-14 16:27:08] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 0 ms to minimize.
[2021-05-14 16:27:08] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 0 ms to minimize.
[2021-05-14 16:27:08] [INFO ] Deduced a trap composed of 71 places in 107 ms of which 0 ms to minimize.
[2021-05-14 16:27:09] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 0 ms to minimize.
[2021-05-14 16:27:09] [INFO ] Deduced a trap composed of 76 places in 123 ms of which 0 ms to minimize.
[2021-05-14 16:27:09] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 9 ms to minimize.
[2021-05-14 16:27:09] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 1 ms to minimize.
[2021-05-14 16:27:09] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 0 ms to minimize.
[2021-05-14 16:27:09] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 0 ms to minimize.
[2021-05-14 16:27:09] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 0 ms to minimize.
[2021-05-14 16:27:10] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 0 ms to minimize.
[2021-05-14 16:27:10] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 0 ms to minimize.
[2021-05-14 16:27:10] [INFO ] Deduced a trap composed of 78 places in 90 ms of which 0 ms to minimize.
[2021-05-14 16:27:10] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 1 ms to minimize.
[2021-05-14 16:27:10] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 1 ms to minimize.
[2021-05-14 16:27:10] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 1 ms to minimize.
[2021-05-14 16:27:11] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 0 ms to minimize.
[2021-05-14 16:27:11] [INFO ] Deduced a trap composed of 77 places in 120 ms of which 1 ms to minimize.
[2021-05-14 16:27:11] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 0 ms to minimize.
[2021-05-14 16:27:11] [INFO ] Deduced a trap composed of 59 places in 132 ms of which 1 ms to minimize.
[2021-05-14 16:27:12] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 1 ms to minimize.
[2021-05-14 16:27:12] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 1 ms to minimize.
[2021-05-14 16:27:12] [INFO ] Deduced a trap composed of 58 places in 126 ms of which 0 ms to minimize.
[2021-05-14 16:27:12] [INFO ] Deduced a trap composed of 83 places in 134 ms of which 1 ms to minimize.
[2021-05-14 16:27:12] [INFO ] Deduced a trap composed of 114 places in 105 ms of which 0 ms to minimize.
[2021-05-14 16:27:12] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 1 ms to minimize.
[2021-05-14 16:27:13] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 1 ms to minimize.
[2021-05-14 16:27:13] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 0 ms to minimize.
[2021-05-14 16:27:13] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 1 ms to minimize.
[2021-05-14 16:27:13] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 1 ms to minimize.
[2021-05-14 16:27:13] [INFO ] Deduced a trap composed of 60 places in 121 ms of which 1 ms to minimize.
[2021-05-14 16:27:13] [INFO ] Deduced a trap composed of 66 places in 100 ms of which 4 ms to minimize.
[2021-05-14 16:27:14] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 0 ms to minimize.
[2021-05-14 16:27:14] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 1 ms to minimize.
[2021-05-14 16:27:14] [INFO ] Deduced a trap composed of 91 places in 98 ms of which 1 ms to minimize.
[2021-05-14 16:27:14] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 0 ms to minimize.
[2021-05-14 16:27:14] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 0 ms to minimize.
[2021-05-14 16:27:14] [INFO ] Deduced a trap composed of 91 places in 85 ms of which 0 ms to minimize.
[2021-05-14 16:27:14] [INFO ] Trap strengthening (SAT) tested/added 90/89 trap constraints in 13937 ms
[2021-05-14 16:27:14] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 35 ms.
[2021-05-14 16:27:20] [INFO ] Added : 580 causal constraints over 116 iterations in 5870 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 24 ms.
[2021-05-14 16:27:20] [INFO ] [Real]Absence check using 14 positive place invariants in 45 ms returned sat
[2021-05-14 16:27:20] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 6 ms returned sat
[2021-05-14 16:27:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 16:27:21] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2021-05-14 16:27:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 16:27:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 38 ms returned sat
[2021-05-14 16:27:21] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 5 ms returned sat
[2021-05-14 16:27:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 16:27:21] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2021-05-14 16:27:21] [INFO ] [Nat]Added 132 Read/Feed constraints in 21 ms returned sat
[2021-05-14 16:27:21] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 0 ms to minimize.
[2021-05-14 16:27:21] [INFO ] Deduced a trap composed of 62 places in 106 ms of which 1 ms to minimize.
[2021-05-14 16:27:22] [INFO ] Deduced a trap composed of 75 places in 122 ms of which 0 ms to minimize.
[2021-05-14 16:27:22] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 1 ms to minimize.
[2021-05-14 16:27:22] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 0 ms to minimize.
[2021-05-14 16:27:22] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 0 ms to minimize.
[2021-05-14 16:27:22] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 0 ms to minimize.
[2021-05-14 16:27:22] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 1 ms to minimize.
[2021-05-14 16:27:22] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 0 ms to minimize.
[2021-05-14 16:27:23] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2021-05-14 16:27:23] [INFO ] Deduced a trap composed of 47 places in 122 ms of which 0 ms to minimize.
[2021-05-14 16:27:23] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 0 ms to minimize.
[2021-05-14 16:27:23] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 1 ms to minimize.
[2021-05-14 16:27:23] [INFO ] Deduced a trap composed of 112 places in 127 ms of which 1 ms to minimize.
[2021-05-14 16:27:23] [INFO ] Deduced a trap composed of 48 places in 115 ms of which 0 ms to minimize.
[2021-05-14 16:27:23] [INFO ] Deduced a trap composed of 58 places in 120 ms of which 1 ms to minimize.
[2021-05-14 16:27:24] [INFO ] Deduced a trap composed of 58 places in 128 ms of which 0 ms to minimize.
[2021-05-14 16:27:24] [INFO ] Deduced a trap composed of 58 places in 115 ms of which 0 ms to minimize.
[2021-05-14 16:27:24] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 0 ms to minimize.
[2021-05-14 16:27:24] [INFO ] Deduced a trap composed of 73 places in 118 ms of which 1 ms to minimize.
[2021-05-14 16:27:24] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 1 ms to minimize.
[2021-05-14 16:27:24] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 1 ms to minimize.
[2021-05-14 16:27:25] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 0 ms to minimize.
[2021-05-14 16:27:25] [INFO ] Deduced a trap composed of 120 places in 120 ms of which 1 ms to minimize.
[2021-05-14 16:27:25] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 1 ms to minimize.
[2021-05-14 16:27:25] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 0 ms to minimize.
[2021-05-14 16:27:25] [INFO ] Deduced a trap composed of 103 places in 118 ms of which 0 ms to minimize.
[2021-05-14 16:27:25] [INFO ] Deduced a trap composed of 102 places in 124 ms of which 0 ms to minimize.
[2021-05-14 16:27:25] [INFO ] Deduced a trap composed of 109 places in 118 ms of which 0 ms to minimize.
[2021-05-14 16:27:26] [INFO ] Deduced a trap composed of 102 places in 118 ms of which 0 ms to minimize.
[2021-05-14 16:27:26] [INFO ] Deduced a trap composed of 122 places in 133 ms of which 0 ms to minimize.
[2021-05-14 16:27:26] [INFO ] Deduced a trap composed of 103 places in 129 ms of which 0 ms to minimize.
[2021-05-14 16:27:26] [INFO ] Deduced a trap composed of 109 places in 128 ms of which 0 ms to minimize.
[2021-05-14 16:27:26] [INFO ] Deduced a trap composed of 102 places in 130 ms of which 0 ms to minimize.
[2021-05-14 16:27:26] [INFO ] Deduced a trap composed of 102 places in 129 ms of which 0 ms to minimize.
[2021-05-14 16:27:27] [INFO ] Deduced a trap composed of 104 places in 124 ms of which 1 ms to minimize.
[2021-05-14 16:27:27] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 1 ms to minimize.
[2021-05-14 16:27:27] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 5607 ms
[2021-05-14 16:27:27] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 39 ms.
[2021-05-14 16:27:32] [INFO ] Added : 588 causal constraints over 118 iterations in 4964 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
[2021-05-14 16:27:32] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2021-05-14 16:27:32] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 7 ms returned sat
[2021-05-14 16:27:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 16:27:32] [INFO ] [Real]Absence check using state equation in 399 ms returned sat
[2021-05-14 16:27:32] [INFO ] [Real]Added 132 Read/Feed constraints in 23 ms returned sat
[2021-05-14 16:27:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 16:27:32] [INFO ] [Nat]Absence check using 14 positive place invariants in 15 ms returned sat
[2021-05-14 16:27:32] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 8 ms returned sat
[2021-05-14 16:27:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 16:27:33] [INFO ] [Nat]Absence check using state equation in 455 ms returned sat
[2021-05-14 16:27:33] [INFO ] [Nat]Added 132 Read/Feed constraints in 32 ms returned sat
[2021-05-14 16:27:33] [INFO ] Deduced a trap composed of 112 places in 141 ms of which 0 ms to minimize.
[2021-05-14 16:27:33] [INFO ] Deduced a trap composed of 106 places in 133 ms of which 0 ms to minimize.
[2021-05-14 16:27:33] [INFO ] Deduced a trap composed of 69 places in 126 ms of which 1 ms to minimize.
[2021-05-14 16:27:34] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 0 ms to minimize.
[2021-05-14 16:27:34] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 1 ms to minimize.
[2021-05-14 16:27:34] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 1 ms to minimize.
[2021-05-14 16:27:34] [INFO ] Deduced a trap composed of 158 places in 121 ms of which 1 ms to minimize.
[2021-05-14 16:27:34] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 0 ms to minimize.
[2021-05-14 16:27:34] [INFO ] Deduced a trap composed of 54 places in 116 ms of which 0 ms to minimize.
[2021-05-14 16:27:34] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 0 ms to minimize.
[2021-05-14 16:27:35] [INFO ] Deduced a trap composed of 123 places in 116 ms of which 1 ms to minimize.
[2021-05-14 16:27:35] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 0 ms to minimize.
[2021-05-14 16:27:35] [INFO ] Deduced a trap composed of 69 places in 115 ms of which 0 ms to minimize.
[2021-05-14 16:27:35] [INFO ] Deduced a trap composed of 86 places in 133 ms of which 0 ms to minimize.
[2021-05-14 16:27:35] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 1 ms to minimize.
[2021-05-14 16:27:35] [INFO ] Deduced a trap composed of 62 places in 122 ms of which 1 ms to minimize.
[2021-05-14 16:27:36] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 0 ms to minimize.
[2021-05-14 16:27:36] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 1 ms to minimize.
[2021-05-14 16:27:36] [INFO ] Deduced a trap composed of 66 places in 121 ms of which 0 ms to minimize.
[2021-05-14 16:27:36] [INFO ] Deduced a trap composed of 123 places in 106 ms of which 0 ms to minimize.
[2021-05-14 16:27:36] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 0 ms to minimize.
[2021-05-14 16:27:36] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 1 ms to minimize.
[2021-05-14 16:27:36] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 1 ms to minimize.
[2021-05-14 16:27:37] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 1 ms to minimize.
[2021-05-14 16:27:37] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 0 ms to minimize.
[2021-05-14 16:27:37] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 0 ms to minimize.
[2021-05-14 16:27:37] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 1 ms to minimize.
[2021-05-14 16:27:37] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 1 ms to minimize.
[2021-05-14 16:27:37] [INFO ] Deduced a trap composed of 62 places in 101 ms of which 0 ms to minimize.
[2021-05-14 16:27:37] [INFO ] Deduced a trap composed of 62 places in 101 ms of which 1 ms to minimize.
[2021-05-14 16:27:38] [INFO ] Deduced a trap composed of 112 places in 107 ms of which 0 ms to minimize.
[2021-05-14 16:27:38] [INFO ] Deduced a trap composed of 62 places in 114 ms of which 0 ms to minimize.
[2021-05-14 16:27:38] [INFO ] Deduced a trap composed of 136 places in 121 ms of which 0 ms to minimize.
[2021-05-14 16:27:38] [INFO ] Deduced a trap composed of 116 places in 127 ms of which 0 ms to minimize.
[2021-05-14 16:27:38] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 0 ms to minimize.
[2021-05-14 16:27:38] [INFO ] Deduced a trap composed of 63 places in 114 ms of which 0 ms to minimize.
[2021-05-14 16:27:39] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 0 ms to minimize.
[2021-05-14 16:27:39] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 1 ms to minimize.
[2021-05-14 16:27:39] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 0 ms to minimize.
[2021-05-14 16:27:39] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 1 ms to minimize.
[2021-05-14 16:27:39] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 0 ms to minimize.
[2021-05-14 16:27:39] [INFO ] Deduced a trap composed of 50 places in 122 ms of which 0 ms to minimize.
[2021-05-14 16:27:40] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 0 ms to minimize.
[2021-05-14 16:27:40] [INFO ] Deduced a trap composed of 144 places in 80 ms of which 1 ms to minimize.
[2021-05-14 16:27:40] [INFO ] Deduced a trap composed of 94 places in 96 ms of which 0 ms to minimize.
[2021-05-14 16:27:40] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 1 ms to minimize.
[2021-05-14 16:27:40] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 0 ms to minimize.
[2021-05-14 16:27:41] [INFO ] Deduced a trap composed of 144 places in 100 ms of which 0 ms to minimize.
[2021-05-14 16:27:41] [INFO ] Deduced a trap composed of 115 places in 127 ms of which 0 ms to minimize.
[2021-05-14 16:27:41] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 1 ms to minimize.
[2021-05-14 16:27:41] [INFO ] Deduced a trap composed of 126 places in 139 ms of which 0 ms to minimize.
[2021-05-14 16:27:41] [INFO ] Deduced a trap composed of 131 places in 125 ms of which 0 ms to minimize.
[2021-05-14 16:27:42] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 1 ms to minimize.
[2021-05-14 16:27:42] [INFO ] Deduced a trap composed of 138 places in 102 ms of which 1 ms to minimize.
[2021-05-14 16:27:42] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 1 ms to minimize.
[2021-05-14 16:27:42] [INFO ] Deduced a trap composed of 82 places in 75 ms of which 0 ms to minimize.
[2021-05-14 16:27:42] [INFO ] Deduced a trap composed of 88 places in 76 ms of which 1 ms to minimize.
[2021-05-14 16:27:42] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 0 ms to minimize.
[2021-05-14 16:27:42] [INFO ] Deduced a trap composed of 81 places in 71 ms of which 0 ms to minimize.
[2021-05-14 16:27:43] [INFO ] Deduced a trap composed of 88 places in 84 ms of which 0 ms to minimize.
[2021-05-14 16:27:43] [INFO ] Deduced a trap composed of 113 places in 89 ms of which 1 ms to minimize.
[2021-05-14 16:27:43] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 1 ms to minimize.
[2021-05-14 16:27:44] [INFO ] Deduced a trap composed of 88 places in 87 ms of which 1 ms to minimize.
[2021-05-14 16:27:44] [INFO ] Deduced a trap composed of 92 places in 79 ms of which 0 ms to minimize.
[2021-05-14 16:27:44] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 0 ms to minimize.
[2021-05-14 16:27:44] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 0 ms to minimize.
[2021-05-14 16:27:44] [INFO ] Deduced a trap composed of 142 places in 91 ms of which 0 ms to minimize.
[2021-05-14 16:27:44] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 1 ms to minimize.
[2021-05-14 16:27:45] [INFO ] Deduced a trap composed of 69 places in 111 ms of which 0 ms to minimize.
[2021-05-14 16:27:45] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 1 ms to minimize.
[2021-05-14 16:27:46] [INFO ] Deduced a trap composed of 64 places in 117 ms of which 0 ms to minimize.
[2021-05-14 16:27:46] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 0 ms to minimize.
[2021-05-14 16:27:46] [INFO ] Deduced a trap composed of 71 places in 117 ms of which 0 ms to minimize.
[2021-05-14 16:27:47] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 1 ms to minimize.
[2021-05-14 16:27:47] [INFO ] Deduced a trap composed of 134 places in 99 ms of which 0 ms to minimize.
[2021-05-14 16:27:47] [INFO ] Deduced a trap composed of 164 places in 126 ms of which 0 ms to minimize.
[2021-05-14 16:27:47] [INFO ] Deduced a trap composed of 112 places in 124 ms of which 1 ms to minimize.
[2021-05-14 16:27:47] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 0 ms to minimize.
[2021-05-14 16:27:47] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 0 ms to minimize.
[2021-05-14 16:27:48] [INFO ] Deduced a trap composed of 50 places in 112 ms of which 0 ms to minimize.
[2021-05-14 16:27:48] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 0 ms to minimize.
[2021-05-14 16:27:48] [INFO ] Deduced a trap composed of 160 places in 102 ms of which 1 ms to minimize.
[2021-05-14 16:27:48] [INFO ] Deduced a trap composed of 69 places in 105 ms of which 0 ms to minimize.
[2021-05-14 16:27:49] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 1 ms to minimize.
[2021-05-14 16:27:49] [INFO ] Deduced a trap composed of 68 places in 115 ms of which 1 ms to minimize.
[2021-05-14 16:27:49] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 0 ms to minimize.
[2021-05-14 16:27:49] [INFO ] Deduced a trap composed of 62 places in 120 ms of which 0 ms to minimize.
[2021-05-14 16:27:50] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 1 ms to minimize.
[2021-05-14 16:27:50] [INFO ] Deduced a trap composed of 50 places in 102 ms of which 1 ms to minimize.
[2021-05-14 16:27:51] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 0 ms to minimize.
[2021-05-14 16:27:51] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 1 ms to minimize.
[2021-05-14 16:27:52] [INFO ] Deduced a trap composed of 69 places in 104 ms of which 1 ms to minimize.
[2021-05-14 16:27:52] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 1 ms to minimize.
[2021-05-14 16:27:52] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 1 ms to minimize.
[2021-05-14 16:27:52] [INFO ] Deduced a trap composed of 82 places in 90 ms of which 1 ms to minimize.
[2021-05-14 16:27:53] [INFO ] Deduced a trap composed of 70 places in 103 ms of which 1 ms to minimize.
[2021-05-14 16:27:53] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 0 ms to minimize.
[2021-05-14 16:27:53] [INFO ] Deduced a trap composed of 123 places in 96 ms of which 1 ms to minimize.
[2021-05-14 16:27:53] [INFO ] Deduced a trap composed of 112 places in 96 ms of which 1 ms to minimize.
[2021-05-14 16:27:53] [INFO ] Deduced a trap composed of 67 places in 112 ms of which 0 ms to minimize.
[2021-05-14 16:27:54] [INFO ] Deduced a trap composed of 64 places in 109 ms of which 0 ms to minimize.
[2021-05-14 16:27:54] [INFO ] Deduced a trap composed of 90 places in 70 ms of which 0 ms to minimize.
[2021-05-14 16:27:54] [INFO ] Deduced a trap composed of 144 places in 77 ms of which 0 ms to minimize.
[2021-05-14 16:27:54] [INFO ] Deduced a trap composed of 97 places in 74 ms of which 0 ms to minimize.
[2021-05-14 16:27:54] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 1 ms to minimize.
[2021-05-14 16:27:55] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 1 ms to minimize.
[2021-05-14 16:27:56] [INFO ] Trap strengthening (SAT) tested/added 107/106 trap constraints in 22664 ms
[2021-05-14 16:27:56] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 42 ms.
[2021-05-14 16:28:02] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 0 ms to minimize.
[2021-05-14 16:28:02] [INFO ] Deduced a trap composed of 54 places in 104 ms of which 0 ms to minimize.
[2021-05-14 16:28:03] [INFO ] Deduced a trap composed of 120 places in 130 ms of which 0 ms to minimize.
[2021-05-14 16:28:03] [INFO ] Deduced a trap composed of 120 places in 122 ms of which 1 ms to minimize.
[2021-05-14 16:28:03] [INFO ] Deduced a trap composed of 64 places in 103 ms of which 1 ms to minimize.
[2021-05-14 16:28:05] [INFO ] Deduced a trap composed of 104 places in 73 ms of which 1 ms to minimize.
[2021-05-14 16:28:06] [INFO ] Deduced a trap composed of 102 places in 88 ms of which 0 ms to minimize.
[2021-05-14 16:28:06] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 1 ms to minimize.
[2021-05-14 16:28:06] [INFO ] Deduced a trap composed of 109 places in 61 ms of which 1 ms to minimize.
[2021-05-14 16:28:07] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 1 ms to minimize.
[2021-05-14 16:28:09] [INFO ] Deduced a trap composed of 100 places in 103 ms of which 0 ms to minimize.
[2021-05-14 16:28:10] [INFO ] Deduced a trap composed of 150 places in 85 ms of which 0 ms to minimize.
[2021-05-14 16:28:11] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 0 ms to minimize.
[2021-05-14 16:28:11] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 0 ms to minimize.
[2021-05-14 16:28:11] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 1 ms to minimize.
[2021-05-14 16:28:11] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 1 ms to minimize.
[2021-05-14 16:28:11] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 0 ms to minimize.
[2021-05-14 16:28:11] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 9746 ms
[2021-05-14 16:28:11] [INFO ] Added : 589 causal constraints over 118 iterations in 15939 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 21 ms.
[2021-05-14 16:28:12] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2021-05-14 16:28:12] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2021-05-14 16:28:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 16:28:12] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2021-05-14 16:28:12] [INFO ] [Real]Added 132 Read/Feed constraints in 22 ms returned sat
[2021-05-14 16:28:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 16:28:12] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2021-05-14 16:28:12] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 5 ms returned sat
[2021-05-14 16:28:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 16:28:12] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2021-05-14 16:28:12] [INFO ] [Nat]Added 132 Read/Feed constraints in 24 ms returned sat
[2021-05-14 16:28:12] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 0 ms to minimize.
[2021-05-14 16:28:13] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 1 ms to minimize.
[2021-05-14 16:28:13] [INFO ] Deduced a trap composed of 140 places in 121 ms of which 0 ms to minimize.
[2021-05-14 16:28:13] [INFO ] Deduced a trap composed of 103 places in 117 ms of which 0 ms to minimize.
[2021-05-14 16:28:13] [INFO ] Deduced a trap composed of 66 places in 111 ms of which 0 ms to minimize.
[2021-05-14 16:28:13] [INFO ] Deduced a trap composed of 71 places in 106 ms of which 0 ms to minimize.
[2021-05-14 16:28:13] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 0 ms to minimize.
[2021-05-14 16:28:13] [INFO ] Deduced a trap composed of 145 places in 120 ms of which 1 ms to minimize.
[2021-05-14 16:28:14] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 1 ms to minimize.
[2021-05-14 16:28:14] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 0 ms to minimize.
[2021-05-14 16:28:14] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 0 ms to minimize.
[2021-05-14 16:28:14] [INFO ] Deduced a trap composed of 78 places in 108 ms of which 0 ms to minimize.
[2021-05-14 16:28:14] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 0 ms to minimize.
[2021-05-14 16:28:14] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 0 ms to minimize.
[2021-05-14 16:28:14] [INFO ] Deduced a trap composed of 79 places in 129 ms of which 1 ms to minimize.
[2021-05-14 16:28:15] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 0 ms to minimize.
[2021-05-14 16:28:15] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 0 ms to minimize.
[2021-05-14 16:28:15] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 0 ms to minimize.
[2021-05-14 16:28:15] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 0 ms to minimize.
[2021-05-14 16:28:15] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 1 ms to minimize.
[2021-05-14 16:28:15] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 1 ms to minimize.
[2021-05-14 16:28:15] [INFO ] Deduced a trap composed of 69 places in 113 ms of which 1 ms to minimize.
[2021-05-14 16:28:16] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 1 ms to minimize.
[2021-05-14 16:28:16] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 0 ms to minimize.
[2021-05-14 16:28:16] [INFO ] Deduced a trap composed of 62 places in 105 ms of which 0 ms to minimize.
[2021-05-14 16:28:16] [INFO ] Deduced a trap composed of 137 places in 122 ms of which 0 ms to minimize.
[2021-05-14 16:28:16] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 0 ms to minimize.
[2021-05-14 16:28:16] [INFO ] Deduced a trap composed of 139 places in 108 ms of which 1 ms to minimize.
[2021-05-14 16:28:16] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 0 ms to minimize.
[2021-05-14 16:28:17] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 1 ms to minimize.
[2021-05-14 16:28:17] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 0 ms to minimize.
[2021-05-14 16:28:17] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 1 ms to minimize.
[2021-05-14 16:28:17] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 0 ms to minimize.
[2021-05-14 16:28:17] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 0 ms to minimize.
[2021-05-14 16:28:17] [INFO ] Deduced a trap composed of 43 places in 112 ms of which 0 ms to minimize.
[2021-05-14 16:28:18] [INFO ] Deduced a trap composed of 160 places in 113 ms of which 1 ms to minimize.
[2021-05-14 16:28:18] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 1 ms to minimize.
[2021-05-14 16:28:18] [INFO ] Deduced a trap composed of 114 places in 118 ms of which 1 ms to minimize.
[2021-05-14 16:28:18] [INFO ] Deduced a trap composed of 121 places in 115 ms of which 0 ms to minimize.
[2021-05-14 16:28:18] [INFO ] Deduced a trap composed of 114 places in 120 ms of which 1 ms to minimize.
[2021-05-14 16:28:18] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 0 ms to minimize.
[2021-05-14 16:28:18] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 0 ms to minimize.
[2021-05-14 16:28:19] [INFO ] Deduced a trap composed of 115 places in 118 ms of which 1 ms to minimize.
[2021-05-14 16:28:19] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 0 ms to minimize.
[2021-05-14 16:28:19] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 1 ms to minimize.
[2021-05-14 16:28:19] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 1 ms to minimize.
[2021-05-14 16:28:19] [INFO ] Deduced a trap composed of 82 places in 114 ms of which 1 ms to minimize.
[2021-05-14 16:28:19] [INFO ] Deduced a trap composed of 104 places in 113 ms of which 1 ms to minimize.
[2021-05-14 16:28:19] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 0 ms to minimize.
[2021-05-14 16:28:20] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 0 ms to minimize.
[2021-05-14 16:28:20] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 0 ms to minimize.
[2021-05-14 16:28:20] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 0 ms to minimize.
[2021-05-14 16:28:20] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 0 ms to minimize.
[2021-05-14 16:28:20] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 1 ms to minimize.
[2021-05-14 16:28:20] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 0 ms to minimize.
[2021-05-14 16:28:20] [INFO ] Deduced a trap composed of 65 places in 98 ms of which 1 ms to minimize.
[2021-05-14 16:28:21] [INFO ] Deduced a trap composed of 68 places in 97 ms of which 1 ms to minimize.
[2021-05-14 16:28:21] [INFO ] Deduced a trap composed of 58 places in 94 ms of which 0 ms to minimize.
[2021-05-14 16:28:22] [INFO ] Deduced a trap composed of 104 places in 114 ms of which 1 ms to minimize.
[2021-05-14 16:28:22] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 0 ms to minimize.
[2021-05-14 16:28:22] [INFO ] Deduced a trap composed of 91 places in 125 ms of which 0 ms to minimize.
[2021-05-14 16:28:22] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 1 ms to minimize.
[2021-05-14 16:28:22] [INFO ] Deduced a trap composed of 73 places in 133 ms of which 1 ms to minimize.
[2021-05-14 16:28:22] [INFO ] Deduced a trap composed of 120 places in 133 ms of which 1 ms to minimize.
[2021-05-14 16:28:23] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 0 ms to minimize.
[2021-05-14 16:28:23] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 0 ms to minimize.
[2021-05-14 16:28:23] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 1 ms to minimize.
[2021-05-14 16:28:23] [INFO ] Deduced a trap composed of 73 places in 111 ms of which 0 ms to minimize.
[2021-05-14 16:28:23] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 0 ms to minimize.
[2021-05-14 16:28:23] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 1 ms to minimize.
[2021-05-14 16:28:23] [INFO ] Deduced a trap composed of 100 places in 103 ms of which 0 ms to minimize.
[2021-05-14 16:28:24] [INFO ] Deduced a trap composed of 113 places in 101 ms of which 0 ms to minimize.
[2021-05-14 16:28:24] [INFO ] Deduced a trap composed of 100 places in 104 ms of which 0 ms to minimize.
[2021-05-14 16:28:24] [INFO ] Deduced a trap composed of 100 places in 97 ms of which 1 ms to minimize.
[2021-05-14 16:28:24] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 0 ms to minimize.
[2021-05-14 16:28:24] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 0 ms to minimize.
[2021-05-14 16:28:24] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 0 ms to minimize.
[2021-05-14 16:28:24] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 0 ms to minimize.
[2021-05-14 16:28:25] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 1 ms to minimize.
[2021-05-14 16:28:25] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 0 ms to minimize.
[2021-05-14 16:28:25] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 1 ms to minimize.
[2021-05-14 16:28:26] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 0 ms to minimize.
[2021-05-14 16:28:26] [INFO ] Deduced a trap composed of 130 places in 100 ms of which 1 ms to minimize.
[2021-05-14 16:28:26] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 0 ms to minimize.
[2021-05-14 16:28:26] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 0 ms to minimize.
[2021-05-14 16:28:27] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 0 ms to minimize.
[2021-05-14 16:28:27] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 13 ms to minimize.
[2021-05-14 16:28:27] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 0 ms to minimize.
[2021-05-14 16:28:27] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 0 ms to minimize.
[2021-05-14 16:28:28] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 0 ms to minimize.
[2021-05-14 16:28:28] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 1 ms to minimize.
[2021-05-14 16:28:29] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 0 ms to minimize.
[2021-05-14 16:28:29] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 1 ms to minimize.
[2021-05-14 16:28:29] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 0 ms to minimize.
[2021-05-14 16:28:29] [INFO ] Deduced a trap composed of 70 places in 84 ms of which 1 ms to minimize.
[2021-05-14 16:28:29] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 0 ms to minimize.
[2021-05-14 16:28:30] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 1 ms to minimize.
[2021-05-14 16:28:30] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 0 ms to minimize.
[2021-05-14 16:28:30] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 0 ms to minimize.
[2021-05-14 16:28:30] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 0 ms to minimize.
[2021-05-14 16:28:30] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 1 ms to minimize.
[2021-05-14 16:28:30] [INFO ] Deduced a trap composed of 65 places in 115 ms of which 0 ms to minimize.
[2021-05-14 16:28:30] [INFO ] Deduced a trap composed of 61 places in 110 ms of which 1 ms to minimize.
[2021-05-14 16:28:31] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 1 ms to minimize.
[2021-05-14 16:28:31] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 0 ms to minimize.
[2021-05-14 16:28:31] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 1 ms to minimize.
[2021-05-14 16:28:31] [INFO ] Deduced a trap composed of 54 places in 101 ms of which 1 ms to minimize.
[2021-05-14 16:28:32] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 1 ms to minimize.
[2021-05-14 16:28:32] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 1 ms to minimize.
[2021-05-14 16:28:33] [INFO ] Deduced a trap composed of 51 places in 89 ms of which 0 ms to minimize.
[2021-05-14 16:28:33] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 0 ms to minimize.
[2021-05-14 16:28:33] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 1 ms to minimize.
[2021-05-14 16:28:33] [INFO ] Deduced a trap composed of 70 places in 102 ms of which 0 ms to minimize.
[2021-05-14 16:28:33] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 0 ms to minimize.
[2021-05-14 16:28:33] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 0 ms to minimize.
[2021-05-14 16:28:34] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 0 ms to minimize.
[2021-05-14 16:28:34] [INFO ] Deduced a trap composed of 76 places in 81 ms of which 0 ms to minimize.
[2021-05-14 16:28:34] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 1 ms to minimize.
[2021-05-14 16:28:34] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 0 ms to minimize.
[2021-05-14 16:28:34] [INFO ] Deduced a trap composed of 90 places in 95 ms of which 0 ms to minimize.
[2021-05-14 16:28:34] [INFO ] Deduced a trap composed of 70 places in 95 ms of which 1 ms to minimize.
[2021-05-14 16:28:35] [INFO ] Deduced a trap composed of 63 places in 95 ms of which 0 ms to minimize.
[2021-05-14 16:28:35] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 0 ms to minimize.
[2021-05-14 16:28:35] [INFO ] Deduced a trap composed of 57 places in 88 ms of which 0 ms to minimize.
[2021-05-14 16:28:35] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 1 ms to minimize.
[2021-05-14 16:28:35] [INFO ] Deduced a trap composed of 66 places in 97 ms of which 1 ms to minimize.
[2021-05-14 16:28:36] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 1 ms to minimize.
[2021-05-14 16:28:36] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 1 ms to minimize.
[2021-05-14 16:28:37] [INFO ] Deduced a trap composed of 58 places in 94 ms of which 1 ms to minimize.
[2021-05-14 16:28:37] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 1 ms to minimize.
[2021-05-14 16:28:37] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 0 ms to minimize.
[2021-05-14 16:28:37] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 0 ms to minimize.
[2021-05-14 16:28:57] [INFO ] Deduced a trap composed of 2 places in 162 ms of which 1 ms to minimize.
[2021-05-14 16:28:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
Incomplete Parikh walk after 188500 steps, including 1000 resets, run finished after 1834 ms. (steps per millisecond=102 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 230800 steps, including 1000 resets, run finished after 2026 ms. (steps per millisecond=113 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 220400 steps, including 1000 resets, run finished after 2130 ms. (steps per millisecond=103 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 320 out of 480 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 25 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 480/480 places, 690/690 transitions.
[2021-05-14 16:29:03] [INFO ] Flatten gal took : 27 ms
[2021-05-14 16:29:03] [INFO ] Flatten gal took : 24 ms
[2021-05-14 16:29:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11574202142410910988.gal : 4 ms
[2021-05-14 16:29:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2214361151045690557.prop : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality11574202142410910988.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2214361151045690557.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality11574202142410910988.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2214361151045690557.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality2214361151045690557.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :5 after 6
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :6 after 16
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :16 after 37
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :37 after 69
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :69 after 212
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :212 after 624
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :624 after 1768
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :1768 after 4220
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :4220 after 25994
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :25994 after 68803
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :68803 after 139526
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :139526 after 660694
Detected timeout of ITS tools.
[2021-05-14 16:29:18] [INFO ] Flatten gal took : 26 ms
[2021-05-14 16:29:18] [INFO ] Applying decomposition
[2021-05-14 16:29:18] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8084033002916372968.txt, -o, /tmp/graph8084033002916372968.bin, -w, /tmp/graph8084033002916372968.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8084033002916372968.bin, -l, -1, -v, -w, /tmp/graph8084033002916372968.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 16:29:18] [INFO ] Decomposing Gal with order
[2021-05-14 16:29:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 16:29:18] [INFO ] Removed a total of 474 redundant transitions.
[2021-05-14 16:29:18] [INFO ] Flatten gal took : 47 ms
[2021-05-14 16:29:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 5 ms.
[2021-05-14 16:29:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3458934017638523712.gal : 7 ms
[2021-05-14 16:29:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4763229883313025168.prop : 5 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality3458934017638523712.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4763229883313025168.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality3458934017638523712.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4763229883313025168.prop --nowitness
Loading property file /tmp/ReachabilityCardinality4763229883313025168.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 12
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :12 after 231
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :231 after 1032
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1032 after 87424
Reachability property Peterson-COL-4-ReachabilityFireability-09 is true.
FORMULA Peterson-COL-4-ReachabilityFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3973940951215604390
[2021-05-14 16:29:34] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3973940951215604390
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3973940951215604390]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3973940951215604390] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3973940951215604390] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 8037 ms. (steps per millisecond=124 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 340201 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=68 ) properties seen :{}
Interrupted Best-First random walk after 524401 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=104 ) properties seen :{}
Interrupted Best-First random walk after 657025 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=131 ) properties seen :{}
Interrupted probabilistic random walk after 7080870 steps, run timeout after 30001 ms. (steps per millisecond=236 ) properties seen :{}
Probabilistic random walk after 7080870 steps, saw 1212676 distinct states, run finished after 30001 ms. (steps per millisecond=236 ) properties seen :{}
Running SMT prover for 3 properties.
[2021-05-14 16:30:28] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2021-05-14 16:30:28] [INFO ] Computed 19 place invariants in 3 ms
[2021-05-14 16:30:28] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2021-05-14 16:30:28] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 6 ms returned sat
[2021-05-14 16:30:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 16:30:28] [INFO ] [Real]Absence check using state equation in 461 ms returned sat
[2021-05-14 16:30:28] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-14 16:30:28] [INFO ] [Real]Added 132 Read/Feed constraints in 35 ms returned sat
[2021-05-14 16:30:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 16:30:28] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2021-05-14 16:30:28] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 6 ms returned sat
[2021-05-14 16:30:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 16:30:29] [INFO ] [Nat]Absence check using state equation in 407 ms returned sat
[2021-05-14 16:30:29] [INFO ] [Nat]Added 132 Read/Feed constraints in 21 ms returned sat
[2021-05-14 16:30:29] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 1 ms to minimize.
[2021-05-14 16:30:29] [INFO ] Deduced a trap composed of 66 places in 116 ms of which 1 ms to minimize.
[2021-05-14 16:30:29] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 0 ms to minimize.
[2021-05-14 16:30:29] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 0 ms to minimize.
[2021-05-14 16:30:30] [INFO ] Deduced a trap composed of 85 places in 124 ms of which 1 ms to minimize.
[2021-05-14 16:30:30] [INFO ] Deduced a trap composed of 63 places in 117 ms of which 0 ms to minimize.
[2021-05-14 16:30:30] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 0 ms to minimize.
[2021-05-14 16:30:30] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 1 ms to minimize.
[2021-05-14 16:30:30] [INFO ] Deduced a trap composed of 70 places in 114 ms of which 0 ms to minimize.
[2021-05-14 16:30:30] [INFO ] Deduced a trap composed of 63 places in 122 ms of which 1 ms to minimize.
[2021-05-14 16:30:30] [INFO ] Deduced a trap composed of 114 places in 119 ms of which 1 ms to minimize.
[2021-05-14 16:30:31] [INFO ] Deduced a trap composed of 76 places in 143 ms of which 1 ms to minimize.
[2021-05-14 16:30:31] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 1 ms to minimize.
[2021-05-14 16:30:31] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 1 ms to minimize.
[2021-05-14 16:30:31] [INFO ] Deduced a trap composed of 62 places in 88 ms of which 0 ms to minimize.
[2021-05-14 16:30:31] [INFO ] Deduced a trap composed of 57 places in 91 ms of which 1 ms to minimize.
[2021-05-14 16:30:31] [INFO ] Deduced a trap composed of 61 places in 93 ms of which 0 ms to minimize.
[2021-05-14 16:30:31] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 1 ms to minimize.
[2021-05-14 16:30:31] [INFO ] Deduced a trap composed of 47 places in 124 ms of which 0 ms to minimize.
[2021-05-14 16:30:32] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 0 ms to minimize.
[2021-05-14 16:30:32] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 1 ms to minimize.
[2021-05-14 16:30:32] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 0 ms to minimize.
[2021-05-14 16:30:32] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 1 ms to minimize.
[2021-05-14 16:30:32] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 1 ms to minimize.
[2021-05-14 16:30:32] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 0 ms to minimize.
[2021-05-14 16:30:33] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 0 ms to minimize.
[2021-05-14 16:30:33] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 0 ms to minimize.
[2021-05-14 16:30:33] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 0 ms to minimize.
[2021-05-14 16:30:33] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 1 ms to minimize.
[2021-05-14 16:30:33] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 0 ms to minimize.
[2021-05-14 16:30:33] [INFO ] Deduced a trap composed of 62 places in 125 ms of which 0 ms to minimize.
[2021-05-14 16:30:33] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 1 ms to minimize.
[2021-05-14 16:30:34] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 0 ms to minimize.
[2021-05-14 16:30:34] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 0 ms to minimize.
[2021-05-14 16:30:34] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 1 ms to minimize.
[2021-05-14 16:30:34] [INFO ] Deduced a trap composed of 80 places in 117 ms of which 1 ms to minimize.
[2021-05-14 16:30:34] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 1 ms to minimize.
[2021-05-14 16:30:34] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 0 ms to minimize.
[2021-05-14 16:30:34] [INFO ] Deduced a trap composed of 64 places in 103 ms of which 0 ms to minimize.
[2021-05-14 16:30:35] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 0 ms to minimize.
[2021-05-14 16:30:35] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 0 ms to minimize.
[2021-05-14 16:30:35] [INFO ] Deduced a trap composed of 53 places in 102 ms of which 1 ms to minimize.
[2021-05-14 16:30:35] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 0 ms to minimize.
[2021-05-14 16:30:35] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 0 ms to minimize.
[2021-05-14 16:30:35] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 0 ms to minimize.
[2021-05-14 16:30:35] [INFO ] Deduced a trap composed of 54 places in 117 ms of which 0 ms to minimize.
[2021-05-14 16:30:36] [INFO ] Deduced a trap composed of 61 places in 114 ms of which 0 ms to minimize.
[2021-05-14 16:30:36] [INFO ] Deduced a trap composed of 131 places in 109 ms of which 0 ms to minimize.
[2021-05-14 16:30:36] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 0 ms to minimize.
[2021-05-14 16:30:36] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 1 ms to minimize.
[2021-05-14 16:30:36] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 0 ms to minimize.
[2021-05-14 16:30:36] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 0 ms to minimize.
[2021-05-14 16:30:36] [INFO ] Deduced a trap composed of 47 places in 109 ms of which 1 ms to minimize.
[2021-05-14 16:30:37] [INFO ] Deduced a trap composed of 71 places in 95 ms of which 1 ms to minimize.
[2021-05-14 16:30:37] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 0 ms to minimize.
[2021-05-14 16:30:37] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 1 ms to minimize.
[2021-05-14 16:30:37] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 0 ms to minimize.
[2021-05-14 16:30:37] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 1 ms to minimize.
[2021-05-14 16:30:37] [INFO ] Deduced a trap composed of 69 places in 94 ms of which 1 ms to minimize.
[2021-05-14 16:30:37] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 1 ms to minimize.
[2021-05-14 16:30:38] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 1 ms to minimize.
[2021-05-14 16:30:38] [INFO ] Deduced a trap composed of 57 places in 93 ms of which 0 ms to minimize.
[2021-05-14 16:30:38] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 0 ms to minimize.
[2021-05-14 16:30:38] [INFO ] Deduced a trap composed of 78 places in 84 ms of which 1 ms to minimize.
[2021-05-14 16:30:38] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 0 ms to minimize.
[2021-05-14 16:30:38] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 0 ms to minimize.
[2021-05-14 16:30:38] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2021-05-14 16:30:39] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 0 ms to minimize.
[2021-05-14 16:30:39] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 1 ms to minimize.
[2021-05-14 16:30:39] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 0 ms to minimize.
[2021-05-14 16:30:39] [INFO ] Deduced a trap composed of 59 places in 113 ms of which 0 ms to minimize.
[2021-05-14 16:30:40] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 1 ms to minimize.
[2021-05-14 16:30:40] [INFO ] Deduced a trap composed of 69 places in 94 ms of which 1 ms to minimize.
[2021-05-14 16:30:40] [INFO ] Deduced a trap composed of 58 places in 101 ms of which 1 ms to minimize.
[2021-05-14 16:30:40] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 0 ms to minimize.
[2021-05-14 16:30:40] [INFO ] Deduced a trap composed of 114 places in 101 ms of which 0 ms to minimize.
[2021-05-14 16:30:40] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 0 ms to minimize.
[2021-05-14 16:30:40] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 0 ms to minimize.
[2021-05-14 16:30:41] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 1 ms to minimize.
[2021-05-14 16:30:41] [INFO ] Deduced a trap composed of 77 places in 101 ms of which 1 ms to minimize.
[2021-05-14 16:30:41] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 0 ms to minimize.
[2021-05-14 16:30:41] [INFO ] Deduced a trap composed of 60 places in 115 ms of which 1 ms to minimize.
[2021-05-14 16:30:41] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 0 ms to minimize.
[2021-05-14 16:30:41] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 0 ms to minimize.
[2021-05-14 16:30:41] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 1 ms to minimize.
[2021-05-14 16:30:42] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 0 ms to minimize.
[2021-05-14 16:30:42] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 0 ms to minimize.
[2021-05-14 16:30:42] [INFO ] Deduced a trap composed of 88 places in 82 ms of which 0 ms to minimize.
[2021-05-14 16:30:42] [INFO ] Deduced a trap composed of 91 places in 79 ms of which 1 ms to minimize.
[2021-05-14 16:30:42] [INFO ] Trap strengthening (SAT) tested/added 90/89 trap constraints in 13205 ms
[2021-05-14 16:30:42] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 32 ms.
[2021-05-14 16:30:48] [INFO ] Added : 580 causal constraints over 116 iterations in 6003 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
[2021-05-14 16:30:48] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2021-05-14 16:30:48] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 6 ms returned sat
[2021-05-14 16:30:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 16:30:49] [INFO ] [Real]Absence check using state equation in 390 ms returned sat
[2021-05-14 16:30:49] [INFO ] [Real]Added 132 Read/Feed constraints in 23 ms returned sat
[2021-05-14 16:30:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 16:30:49] [INFO ] [Nat]Absence check using 14 positive place invariants in 16 ms returned sat
[2021-05-14 16:30:49] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 8 ms returned sat
[2021-05-14 16:30:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 16:30:49] [INFO ] [Nat]Absence check using state equation in 465 ms returned sat
[2021-05-14 16:30:49] [INFO ] [Nat]Added 132 Read/Feed constraints in 31 ms returned sat
[2021-05-14 16:30:49] [INFO ] Deduced a trap composed of 112 places in 136 ms of which 0 ms to minimize.
[2021-05-14 16:30:50] [INFO ] Deduced a trap composed of 106 places in 141 ms of which 1 ms to minimize.
[2021-05-14 16:30:50] [INFO ] Deduced a trap composed of 69 places in 159 ms of which 1 ms to minimize.
[2021-05-14 16:30:50] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 0 ms to minimize.
[2021-05-14 16:30:50] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 0 ms to minimize.
[2021-05-14 16:30:50] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 0 ms to minimize.
[2021-05-14 16:30:50] [INFO ] Deduced a trap composed of 158 places in 121 ms of which 1 ms to minimize.
[2021-05-14 16:30:51] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 1 ms to minimize.
[2021-05-14 16:30:51] [INFO ] Deduced a trap composed of 54 places in 114 ms of which 0 ms to minimize.
[2021-05-14 16:30:51] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 0 ms to minimize.
[2021-05-14 16:30:51] [INFO ] Deduced a trap composed of 123 places in 115 ms of which 0 ms to minimize.
[2021-05-14 16:30:51] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 0 ms to minimize.
[2021-05-14 16:30:51] [INFO ] Deduced a trap composed of 69 places in 114 ms of which 0 ms to minimize.
[2021-05-14 16:30:51] [INFO ] Deduced a trap composed of 86 places in 136 ms of which 1 ms to minimize.
[2021-05-14 16:30:52] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 1 ms to minimize.
[2021-05-14 16:30:52] [INFO ] Deduced a trap composed of 62 places in 129 ms of which 1 ms to minimize.
[2021-05-14 16:30:52] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 1 ms to minimize.
[2021-05-14 16:30:52] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 0 ms to minimize.
[2021-05-14 16:30:52] [INFO ] Deduced a trap composed of 66 places in 116 ms of which 1 ms to minimize.
[2021-05-14 16:30:52] [INFO ] Deduced a trap composed of 123 places in 104 ms of which 1 ms to minimize.
[2021-05-14 16:30:53] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 1 ms to minimize.
[2021-05-14 16:30:53] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 1 ms to minimize.
[2021-05-14 16:30:53] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 1 ms to minimize.
[2021-05-14 16:30:53] [INFO ] Deduced a trap composed of 78 places in 120 ms of which 0 ms to minimize.
[2021-05-14 16:30:53] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 1 ms to minimize.
[2021-05-14 16:30:53] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 0 ms to minimize.
[2021-05-14 16:30:53] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 0 ms to minimize.
[2021-05-14 16:30:54] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 0 ms to minimize.
[2021-05-14 16:30:54] [INFO ] Deduced a trap composed of 62 places in 98 ms of which 0 ms to minimize.
[2021-05-14 16:30:54] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 1 ms to minimize.
[2021-05-14 16:30:54] [INFO ] Deduced a trap composed of 112 places in 113 ms of which 1 ms to minimize.
[2021-05-14 16:30:54] [INFO ] Deduced a trap composed of 62 places in 126 ms of which 0 ms to minimize.
[2021-05-14 16:30:54] [INFO ] Deduced a trap composed of 136 places in 124 ms of which 1 ms to minimize.
[2021-05-14 16:30:55] [INFO ] Deduced a trap composed of 116 places in 135 ms of which 1 ms to minimize.
[2021-05-14 16:30:55] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 1 ms to minimize.
[2021-05-14 16:30:55] [INFO ] Deduced a trap composed of 63 places in 124 ms of which 1 ms to minimize.
[2021-05-14 16:30:55] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 0 ms to minimize.
[2021-05-14 16:30:55] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 0 ms to minimize.
[2021-05-14 16:30:55] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 0 ms to minimize.
[2021-05-14 16:30:55] [INFO ] Deduced a trap composed of 65 places in 99 ms of which 0 ms to minimize.
[2021-05-14 16:30:56] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 0 ms to minimize.
[2021-05-14 16:30:56] [INFO ] Deduced a trap composed of 50 places in 118 ms of which 0 ms to minimize.
[2021-05-14 16:30:56] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 0 ms to minimize.
[2021-05-14 16:30:56] [INFO ] Deduced a trap composed of 144 places in 100 ms of which 1 ms to minimize.
[2021-05-14 16:30:56] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 0 ms to minimize.
[2021-05-14 16:30:56] [INFO ] Deduced a trap composed of 73 places in 105 ms of which 1 ms to minimize.
[2021-05-14 16:30:57] [INFO ] Deduced a trap composed of 69 places in 95 ms of which 0 ms to minimize.
[2021-05-14 16:30:57] [INFO ] Deduced a trap composed of 144 places in 102 ms of which 0 ms to minimize.
[2021-05-14 16:30:58] [INFO ] Deduced a trap composed of 115 places in 124 ms of which 0 ms to minimize.
[2021-05-14 16:30:58] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 1 ms to minimize.
[2021-05-14 16:30:58] [INFO ] Deduced a trap composed of 126 places in 115 ms of which 1 ms to minimize.
[2021-05-14 16:30:58] [INFO ] Deduced a trap composed of 131 places in 122 ms of which 0 ms to minimize.
[2021-05-14 16:30:58] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 1 ms to minimize.
[2021-05-14 16:30:58] [INFO ] Deduced a trap composed of 138 places in 97 ms of which 0 ms to minimize.
[2021-05-14 16:30:58] [INFO ] Deduced a trap composed of 82 places in 68 ms of which 0 ms to minimize.
[2021-05-14 16:30:59] [INFO ] Deduced a trap composed of 82 places in 75 ms of which 1 ms to minimize.
[2021-05-14 16:30:59] [INFO ] Deduced a trap composed of 88 places in 75 ms of which 1 ms to minimize.
[2021-05-14 16:30:59] [INFO ] Deduced a trap composed of 82 places in 74 ms of which 1 ms to minimize.
[2021-05-14 16:30:59] [INFO ] Deduced a trap composed of 81 places in 75 ms of which 0 ms to minimize.
[2021-05-14 16:31:00] [INFO ] Deduced a trap composed of 88 places in 78 ms of which 0 ms to minimize.
[2021-05-14 16:31:00] [INFO ] Deduced a trap composed of 113 places in 76 ms of which 0 ms to minimize.
[2021-05-14 16:31:00] [INFO ] Deduced a trap composed of 88 places in 73 ms of which 1 ms to minimize.
[2021-05-14 16:31:00] [INFO ] Deduced a trap composed of 88 places in 79 ms of which 1 ms to minimize.
[2021-05-14 16:31:01] [INFO ] Deduced a trap composed of 92 places in 86 ms of which 1 ms to minimize.
[2021-05-14 16:31:01] [INFO ] Deduced a trap composed of 92 places in 79 ms of which 0 ms to minimize.
[2021-05-14 16:31:01] [INFO ] Deduced a trap composed of 92 places in 80 ms of which 1 ms to minimize.
[2021-05-14 16:31:01] [INFO ] Deduced a trap composed of 142 places in 78 ms of which 0 ms to minimize.
[2021-05-14 16:31:01] [INFO ] Deduced a trap composed of 92 places in 79 ms of which 1 ms to minimize.
[2021-05-14 16:31:02] [INFO ] Deduced a trap composed of 69 places in 129 ms of which 0 ms to minimize.
[2021-05-14 16:31:02] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 1 ms to minimize.
[2021-05-14 16:31:02] [INFO ] Deduced a trap composed of 64 places in 113 ms of which 0 ms to minimize.
[2021-05-14 16:31:03] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 1 ms to minimize.
[2021-05-14 16:31:03] [INFO ] Deduced a trap composed of 71 places in 122 ms of which 0 ms to minimize.
[2021-05-14 16:31:03] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 1 ms to minimize.
[2021-05-14 16:31:04] [INFO ] Deduced a trap composed of 134 places in 88 ms of which 0 ms to minimize.
[2021-05-14 16:31:04] [INFO ] Deduced a trap composed of 164 places in 117 ms of which 0 ms to minimize.
[2021-05-14 16:31:04] [INFO ] Deduced a trap composed of 112 places in 117 ms of which 0 ms to minimize.
[2021-05-14 16:31:04] [INFO ] Deduced a trap composed of 70 places in 102 ms of which 1 ms to minimize.
[2021-05-14 16:31:04] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 0 ms to minimize.
[2021-05-14 16:31:05] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 1 ms to minimize.
[2021-05-14 16:31:05] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 0 ms to minimize.
[2021-05-14 16:31:05] [INFO ] Deduced a trap composed of 160 places in 123 ms of which 0 ms to minimize.
[2021-05-14 16:31:05] [INFO ] Deduced a trap composed of 69 places in 112 ms of which 0 ms to minimize.
[2021-05-14 16:31:06] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 0 ms to minimize.
[2021-05-14 16:31:06] [INFO ] Deduced a trap composed of 68 places in 130 ms of which 0 ms to minimize.
[2021-05-14 16:31:06] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 0 ms to minimize.
[2021-05-14 16:31:06] [INFO ] Deduced a trap composed of 62 places in 105 ms of which 0 ms to minimize.
[2021-05-14 16:31:06] [INFO ] Deduced a trap composed of 57 places in 108 ms of which 0 ms to minimize.
[2021-05-14 16:31:07] [INFO ] Deduced a trap composed of 50 places in 91 ms of which 0 ms to minimize.
[2021-05-14 16:31:08] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 0 ms to minimize.
[2021-05-14 16:31:08] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 1 ms to minimize.
[2021-05-14 16:31:09] [INFO ] Deduced a trap composed of 69 places in 109 ms of which 1 ms to minimize.
[2021-05-14 16:31:09] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 0 ms to minimize.
[2021-05-14 16:31:09] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 0 ms to minimize.
[2021-05-14 16:31:09] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 1 ms to minimize.
[2021-05-14 16:31:09] [INFO ] Deduced a trap composed of 70 places in 114 ms of which 1 ms to minimize.
[2021-05-14 16:31:10] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 1 ms to minimize.
[2021-05-14 16:31:10] [INFO ] Deduced a trap composed of 123 places in 100 ms of which 0 ms to minimize.
[2021-05-14 16:31:10] [INFO ] Deduced a trap composed of 112 places in 100 ms of which 0 ms to minimize.
[2021-05-14 16:31:10] [INFO ] Deduced a trap composed of 67 places in 103 ms of which 1 ms to minimize.
[2021-05-14 16:31:11] [INFO ] Deduced a trap composed of 64 places in 128 ms of which 0 ms to minimize.
[2021-05-14 16:31:11] [INFO ] Deduced a trap composed of 90 places in 74 ms of which 0 ms to minimize.
[2021-05-14 16:31:11] [INFO ] Deduced a trap composed of 144 places in 70 ms of which 0 ms to minimize.
[2021-05-14 16:31:11] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 1 ms to minimize.
[2021-05-14 16:31:11] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 0 ms to minimize.
[2021-05-14 16:31:12] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 0 ms to minimize.
[2021-05-14 16:31:12] [INFO ] Trap strengthening (SAT) tested/added 107/106 trap constraints in 23271 ms
[2021-05-14 16:31:13] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 31 ms.
[2021-05-14 16:31:18] [INFO ] Deduced a trap composed of 70 places in 105 ms of which 0 ms to minimize.
[2021-05-14 16:31:19] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 1 ms to minimize.
[2021-05-14 16:31:20] [INFO ] Deduced a trap composed of 120 places in 1034 ms of which 0 ms to minimize.
[2021-05-14 16:31:21] [INFO ] Deduced a trap composed of 120 places in 135 ms of which 1 ms to minimize.
[2021-05-14 16:31:21] [INFO ] Deduced a trap composed of 64 places in 103 ms of which 0 ms to minimize.
[2021-05-14 16:31:23] [INFO ] Deduced a trap composed of 104 places in 76 ms of which 1 ms to minimize.
[2021-05-14 16:31:24] [INFO ] Deduced a trap composed of 102 places in 71 ms of which 0 ms to minimize.
[2021-05-14 16:31:24] [INFO ] Deduced a trap composed of 61 places in 79 ms of which 0 ms to minimize.
[2021-05-14 16:31:24] [INFO ] Deduced a trap composed of 109 places in 69 ms of which 0 ms to minimize.
[2021-05-14 16:31:25] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 0 ms to minimize.
[2021-05-14 16:31:27] [INFO ] Deduced a trap composed of 100 places in 98 ms of which 1 ms to minimize.
[2021-05-14 16:31:27] [INFO ] Deduced a trap composed of 150 places in 86 ms of which 1 ms to minimize.
[2021-05-14 16:31:28] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 0 ms to minimize.
[2021-05-14 16:31:28] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 0 ms to minimize.
[2021-05-14 16:31:29] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 0 ms to minimize.
[2021-05-14 16:31:29] [INFO ] Deduced a trap composed of 84 places in 120 ms of which 1 ms to minimize.
[2021-05-14 16:31:29] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 0 ms to minimize.
[2021-05-14 16:31:29] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 10689 ms
[2021-05-14 16:31:29] [INFO ] Added : 589 causal constraints over 118 iterations in 16618 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 20 ms.
[2021-05-14 16:31:29] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2021-05-14 16:31:29] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2021-05-14 16:31:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 16:31:29] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2021-05-14 16:31:29] [INFO ] [Real]Added 132 Read/Feed constraints in 22 ms returned sat
[2021-05-14 16:31:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 16:31:30] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2021-05-14 16:31:30] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2021-05-14 16:31:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 16:31:30] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2021-05-14 16:31:30] [INFO ] [Nat]Added 132 Read/Feed constraints in 23 ms returned sat
[2021-05-14 16:31:30] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 0 ms to minimize.
[2021-05-14 16:31:30] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 0 ms to minimize.
[2021-05-14 16:31:30] [INFO ] Deduced a trap composed of 140 places in 118 ms of which 0 ms to minimize.
[2021-05-14 16:31:30] [INFO ] Deduced a trap composed of 103 places in 122 ms of which 1 ms to minimize.
[2021-05-14 16:31:31] [INFO ] Deduced a trap composed of 66 places in 117 ms of which 0 ms to minimize.
[2021-05-14 16:31:31] [INFO ] Deduced a trap composed of 71 places in 113 ms of which 0 ms to minimize.
[2021-05-14 16:31:31] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 0 ms to minimize.
[2021-05-14 16:31:31] [INFO ] Deduced a trap composed of 145 places in 124 ms of which 0 ms to minimize.
[2021-05-14 16:31:31] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 0 ms to minimize.
[2021-05-14 16:31:31] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 0 ms to minimize.
[2021-05-14 16:31:31] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 1 ms to minimize.
[2021-05-14 16:31:32] [INFO ] Deduced a trap composed of 78 places in 108 ms of which 0 ms to minimize.
[2021-05-14 16:31:32] [INFO ] Deduced a trap composed of 59 places in 111 ms of which 1 ms to minimize.
[2021-05-14 16:31:32] [INFO ] Deduced a trap composed of 76 places in 127 ms of which 1 ms to minimize.
[2021-05-14 16:31:32] [INFO ] Deduced a trap composed of 79 places in 113 ms of which 1 ms to minimize.
[2021-05-14 16:31:32] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 1 ms to minimize.
[2021-05-14 16:31:32] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 0 ms to minimize.
[2021-05-14 16:31:33] [INFO ] Deduced a trap composed of 76 places in 135 ms of which 0 ms to minimize.
[2021-05-14 16:31:33] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 0 ms to minimize.
[2021-05-14 16:31:33] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 1 ms to minimize.
[2021-05-14 16:31:33] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 0 ms to minimize.
[2021-05-14 16:31:33] [INFO ] Deduced a trap composed of 69 places in 122 ms of which 0 ms to minimize.
[2021-05-14 16:31:33] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 1 ms to minimize.
[2021-05-14 16:31:33] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 1 ms to minimize.
[2021-05-14 16:31:34] [INFO ] Deduced a trap composed of 62 places in 111 ms of which 0 ms to minimize.
[2021-05-14 16:31:34] [INFO ] Deduced a trap composed of 137 places in 110 ms of which 1 ms to minimize.
[2021-05-14 16:31:34] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 1 ms to minimize.
[2021-05-14 16:31:34] [INFO ] Deduced a trap composed of 139 places in 101 ms of which 0 ms to minimize.
[2021-05-14 16:31:34] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 0 ms to minimize.
[2021-05-14 16:31:34] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 1 ms to minimize.
[2021-05-14 16:31:34] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 0 ms to minimize.
[2021-05-14 16:31:35] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 0 ms to minimize.
[2021-05-14 16:31:35] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 0 ms to minimize.
[2021-05-14 16:31:35] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 1 ms to minimize.
[2021-05-14 16:31:35] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 1 ms to minimize.
[2021-05-14 16:31:35] [INFO ] Deduced a trap composed of 160 places in 95 ms of which 0 ms to minimize.
[2021-05-14 16:31:35] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 1 ms to minimize.
[2021-05-14 16:31:35] [INFO ] Deduced a trap composed of 114 places in 110 ms of which 0 ms to minimize.
[2021-05-14 16:31:36] [INFO ] Deduced a trap composed of 121 places in 109 ms of which 0 ms to minimize.
[2021-05-14 16:31:36] [INFO ] Deduced a trap composed of 114 places in 113 ms of which 1 ms to minimize.
[2021-05-14 16:31:36] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 0 ms to minimize.
[2021-05-14 16:31:36] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 0 ms to minimize.
[2021-05-14 16:31:36] [INFO ] Deduced a trap composed of 115 places in 104 ms of which 1 ms to minimize.
[2021-05-14 16:31:36] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 1 ms to minimize.
[2021-05-14 16:31:36] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 0 ms to minimize.
[2021-05-14 16:31:36] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 0 ms to minimize.
[2021-05-14 16:31:37] [INFO ] Deduced a trap composed of 82 places in 111 ms of which 0 ms to minimize.
[2021-05-14 16:31:37] [INFO ] Deduced a trap composed of 104 places in 112 ms of which 0 ms to minimize.
[2021-05-14 16:31:37] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 0 ms to minimize.
[2021-05-14 16:31:37] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 1 ms to minimize.
[2021-05-14 16:31:37] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 0 ms to minimize.
[2021-05-14 16:31:37] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 0 ms to minimize.
[2021-05-14 16:31:37] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 1 ms to minimize.
[2021-05-14 16:31:38] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 0 ms to minimize.
[2021-05-14 16:31:38] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 1 ms to minimize.
[2021-05-14 16:31:38] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 0 ms to minimize.
[2021-05-14 16:31:38] [INFO ] Deduced a trap composed of 68 places in 106 ms of which 0 ms to minimize.
[2021-05-14 16:31:39] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 0 ms to minimize.
[2021-05-14 16:31:39] [INFO ] Deduced a trap composed of 104 places in 105 ms of which 0 ms to minimize.
[2021-05-14 16:31:39] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 0 ms to minimize.
[2021-05-14 16:31:39] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 0 ms to minimize.
[2021-05-14 16:31:39] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 0 ms to minimize.
[2021-05-14 16:31:40] [INFO ] Deduced a trap composed of 73 places in 133 ms of which 0 ms to minimize.
[2021-05-14 16:31:40] [INFO ] Deduced a trap composed of 120 places in 138 ms of which 0 ms to minimize.
[2021-05-14 16:31:40] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 1 ms to minimize.
[2021-05-14 16:31:40] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 1 ms to minimize.
[2021-05-14 16:31:40] [INFO ] Deduced a trap composed of 69 places in 97 ms of which 1 ms to minimize.
[2021-05-14 16:31:40] [INFO ] Deduced a trap composed of 73 places in 102 ms of which 1 ms to minimize.
[2021-05-14 16:31:41] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 1 ms to minimize.
[2021-05-14 16:31:41] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 0 ms to minimize.
[2021-05-14 16:31:41] [INFO ] Deduced a trap composed of 100 places in 100 ms of which 1 ms to minimize.
[2021-05-14 16:31:41] [INFO ] Deduced a trap composed of 113 places in 109 ms of which 0 ms to minimize.
[2021-05-14 16:31:41] [INFO ] Deduced a trap composed of 100 places in 104 ms of which 0 ms to minimize.
[2021-05-14 16:31:41] [INFO ] Deduced a trap composed of 100 places in 100 ms of which 1 ms to minimize.
[2021-05-14 16:31:41] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 1 ms to minimize.
[2021-05-14 16:31:42] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 1 ms to minimize.
[2021-05-14 16:31:42] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 0 ms to minimize.
[2021-05-14 16:31:42] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 0 ms to minimize.
[2021-05-14 16:31:42] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 1 ms to minimize.
[2021-05-14 16:31:42] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 0 ms to minimize.
[2021-05-14 16:31:42] [INFO ] Deduced a trap composed of 47 places in 99 ms of which 0 ms to minimize.
[2021-05-14 16:31:43] [INFO ] Deduced a trap composed of 57 places in 122 ms of which 0 ms to minimize.
[2021-05-14 16:31:44] [INFO ] Deduced a trap composed of 130 places in 122 ms of which 1 ms to minimize.
[2021-05-14 16:31:44] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 0 ms to minimize.
[2021-05-14 16:31:44] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 0 ms to minimize.
[2021-05-14 16:31:44] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 0 ms to minimize.
[2021-05-14 16:31:44] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 0 ms to minimize.
[2021-05-14 16:31:44] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 0 ms to minimize.
[2021-05-14 16:31:45] [INFO ] Deduced a trap composed of 62 places in 137 ms of which 0 ms to minimize.
[2021-05-14 16:31:45] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 0 ms to minimize.
[2021-05-14 16:31:46] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 1 ms to minimize.
[2021-05-14 16:31:46] [INFO ] Deduced a trap composed of 67 places in 100 ms of which 0 ms to minimize.
[2021-05-14 16:31:46] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 1 ms to minimize.
[2021-05-14 16:31:47] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 1 ms to minimize.
[2021-05-14 16:31:47] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 0 ms to minimize.
[2021-05-14 16:31:47] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 0 ms to minimize.
[2021-05-14 16:31:47] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 1 ms to minimize.
[2021-05-14 16:31:47] [INFO ] Deduced a trap composed of 66 places in 116 ms of which 0 ms to minimize.
[2021-05-14 16:31:48] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 0 ms to minimize.
[2021-05-14 16:31:48] [INFO ] Deduced a trap composed of 62 places in 108 ms of which 1 ms to minimize.
[2021-05-14 16:31:48] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 0 ms to minimize.
[2021-05-14 16:31:48] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 1 ms to minimize.
[2021-05-14 16:31:48] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 1 ms to minimize.
[2021-05-14 16:31:48] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 0 ms to minimize.
[2021-05-14 16:31:48] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 0 ms to minimize.
[2021-05-14 16:31:49] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 0 ms to minimize.
[2021-05-14 16:31:49] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 1 ms to minimize.
[2021-05-14 16:31:49] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 0 ms to minimize.
[2021-05-14 16:31:50] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 0 ms to minimize.
[2021-05-14 16:31:50] [INFO ] Deduced a trap composed of 51 places in 116 ms of which 0 ms to minimize.
[2021-05-14 16:31:50] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 1 ms to minimize.
[2021-05-14 16:31:51] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 1 ms to minimize.
[2021-05-14 16:31:51] [INFO ] Deduced a trap composed of 70 places in 94 ms of which 0 ms to minimize.
[2021-05-14 16:31:51] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 1 ms to minimize.
[2021-05-14 16:31:51] [INFO ] Deduced a trap composed of 75 places in 113 ms of which 11 ms to minimize.
[2021-05-14 16:31:51] [INFO ] Deduced a trap composed of 56 places in 88 ms of which 1 ms to minimize.
[2021-05-14 16:31:52] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 0 ms to minimize.
[2021-05-14 16:31:52] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 8 ms to minimize.
[2021-05-14 16:31:52] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 0 ms to minimize.
[2021-05-14 16:31:52] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 0 ms to minimize.
[2021-05-14 16:31:52] [INFO ] Deduced a trap composed of 70 places in 84 ms of which 0 ms to minimize.
[2021-05-14 16:31:52] [INFO ] Deduced a trap composed of 63 places in 91 ms of which 1 ms to minimize.
[2021-05-14 16:31:53] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 1 ms to minimize.
[2021-05-14 16:31:53] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 0 ms to minimize.
[2021-05-14 16:31:53] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 0 ms to minimize.
[2021-05-14 16:31:53] [INFO ] Deduced a trap composed of 66 places in 106 ms of which 1 ms to minimize.
[2021-05-14 16:31:53] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 0 ms to minimize.
[2021-05-14 16:31:54] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 0 ms to minimize.
[2021-05-14 16:31:54] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 1 ms to minimize.
[2021-05-14 16:31:55] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 0 ms to minimize.
[2021-05-14 16:31:55] [INFO ] Deduced a trap composed of 87 places in 118 ms of which 1 ms to minimize.
[2021-05-14 16:31:55] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 1 ms to minimize.
[2021-05-14 16:32:17] [INFO ] Deduced a trap composed of 2 places in 2644 ms of which 1 ms to minimize.
[2021-05-14 16:32:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
Incomplete Parikh walk after 188500 steps, including 999 resets, run finished after 1455 ms. (steps per millisecond=129 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 220400 steps, including 1000 resets, run finished after 1692 ms. (steps per millisecond=130 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 315 out of 480 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 26 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 480/480 places, 690/690 transitions.
Starting structural reductions, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 16 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2021-05-14 16:32:20] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2021-05-14 16:32:20] [INFO ] Computed 19 place invariants in 3 ms
[2021-05-14 16:32:20] [INFO ] Implicit Places using invariants in 85 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 88 ms to find 5 implicit places.
[2021-05-14 16:32:20] [INFO ] Redundant transitions in 37 ms returned []
[2021-05-14 16:32:20] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2021-05-14 16:32:21] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-14 16:32:21] [INFO ] Dead Transitions using invariants and state equation in 317 ms returned []
Starting structural reductions, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 50 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2021-05-14 16:32:21] [INFO ] Redundant transitions in 16 ms returned []
[2021-05-14 16:32:21] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2021-05-14 16:32:21] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-14 16:32:21] [INFO ] Dead Transitions using invariants and state equation in 340 ms returned []
Finished structural reductions, in 2 iterations. Remains : 475/480 places, 690/690 transitions.
[2021-05-14 16:32:21] [INFO ] Flatten gal took : 28 ms
[2021-05-14 16:32:21] [INFO ] Flatten gal took : 21 ms
[2021-05-14 16:32:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2156607221520188737.gal : 3 ms
[2021-05-14 16:32:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12491629015371286280.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality2156607221520188737.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12491629015371286280.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality2156607221520188737.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12491629015371286280.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality12491629015371286280.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :5 after 6
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :6 after 15
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :15 after 36
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :36 after 69
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :69 after 206
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :206 after 564
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :564 after 1580
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1580 after 8340
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :8340 after 29759
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :29759 after 60543
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :60543 after 138656
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :138656 after 820651
Detected timeout of ITS tools.
[2021-05-14 16:32:36] [INFO ] Flatten gal took : 20 ms
[2021-05-14 16:32:36] [INFO ] Applying decomposition
[2021-05-14 16:32:36] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17069053311051242337.txt, -o, /tmp/graph17069053311051242337.bin, -w, /tmp/graph17069053311051242337.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17069053311051242337.bin, -l, -1, -v, -w, /tmp/graph17069053311051242337.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 16:32:36] [INFO ] Decomposing Gal with order
[2021-05-14 16:32:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 16:32:36] [INFO ] Removed a total of 478 redundant transitions.
[2021-05-14 16:32:36] [INFO ] Flatten gal took : 41 ms
[2021-05-14 16:32:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 5 ms.
[2021-05-14 16:32:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12079730559334835058.gal : 5 ms
[2021-05-14 16:32:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15058415227553638225.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality12079730559334835058.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15058415227553638225.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality12079730559334835058.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15058415227553638225.prop --nowitness
Loading property file /tmp/ReachabilityCardinality15058415227553638225.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 1201
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1201 after 1210
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1210 after 4624
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :4624 after 13964
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :13964 after 84748
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :84748 after 958974
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7798857887360437085
[2021-05-14 16:32:52] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7798857887360437085
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7798857887360437085]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7798857887360437085] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7798857887360437085] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 7965 ms. (steps per millisecond=125 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 331278 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=66 ) properties seen :{}
Interrupted Best-First random walk after 573031 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=114 ) properties seen :{}
Interrupted Best-First random walk after 634399 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=126 ) properties seen :{}
Interrupted probabilistic random walk after 7061262 steps, run timeout after 30001 ms. (steps per millisecond=235 ) properties seen :{}
Probabilistic random walk after 7061262 steps, saw 1209551 distinct states, run finished after 30001 ms. (steps per millisecond=235 ) properties seen :{}
Running SMT prover for 3 properties.
[2021-05-14 16:33:46] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2021-05-14 16:33:46] [INFO ] Computed 14 place invariants in 3 ms
[2021-05-14 16:33:46] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2021-05-14 16:33:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 16:33:46] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2021-05-14 16:33:46] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-14 16:33:46] [INFO ] [Real]Added 132 Read/Feed constraints in 42 ms returned sat
[2021-05-14 16:33:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 16:33:46] [INFO ] [Nat]Absence check using 14 positive place invariants in 24 ms returned sat
[2021-05-14 16:33:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 16:33:47] [INFO ] [Nat]Absence check using state equation in 419 ms returned sat
[2021-05-14 16:33:47] [INFO ] [Nat]Added 132 Read/Feed constraints in 23 ms returned sat
[2021-05-14 16:33:47] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 0 ms to minimize.
[2021-05-14 16:33:47] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 1 ms to minimize.
[2021-05-14 16:33:47] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 1 ms to minimize.
[2021-05-14 16:33:47] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 0 ms to minimize.
[2021-05-14 16:33:48] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 1 ms to minimize.
[2021-05-14 16:33:48] [INFO ] Deduced a trap composed of 132 places in 91 ms of which 1 ms to minimize.
[2021-05-14 16:33:48] [INFO ] Deduced a trap composed of 121 places in 101 ms of which 0 ms to minimize.
[2021-05-14 16:33:48] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 1 ms to minimize.
[2021-05-14 16:33:48] [INFO ] Deduced a trap composed of 140 places in 106 ms of which 1 ms to minimize.
[2021-05-14 16:33:48] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 1 ms to minimize.
[2021-05-14 16:33:48] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 0 ms to minimize.
[2021-05-14 16:33:49] [INFO ] Deduced a trap composed of 78 places in 101 ms of which 0 ms to minimize.
[2021-05-14 16:33:49] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 0 ms to minimize.
[2021-05-14 16:33:49] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 0 ms to minimize.
[2021-05-14 16:33:49] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 0 ms to minimize.
[2021-05-14 16:33:49] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 0 ms to minimize.
[2021-05-14 16:33:49] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 0 ms to minimize.
[2021-05-14 16:33:49] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 0 ms to minimize.
[2021-05-14 16:33:49] [INFO ] Deduced a trap composed of 91 places in 71 ms of which 1 ms to minimize.
[2021-05-14 16:33:50] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2652 ms
[2021-05-14 16:33:50] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 31 ms.
[2021-05-14 16:33:55] [INFO ] Added : 585 causal constraints over 117 iterations in 5240 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
[2021-05-14 16:33:55] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2021-05-14 16:33:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 16:33:55] [INFO ] [Real]Absence check using state equation in 518 ms returned sat
[2021-05-14 16:33:55] [INFO ] [Real]Added 132 Read/Feed constraints in 22 ms returned sat
[2021-05-14 16:33:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 16:33:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2021-05-14 16:33:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 16:33:56] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2021-05-14 16:33:56] [INFO ] [Nat]Added 132 Read/Feed constraints in 24 ms returned sat
[2021-05-14 16:33:56] [INFO ] Deduced a trap composed of 55 places in 115 ms of which 0 ms to minimize.
[2021-05-14 16:33:56] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 0 ms to minimize.
[2021-05-14 16:33:56] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 0 ms to minimize.
[2021-05-14 16:33:57] [INFO ] Deduced a trap composed of 76 places in 113 ms of which 0 ms to minimize.
[2021-05-14 16:33:57] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 1 ms to minimize.
[2021-05-14 16:33:57] [INFO ] Deduced a trap composed of 54 places in 111 ms of which 0 ms to minimize.
[2021-05-14 16:33:57] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 1 ms to minimize.
[2021-05-14 16:33:57] [INFO ] Deduced a trap composed of 50 places in 126 ms of which 1 ms to minimize.
[2021-05-14 16:33:57] [INFO ] Deduced a trap composed of 69 places in 109 ms of which 0 ms to minimize.
[2021-05-14 16:33:57] [INFO ] Deduced a trap composed of 69 places in 128 ms of which 0 ms to minimize.
[2021-05-14 16:33:58] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 0 ms to minimize.
[2021-05-14 16:33:58] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 1 ms to minimize.
[2021-05-14 16:33:58] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 0 ms to minimize.
[2021-05-14 16:33:58] [INFO ] Deduced a trap composed of 61 places in 123 ms of which 0 ms to minimize.
[2021-05-14 16:33:58] [INFO ] Deduced a trap composed of 69 places in 107 ms of which 0 ms to minimize.
[2021-05-14 16:33:58] [INFO ] Deduced a trap composed of 61 places in 89 ms of which 1 ms to minimize.
[2021-05-14 16:33:58] [INFO ] Deduced a trap composed of 115 places in 90 ms of which 0 ms to minimize.
[2021-05-14 16:33:59] [INFO ] Deduced a trap composed of 62 places in 95 ms of which 1 ms to minimize.
[2021-05-14 16:33:59] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 0 ms to minimize.
[2021-05-14 16:33:59] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 0 ms to minimize.
[2021-05-14 16:33:59] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 0 ms to minimize.
[2021-05-14 16:33:59] [INFO ] Deduced a trap composed of 47 places in 99 ms of which 0 ms to minimize.
[2021-05-14 16:33:59] [INFO ] Deduced a trap composed of 47 places in 119 ms of which 0 ms to minimize.
[2021-05-14 16:33:59] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 0 ms to minimize.
[2021-05-14 16:34:00] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 0 ms to minimize.
[2021-05-14 16:34:00] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 1 ms to minimize.
[2021-05-14 16:34:00] [INFO ] Deduced a trap composed of 91 places in 88 ms of which 0 ms to minimize.
[2021-05-14 16:34:00] [INFO ] Deduced a trap composed of 125 places in 82 ms of which 1 ms to minimize.
[2021-05-14 16:34:08] [INFO ] Deduced a trap composed of 147 places in 8275 ms of which 0 ms to minimize.
[2021-05-14 16:34:08] [INFO ] Deduced a trap composed of 62 places in 92 ms of which 0 ms to minimize.
[2021-05-14 16:34:09] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 1 ms to minimize.
[2021-05-14 16:34:09] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 0 ms to minimize.
[2021-05-14 16:34:09] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 0 ms to minimize.
[2021-05-14 16:34:09] [INFO ] Deduced a trap composed of 63 places in 103 ms of which 0 ms to minimize.
[2021-05-14 16:34:09] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 0 ms to minimize.
[2021-05-14 16:34:09] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 0 ms to minimize.
[2021-05-14 16:34:09] [INFO ] Deduced a trap composed of 138 places in 112 ms of which 1 ms to minimize.
[2021-05-14 16:34:10] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 1 ms to minimize.
[2021-05-14 16:34:10] [INFO ] Deduced a trap composed of 80 places in 117 ms of which 0 ms to minimize.
[2021-05-14 16:34:10] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 1 ms to minimize.
[2021-05-14 16:34:10] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 0 ms to minimize.
[2021-05-14 16:34:10] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 0 ms to minimize.
[2021-05-14 16:34:10] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 0 ms to minimize.
[2021-05-14 16:34:11] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 0 ms to minimize.
[2021-05-14 16:34:11] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 1 ms to minimize.
[2021-05-14 16:34:11] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 1 ms to minimize.
[2021-05-14 16:34:11] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 0 ms to minimize.
[2021-05-14 16:34:11] [INFO ] Deduced a trap composed of 62 places in 129 ms of which 0 ms to minimize.
[2021-05-14 16:34:12] [INFO ] Deduced a trap composed of 61 places in 135 ms of which 0 ms to minimize.
[2021-05-14 16:34:12] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 0 ms to minimize.
[2021-05-14 16:34:12] [INFO ] Deduced a trap composed of 100 places in 67 ms of which 1 ms to minimize.
[2021-05-14 16:34:12] [INFO ] Deduced a trap composed of 80 places in 71 ms of which 0 ms to minimize.
[2021-05-14 16:34:12] [INFO ] Deduced a trap composed of 80 places in 72 ms of which 0 ms to minimize.
[2021-05-14 16:34:12] [INFO ] Deduced a trap composed of 79 places in 70 ms of which 0 ms to minimize.
[2021-05-14 16:34:12] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 1 ms to minimize.
[2021-05-14 16:34:13] [INFO ] Deduced a trap composed of 125 places in 79 ms of which 0 ms to minimize.
[2021-05-14 16:34:13] [INFO ] Deduced a trap composed of 113 places in 75 ms of which 0 ms to minimize.
[2021-05-14 16:34:13] [INFO ] Deduced a trap composed of 113 places in 87 ms of which 0 ms to minimize.
[2021-05-14 16:34:13] [INFO ] Deduced a trap composed of 78 places in 121 ms of which 1 ms to minimize.
[2021-05-14 16:34:13] [INFO ] Deduced a trap composed of 62 places in 123 ms of which 0 ms to minimize.
[2021-05-14 16:34:13] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 1 ms to minimize.
[2021-05-14 16:34:14] [INFO ] Deduced a trap composed of 76 places in 118 ms of which 0 ms to minimize.
[2021-05-14 16:34:14] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 0 ms to minimize.
[2021-05-14 16:34:14] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 0 ms to minimize.
[2021-05-14 16:34:14] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 1 ms to minimize.
[2021-05-14 16:34:14] [INFO ] Deduced a trap composed of 54 places in 101 ms of which 0 ms to minimize.
[2021-05-14 16:34:15] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 1 ms to minimize.
[2021-05-14 16:34:15] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 1 ms to minimize.
[2021-05-14 16:34:15] [INFO ] Deduced a trap composed of 114 places in 98 ms of which 0 ms to minimize.
[2021-05-14 16:34:15] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 0 ms to minimize.
[2021-05-14 16:34:15] [INFO ] Deduced a trap composed of 132 places in 75 ms of which 1 ms to minimize.
[2021-05-14 16:34:15] [INFO ] Deduced a trap composed of 113 places in 75 ms of which 1 ms to minimize.
[2021-05-14 16:34:16] [INFO ] Deduced a trap composed of 85 places in 74 ms of which 0 ms to minimize.
[2021-05-14 16:34:16] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 0 ms to minimize.
[2021-05-14 16:34:16] [INFO ] Deduced a trap composed of 69 places in 124 ms of which 1 ms to minimize.
[2021-05-14 16:34:16] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 1 ms to minimize.
[2021-05-14 16:34:16] [INFO ] Deduced a trap composed of 85 places in 73 ms of which 0 ms to minimize.
[2021-05-14 16:34:16] [INFO ] Deduced a trap composed of 84 places in 74 ms of which 0 ms to minimize.
[2021-05-14 16:34:17] [INFO ] Deduced a trap composed of 84 places in 74 ms of which 1 ms to minimize.
[2021-05-14 16:34:17] [INFO ] Deduced a trap composed of 85 places in 90 ms of which 1 ms to minimize.
[2021-05-14 16:34:17] [INFO ] Deduced a trap composed of 116 places in 76 ms of which 1 ms to minimize.
[2021-05-14 16:34:17] [INFO ] Deduced a trap composed of 64 places in 113 ms of which 1 ms to minimize.
[2021-05-14 16:34:18] [INFO ] Trap strengthening (SAT) tested/added 83/82 trap constraints in 21894 ms
[2021-05-14 16:34:18] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 33 ms.
[2021-05-14 16:34:25] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 0 ms to minimize.
[2021-05-14 16:34:25] [INFO ] Deduced a trap composed of 66 places in 101 ms of which 1 ms to minimize.
[2021-05-14 16:34:25] [INFO ] Deduced a trap composed of 109 places in 103 ms of which 0 ms to minimize.
[2021-05-14 16:34:26] [INFO ] Deduced a trap composed of 164 places in 107 ms of which 1 ms to minimize.
[2021-05-14 16:34:26] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 1 ms to minimize.
[2021-05-14 16:34:26] [INFO ] Deduced a trap composed of 106 places in 125 ms of which 1 ms to minimize.
[2021-05-14 16:34:26] [INFO ] Deduced a trap composed of 42 places in 114 ms of which 0 ms to minimize.
[2021-05-14 16:34:27] [INFO ] Deduced a trap composed of 60 places in 121 ms of which 1 ms to minimize.
[2021-05-14 16:34:27] [INFO ] Deduced a trap composed of 128 places in 64 ms of which 0 ms to minimize.
[2021-05-14 16:34:27] [INFO ] Deduced a trap composed of 65 places in 105 ms of which 0 ms to minimize.
[2021-05-14 16:34:27] [INFO ] Deduced a trap composed of 53 places in 101 ms of which 0 ms to minimize.
[2021-05-14 16:34:27] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 0 ms to minimize.
[2021-05-14 16:34:28] [INFO ] Deduced a trap composed of 120 places in 107 ms of which 1 ms to minimize.
[2021-05-14 16:34:29] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 0 ms to minimize.
[2021-05-14 16:34:29] [INFO ] Deduced a trap composed of 77 places in 124 ms of which 0 ms to minimize.
[2021-05-14 16:34:29] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 1 ms to minimize.
[2021-05-14 16:34:30] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 0 ms to minimize.
[2021-05-14 16:34:30] [INFO ] Deduced a trap composed of 104 places in 74 ms of which 0 ms to minimize.
[2021-05-14 16:34:30] [INFO ] Deduced a trap composed of 88 places in 63 ms of which 1 ms to minimize.
[2021-05-14 16:34:31] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 1 ms to minimize.
[2021-05-14 16:34:32] [INFO ] Deduced a trap composed of 71 places in 74 ms of which 0 ms to minimize.
[2021-05-14 16:34:41] [INFO ] Deduced a trap composed of 2 places in 166 ms of which 0 ms to minimize.
[2021-05-14 16:34:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-14 16:34:41] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2021-05-14 16:34:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 16:34:41] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2021-05-14 16:34:41] [INFO ] [Real]Added 132 Read/Feed constraints in 22 ms returned sat
[2021-05-14 16:34:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 16:34:41] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2021-05-14 16:34:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 16:34:41] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2021-05-14 16:34:41] [INFO ] [Nat]Added 132 Read/Feed constraints in 20 ms returned sat
[2021-05-14 16:34:42] [INFO ] Deduced a trap composed of 48 places in 116 ms of which 0 ms to minimize.
[2021-05-14 16:34:42] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 1 ms to minimize.
[2021-05-14 16:34:42] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 0 ms to minimize.
[2021-05-14 16:34:42] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 0 ms to minimize.
[2021-05-14 16:34:42] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 0 ms to minimize.
[2021-05-14 16:34:42] [INFO ] Deduced a trap composed of 57 places in 124 ms of which 1 ms to minimize.
[2021-05-14 16:34:42] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 0 ms to minimize.
[2021-05-14 16:34:43] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 1 ms to minimize.
[2021-05-14 16:34:43] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 0 ms to minimize.
[2021-05-14 16:34:43] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 0 ms to minimize.
[2021-05-14 16:34:43] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 1 ms to minimize.
[2021-05-14 16:34:43] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 1 ms to minimize.
[2021-05-14 16:34:43] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 0 ms to minimize.
[2021-05-14 16:34:43] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 0 ms to minimize.
[2021-05-14 16:34:43] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 1 ms to minimize.
[2021-05-14 16:34:44] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 0 ms to minimize.
[2021-05-14 16:34:44] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 1 ms to minimize.
[2021-05-14 16:34:44] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 1 ms to minimize.
[2021-05-14 16:34:44] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 0 ms to minimize.
[2021-05-14 16:34:44] [INFO ] Deduced a trap composed of 54 places in 119 ms of which 0 ms to minimize.
[2021-05-14 16:34:44] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 0 ms to minimize.
[2021-05-14 16:34:45] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 0 ms to minimize.
[2021-05-14 16:34:45] [INFO ] Deduced a trap composed of 58 places in 118 ms of which 1 ms to minimize.
[2021-05-14 16:34:45] [INFO ] Deduced a trap composed of 64 places in 104 ms of which 0 ms to minimize.
[2021-05-14 16:34:45] [INFO ] Deduced a trap composed of 58 places in 102 ms of which 1 ms to minimize.
[2021-05-14 16:34:45] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 1 ms to minimize.
[2021-05-14 16:34:45] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 1 ms to minimize.
[2021-05-14 16:34:45] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 0 ms to minimize.
[2021-05-14 16:34:46] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 0 ms to minimize.
[2021-05-14 16:34:46] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 0 ms to minimize.
[2021-05-14 16:34:46] [INFO ] Deduced a trap composed of 87 places in 130 ms of which 0 ms to minimize.
[2021-05-14 16:34:46] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 1 ms to minimize.
[2021-05-14 16:34:46] [INFO ] Deduced a trap composed of 47 places in 125 ms of which 1 ms to minimize.
[2021-05-14 16:34:46] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 0 ms to minimize.
[2021-05-14 16:34:47] [INFO ] Deduced a trap composed of 66 places in 103 ms of which 1 ms to minimize.
[2021-05-14 16:34:47] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 0 ms to minimize.
[2021-05-14 16:34:47] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 0 ms to minimize.
[2021-05-14 16:34:47] [INFO ] Deduced a trap composed of 54 places in 104 ms of which 1 ms to minimize.
[2021-05-14 16:34:47] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 1 ms to minimize.
[2021-05-14 16:34:47] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 1 ms to minimize.
[2021-05-14 16:34:48] [INFO ] Deduced a trap composed of 69 places in 120 ms of which 0 ms to minimize.
[2021-05-14 16:34:48] [INFO ] Deduced a trap composed of 117 places in 102 ms of which 0 ms to minimize.
[2021-05-14 16:34:48] [INFO ] Deduced a trap composed of 69 places in 97 ms of which 0 ms to minimize.
[2021-05-14 16:34:48] [INFO ] Deduced a trap composed of 85 places in 133 ms of which 1 ms to minimize.
[2021-05-14 16:34:48] [INFO ] Deduced a trap composed of 47 places in 119 ms of which 1 ms to minimize.
[2021-05-14 16:34:49] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 1 ms to minimize.
[2021-05-14 16:34:49] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 1 ms to minimize.
[2021-05-14 16:34:49] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 0 ms to minimize.
[2021-05-14 16:34:49] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 1 ms to minimize.
[2021-05-14 16:34:49] [INFO ] Deduced a trap composed of 57 places in 104 ms of which 1 ms to minimize.
[2021-05-14 16:34:49] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 0 ms to minimize.
[2021-05-14 16:34:50] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 0 ms to minimize.
[2021-05-14 16:34:50] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 0 ms to minimize.
[2021-05-14 16:34:50] [INFO ] Deduced a trap composed of 85 places in 120 ms of which 1 ms to minimize.
[2021-05-14 16:34:50] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 1 ms to minimize.
[2021-05-14 16:34:50] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 1 ms to minimize.
[2021-05-14 16:34:50] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 0 ms to minimize.
[2021-05-14 16:34:51] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 0 ms to minimize.
[2021-05-14 16:34:51] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 0 ms to minimize.
[2021-05-14 16:34:51] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 1 ms to minimize.
[2021-05-14 16:34:51] [INFO ] Deduced a trap composed of 72 places in 129 ms of which 1 ms to minimize.
[2021-05-14 16:34:51] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 1 ms to minimize.
[2021-05-14 16:34:51] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 1 ms to minimize.
[2021-05-14 16:34:52] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 0 ms to minimize.
[2021-05-14 16:34:52] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 0 ms to minimize.
[2021-05-14 16:34:52] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 0 ms to minimize.
[2021-05-14 16:34:52] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 0 ms to minimize.
[2021-05-14 16:34:52] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 0 ms to minimize.
[2021-05-14 16:34:53] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 1 ms to minimize.
[2021-05-14 16:34:53] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 0 ms to minimize.
[2021-05-14 16:34:53] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 0 ms to minimize.
[2021-05-14 16:34:53] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 0 ms to minimize.
[2021-05-14 16:34:53] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 1 ms to minimize.
[2021-05-14 16:34:54] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 1 ms to minimize.
[2021-05-14 16:34:54] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 0 ms to minimize.
[2021-05-14 16:34:54] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 1 ms to minimize.
[2021-05-14 16:34:55] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 0 ms to minimize.
[2021-05-14 16:34:55] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 1 ms to minimize.
[2021-05-14 16:34:55] [INFO ] Deduced a trap composed of 62 places in 107 ms of which 0 ms to minimize.
[2021-05-14 16:34:56] [INFO ] Deduced a trap composed of 69 places in 94 ms of which 1 ms to minimize.
[2021-05-14 16:34:56] [INFO ] Deduced a trap composed of 54 places in 117 ms of which 1 ms to minimize.
[2021-05-14 16:34:56] [INFO ] Deduced a trap composed of 42 places in 114 ms of which 0 ms to minimize.
[2021-05-14 16:34:56] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 1 ms to minimize.
[2021-05-14 16:34:56] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 1 ms to minimize.
[2021-05-14 16:34:56] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 0 ms to minimize.
[2021-05-14 16:34:57] [INFO ] Deduced a trap composed of 83 places in 108 ms of which 0 ms to minimize.
[2021-05-14 16:34:57] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 1 ms to minimize.
[2021-05-14 16:34:57] [INFO ] Deduced a trap composed of 67 places in 119 ms of which 1 ms to minimize.
[2021-05-14 16:34:57] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 1 ms to minimize.
[2021-05-14 16:34:57] [INFO ] Deduced a trap composed of 51 places in 109 ms of which 1 ms to minimize.
[2021-05-14 16:34:58] [INFO ] Deduced a trap composed of 88 places in 98 ms of which 0 ms to minimize.
[2021-05-14 16:34:58] [INFO ] Deduced a trap composed of 91 places in 103 ms of which 0 ms to minimize.
[2021-05-14 16:34:58] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 0 ms to minimize.
[2021-05-14 16:34:58] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 0 ms to minimize.
[2021-05-14 16:34:58] [INFO ] Deduced a trap composed of 91 places in 109 ms of which 0 ms to minimize.
[2021-05-14 16:34:58] [INFO ] Deduced a trap composed of 91 places in 94 ms of which 0 ms to minimize.
[2021-05-14 16:34:58] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 0 ms to minimize.
[2021-05-14 16:34:59] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 1 ms to minimize.
[2021-05-14 16:34:59] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 1 ms to minimize.
[2021-05-14 16:34:59] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 1 ms to minimize.
[2021-05-14 16:35:00] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 1 ms to minimize.
[2021-05-14 16:35:00] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 1 ms to minimize.
[2021-05-14 16:35:01] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 0 ms to minimize.
[2021-05-14 16:35:01] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 0 ms to minimize.
[2021-05-14 16:35:01] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 1 ms to minimize.
[2021-05-14 16:35:01] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 0 ms to minimize.
[2021-05-14 16:35:02] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 1 ms to minimize.
[2021-05-14 16:35:02] [INFO ] Deduced a trap composed of 75 places in 95 ms of which 0 ms to minimize.
[2021-05-14 16:35:02] [INFO ] Deduced a trap composed of 47 places in 94 ms of which 0 ms to minimize.
[2021-05-14 16:35:02] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 1 ms to minimize.
[2021-05-14 16:35:02] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 0 ms to minimize.
[2021-05-14 16:35:02] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 0 ms to minimize.
[2021-05-14 16:35:03] [INFO ] Deduced a trap composed of 73 places in 97 ms of which 0 ms to minimize.
[2021-05-14 16:35:03] [INFO ] Deduced a trap composed of 63 places in 107 ms of which 1 ms to minimize.
[2021-05-14 16:35:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 114 trap constraints in 22737 ms
FORMULA Peterson-COL-4-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 216200 steps, including 1000 resets, run finished after 841 ms. (steps per millisecond=257 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 315 out of 475 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 475/475 places, 690/690 transitions.
Applied a total of 0 rules in 14 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 475/475 places, 690/690 transitions.
[2021-05-14 16:35:05] [INFO ] Flatten gal took : 19 ms
[2021-05-14 16:35:05] [INFO ] Flatten gal took : 19 ms
[2021-05-14 16:35:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4993116640716231484.gal : 2 ms
[2021-05-14 16:35:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15542246443086503363.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality4993116640716231484.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15542246443086503363.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality4993116640716231484.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15542246443086503363.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality15542246443086503363.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 6
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :6 after 15
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :15 after 36
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :36 after 69
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :69 after 206
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :206 after 564
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :564 after 1580
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1580 after 8340
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :8340 after 29759
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :29759 after 60543
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :60543 after 138656
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :138656 after 820651
Detected timeout of ITS tools.
[2021-05-14 16:35:25] [INFO ] Flatten gal took : 19 ms
[2021-05-14 16:35:25] [INFO ] Applying decomposition
[2021-05-14 16:35:25] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15169346614352210559.txt, -o, /tmp/graph15169346614352210559.bin, -w, /tmp/graph15169346614352210559.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15169346614352210559.bin, -l, -1, -v, -w, /tmp/graph15169346614352210559.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 16:35:25] [INFO ] Decomposing Gal with order
[2021-05-14 16:35:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 16:35:25] [INFO ] Removed a total of 491 redundant transitions.
[2021-05-14 16:35:25] [INFO ] Flatten gal took : 74 ms
[2021-05-14 16:35:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 3 ms.
[2021-05-14 16:35:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8868050976783801451.gal : 23 ms
[2021-05-14 16:35:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7054127092817406717.prop : 10349 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality8868050976783801451.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7054127092817406717.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality8868050976783801451.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7054127092817406717.prop --nowitness
Loading property file /tmp/ReachabilityCardinality7054127092817406717.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 14
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :14 after 53
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :53 after 172
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :172 after 6986
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :6986 after 246268
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :246268 after 1.84842e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16857368455845494384
[2021-05-14 16:35:56] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16857368455845494384
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16857368455845494384]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16857368455845494384] killed by timeout after 2 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16857368455845494384] killed by timeout after 2 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4337 ms. (steps per millisecond=230 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 340855 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=68 ) properties seen :{}
Interrupted Best-First random walk after 576175 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=115 ) properties seen :{}
Interrupted probabilistic random walk after 8511336 steps, run timeout after 30001 ms. (steps per millisecond=283 ) properties seen :{}
Probabilistic random walk after 8511336 steps, saw 1435809 distinct states, run finished after 30001 ms. (steps per millisecond=283 ) properties seen :{}
Running SMT prover for 2 properties.
[2021-05-14 16:36:42] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2021-05-14 16:36:42] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-14 16:36:42] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2021-05-14 16:36:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 16:36:43] [INFO ] [Real]Absence check using state equation in 358 ms returned sat
[2021-05-14 16:36:43] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-14 16:36:43] [INFO ] [Real]Added 132 Read/Feed constraints in 22 ms returned sat
[2021-05-14 16:36:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 16:36:43] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2021-05-14 16:36:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 16:36:43] [INFO ] [Nat]Absence check using state equation in 430 ms returned sat
[2021-05-14 16:36:43] [INFO ] [Nat]Added 132 Read/Feed constraints in 24 ms returned sat
[2021-05-14 16:36:43] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 1 ms to minimize.
[2021-05-14 16:36:44] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 1 ms to minimize.
[2021-05-14 16:36:44] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 0 ms to minimize.
[2021-05-14 16:36:44] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 1 ms to minimize.
[2021-05-14 16:36:44] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 0 ms to minimize.
[2021-05-14 16:36:44] [INFO ] Deduced a trap composed of 132 places in 102 ms of which 0 ms to minimize.
[2021-05-14 16:36:44] [INFO ] Deduced a trap composed of 121 places in 109 ms of which 0 ms to minimize.
[2021-05-14 16:36:44] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 1 ms to minimize.
[2021-05-14 16:36:44] [INFO ] Deduced a trap composed of 140 places in 94 ms of which 1 ms to minimize.
[2021-05-14 16:36:45] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 0 ms to minimize.
[2021-05-14 16:36:45] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 0 ms to minimize.
[2021-05-14 16:36:45] [INFO ] Deduced a trap composed of 78 places in 113 ms of which 1 ms to minimize.
[2021-05-14 16:36:45] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 0 ms to minimize.
[2021-05-14 16:36:45] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 0 ms to minimize.
[2021-05-14 16:36:45] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 1 ms to minimize.
[2021-05-14 16:36:45] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 0 ms to minimize.
[2021-05-14 16:36:46] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
[2021-05-14 16:36:46] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 0 ms to minimize.
[2021-05-14 16:36:46] [INFO ] Deduced a trap composed of 91 places in 71 ms of which 0 ms to minimize.
[2021-05-14 16:36:46] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2635 ms
[2021-05-14 16:36:46] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 35 ms.
[2021-05-14 16:36:51] [INFO ] Added : 585 causal constraints over 117 iterations in 5262 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
[2021-05-14 16:36:51] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2021-05-14 16:36:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 16:36:52] [INFO ] [Real]Absence check using state equation in 508 ms returned sat
[2021-05-14 16:36:52] [INFO ] [Real]Added 132 Read/Feed constraints in 22 ms returned sat
[2021-05-14 16:36:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 16:36:52] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2021-05-14 16:36:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 16:36:52] [INFO ] [Nat]Absence check using state equation in 385 ms returned sat
[2021-05-14 16:36:52] [INFO ] [Nat]Added 132 Read/Feed constraints in 25 ms returned sat
[2021-05-14 16:36:52] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 0 ms to minimize.
[2021-05-14 16:36:53] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 1 ms to minimize.
[2021-05-14 16:36:53] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 0 ms to minimize.
[2021-05-14 16:36:53] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 0 ms to minimize.
[2021-05-14 16:36:53] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 0 ms to minimize.
[2021-05-14 16:36:53] [INFO ] Deduced a trap composed of 54 places in 127 ms of which 1 ms to minimize.
[2021-05-14 16:36:53] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 0 ms to minimize.
[2021-05-14 16:36:54] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 0 ms to minimize.
[2021-05-14 16:36:54] [INFO ] Deduced a trap composed of 69 places in 118 ms of which 1 ms to minimize.
[2021-05-14 16:36:54] [INFO ] Deduced a trap composed of 69 places in 130 ms of which 0 ms to minimize.
[2021-05-14 16:36:54] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 1 ms to minimize.
[2021-05-14 16:36:54] [INFO ] Deduced a trap composed of 83 places in 131 ms of which 0 ms to minimize.
[2021-05-14 16:36:54] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 0 ms to minimize.
[2021-05-14 16:36:54] [INFO ] Deduced a trap composed of 61 places in 113 ms of which 1 ms to minimize.
[2021-05-14 16:36:55] [INFO ] Deduced a trap composed of 69 places in 125 ms of which 0 ms to minimize.
[2021-05-14 16:36:55] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 0 ms to minimize.
[2021-05-14 16:36:55] [INFO ] Deduced a trap composed of 115 places in 104 ms of which 0 ms to minimize.
[2021-05-14 16:36:55] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 1 ms to minimize.
[2021-05-14 16:36:55] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 0 ms to minimize.
[2021-05-14 16:36:55] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 1 ms to minimize.
[2021-05-14 16:36:55] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 0 ms to minimize.
[2021-05-14 16:36:55] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 1 ms to minimize.
[2021-05-14 16:36:56] [INFO ] Deduced a trap composed of 47 places in 124 ms of which 0 ms to minimize.
[2021-05-14 16:36:56] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 1 ms to minimize.
[2021-05-14 16:36:56] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 1 ms to minimize.
[2021-05-14 16:36:56] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 1 ms to minimize.
[2021-05-14 16:36:56] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 1 ms to minimize.
[2021-05-14 16:36:56] [INFO ] Deduced a trap composed of 125 places in 101 ms of which 0 ms to minimize.
[2021-05-14 16:36:57] [INFO ] Deduced a trap composed of 147 places in 101 ms of which 1 ms to minimize.
[2021-05-14 16:36:57] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 1 ms to minimize.
[2021-05-14 16:36:57] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 1 ms to minimize.
[2021-05-14 16:36:57] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 1 ms to minimize.
[2021-05-14 16:36:57] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 1 ms to minimize.
[2021-05-14 16:36:57] [INFO ] Deduced a trap composed of 63 places in 126 ms of which 1 ms to minimize.
[2021-05-14 16:36:57] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 0 ms to minimize.
[2021-05-14 16:36:58] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 1 ms to minimize.
[2021-05-14 16:36:58] [INFO ] Deduced a trap composed of 138 places in 125 ms of which 0 ms to minimize.
[2021-05-14 16:36:58] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 1 ms to minimize.
[2021-05-14 16:36:58] [INFO ] Deduced a trap composed of 80 places in 117 ms of which 0 ms to minimize.
[2021-05-14 16:36:58] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 0 ms to minimize.
[2021-05-14 16:36:59] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 1 ms to minimize.
[2021-05-14 16:36:59] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 0 ms to minimize.
[2021-05-14 16:36:59] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 1 ms to minimize.
[2021-05-14 16:36:59] [INFO ] Deduced a trap composed of 87 places in 118 ms of which 1 ms to minimize.
[2021-05-14 16:36:59] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 0 ms to minimize.
[2021-05-14 16:36:59] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 1 ms to minimize.
[2021-05-14 16:37:00] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 1 ms to minimize.
[2021-05-14 16:37:00] [INFO ] Deduced a trap composed of 62 places in 138 ms of which 1 ms to minimize.
[2021-05-14 16:37:00] [INFO ] Deduced a trap composed of 61 places in 162 ms of which 1 ms to minimize.
[2021-05-14 16:37:00] [INFO ] Deduced a trap composed of 58 places in 112 ms of which 0 ms to minimize.
[2021-05-14 16:37:00] [INFO ] Deduced a trap composed of 100 places in 72 ms of which 1 ms to minimize.
[2021-05-14 16:37:00] [INFO ] Deduced a trap composed of 80 places in 85 ms of which 0 ms to minimize.
[2021-05-14 16:37:01] [INFO ] Deduced a trap composed of 80 places in 83 ms of which 0 ms to minimize.
[2021-05-14 16:37:01] [INFO ] Deduced a trap composed of 79 places in 71 ms of which 0 ms to minimize.
[2021-05-14 16:37:01] [INFO ] Deduced a trap composed of 65 places in 103 ms of which 0 ms to minimize.
[2021-05-14 16:37:01] [INFO ] Deduced a trap composed of 125 places in 85 ms of which 0 ms to minimize.
[2021-05-14 16:37:01] [INFO ] Deduced a trap composed of 113 places in 74 ms of which 1 ms to minimize.
[2021-05-14 16:37:01] [INFO ] Deduced a trap composed of 113 places in 88 ms of which 0 ms to minimize.
[2021-05-14 16:37:02] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 1 ms to minimize.
[2021-05-14 16:37:02] [INFO ] Deduced a trap composed of 62 places in 130 ms of which 0 ms to minimize.
[2021-05-14 16:37:02] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 1 ms to minimize.
[2021-05-14 16:37:02] [INFO ] Deduced a trap composed of 76 places in 121 ms of which 0 ms to minimize.
[2021-05-14 16:37:02] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 1 ms to minimize.
[2021-05-14 16:37:02] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 1 ms to minimize.
[2021-05-14 16:37:03] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 0 ms to minimize.
[2021-05-14 16:37:03] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 1 ms to minimize.
[2021-05-14 16:37:03] [INFO ] Deduced a trap composed of 50 places in 113 ms of which 0 ms to minimize.
[2021-05-14 16:37:03] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 1 ms to minimize.
[2021-05-14 16:37:04] [INFO ] Deduced a trap composed of 114 places in 94 ms of which 1 ms to minimize.
[2021-05-14 16:37:04] [INFO ] Deduced a trap composed of 83 places in 64 ms of which 0 ms to minimize.
[2021-05-14 16:37:04] [INFO ] Deduced a trap composed of 132 places in 93 ms of which 0 ms to minimize.
[2021-05-14 16:37:04] [INFO ] Deduced a trap composed of 113 places in 86 ms of which 0 ms to minimize.
[2021-05-14 16:37:04] [INFO ] Deduced a trap composed of 85 places in 65 ms of which 0 ms to minimize.
[2021-05-14 16:37:04] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 0 ms to minimize.
[2021-05-14 16:37:05] [INFO ] Deduced a trap composed of 69 places in 109 ms of which 1 ms to minimize.
[2021-05-14 16:37:05] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 0 ms to minimize.
[2021-05-14 16:37:05] [INFO ] Deduced a trap composed of 85 places in 81 ms of which 0 ms to minimize.
[2021-05-14 16:37:05] [INFO ] Deduced a trap composed of 84 places in 72 ms of which 0 ms to minimize.
[2021-05-14 16:37:05] [INFO ] Deduced a trap composed of 84 places in 72 ms of which 0 ms to minimize.
[2021-05-14 16:37:05] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 1 ms to minimize.
[2021-05-14 16:37:05] [INFO ] Deduced a trap composed of 116 places in 86 ms of which 0 ms to minimize.
[2021-05-14 16:37:06] [INFO ] Deduced a trap composed of 64 places in 104 ms of which 1 ms to minimize.
[2021-05-14 16:37:06] [INFO ] Trap strengthening (SAT) tested/added 83/82 trap constraints in 14091 ms
[2021-05-14 16:37:06] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 32 ms.
[2021-05-14 16:37:14] [INFO ] Deduced a trap composed of 43 places in 151 ms of which 1 ms to minimize.
[2021-05-14 16:37:14] [INFO ] Deduced a trap composed of 66 places in 113 ms of which 0 ms to minimize.
[2021-05-14 16:37:14] [INFO ] Deduced a trap composed of 109 places in 116 ms of which 0 ms to minimize.
[2021-05-14 16:37:14] [INFO ] Deduced a trap composed of 164 places in 96 ms of which 0 ms to minimize.
[2021-05-14 16:37:15] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 1 ms to minimize.
[2021-05-14 16:37:15] [INFO ] Deduced a trap composed of 106 places in 96 ms of which 0 ms to minimize.
[2021-05-14 16:37:15] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 0 ms to minimize.
[2021-05-14 16:37:15] [INFO ] Deduced a trap composed of 60 places in 109 ms of which 1 ms to minimize.
[2021-05-14 16:37:16] [INFO ] Deduced a trap composed of 128 places in 90 ms of which 0 ms to minimize.
[2021-05-14 16:37:16] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 1 ms to minimize.
[2021-05-14 16:37:16] [INFO ] Deduced a trap composed of 53 places in 110 ms of which 1 ms to minimize.
[2021-05-14 16:37:16] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 0 ms to minimize.
[2021-05-14 16:37:17] [INFO ] Deduced a trap composed of 120 places in 89 ms of which 1 ms to minimize.
[2021-05-14 16:37:18] [INFO ] Deduced a trap composed of 58 places in 106 ms of which 1 ms to minimize.
[2021-05-14 16:37:18] [INFO ] Deduced a trap composed of 77 places in 126 ms of which 1 ms to minimize.
[2021-05-14 16:37:18] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 1 ms to minimize.
[2021-05-14 16:37:19] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 0 ms to minimize.
[2021-05-14 16:37:19] [INFO ] Deduced a trap composed of 104 places in 65 ms of which 1 ms to minimize.
[2021-05-14 16:37:19] [INFO ] Deduced a trap composed of 88 places in 78 ms of which 1 ms to minimize.
[2021-05-14 16:37:20] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 0 ms to minimize.
[2021-05-14 16:37:20] [INFO ] Deduced a trap composed of 71 places in 79 ms of which 1 ms to minimize.
[2021-05-14 16:37:37] [INFO ] Deduced a trap composed of 2 places in 166 ms of which 0 ms to minimize.
[2021-05-14 16:37:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
Incomplete Parikh walk after 216200 steps, including 1000 resets, run finished after 848 ms. (steps per millisecond=254 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 315 out of 475 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 475/475 places, 690/690 transitions.
Applied a total of 0 rules in 13 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 475/475 places, 690/690 transitions.
Starting structural reductions, iteration 0 : 475/475 places, 690/690 transitions.
Applied a total of 0 rules in 13 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2021-05-14 16:37:38] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2021-05-14 16:37:38] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-14 16:37:38] [INFO ] Implicit Places using invariants in 104 ms returned []
[2021-05-14 16:37:38] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2021-05-14 16:37:38] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-14 16:37:38] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-14 16:37:38] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2021-05-14 16:37:38] [INFO ] Redundant transitions in 4 ms returned []
[2021-05-14 16:37:38] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2021-05-14 16:37:38] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-14 16:37:38] [INFO ] Dead Transitions using invariants and state equation in 290 ms returned []
Finished structural reductions, in 1 iterations. Remains : 475/475 places, 690/690 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 598 ms. (steps per millisecond=167 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2021-05-14 16:37:39] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2021-05-14 16:37:39] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-14 16:37:39] [INFO ] [Real]Absence check using 14 positive place invariants in 69 ms returned sat
[2021-05-14 16:37:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 16:37:40] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2021-05-14 16:37:40] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-14 16:37:40] [INFO ] [Real]Added 132 Read/Feed constraints in 23 ms returned sat
[2021-05-14 16:37:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 16:37:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2021-05-14 16:37:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 16:37:40] [INFO ] [Nat]Absence check using state equation in 444 ms returned sat
[2021-05-14 16:37:40] [INFO ] [Nat]Added 132 Read/Feed constraints in 24 ms returned sat
[2021-05-14 16:37:40] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 1 ms to minimize.
[2021-05-14 16:37:41] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 1 ms to minimize.
[2021-05-14 16:37:41] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 0 ms to minimize.
[2021-05-14 16:37:41] [INFO ] Deduced a trap composed of 32 places in 565 ms of which 0 ms to minimize.
[2021-05-14 16:37:41] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 0 ms to minimize.
[2021-05-14 16:37:42] [INFO ] Deduced a trap composed of 132 places in 108 ms of which 1 ms to minimize.
[2021-05-14 16:37:42] [INFO ] Deduced a trap composed of 121 places in 97 ms of which 0 ms to minimize.
[2021-05-14 16:37:42] [INFO ] Deduced a trap composed of 93 places in 97 ms of which 0 ms to minimize.
[2021-05-14 16:37:42] [INFO ] Deduced a trap composed of 140 places in 95 ms of which 0 ms to minimize.
[2021-05-14 16:37:42] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 0 ms to minimize.
[2021-05-14 16:37:42] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 1 ms to minimize.
[2021-05-14 16:37:42] [INFO ] Deduced a trap composed of 78 places in 114 ms of which 0 ms to minimize.
[2021-05-14 16:37:42] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 0 ms to minimize.
[2021-05-14 16:37:43] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 0 ms to minimize.
[2021-05-14 16:37:43] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 0 ms to minimize.
[2021-05-14 16:37:43] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2021-05-14 16:37:43] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2021-05-14 16:37:43] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 0 ms to minimize.
[2021-05-14 16:37:43] [INFO ] Deduced a trap composed of 91 places in 82 ms of which 0 ms to minimize.
[2021-05-14 16:37:43] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3074 ms
[2021-05-14 16:37:43] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 36 ms.
[2021-05-14 16:37:49] [INFO ] Added : 585 causal constraints over 117 iterations in 5516 ms. Result :sat
[2021-05-14 16:37:49] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2021-05-14 16:37:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 16:37:49] [INFO ] [Real]Absence check using state equation in 515 ms returned sat
[2021-05-14 16:37:49] [INFO ] [Real]Added 132 Read/Feed constraints in 22 ms returned sat
[2021-05-14 16:37:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 16:37:50] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2021-05-14 16:37:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 16:37:50] [INFO ] [Nat]Absence check using state equation in 388 ms returned sat
[2021-05-14 16:37:50] [INFO ] [Nat]Added 132 Read/Feed constraints in 24 ms returned sat
[2021-05-14 16:37:50] [INFO ] Deduced a trap composed of 55 places in 124 ms of which 0 ms to minimize.
[2021-05-14 16:37:50] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 1 ms to minimize.
[2021-05-14 16:37:50] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 1 ms to minimize.
[2021-05-14 16:37:51] [INFO ] Deduced a trap composed of 76 places in 128 ms of which 1 ms to minimize.
[2021-05-14 16:37:51] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 1 ms to minimize.
[2021-05-14 16:37:51] [INFO ] Deduced a trap composed of 54 places in 112 ms of which 1 ms to minimize.
[2021-05-14 16:37:51] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 1 ms to minimize.
[2021-05-14 16:37:51] [INFO ] Deduced a trap composed of 50 places in 120 ms of which 1 ms to minimize.
[2021-05-14 16:37:51] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 1 ms to minimize.
[2021-05-14 16:37:51] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 1 ms to minimize.
[2021-05-14 16:37:52] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 0 ms to minimize.
[2021-05-14 16:37:52] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 1 ms to minimize.
[2021-05-14 16:37:52] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 0 ms to minimize.
[2021-05-14 16:37:52] [INFO ] Deduced a trap composed of 61 places in 109 ms of which 0 ms to minimize.
[2021-05-14 16:37:52] [INFO ] Deduced a trap composed of 69 places in 95 ms of which 1 ms to minimize.
[2021-05-14 16:37:52] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 0 ms to minimize.
[2021-05-14 16:37:52] [INFO ] Deduced a trap composed of 115 places in 92 ms of which 0 ms to minimize.
[2021-05-14 16:37:53] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 0 ms to minimize.
[2021-05-14 16:37:53] [INFO ] Deduced a trap composed of 91 places in 95 ms of which 0 ms to minimize.
[2021-05-14 16:37:53] [INFO ] Deduced a trap composed of 91 places in 103 ms of which 0 ms to minimize.
[2021-05-14 16:37:53] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 0 ms to minimize.
[2021-05-14 16:37:53] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 0 ms to minimize.
[2021-05-14 16:37:53] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 0 ms to minimize.
[2021-05-14 16:37:53] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 0 ms to minimize.
[2021-05-14 16:37:54] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 0 ms to minimize.
[2021-05-14 16:37:54] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 0 ms to minimize.
[2021-05-14 16:37:54] [INFO ] Deduced a trap composed of 91 places in 88 ms of which 0 ms to minimize.
[2021-05-14 16:37:54] [INFO ] Deduced a trap composed of 125 places in 93 ms of which 0 ms to minimize.
[2021-05-14 16:37:54] [INFO ] Deduced a trap composed of 147 places in 75 ms of which 0 ms to minimize.
[2021-05-14 16:37:54] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 1 ms to minimize.
[2021-05-14 16:37:54] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 0 ms to minimize.
[2021-05-14 16:37:54] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 0 ms to minimize.
[2021-05-14 16:37:55] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 0 ms to minimize.
[2021-05-14 16:37:55] [INFO ] Deduced a trap composed of 63 places in 114 ms of which 0 ms to minimize.
[2021-05-14 16:37:55] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 0 ms to minimize.
[2021-05-14 16:37:55] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 0 ms to minimize.
[2021-05-14 16:37:55] [INFO ] Deduced a trap composed of 138 places in 115 ms of which 1 ms to minimize.
[2021-05-14 16:37:55] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 1 ms to minimize.
[2021-05-14 16:37:56] [INFO ] Deduced a trap composed of 80 places in 119 ms of which 0 ms to minimize.
[2021-05-14 16:37:56] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 0 ms to minimize.
[2021-05-14 16:37:56] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 1 ms to minimize.
[2021-05-14 16:37:56] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 0 ms to minimize.
[2021-05-14 16:37:56] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 1 ms to minimize.
[2021-05-14 16:37:56] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 1 ms to minimize.
[2021-05-14 16:37:56] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 0 ms to minimize.
[2021-05-14 16:37:57] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 0 ms to minimize.
[2021-05-14 16:37:57] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 1 ms to minimize.
[2021-05-14 16:37:57] [INFO ] Deduced a trap composed of 62 places in 131 ms of which 0 ms to minimize.
[2021-05-14 16:37:57] [INFO ] Deduced a trap composed of 61 places in 113 ms of which 1 ms to minimize.
[2021-05-14 16:37:58] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 0 ms to minimize.
[2021-05-14 16:37:58] [INFO ] Deduced a trap composed of 100 places in 63 ms of which 0 ms to minimize.
[2021-05-14 16:37:58] [INFO ] Deduced a trap composed of 80 places in 85 ms of which 0 ms to minimize.
[2021-05-14 16:37:58] [INFO ] Deduced a trap composed of 80 places in 86 ms of which 1 ms to minimize.
[2021-05-14 16:37:58] [INFO ] Deduced a trap composed of 79 places in 88 ms of which 0 ms to minimize.
[2021-05-14 16:37:58] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 0 ms to minimize.
[2021-05-14 16:37:58] [INFO ] Deduced a trap composed of 125 places in 90 ms of which 0 ms to minimize.
[2021-05-14 16:37:58] [INFO ] Deduced a trap composed of 113 places in 86 ms of which 1 ms to minimize.
[2021-05-14 16:37:59] [INFO ] Deduced a trap composed of 113 places in 76 ms of which 0 ms to minimize.
[2021-05-14 16:37:59] [INFO ] Deduced a trap composed of 78 places in 116 ms of which 1 ms to minimize.
[2021-05-14 16:37:59] [INFO ] Deduced a trap composed of 62 places in 137 ms of which 0 ms to minimize.
[2021-05-14 16:37:59] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 0 ms to minimize.
[2021-05-14 16:37:59] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 1 ms to minimize.
[2021-05-14 16:38:00] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 1 ms to minimize.
[2021-05-14 16:38:00] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 0 ms to minimize.
[2021-05-14 16:38:00] [INFO ] Deduced a trap composed of 54 places in 111 ms of which 0 ms to minimize.
[2021-05-14 16:38:00] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 0 ms to minimize.
[2021-05-14 16:38:00] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 0 ms to minimize.
[2021-05-14 16:38:01] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 0 ms to minimize.
[2021-05-14 16:38:01] [INFO ] Deduced a trap composed of 114 places in 99 ms of which 0 ms to minimize.
[2021-05-14 16:38:01] [INFO ] Deduced a trap composed of 83 places in 75 ms of which 1 ms to minimize.
[2021-05-14 16:38:01] [INFO ] Deduced a trap composed of 132 places in 94 ms of which 1 ms to minimize.
[2021-05-14 16:38:01] [INFO ] Deduced a trap composed of 113 places in 98 ms of which 1 ms to minimize.
[2021-05-14 16:38:01] [INFO ] Deduced a trap composed of 85 places in 81 ms of which 0 ms to minimize.
[2021-05-14 16:38:02] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 0 ms to minimize.
[2021-05-14 16:38:02] [INFO ] Deduced a trap composed of 69 places in 127 ms of which 1 ms to minimize.
[2021-05-14 16:38:02] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 1 ms to minimize.
[2021-05-14 16:38:02] [INFO ] Deduced a trap composed of 85 places in 74 ms of which 1 ms to minimize.
[2021-05-14 16:38:02] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 0 ms to minimize.
[2021-05-14 16:38:02] [INFO ] Deduced a trap composed of 84 places in 80 ms of which 0 ms to minimize.
[2021-05-14 16:38:03] [INFO ] Deduced a trap composed of 85 places in 90 ms of which 1 ms to minimize.
[2021-05-14 16:38:03] [INFO ] Deduced a trap composed of 116 places in 98 ms of which 1 ms to minimize.
[2021-05-14 16:38:03] [INFO ] Deduced a trap composed of 64 places in 111 ms of which 0 ms to minimize.
[2021-05-14 16:38:04] [INFO ] Trap strengthening (SAT) tested/added 83/82 trap constraints in 13823 ms
[2021-05-14 16:38:04] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 32 ms.
[2021-05-14 16:38:10] [INFO ] Deduced a trap composed of 2 places in 163 ms of which 1 ms to minimize.
[2021-05-14 16:38:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-14 16:38:10] [INFO ] Flatten gal took : 18 ms
[2021-05-14 16:38:10] [INFO ] Flatten gal took : 26 ms
[2021-05-14 16:38:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6057836531413376294.gal : 2 ms
[2021-05-14 16:38:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4390000799307907315.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality6057836531413376294.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4390000799307907315.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality6057836531413376294.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4390000799307907315.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality4390000799307907315.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 6
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :6 after 15
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :15 after 36
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :36 after 69
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :69 after 206
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :206 after 564
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :564 after 1580
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1580 after 8340
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :8340 after 29759
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :29759 after 60543
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :60543 after 138656
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :138656 after 820651
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :820651 after 2.50753e+06
Detected timeout of ITS tools.
[2021-05-14 16:38:35] [INFO ] Flatten gal took : 17 ms
[2021-05-14 16:38:35] [INFO ] Applying decomposition
[2021-05-14 16:38:35] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph11644623727256131891.txt, -o, /tmp/graph11644623727256131891.bin, -w, /tmp/graph11644623727256131891.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph11644623727256131891.bin, -l, -1, -v, -w, /tmp/graph11644623727256131891.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 16:38:35] [INFO ] Decomposing Gal with order
[2021-05-14 16:38:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 16:38:35] [INFO ] Removed a total of 491 redundant transitions.
[2021-05-14 16:38:35] [INFO ] Flatten gal took : 78 ms
[2021-05-14 16:38:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 12 ms.
[2021-05-14 16:38:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15428874840475908645.gal : 5 ms
[2021-05-14 16:38:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12570505241410390660.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality15428874840475908645.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12570505241410390660.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality15428874840475908645.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12570505241410390660.prop --nowitness
Loading property file /tmp/ReachabilityCardinality12570505241410390660.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :3 after 3
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :3 after 24
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :24 after 355
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :355 after 24443
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :24443 after 150213
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1035104088851985282
[2021-05-14 16:39:00] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1035104088851985282
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1035104088851985282]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1035104088851985282] killed by timeout after 2 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1035104088851985282] killed by timeout after 2 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 475 transition count 630
Applied a total of 60 rules in 45 ms. Remains 475 /475 variables (removed 0) and now considering 630/690 (removed 60) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 630 rows 475 cols
[2021-05-14 16:39:02] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-14 16:39:02] [INFO ] [Real]Absence check using 14 positive place invariants in 29 ms returned sat
[2021-05-14 16:39:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 16:39:03] [INFO ] [Real]Absence check using state equation in 637 ms returned sat
[2021-05-14 16:39:03] [INFO ] Computed and/alt/rep : 625/1226/625 causal constraints (skipped 0 transitions) in 45 ms.
[2021-05-14 16:39:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 16:39:03] [INFO ] [Nat]Absence check using 14 positive place invariants in 24 ms returned sat
[2021-05-14 16:39:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 16:39:04] [INFO ] [Nat]Absence check using state equation in 828 ms returned sat
[2021-05-14 16:39:04] [INFO ] Computed and/alt/rep : 625/1226/625 causal constraints (skipped 0 transitions) in 66 ms.
[2021-05-14 16:39:10] [INFO ] Added : 605 causal constraints over 121 iterations in 5568 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 24 ms.
[2021-05-14 16:39:10] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2021-05-14 16:39:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 16:39:10] [INFO ] [Real]Absence check using state equation in 508 ms returned sat
[2021-05-14 16:39:10] [INFO ] Computed and/alt/rep : 625/1226/625 causal constraints (skipped 0 transitions) in 31 ms.
[2021-05-14 16:39:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 16:39:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2021-05-14 16:39:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 16:39:11] [INFO ] [Nat]Absence check using state equation in 396 ms returned sat
[2021-05-14 16:39:11] [INFO ] Computed and/alt/rep : 625/1226/625 causal constraints (skipped 0 transitions) in 37 ms.
[2021-05-14 16:39:17] [INFO ] Added : 606 causal constraints over 122 iterations in 5908 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 18 ms.
[2021-05-14 16:39:17] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17312640001989021638
[2021-05-14 16:39:17] [INFO ] Computing symmetric may disable matrix : 690 transitions.
[2021-05-14 16:39:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 16:39:17] [INFO ] Computing symmetric may enable matrix : 690 transitions.
[2021-05-14 16:39:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 16:39:17] [INFO ] Applying decomposition
[2021-05-14 16:39:17] [INFO ] Flatten gal took : 18 ms
[2021-05-14 16:39:17] [INFO ] Flatten gal took : 57 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph2614366942463800545.txt, -o, /tmp/graph2614366942463800545.bin, -w, /tmp/graph2614366942463800545.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph2614366942463800545.bin, -l, -1, -v, -w, /tmp/graph2614366942463800545.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 16:39:17] [INFO ] Decomposing Gal with order
[2021-05-14 16:39:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 16:39:17] [INFO ] Input system was already deterministic with 690 transitions.
[2021-05-14 16:39:17] [INFO ] Removed a total of 517 redundant transitions.
[2021-05-14 16:39:17] [INFO ] Flatten gal took : 94 ms
[2021-05-14 16:39:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 3 ms.
[2021-05-14 16:39:17] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability4938548146424879060.gal : 29 ms
[2021-05-14 16:39:17] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability7500658307866502277.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityFireability4938548146424879060.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability7500658307866502277.prop, --nowitness], workingDir=/home/mcc/execution]
[2021-05-14 16:39:18] [INFO ] Computing Do-Not-Accords matrix : 690 transitions.

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityFireability4938548146424879060.gal -t CGAL -reachable-file /tmp/ReachabilityFireability7500658307866502277.prop --nowitness
[2021-05-14 16:39:18] [INFO ] Computation of Completed DNA matrix. took 40 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 16:39:18] [INFO ] Built C files in 563ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17312640001989021638
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17312640001989021638]
Loading property file /tmp/ReachabilityFireability7500658307866502277.prop.
[2021-05-14 16:39:18] [INFO ] Ran tautology test, simplified 0 / 2 in 630 ms.
[2021-05-14 16:39:18] [INFO ] BMC solution for property Peterson-COL-4-ReachabilityFireability-05(UNSAT) depth K=0 took 19 ms
[2021-05-14 16:39:18] [INFO ] BMC solution for property Peterson-COL-4-ReachabilityFireability-13(UNSAT) depth K=0 took 16 ms
[2021-05-14 16:39:18] [INFO ] BMC solution for property Peterson-COL-4-ReachabilityFireability-05(UNSAT) depth K=1 took 19 ms
[2021-05-14 16:39:18] [INFO ] BMC solution for property Peterson-COL-4-ReachabilityFireability-13(UNSAT) depth K=1 took 42 ms
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 1151
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 630 out of 690 initially.
// Phase 1: matrix 630 rows 475 cols
[2021-05-14 16:39:18] [INFO ] Computed 14 place invariants in 2 ms
inv : Turn_0 + Turn_1 + Turn_2 + Turn_3 + Turn_4 = 1
inv : WantSection_4 + WantSection_5 = 1
inv : WantSection_2 + AskForSection_4 + AskForSection_5 + AskForSection_6 + AskForSection_7 + TestTurn_4 + TestTurn_5 + TestTurn_6 + TestTurn_7 + BeginLoop_20 + BeginLoop_21 + BeginLoop_22 + BeginLoop_23 + BeginLoop_24 + BeginLoop_25 + BeginLoop_26 + BeginLoop_27 + BeginLoop_28 + BeginLoop_29 + BeginLoop_30 + BeginLoop_31 + BeginLoop_32 + BeginLoop_33 + BeginLoop_34 + BeginLoop_35 + BeginLoop_36 + BeginLoop_37 + BeginLoop_38 + BeginLoop_39 + EndTurn_4 + EndTurn_5 + EndTurn_6 + EndTurn_7 + CS_1 + TestIdentity_20 + TestIdentity_21 + TestIdentity_22 + TestIdentity_23 + TestIdentity_24 + TestIdentity_25 + TestIdentity_26 + TestIdentity_27 + TestIdentity_28 + TestIdentity_29 + TestIdentity_30 + TestIdentity_31 + TestIdentity_32 + TestIdentity_33 + TestIdentity_34 + TestIdentity_35 + TestIdentity_36 + TestIdentity_37 + TestIdentity_38 + TestIdentity_39 + TestAlone_20 + TestAlone_22 + TestAlone_23 + TestAlone_24 + TestAlone_25 + TestAlone_27 + TestAlone_28 + TestAlone_29 + TestAlone_30 + TestAlone_32 + TestAlone_33 + TestAlone_34 + TestAlone_35 + TestAlone_37 + TestAlone_38 + TestAlone_39 + IsEndLoop_20 + IsEndLoop_21 + IsEndLoop_22 + IsEndLoop_23 + IsEndLoop_24 + IsEndLoop_25 + IsEndLoop_26 + IsEndLoop_27 + IsEndLoop_28 + IsEndLoop_29 + IsEndLoop_30 + IsEndLoop_31 + IsEndLoop_32 + IsEndLoop_33 + IsEndLoop_34 + IsEndLoop_35 + IsEndLoop_36 + IsEndLoop_37 + IsEndLoop_38 + IsEndLoop_39 = 1
inv : WantSection_8 + WantSection_9 = 1
inv : WantSection_4 + AskForSection_8 + AskForSection_9 + AskForSection_10 + AskForSection_11 + TestTurn_8 + TestTurn_9 + TestTurn_10 + TestTurn_11 + BeginLoop_40 + BeginLoop_41 + BeginLoop_42 + BeginLoop_43 + BeginLoop_44 + BeginLoop_45 + BeginLoop_46 + BeginLoop_47 + BeginLoop_48 + BeginLoop_49 + BeginLoop_50 + BeginLoop_51 + BeginLoop_52 + BeginLoop_53 + BeginLoop_54 + BeginLoop_55 + BeginLoop_56 + BeginLoop_57 + BeginLoop_58 + BeginLoop_59 + EndTurn_8 + EndTurn_9 + EndTurn_10 + EndTurn_11 + CS_2 + TestIdentity_40 + TestIdentity_41 + TestIdentity_42 + TestIdentity_43 + TestIdentity_44 + TestIdentity_45 + TestIdentity_46 + TestIdentity_47 + TestIdentity_48 + TestIdentity_49 + TestIdentity_50 + TestIdentity_51 + TestIdentity_52 + TestIdentity_53 + TestIdentity_54 + TestIdentity_55 + TestIdentity_56 + TestIdentity_57 + TestIdentity_58 + TestIdentity_59 + TestAlone_40 + TestAlone_41 + TestAlone_43 + TestAlone_44 + TestAlone_45 + TestAlone_46 + TestAlone_48 + TestAlone_49 + TestAlone_50 + TestAlone_51 + TestAlone_53 + TestAlone_54 + TestAlone_55 + TestAlone_56 + TestAlone_58 + TestAlone_59 + IsEndLoop_40 + IsEndLoop_41 + IsEndLoop_42 + IsEndLoop_43 + IsEndLoop_44 + IsEndLoop_45 + IsEndLoop_46 + IsEndLoop_47 + IsEndLoop_48 + IsEndLoop_49 + IsEndLoop_50 + IsEndLoop_51 + IsEndLoop_52 + IsEndLoop_53 + IsEndLoop_54 + IsEndLoop_55 + IsEndLoop_56 + IsEndLoop_57 + IsEndLoop_58 + IsEndLoop_59 = 1
inv : WantSection_0 + WantSection_1 = 1
inv : WantSection_6 + AskForSection_12 + AskForSection_13 + AskForSection_14 + AskForSection_15 + TestTurn_12 + TestTurn_13 + TestTurn_14 + TestTurn_15 + BeginLoop_60 + BeginLoop_61 + BeginLoop_62 + BeginLoop_63 + BeginLoop_64 + BeginLoop_65 + BeginLoop_66 + BeginLoop_67 + BeginLoop_68 + BeginLoop_69 + BeginLoop_70 + BeginLoop_71 + BeginLoop_72 + BeginLoop_73 + BeginLoop_74 + BeginLoop_75 + BeginLoop_76 + BeginLoop_77 + BeginLoop_78 + BeginLoop_79 + EndTurn_12 + EndTurn_13 + EndTurn_14 + EndTurn_15 + CS_3 + TestIdentity_60 + TestIdentity_61 + TestIdentity_62 + TestIdentity_63 + TestIdentity_64 + TestIdentity_65 + TestIdentity_66 + TestIdentity_67 + TestIdentity_68 + TestIdentity_69 + TestIdentity_70 + TestIdentity_71 + TestIdentity_72 + TestIdentity_73 + TestIdentity_74 + TestIdentity_75 + TestIdentity_76 + TestIdentity_77 + TestIdentity_78 + TestIdentity_79 + TestAlone_60 + TestAlone_61 + TestAlone_62 + TestAlone_64 + TestAlone_65 + TestAlone_66 + TestAlone_67 + TestAlone_69 + TestAlone_70 + TestAlone_71 + TestAlone_72 + TestAlone_74 + TestAlone_75 + TestAlone_76 + TestAlone_77 + TestAlone_79 + IsEndLoop_60 + IsEndLoop_61 + IsEndLoop_62 + IsEndLoop_63 + IsEndLoop_64 + IsEndLoop_65 + IsEndLoop_66 + IsEndLoop_67 + IsEndLoop_68 + IsEndLoop_69 + IsEndLoop_70 + IsEndLoop_71 + IsEndLoop_72 + IsEndLoop_73 + IsEndLoop_74 + IsEndLoop_75 + IsEndLoop_76 + IsEndLoop_77 + IsEndLoop_78 + IsEndLoop_79 = 1
inv : Turn_5 + Turn_6 + Turn_7 + Turn_8 + Turn_9 = 1
inv : Turn_15 + Turn_16 + Turn_17 + Turn_18 + Turn_19 = 1
inv : WantSection_0 + AskForSection_0 + AskForSection_1 + AskForSection_2 + AskForSection_3 + TestTurn_0 + TestTurn_1 + TestTurn_2 + TestTurn_3 + BeginLoop_0 + BeginLoop_1 + BeginLoop_2 + BeginLoop_3 + BeginLoop_4 + BeginLoop_5 + BeginLoop_6 + BeginLoop_7 + BeginLoop_8 + BeginLoop_9 + BeginLoop_10 + BeginLoop_11 + BeginLoop_12 + BeginLoop_13 + BeginLoop_14 + BeginLoop_15 + BeginLoop_16 + BeginLoop_17 + BeginLoop_18 + BeginLoop_19 + EndTurn_0 + EndTurn_1 + EndTurn_2 + EndTurn_3 + CS_0 + TestIdentity_0 + TestIdentity_1 + TestIdentity_2 + TestIdentity_3 + TestIdentity_4 + TestIdentity_5 + TestIdentity_6 + TestIdentity_7 + TestIdentity_8 + TestIdentity_9 + TestIdentity_10 + TestIdentity_11 + TestIdentity_12 + TestIdentity_13 + TestIdentity_14 + TestIdentity_15 + TestIdentity_16 + TestIdentity_17 + TestIdentity_18 + TestIdentity_19 + TestAlone_1 + TestAlone_2 + TestAlone_3 + TestAlone_4 + TestAlone_6 + TestAlone_7 + TestAlone_8 + TestAlone_9 + TestAlone_11 + TestAlone_12 + TestAlone_13 + TestAlone_14 + TestAlone_16 + TestAlone_17 + TestAlone_18 + TestAlone_19 + IsEndLoop_0 + IsEndLoop_1 + IsEndLoop_2 + IsEndLoop_3 + IsEndLoop_4 + IsEndLoop_5 + IsEndLoop_6 + IsEndLoop_7 + IsEndLoop_8 + IsEndLoop_9 + IsEndLoop_10 + IsEndLoop_11 + IsEndLoop_12 + IsEndLoop_13 + IsEndLoop_14 + IsEndLoop_15 + IsEndLoop_16 + IsEndLoop_17 + IsEndLoop_18 + IsEndLoop_19 = 1
inv : WantSection_6 + WantSection_7 = 1
inv : Turn_10 + Turn_11 + Turn_12 + Turn_13 + Turn_14 = 1
inv : WantSection_2 + WantSection_3 = 1
inv : WantSection_8 + AskForSection_16 + AskForSection_17 + AskForSection_18 + AskForSection_19 + TestTurn_16 + TestTurn_17 + TestTurn_18 + TestTurn_19 + BeginLoop_80 + BeginLoop_81 + BeginLoop_82 + BeginLoop_83 + BeginLoop_84 + BeginLoop_85 + BeginLoop_86 + BeginLoop_87 + BeginLoop_88 + BeginLoop_89 + BeginLoop_90 + BeginLoop_91 + BeginLoop_92 + BeginLoop_93 + BeginLoop_94 + BeginLoop_95 + BeginLoop_96 + BeginLoop_97 + BeginLoop_98 + BeginLoop_99 + EndTurn_16 + EndTurn_17 + EndTurn_18 + EndTurn_19 + CS_4 + TestIdentity_80 + TestIdentity_81 + TestIdentity_82 + TestIdentity_83 + TestIdentity_84 + TestIdentity_85 + TestIdentity_86 + TestIdentity_87 + TestIdentity_88 + TestIdentity_89 + TestIdentity_90 + TestIdentity_91 + TestIdentity_92 + TestIdentity_93 + TestIdentity_94 + TestIdentity_95 + TestIdentity_96 + TestIdentity_97 + TestIdentity_98 + TestIdentity_99 + TestAlone_80 + TestAlone_81 + TestAlone_82 + TestAlone_83 + TestAlone_85 + TestAlone_86 + TestAlone_87 + TestAlone_88 + TestAlone_90 + TestAlone_91 + TestAlone_92 + TestAlone_93 + TestAlone_95 + TestAlone_96 + TestAlone_97 + TestAlone_98 + IsEndLoop_80 + IsEndLoop_81 + IsEndLoop_82 + IsEndLoop_83 + IsEndLoop_84 + IsEndLoop_85 + IsEndLoop_86 + IsEndLoop_87 + IsEndLoop_88 + IsEndLoop_89 + IsEndLoop_90 + IsEndLoop_91 + IsEndLoop_92 + IsEndLoop_93 + IsEndLoop_94 + IsEndLoop_95 + IsEndLoop_96 + IsEndLoop_97 + IsEndLoop_98 + IsEndLoop_99 = 1
Total of 14 invariants.
[2021-05-14 16:39:18] [INFO ] Computed 14 place invariants in 13 ms
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1151 after 77788
[2021-05-14 16:39:19] [INFO ] BMC solution for property Peterson-COL-4-ReachabilityFireability-05(UNSAT) depth K=2 took 1649 ms
[2021-05-14 16:39:20] [INFO ] Proved 475 variables to be positive in 1655 ms
[2021-05-14 16:39:20] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-4-ReachabilityFireability-05
[2021-05-14 16:39:20] [INFO ] KInduction solution for property Peterson-COL-4-ReachabilityFireability-05(SAT) depth K=0 took 79 ms
[2021-05-14 16:39:20] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-4-ReachabilityFireability-13
[2021-05-14 16:39:20] [INFO ] KInduction solution for property Peterson-COL-4-ReachabilityFireability-13(SAT) depth K=0 took 39 ms
[2021-05-14 16:39:20] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-4-ReachabilityFireability-05
[2021-05-14 16:39:20] [INFO ] KInduction solution for property Peterson-COL-4-ReachabilityFireability-05(SAT) depth K=1 took 199 ms
[2021-05-14 16:39:20] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-4-ReachabilityFireability-13
[2021-05-14 16:39:20] [INFO ] KInduction solution for property Peterson-COL-4-ReachabilityFireability-13(SAT) depth K=1 took 156 ms
[2021-05-14 16:39:21] [INFO ] BMC solution for property Peterson-COL-4-ReachabilityFireability-13(UNSAT) depth K=2 took 1155 ms
Compilation finished in 6813 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin17312640001989021638]
Link finished in 93 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PetersonCOL4ReachabilityFireability05==true], workingDir=/tmp/ltsmin17312640001989021638]
[2021-05-14 16:39:30] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-4-ReachabilityFireability-05
[2021-05-14 16:39:30] [INFO ] KInduction solution for property Peterson-COL-4-ReachabilityFireability-05(SAT) depth K=2 took 9515 ms
[2021-05-14 16:39:33] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-4-ReachabilityFireability-13
[2021-05-14 16:39:33] [INFO ] KInduction solution for property Peterson-COL-4-ReachabilityFireability-13(SAT) depth K=2 took 3002 ms
[2021-05-14 16:39:40] [INFO ] BMC solution for property Peterson-COL-4-ReachabilityFireability-05(UNSAT) depth K=3 took 19153 ms
[2021-05-14 16:40:42] [INFO ] BMC solution for property Peterson-COL-4-ReachabilityFireability-13(UNSAT) depth K=3 took 62327 ms
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :77788 after 2.1061e+07
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2.1061e+07 after 2.58296e+07
[2021-05-14 16:45:22] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-4-ReachabilityFireability-05
[2021-05-14 16:45:22] [INFO ] KInduction solution for property Peterson-COL-4-ReachabilityFireability-05(SAT) depth K=3 took 349000 ms
[2021-05-14 16:45:30] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-4-ReachabilityFireability-13
[2021-05-14 16:45:30] [INFO ] KInduction solution for property Peterson-COL-4-ReachabilityFireability-13(SAT) depth K=3 took 7655 ms
[2021-05-14 16:47:13] [INFO ] BMC solution for property Peterson-COL-4-ReachabilityFireability-05(UNSAT) depth K=4 took 391266 ms
Invariant property Peterson-COL-4-ReachabilityFireability-13 does not hold.
FORMULA Peterson-COL-4-ReachabilityFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property Peterson-COL-4-ReachabilityFireability-05 does not hold.
FORMULA Peterson-COL-4-ReachabilityFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,9.81282e+07,281.133,1369664,24475,273,1.55123e+06,2302,1224,1.17858e+07,99,16540,0
Total reachable state count : 98128193

Verifying 2 reachability properties.
[2021-05-14 16:52:02] [INFO ] BMC solution for property Peterson-COL-4-ReachabilityFireability-13(UNSAT) depth K=4 took 288614 ms
Invariant property Peterson-COL-4-ReachabilityFireability-05 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-COL-4-ReachabilityFireability-05,10562,323.592,1369664,1858,64,1.55123e+06,2302,3106,1.17858e+07,147,16540,0
Invariant property Peterson-COL-4-ReachabilityFireability-13 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-COL-4-ReachabilityFireability-13,719,397.873,1369664,1198,42,1.55123e+06,2302,4022,1.17858e+07,153,16540,0
[2021-05-14 16:56:48] [WARNING] Interrupting SMT solver.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2021-05-14 16:56:48] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:279)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:834)
[2021-05-14 16:56:48] [WARNING] Unexpected error occurred while running SMT. Was verifying Peterson-COL-4-ReachabilityFireability-05 K-induction depth 4
Exception in thread "Thread-32" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:344)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:279)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
... 3 more
[2021-05-14 16:56:48] [INFO ] SMT solved 0/ 2 properties. Interrupting SMT analysis.

BK_STOP 1621011409476

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="Peterson-COL-4"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Peterson-COL-4, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r140-tall-162089128100575"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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