Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 984K
-rw-r--r-- 1 mcc users 7.5K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 11:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 11:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K Feb 25 11:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 25 11:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 613K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678636296863

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0200
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-12 15:51:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 15:51:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 15:51:38] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2023-03-12 15:51:38] [INFO ] Transformed 1001 places.
[2023-03-12 15:51:38] [INFO ] Transformed 1601 transitions.
[2023-03-12 15:51:38] [INFO ] Parsed PT model containing 1001 places and 1601 transitions and 4602 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
Reduce places removed 1 places and 0 transitions.
// Phase 1: matrix 1601 rows 1000 cols
[2023-03-12 15:51:38] [INFO ] Computed 200 place invariants in 40 ms
Incomplete random walk after 10065 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 16) seen :711
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 16) seen :220
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 16) seen :220
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 16) seen :223
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 16) seen :220
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 16) seen :220
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 16) seen :223
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 16) seen :214
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 16) seen :220
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 16) seen :211
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 16) seen :212
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 16) seen :213
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 16) seen :220
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 16) seen :211
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 16) seen :223
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 16) seen :220
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 16) seen :223
[2023-03-12 15:51:40] [INFO ] Invariant cache hit.
[2023-03-12 15:51:40] [INFO ] [Real]Absence check using 200 positive place invariants in 49 ms returned sat
[2023-03-12 15:51:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:51:41] [INFO ] [Real]Absence check using state equation in 493 ms returned sat
[2023-03-12 15:51:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:51:41] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-12 15:51:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:51:42] [INFO ] [Nat]Absence check using state equation in 1493 ms returned sat
[2023-03-12 15:51:42] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-12 15:51:43] [INFO ] [Nat]Added 200 Read/Feed constraints in 146 ms returned sat
[2023-03-12 15:51:43] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 3 ms to minimize.
[2023-03-12 15:51:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 334 ms
[2023-03-12 15:51:43] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 151 ms.
[2023-03-12 15:51:46] [INFO ] Deduced a trap composed of 3 places in 413 ms of which 1 ms to minimize.
[2023-03-12 15:51:46] [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
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 15:51:46] [INFO ] [Real]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-12 15:51:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:51:47] [INFO ] [Real]Absence check using state equation in 377 ms returned sat
[2023-03-12 15:51:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:51:47] [INFO ] [Nat]Absence check using 200 positive place invariants in 47 ms returned sat
[2023-03-12 15:51:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:51:48] [INFO ] [Nat]Absence check using state equation in 1595 ms returned sat
[2023-03-12 15:51:49] [INFO ] [Nat]Added 200 Read/Feed constraints in 297 ms returned sat
[2023-03-12 15:51:49] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 89 ms.
[2023-03-12 15:51:52] [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
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 15:51:52] [INFO ] [Real]Absence check using 200 positive place invariants in 35 ms returned sat
[2023-03-12 15:51:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:51:52] [INFO ] [Real]Absence check using state equation in 367 ms returned sat
[2023-03-12 15:51:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:51:52] [INFO ] [Nat]Absence check using 200 positive place invariants in 36 ms returned sat
[2023-03-12 15:51:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:51:54] [INFO ] [Nat]Absence check using state equation in 1566 ms returned sat
[2023-03-12 15:51:54] [INFO ] [Nat]Added 200 Read/Feed constraints in 152 ms returned sat
[2023-03-12 15:51:54] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 79 ms.
[2023-03-12 15:51: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 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 15:51:57] [INFO ] [Real]Absence check using 200 positive place invariants in 35 ms returned sat
[2023-03-12 15:51:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:51:58] [INFO ] [Real]Absence check using state equation in 358 ms returned sat
[2023-03-12 15:51:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:51:58] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-12 15:51:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:52:00] [INFO ] [Nat]Absence check using state equation in 1465 ms returned sat
[2023-03-12 15:52:00] [INFO ] [Nat]Added 200 Read/Feed constraints in 129 ms returned sat
[2023-03-12 15:52:00] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 68 ms.
[2023-03-12 15:52:03] [INFO ] Added : 190 causal constraints over 38 iterations in 3223 ms. Result :unknown
[2023-03-12 15:52:03] [INFO ] [Real]Absence check using 200 positive place invariants in 35 ms returned sat
[2023-03-12 15:52:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:52:03] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2023-03-12 15:52:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:52:04] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-12 15:52:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:52:07] [INFO ] [Nat]Absence check using state equation in 3266 ms returned sat
[2023-03-12 15:52:07] [INFO ] [Nat]Added 200 Read/Feed constraints in 93 ms returned sat
[2023-03-12 15:52:07] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 66 ms.
[2023-03-12 15:52:09] [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
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 15:52:09] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-12 15:52:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:52:09] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2023-03-12 15:52:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:52:09] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-12 15:52:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:52:11] [INFO ] [Nat]Absence check using state equation in 1516 ms returned sat
[2023-03-12 15:52:11] [INFO ] [Nat]Added 200 Read/Feed constraints in 134 ms returned sat
[2023-03-12 15:52:11] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 72 ms.
[2023-03-12 15:52:14] [INFO ] Deduced a trap composed of 3 places in 401 ms of which 2 ms to minimize.
[2023-03-12 15:52:14] [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
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 15:52:15] [INFO ] [Real]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-12 15:52:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:52:15] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2023-03-12 15:52:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:52:15] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-12 15:52:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:52:19] [INFO ] [Nat]Absence check using state equation in 3671 ms returned sat
[2023-03-12 15:52:19] [INFO ] [Nat]Added 200 Read/Feed constraints in 100 ms returned sat
[2023-03-12 15:52:19] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 71 ms.
[2023-03-12 15:52:20] [INFO ] Deduced a trap composed of 3 places in 378 ms of which 4 ms to minimize.
[2023-03-12 15:52:20] [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 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 15:52:21] [INFO ] [Real]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-12 15:52:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:52:21] [INFO ] [Real]Absence check using state equation in 363 ms returned sat
[2023-03-12 15:52:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:52:21] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-12 15:52:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:52:23] [INFO ] [Nat]Absence check using state equation in 1462 ms returned sat
[2023-03-12 15:52:23] [INFO ] [Nat]Added 200 Read/Feed constraints in 144 ms returned sat
[2023-03-12 15:52:23] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 71 ms.
[2023-03-12 15:52:26] [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 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 15:52:26] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-12 15:52:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:52:26] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2023-03-12 15:52:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:52:27] [INFO ] [Nat]Absence check using 200 positive place invariants in 36 ms returned sat
[2023-03-12 15:52:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:52:28] [INFO ] [Nat]Absence check using state equation in 1540 ms returned sat
[2023-03-12 15:52:28] [INFO ] [Nat]Added 200 Read/Feed constraints in 109 ms returned sat
[2023-03-12 15:52:28] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 63 ms.
[2023-03-12 15:52:32] [INFO ] Added : 190 causal constraints over 38 iterations in 3169 ms. Result :unknown
[2023-03-12 15:52:32] [INFO ] [Real]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-12 15:52:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:52:32] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2023-03-12 15:52:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:52:32] [INFO ] [Nat]Absence check using 200 positive place invariants in 37 ms returned sat
[2023-03-12 15:52:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:52:34] [INFO ] [Nat]Absence check using state equation in 1416 ms returned sat
[2023-03-12 15:52:34] [INFO ] [Nat]Added 200 Read/Feed constraints in 117 ms returned sat
[2023-03-12 15:52:34] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 63 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2023-03-12 15:52:38] [INFO ] Deduced a trap composed of 3 places in 433 ms of which 1 ms to minimize.
[2023-03-12 15:52:38] [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 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 15:52:38] [INFO ] [Real]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-12 15:52:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:52:38] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[2023-03-12 15:52:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:52:38] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-12 15:52:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:52:40] [INFO ] [Nat]Absence check using state equation in 1524 ms returned sat
[2023-03-12 15:52:40] [INFO ] [Nat]Added 200 Read/Feed constraints in 129 ms returned sat
[2023-03-12 15:52:40] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 69 ms.
[2023-03-12 15:52:43] [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: Broken pipe ... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 15:52:43] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-12 15:52:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:52:44] [INFO ] [Real]Absence check using state equation in 367 ms returned sat
[2023-03-12 15:52:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:52:44] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-12 15:52:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:52:45] [INFO ] [Nat]Absence check using state equation in 1574 ms returned sat
[2023-03-12 15:52:45] [INFO ] [Nat]Added 200 Read/Feed constraints in 87 ms returned sat
[2023-03-12 15:52:46] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-12 15:52:46] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-12 15:52:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 243 ms
[2023-03-12 15:52:46] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 64 ms.
[2023-03-12 15:52:49] [INFO ] Added : 180 causal constraints over 36 iterations in 2974 ms. Result :unknown
[2023-03-12 15:52:49] [INFO ] [Real]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-12 15:52:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:52:49] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2023-03-12 15:52:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:52:49] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2023-03-12 15:52:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:52:51] [INFO ] [Nat]Absence check using state equation in 1725 ms returned sat
[2023-03-12 15:52:51] [INFO ] [Nat]Added 200 Read/Feed constraints in 116 ms returned sat
[2023-03-12 15:52:51] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 62 ms.
[2023-03-12 15:52:54] [INFO ] Added : 65 causal constraints over 13 iterations in 2976 ms. Result :unknown
[2023-03-12 15:52:54] [INFO ] [Real]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-12 15:52:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:52:55] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2023-03-12 15:52:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:52:55] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-12 15:52:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:52:56] [INFO ] [Nat]Absence check using state equation in 1509 ms returned sat
[2023-03-12 15:52:57] [INFO ] [Nat]Added 200 Read/Feed constraints in 129 ms returned sat
[2023-03-12 15:52:57] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 62 ms.
[2023-03-12 15:53:00] [INFO ] Deduced a trap composed of 3 places in 376 ms of which 1 ms to minimize.
[2023-03-12 15:53: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 13
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 15:53:00] [INFO ] [Real]Absence check using 200 positive place invariants in 31 ms returned sat
[2023-03-12 15:53:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:53:01] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2023-03-12 15:53:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:53:01] [INFO ] [Nat]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-12 15:53:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:53:03] [INFO ] [Nat]Absence check using state equation in 1923 ms returned sat
[2023-03-12 15:53:06] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 15:53:06] [INFO ] [Nat]Added 200 Read/Feed constraints in 2958 ms returned unknown
[2023-03-12 15:53:06] [INFO ] [Real]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-12 15:53:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:53:06] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2023-03-12 15:53:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:53:06] [INFO ] [Nat]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-12 15:53:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:53:08] [INFO ] [Nat]Absence check using state equation in 1524 ms returned sat
[2023-03-12 15:53:08] [INFO ] [Nat]Added 200 Read/Feed constraints in 126 ms returned sat
[2023-03-12 15:53:08] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 63 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2023-03-12 15:53:12] [INFO ] Deduced a trap composed of 3 places in 373 ms of which 0 ms to minimize.
[2023-03-12 15:53:12] [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 15
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203] Max seen :[9, 201, 12, 9, 201, 12, 2, 100, 200, 2, 2, 9, 2, 12, 10, 12]
Support contains 16 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Graph (complete) has 2400 edges and 1000 vertex of which 80 are kept as prefixes of interest. Removing 920 places using SCC suffix rule.4 ms
Discarding 920 places :
Also discarding 1472 output transitions
Drop transitions removed 1472 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 80 transition count 128
Applied a total of 2 rules in 26 ms. Remains 80 /1000 variables (removed 920) and now considering 128/1601 (removed 1473) transitions.
// Phase 1: matrix 128 rows 80 cols
[2023-03-12 15:55:12] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-12 15:55:12] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 80/1000 places, 128/1601 transitions.
[2023-03-12 15:55:12] [INFO ] Invariant cache hit.
Incomplete random walk after 1000008 steps, including 2 resets, run finished after 1036 ms. (steps per millisecond=965 ) properties (out of 16) seen :3199
FORMULA JoinFreeModules-PT-0200-UpperBounds-05 203 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1122 ms. (steps per millisecond=891 ) properties (out of 15) seen :731
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1083 ms. (steps per millisecond=923 ) properties (out of 15) seen :699
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1112 ms. (steps per millisecond=899 ) properties (out of 15) seen :748
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1108 ms. (steps per millisecond=902 ) properties (out of 15) seen :752
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1092 ms. (steps per millisecond=915 ) properties (out of 15) seen :748
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1118 ms. (steps per millisecond=894 ) properties (out of 15) seen :640
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1108 ms. (steps per millisecond=902 ) properties (out of 15) seen :747
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1093 ms. (steps per millisecond=914 ) properties (out of 15) seen :574
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1116 ms. (steps per millisecond=896 ) properties (out of 15) seen :648
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1118 ms. (steps per millisecond=894 ) properties (out of 15) seen :641
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1108 ms. (steps per millisecond=902 ) properties (out of 15) seen :732
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1119 ms. (steps per millisecond=893 ) properties (out of 15) seen :668
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1098 ms. (steps per millisecond=910 ) properties (out of 15) seen :755
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1086 ms. (steps per millisecond=920 ) properties (out of 15) seen :741
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1103 ms. (steps per millisecond=906 ) properties (out of 15) seen :763
[2023-03-12 15:55:29] [INFO ] Invariant cache hit.
[2023-03-12 15:55:29] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 15:55:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:29] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-12 15:55:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:55:29] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 15:55:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:30] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-12 15:55:30] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-12 15:55:30] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-12 15:55:30] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-12 15:55:30] [INFO ] Added : 66 causal constraints over 14 iterations in 182 ms. Result :sat
Minimization took 52 ms.
[2023-03-12 15:55:30] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 15:55:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:30] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-12 15:55:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:55:30] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 15:55:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:30] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-12 15:55:30] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-12 15:55:30] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-12 15:55:30] [INFO ] Added : 46 causal constraints over 11 iterations in 118 ms. Result :sat
Minimization took 46 ms.
[2023-03-12 15:55:30] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 15:55:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:30] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-12 15:55:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:55:30] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 15:55:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:30] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2023-03-12 15:55:30] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-12 15:55:30] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-12 15:55:30] [INFO ] Added : 45 causal constraints over 9 iterations in 144 ms. Result :sat
Minimization took 38 ms.
[2023-03-12 15:55:31] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 15:55:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:31] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-12 15:55:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:55:31] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 15:55:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:31] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-12 15:55:31] [INFO ] [Nat]Added 16 Read/Feed constraints in 27 ms returned sat
[2023-03-12 15:55:31] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-12 15:55:31] [INFO ] Added : 40 causal constraints over 9 iterations in 119 ms. Result :sat
Minimization took 52 ms.
[2023-03-12 15:55:31] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 15:55:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:31] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-12 15:55:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:55:31] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 15:55:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:31] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2023-03-12 15:55:31] [INFO ] [Nat]Added 16 Read/Feed constraints in 9 ms returned sat
[2023-03-12 15:55:31] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-12 15:55:31] [INFO ] Added : 45 causal constraints over 10 iterations in 128 ms. Result :sat
Minimization took 50 ms.
[2023-03-12 15:55:31] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 15:55:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:31] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-12 15:55:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:55:31] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 15:55:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:31] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2023-03-12 15:55:31] [INFO ] [Nat]Added 16 Read/Feed constraints in 1 ms returned sat
[2023-03-12 15:55:31] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-12 15:55:32] [INFO ] Added : 51 causal constraints over 11 iterations in 141 ms. Result :sat
Minimization took 48 ms.
[2023-03-12 15:55:32] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 15:55:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:32] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-12 15:55:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:55:32] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 15:55:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:32] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2023-03-12 15:55:32] [INFO ] [Nat]Added 16 Read/Feed constraints in 20 ms returned sat
[2023-03-12 15:55:32] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-12 15:55:32] [INFO ] Added : 36 causal constraints over 8 iterations in 84 ms. Result :sat
Minimization took 46 ms.
[2023-03-12 15:55:32] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 15:55:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:32] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-12 15:55:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:55:32] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 15:55:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:32] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2023-03-12 15:55:32] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-12 15:55:32] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-12 15:55:32] [INFO ] Added : 59 causal constraints over 12 iterations in 141 ms. Result :sat
Minimization took 39 ms.
[2023-03-12 15:55:32] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 15:55:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:32] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-12 15:55:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:55:32] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 15:55:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:32] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2023-03-12 15:55:32] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-12 15:55:32] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-12 15:55:33] [INFO ] Added : 55 causal constraints over 13 iterations in 142 ms. Result :sat
Minimization took 46 ms.
[2023-03-12 15:55:33] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 15:55:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:33] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-12 15:55:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:55:33] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-12 15:55:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:33] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-12 15:55:33] [INFO ] [Nat]Added 16 Read/Feed constraints in 18 ms returned sat
[2023-03-12 15:55:33] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-12 15:55:33] [INFO ] Added : 50 causal constraints over 11 iterations in 303 ms. Result :sat
Minimization took 36 ms.
[2023-03-12 15:55:33] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-12 15:55:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:33] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-12 15:55:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:55:33] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 15:55:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:35] [INFO ] [Nat]Absence check using state equation in 1728 ms returned sat
[2023-03-12 15:55:35] [INFO ] [Nat]Added 16 Read/Feed constraints in 9 ms returned sat
[2023-03-12 15:55:35] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-12 15:55:35] [INFO ] Added : 60 causal constraints over 13 iterations in 168 ms. Result :sat
Minimization took 64 ms.
[2023-03-12 15:55:35] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 15:55:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:35] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-12 15:55:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:55:35] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 15:55:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:35] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2023-03-12 15:55:35] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-12 15:55:35] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-12 15:55:36] [INFO ] Added : 53 causal constraints over 11 iterations in 129 ms. Result :sat
Minimization took 51 ms.
[2023-03-12 15:55:36] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 15:55:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:36] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-12 15:55:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:55:36] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 15:55:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:36] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2023-03-12 15:55:36] [INFO ] [Nat]Added 16 Read/Feed constraints in 8 ms returned sat
[2023-03-12 15:55:36] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-12 15:55:36] [INFO ] Added : 47 causal constraints over 10 iterations in 99 ms. Result :sat
Minimization took 28 ms.
[2023-03-12 15:55:36] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 15:55:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:36] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-12 15:55:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:55:36] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 15:55:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:36] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2023-03-12 15:55:36] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-12 15:55:36] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-12 15:55:36] [INFO ] Added : 51 causal constraints over 11 iterations in 174 ms. Result :sat
Minimization took 33 ms.
[2023-03-12 15:55:36] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 15:55:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:36] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-12 15:55:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:55:36] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-12 15:55:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:36] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2023-03-12 15:55:36] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-12 15:55:36] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-12 15:55:37] [INFO ] Added : 42 causal constraints over 11 iterations in 110 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : [203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203] Max seen :[199, 201, 202, 199, 201, 197, 201, 200, 197, 200, 200, 200, 202, 201, 202]
FORMULA JoinFreeModules-PT-0200-UpperBounds-15 203 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA JoinFreeModules-PT-0200-UpperBounds-02 203 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 13 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Graph (complete) has 192 edges and 80 vertex of which 65 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 5 ms. Remains 65 /80 variables (removed 15) and now considering 104/128 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 65/80 places, 104/128 transitions.
// Phase 1: matrix 104 rows 65 cols
[2023-03-12 15:55:38] [INFO ] Computed 13 place invariants in 2 ms
Incomplete random walk after 1000029 steps, including 2 resets, run finished after 869 ms. (steps per millisecond=1150 ) properties (out of 13) seen :2585
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 925 ms. (steps per millisecond=1081 ) properties (out of 13) seen :811
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 902 ms. (steps per millisecond=1108 ) properties (out of 13) seen :738
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 921 ms. (steps per millisecond=1085 ) properties (out of 13) seen :778
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 890 ms. (steps per millisecond=1123 ) properties (out of 13) seen :809
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 951 ms. (steps per millisecond=1051 ) properties (out of 13) seen :726
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 920 ms. (steps per millisecond=1086 ) properties (out of 13) seen :779
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 910 ms. (steps per millisecond=1098 ) properties (out of 13) seen :586
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 926 ms. (steps per millisecond=1079 ) properties (out of 13) seen :745
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 925 ms. (steps per millisecond=1081 ) properties (out of 13) seen :742
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 929 ms. (steps per millisecond=1076 ) properties (out of 13) seen :803
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 925 ms. (steps per millisecond=1081 ) properties (out of 13) seen :726
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 925 ms. (steps per millisecond=1081 ) properties (out of 13) seen :777
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 896 ms. (steps per millisecond=1116 ) properties (out of 13) seen :760
[2023-03-12 15:55:51] [INFO ] Invariant cache hit.
[2023-03-12 15:55:51] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-12 15:55:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:51] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-12 15:55:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:55:51] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-12 15:55:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:51] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2023-03-12 15:55:51] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-12 15:55:51] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2023-03-12 15:55:51] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-12 15:55:51] [INFO ] Added : 38 causal constraints over 8 iterations in 102 ms. Result :sat
Minimization took 54 ms.
[2023-03-12 15:55:51] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-12 15:55:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:51] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-12 15:55:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:55:51] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-12 15:55:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:51] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-12 15:55:51] [INFO ] [Nat]Added 13 Read/Feed constraints in 6 ms returned sat
[2023-03-12 15:55:51] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-12 15:55:51] [INFO ] Added : 40 causal constraints over 8 iterations in 131 ms. Result :sat
Minimization took 44 ms.
[2023-03-12 15:55:51] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-12 15:55:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:52] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-12 15:55:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:55:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-12 15:55:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:52] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2023-03-12 15:55:52] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2023-03-12 15:55:52] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-12 15:55:52] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-12 15:55:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-12 15:55:52] [INFO ] Added : 38 causal constraints over 10 iterations in 137 ms. Result :sat
Minimization took 38 ms.
[2023-03-12 15:55:52] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-12 15:55:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:52] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-12 15:55:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:55:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-12 15:55:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:52] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2023-03-12 15:55:52] [INFO ] [Nat]Added 13 Read/Feed constraints in 4 ms returned sat
[2023-03-12 15:55:52] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-12 15:55:52] [INFO ] Added : 49 causal constraints over 12 iterations in 130 ms. Result :sat
Minimization took 43 ms.
[2023-03-12 15:55:52] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-12 15:55:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:52] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-12 15:55:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:55:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-12 15:55:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:52] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-12 15:55:52] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2023-03-12 15:55:52] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2023-03-12 15:55:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-12 15:55:52] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-12 15:55:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:52] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-12 15:55:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:55:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-12 15:55:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:52] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-12 15:55:52] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2023-03-12 15:55:52] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-12 15:55:53] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-12 15:55:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-12 15:55:53] [INFO ] Added : 46 causal constraints over 11 iterations in 153 ms. Result :sat
Minimization took 34 ms.
[2023-03-12 15:55:53] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-12 15:55:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:53] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-12 15:55:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:55:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-12 15:55:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:53] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2023-03-12 15:55:53] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2023-03-12 15:55:53] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-12 15:55:53] [INFO ] Added : 42 causal constraints over 10 iterations in 114 ms. Result :sat
Minimization took 33 ms.
[2023-03-12 15:55:53] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-12 15:55:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:53] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-12 15:55:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:55:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-12 15:55:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:53] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-03-12 15:55:53] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2023-03-12 15:55:53] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-12 15:55:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-12 15:55:53] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-12 15:55:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:53] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-12 15:55:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:55:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-12 15:55:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:53] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2023-03-12 15:55:53] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2023-03-12 15:55:53] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2023-03-12 15:55:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2023-03-12 15:55:53] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-12 15:55:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:53] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-12 15:55:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:55:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-12 15:55:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:53] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-12 15:55:53] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2023-03-12 15:55:53] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-12 15:55:54] [INFO ] Added : 35 causal constraints over 8 iterations in 98 ms. Result :sat
Minimization took 39 ms.
[2023-03-12 15:55:54] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-12 15:55:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:54] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-12 15:55:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:55:54] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-12 15:55:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:54] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2023-03-12 15:55:54] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2023-03-12 15:55:54] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2023-03-12 15:55:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-12 15:55:54] [INFO ] [Real]Absence check using 13 positive place invariants in 1 ms returned sat
[2023-03-12 15:55:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:54] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-12 15:55:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:55:54] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-12 15:55:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:54] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-12 15:55:54] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2023-03-12 15:55:54] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-12 15:55:54] [INFO ] Added : 53 causal constraints over 11 iterations in 119 ms. Result :sat
Minimization took 38 ms.
[2023-03-12 15:55:54] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-12 15:55:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:54] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-12 15:55:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:55:54] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-12 15:55:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:55:54] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2023-03-12 15:55:54] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2023-03-12 15:55:54] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-12 15:55:54] [INFO ] Added : 46 causal constraints over 10 iterations in 118 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [203, 203, 203, 203, 202, 203, 203, 202, 202, 203, 202, 203, 203] Max seen :[200, 201, 200, 201, 202, 201, 200, 202, 202, 200, 202, 202, 201]
FORMULA JoinFreeModules-PT-0200-UpperBounds-12 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0200-UpperBounds-10 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0200-UpperBounds-09 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0200-UpperBounds-06 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 9 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 45 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.2 ms
Discarding 20 places :
Also discarding 32 output transitions
Drop transitions removed 32 transitions
Applied a total of 1 rules in 9 ms. Remains 45 /65 variables (removed 20) and now considering 72/104 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 45/65 places, 72/104 transitions.
// Phase 1: matrix 72 rows 45 cols
[2023-03-12 15:55:55] [INFO ] Computed 9 place invariants in 0 ms
Incomplete random walk after 1000012 steps, including 2 resets, run finished after 580 ms. (steps per millisecond=1724 ) properties (out of 9) seen :1799
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 636 ms. (steps per millisecond=1572 ) properties (out of 9) seen :1011
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 626 ms. (steps per millisecond=1597 ) properties (out of 9) seen :899
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 634 ms. (steps per millisecond=1577 ) properties (out of 9) seen :980
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 621 ms. (steps per millisecond=1610 ) properties (out of 9) seen :883
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 637 ms. (steps per millisecond=1569 ) properties (out of 9) seen :1004
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 631 ms. (steps per millisecond=1584 ) properties (out of 9) seen :828
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 628 ms. (steps per millisecond=1592 ) properties (out of 9) seen :990
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 633 ms. (steps per millisecond=1579 ) properties (out of 9) seen :995
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 620 ms. (steps per millisecond=1612 ) properties (out of 9) seen :885
[2023-03-12 15:56:01] [INFO ] Invariant cache hit.
[2023-03-12 15:56:01] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 15:56:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:01] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-12 15:56:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:56:01] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-12 15:56:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:01] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2023-03-12 15:56:01] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-12 15:56:01] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2023-03-12 15:56:01] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2023-03-12 15:56:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-03-12 15:56:02] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-12 15:56:02] [INFO ] Added : 19 causal constraints over 4 iterations in 48 ms. Result :sat
Minimization took 19 ms.
[2023-03-12 15:56:02] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 15:56:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:02] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-12 15:56:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:56:02] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 15:56:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:02] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2023-03-12 15:56:02] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2023-03-12 15:56:02] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-12 15:56:02] [INFO ] Added : 27 causal constraints over 6 iterations in 39 ms. Result :sat
Minimization took 23 ms.
[2023-03-12 15:56:02] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 15:56:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:02] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-12 15:56:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:56:02] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 15:56:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:02] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-12 15:56:02] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2023-03-12 15:56:02] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-12 15:56:02] [INFO ] Added : 39 causal constraints over 9 iterations in 80 ms. Result :sat
Minimization took 30 ms.
[2023-03-12 15:56:02] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-12 15:56:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:02] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-12 15:56:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:56:02] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-12 15:56:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:02] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-12 15:56:02] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2023-03-12 15:56:02] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-12 15:56:02] [INFO ] Added : 37 causal constraints over 8 iterations in 74 ms. Result :sat
Minimization took 34 ms.
[2023-03-12 15:56:02] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 15:56:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:02] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-12 15:56:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:56:02] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 15:56:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:02] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-12 15:56:02] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2023-03-12 15:56:02] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 15:56:02] [INFO ] Added : 24 causal constraints over 6 iterations in 59 ms. Result :sat
Minimization took 25 ms.
[2023-03-12 15:56:02] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 15:56:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:02] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-12 15:56:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:56:03] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 15:56:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:03] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-12 15:56:03] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2023-03-12 15:56:03] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-12 15:56:03] [INFO ] Added : 30 causal constraints over 7 iterations in 103 ms. Result :sat
Minimization took 18 ms.
[2023-03-12 15:56:03] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-12 15:56:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:03] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-12 15:56:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:56:03] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 15:56:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:03] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2023-03-12 15:56:03] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2023-03-12 15:56:03] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-12 15:56:03] [INFO ] Added : 30 causal constraints over 7 iterations in 46 ms. Result :sat
Minimization took 34 ms.
[2023-03-12 15:56:03] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 15:56:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:03] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-12 15:56:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:56:03] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 15:56:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:03] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-12 15:56:03] [INFO ] [Nat]Added 9 Read/Feed constraints in 12 ms returned sat
[2023-03-12 15:56:03] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-12 15:56:03] [INFO ] Added : 24 causal constraints over 5 iterations in 37 ms. Result :sat
Minimization took 32 ms.
[2023-03-12 15:56:03] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-12 15:56:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:03] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-12 15:56:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:56:03] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-12 15:56:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:03] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-12 15:56:03] [INFO ] [Nat]Added 9 Read/Feed constraints in 7 ms returned sat
[2023-03-12 15:56:03] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-12 15:56:03] [INFO ] Added : 21 causal constraints over 6 iterations in 41 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [203, 203, 203, 203, 203, 203, 203, 203, 203] Max seen :[201, 201, 201, 201, 201, 200, 200, 202, 201]
FORMULA JoinFreeModules-PT-0200-UpperBounds-13 203 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 8 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 72/72 transitions.
Graph (complete) has 108 edges and 45 vertex of which 40 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 2 ms. Remains 40 /45 variables (removed 5) and now considering 64/72 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 40/45 places, 64/72 transitions.
// Phase 1: matrix 64 rows 40 cols
[2023-03-12 15:56:04] [INFO ] Computed 8 place invariants in 2 ms
Incomplete random walk after 1000055 steps, including 2 resets, run finished after 537 ms. (steps per millisecond=1862 ) properties (out of 8) seen :1599
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 582 ms. (steps per millisecond=1718 ) properties (out of 8) seen :1049
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 569 ms. (steps per millisecond=1757 ) properties (out of 8) seen :879
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 588 ms. (steps per millisecond=1700 ) properties (out of 8) seen :1056
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 564 ms. (steps per millisecond=1773 ) properties (out of 8) seen :871
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 592 ms. (steps per millisecond=1689 ) properties (out of 8) seen :1061
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 584 ms. (steps per millisecond=1712 ) properties (out of 8) seen :888
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 580 ms. (steps per millisecond=1724 ) properties (out of 8) seen :1041
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 567 ms. (steps per millisecond=1763 ) properties (out of 8) seen :876
[2023-03-12 15:56:09] [INFO ] Invariant cache hit.
[2023-03-12 15:56:09] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:56:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:09] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-12 15:56:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:56:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:56:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:09] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-12 15:56:09] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 15:56:09] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-12 15:56:09] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 15:56:09] [INFO ] Added : 28 causal constraints over 8 iterations in 71 ms. Result :sat
Minimization took 22 ms.
[2023-03-12 15:56:09] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:56:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:09] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-12 15:56:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:56:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 15:56:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:09] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-12 15:56:09] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-12 15:56:09] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-12 15:56:09] [INFO ] Added : 14 causal constraints over 4 iterations in 39 ms. Result :sat
Minimization took 20 ms.
[2023-03-12 15:56:09] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 15:56:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:09] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-12 15:56:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:56:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 15:56:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:09] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-12 15:56:09] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-12 15:56:09] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 15:56:09] [INFO ] Added : 16 causal constraints over 5 iterations in 35 ms. Result :sat
Minimization took 27 ms.
[2023-03-12 15:56:09] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:56:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:09] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-12 15:56:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:56:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:56:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:10] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-12 15:56:10] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2023-03-12 15:56:10] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-12 15:56:10] [INFO ] Added : 18 causal constraints over 4 iterations in 33 ms. Result :sat
Minimization took 16 ms.
[2023-03-12 15:56:10] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 15:56:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:10] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-12 15:56:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:56:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:56:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:10] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-12 15:56:10] [INFO ] [Nat]Added 8 Read/Feed constraints in 12 ms returned sat
[2023-03-12 15:56:10] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-12 15:56:10] [INFO ] Added : 20 causal constraints over 5 iterations in 59 ms. Result :sat
Minimization took 25 ms.
[2023-03-12 15:56:10] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 15:56:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:10] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-12 15:56:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:56:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 15:56:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:10] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2023-03-12 15:56:10] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-12 15:56:10] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-12 15:56:10] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2023-03-12 15:56:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2023-03-12 15:56:10] [INFO ] Added : 17 causal constraints over 5 iterations in 59 ms. Result :sat
Minimization took 15 ms.
[2023-03-12 15:56:10] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 15:56:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:10] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-12 15:56:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:56:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 15:56:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:10] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-12 15:56:10] [INFO ] [Nat]Added 8 Read/Feed constraints in 33 ms returned sat
[2023-03-12 15:56:10] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-12 15:56:10] [INFO ] Added : 23 causal constraints over 6 iterations in 62 ms. Result :sat
Minimization took 22 ms.
[2023-03-12 15:56:10] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 15:56:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:10] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-12 15:56:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:56:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 15:56:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:10] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-12 15:56:10] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-12 15:56:10] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-12 15:56:10] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2023-03-12 15:56:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2023-03-12 15:56:10] [INFO ] Added : 21 causal constraints over 5 iterations in 80 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [203, 203, 203, 203, 203, 203, 203, 203] Max seen :[201, 201, 201, 201, 201, 200, 201, 201]
Support contains 8 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 40 /40 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 40/40 places, 64/64 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-12 15:56:11] [INFO ] Invariant cache hit.
[2023-03-12 15:56:11] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-12 15:56:11] [INFO ] Invariant cache hit.
[2023-03-12 15:56:11] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 15:56:11] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-12 15:56:11] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 15:56:11] [INFO ] Invariant cache hit.
[2023-03-12 15:56:11] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 40/40 places, 64/64 transitions.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-00
[2023-03-12 15:56:11] [INFO ] Invariant cache hit.
Incomplete random walk after 10024 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2004 ) properties (out of 1) seen :187
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :108
[2023-03-12 15:56:11] [INFO ] Invariant cache hit.
[2023-03-12 15:56:11] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 15:56:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:11] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-12 15:56:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:56:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 15:56:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:11] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-12 15:56:11] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 15:56:11] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2023-03-12 15:56:11] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-12 15:56:11] [INFO ] Added : 23 causal constraints over 6 iterations in 51 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[187]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-12 15:56:11] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 15:56:11] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 5/40 places, 8/64 transitions.
[2023-03-12 15:56:11] [INFO ] Invariant cache hit.
Incomplete random walk after 1000063 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=8475 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=7352 ) properties (out of 1) seen :200
[2023-03-12 15:56:11] [INFO ] Invariant cache hit.
[2023-03-12 15:56:11] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 15:56:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:11] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-12 15:56:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:56:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 15:56:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:11] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-12 15:56:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:56:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-12 15:56:11] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 15:56:11] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[200]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-12 15:56:11] [INFO ] Invariant cache hit.
[2023-03-12 15:56:11] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-12 15:56:11] [INFO ] Invariant cache hit.
[2023-03-12 15:56:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:56:12] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-12 15:56:12] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 15:56:12] [INFO ] Invariant cache hit.
[2023-03-12 15:56:12] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 5/5 places, 8/8 transitions.
[2023-03-12 15:56:12] [INFO ] Invariant cache hit.
Incomplete random walk after 1000008 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=8620 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=7462 ) properties (out of 1) seen :198
[2023-03-12 15:56:12] [INFO ] Invariant cache hit.
[2023-03-12 15:56:12] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 15:56:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:12] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-12 15:56:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:56:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 15:56:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:12] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-12 15:56:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:56:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-12 15:56:12] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-12 15:56:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2023-03-12 15:56:12] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-12 15:56:12] [INFO ] Added : 5 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-12 15:56:12] [INFO ] Invariant cache hit.
[2023-03-12 15:56:12] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-12 15:56:12] [INFO ] Invariant cache hit.
[2023-03-12 15:56:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:56:12] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2023-03-12 15:56:12] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 15:56:12] [INFO ] Invariant cache hit.
[2023-03-12 15:56:12] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-00 in 1102 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-01
// Phase 1: matrix 64 rows 40 cols
[2023-03-12 15:56:12] [INFO ] Computed 8 place invariants in 0 ms
Incomplete random walk after 10006 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :187
[2023-03-12 15:56:12] [INFO ] Invariant cache hit.
[2023-03-12 15:56:12] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 15:56:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:12] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-12 15:56:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:56:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:56:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:12] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-12 15:56:12] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 15:56:12] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-12 15:56:12] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-12 15:56:12] [INFO ] Added : 14 causal constraints over 4 iterations in 42 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-12 15:56:12] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 15:56:12] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 5/40 places, 8/64 transitions.
[2023-03-12 15:56:12] [INFO ] Invariant cache hit.
Incomplete random walk after 1000037 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=8403 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=4347 ) properties (out of 1) seen :201
[2023-03-12 15:56:13] [INFO ] Invariant cache hit.
[2023-03-12 15:56:13] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 15:56:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:13] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-12 15:56:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:56:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 15:56:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:13] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-12 15:56:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:56:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-12 15:56:13] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 15:56:13] [INFO ] Added : 6 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-12 15:56:13] [INFO ] Invariant cache hit.
[2023-03-12 15:56:13] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-12 15:56:13] [INFO ] Invariant cache hit.
[2023-03-12 15:56:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:56:13] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-12 15:56:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 15:56:13] [INFO ] Invariant cache hit.
[2023-03-12 15:56:13] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-01 in 754 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-03
// Phase 1: matrix 64 rows 40 cols
[2023-03-12 15:56:13] [INFO ] Computed 8 place invariants in 0 ms
Incomplete random walk after 10007 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :192
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :112
[2023-03-12 15:56:13] [INFO ] Invariant cache hit.
[2023-03-12 15:56:13] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:56:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:13] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-12 15:56:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:56:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:56:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:13] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-12 15:56:13] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 15:56:13] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-12 15:56:13] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-12 15:56:13] [INFO ] Added : 11 causal constraints over 3 iterations in 34 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[192]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.1 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-12 15:56:13] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 15:56:13] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 5/40 places, 8/64 transitions.
[2023-03-12 15:56:13] [INFO ] Invariant cache hit.
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=8403 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=6289 ) properties (out of 1) seen :198
[2023-03-12 15:56:13] [INFO ] Invariant cache hit.
[2023-03-12 15:56:13] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 15:56:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:13] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-12 15:56:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:56:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 15:56:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:13] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-12 15:56:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:56:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-12 15:56:13] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-12 15:56:13] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[200]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-12 15:56:13] [INFO ] Invariant cache hit.
[2023-03-12 15:56:13] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-12 15:56:13] [INFO ] Invariant cache hit.
[2023-03-12 15:56:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:56:13] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-12 15:56:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 15:56:13] [INFO ] Invariant cache hit.
[2023-03-12 15:56:13] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 5/5 places, 8/8 transitions.
[2023-03-12 15:56:13] [INFO ] Invariant cache hit.
Incomplete random walk after 1000007 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=8771 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=7194 ) properties (out of 1) seen :200
[2023-03-12 15:56:14] [INFO ] Invariant cache hit.
[2023-03-12 15:56:14] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 15:56:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:14] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-12 15:56:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:56:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 15:56:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:14] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-12 15:56:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:56:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-12 15:56:14] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2023-03-12 15:56:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 17 ms
[2023-03-12 15:56:14] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 15:56:14] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-12 15:56:14] [INFO ] Invariant cache hit.
[2023-03-12 15:56:14] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-12 15:56:14] [INFO ] Invariant cache hit.
[2023-03-12 15:56:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:56:14] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-12 15:56:14] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 15:56:14] [INFO ] Invariant cache hit.
[2023-03-12 15:56:14] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-03 in 1111 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-04
// Phase 1: matrix 64 rows 40 cols
[2023-03-12 15:56:14] [INFO ] Computed 8 place invariants in 1 ms
Incomplete random walk after 10092 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1682 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :187
[2023-03-12 15:56:14] [INFO ] Invariant cache hit.
[2023-03-12 15:56:14] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 15:56:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:14] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-12 15:56:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:56:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 15:56:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:14] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-12 15:56:14] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 15:56:14] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-12 15:56:14] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-12 15:56:14] [INFO ] Added : 18 causal constraints over 4 iterations in 33 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-12 15:56:14] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 15:56:14] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 5/40 places, 8/64 transitions.
[2023-03-12 15:56:14] [INFO ] Invariant cache hit.
Incomplete random walk after 1000071 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=8621 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=5988 ) properties (out of 1) seen :201
[2023-03-12 15:56:14] [INFO ] Invariant cache hit.
[2023-03-12 15:56:14] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 15:56:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:14] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-12 15:56:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:56:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 15:56:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:14] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-12 15:56:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:56:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-12 15:56:14] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-12 15:56:14] [INFO ] Added : 6 causal constraints over 3 iterations in 8 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-12 15:56:14] [INFO ] Invariant cache hit.
[2023-03-12 15:56:14] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-12 15:56:14] [INFO ] Invariant cache hit.
[2023-03-12 15:56:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:56:14] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-12 15:56:14] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 15:56:14] [INFO ] Invariant cache hit.
[2023-03-12 15:56:14] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-04 in 640 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-07
// Phase 1: matrix 64 rows 40 cols
[2023-03-12 15:56:14] [INFO ] Computed 8 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :162
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :104
[2023-03-12 15:56:14] [INFO ] Invariant cache hit.
[2023-03-12 15:56:14] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:56:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:14] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-12 15:56:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:56:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 15:56:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:15] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-12 15:56:15] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 15:56:15] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-12 15:56:15] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-12 15:56:15] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-12 15:56:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2023-03-12 15:56:15] [INFO ] Added : 21 causal constraints over 6 iterations in 89 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[162]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-12 15:56:15] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 15:56:15] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 5/40 places, 8/64 transitions.
[2023-03-12 15:56:15] [INFO ] Invariant cache hit.
Incomplete random walk after 1000007 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=8928 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=7194 ) properties (out of 1) seen :200
[2023-03-12 15:56:15] [INFO ] Invariant cache hit.
[2023-03-12 15:56:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 15:56:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:15] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-12 15:56:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:56:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 15:56:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:15] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-12 15:56:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:56:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-12 15:56:15] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 15:56:15] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[200]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-12 15:56:15] [INFO ] Invariant cache hit.
[2023-03-12 15:56:15] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-12 15:56:15] [INFO ] Invariant cache hit.
[2023-03-12 15:56:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:56:15] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-12 15:56:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 15:56:15] [INFO ] Invariant cache hit.
[2023-03-12 15:56:15] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 5/5 places, 8/8 transitions.
[2023-03-12 15:56:15] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=8695 ) properties (out of 1) seen :199
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=6756 ) properties (out of 1) seen :200
[2023-03-12 15:56:15] [INFO ] Invariant cache hit.
[2023-03-12 15:56:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 15:56:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:15] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-12 15:56:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:56:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 15:56:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:16] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-12 15:56:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:56:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-12 15:56:16] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2023-03-12 15:56:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2023-03-12 15:56:16] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 15:56:16] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-12 15:56:16] [INFO ] Invariant cache hit.
[2023-03-12 15:56:16] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-12 15:56:16] [INFO ] Invariant cache hit.
[2023-03-12 15:56:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:56:16] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-12 15:56:16] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 15:56:16] [INFO ] Invariant cache hit.
[2023-03-12 15:56:16] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-07 in 1197 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-08
// Phase 1: matrix 64 rows 40 cols
[2023-03-12 15:56:16] [INFO ] Computed 8 place invariants in 0 ms
Incomplete random walk after 10003 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :200
[2023-03-12 15:56:16] [INFO ] Invariant cache hit.
[2023-03-12 15:56:16] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:56:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:16] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-12 15:56:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:56:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 15:56:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:16] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2023-03-12 15:56:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 15:56:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-12 15:56:16] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-12 15:56:16] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-12 15:56:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2023-03-12 15:56:16] [INFO ] Added : 17 causal constraints over 5 iterations in 66 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[200]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-12 15:56:16] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 15:56:16] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 5/40 places, 8/64 transitions.
[2023-03-12 15:56:16] [INFO ] Invariant cache hit.
Incomplete random walk after 1000015 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=9009 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=6578 ) properties (out of 1) seen :200
[2023-03-12 15:56:16] [INFO ] Invariant cache hit.
[2023-03-12 15:56:16] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 15:56:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:16] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-12 15:56:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:56:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 15:56:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:16] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-12 15:56:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:56:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-12 15:56:16] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 15:56:16] [INFO ] Added : 6 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[200]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-12 15:56:16] [INFO ] Invariant cache hit.
[2023-03-12 15:56:16] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-12 15:56:16] [INFO ] Invariant cache hit.
[2023-03-12 15:56:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:56:16] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2023-03-12 15:56:16] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 15:56:16] [INFO ] Invariant cache hit.
[2023-03-12 15:56:16] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-08 in 710 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-11
// Phase 1: matrix 64 rows 40 cols
[2023-03-12 15:56:16] [INFO ] Computed 8 place invariants in 1 ms
Incomplete random walk after 10035 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1254 ) properties (out of 1) seen :157
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :108
[2023-03-12 15:56:16] [INFO ] Invariant cache hit.
[2023-03-12 15:56:16] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:56:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:16] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-12 15:56:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:56:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 15:56:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:16] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-12 15:56:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 15:56:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-12 15:56:16] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-12 15:56:17] [INFO ] Added : 23 causal constraints over 5 iterations in 57 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[157]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-12 15:56:17] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 15:56:17] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 5/40 places, 8/64 transitions.
[2023-03-12 15:56:17] [INFO ] Invariant cache hit.
Incomplete random walk after 1000006 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=8403 ) properties (out of 1) seen :199
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=7194 ) properties (out of 1) seen :200
[2023-03-12 15:56:17] [INFO ] Invariant cache hit.
[2023-03-12 15:56:17] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 15:56:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:17] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-12 15:56:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:56:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 15:56:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:17] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-12 15:56:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:56:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-12 15:56:17] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-03-12 15:56:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2023-03-12 15:56:17] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 15:56:17] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-12 15:56:17] [INFO ] Invariant cache hit.
[2023-03-12 15:56:17] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-12 15:56:17] [INFO ] Invariant cache hit.
[2023-03-12 15:56:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:56:17] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-12 15:56:17] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 15:56:17] [INFO ] Invariant cache hit.
[2023-03-12 15:56:17] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-11 in 734 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-14
// Phase 1: matrix 64 rows 40 cols
[2023-03-12 15:56:17] [INFO ] Computed 8 place invariants in 1 ms
Incomplete random walk after 10017 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=834 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :187
[2023-03-12 15:56:17] [INFO ] Invariant cache hit.
[2023-03-12 15:56:17] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 15:56:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:17] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-12 15:56:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:56:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 15:56:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:17] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-12 15:56:17] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 15:56:17] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-12 15:56:17] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-12 15:56:17] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-12 15:56:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-03-12 15:56:17] [INFO ] Added : 21 causal constraints over 5 iterations in 83 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-12 15:56:17] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 15:56:17] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 5/40 places, 8/64 transitions.
[2023-03-12 15:56:17] [INFO ] Invariant cache hit.
Incomplete random walk after 1000008 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=8772 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=6211 ) properties (out of 1) seen :201
[2023-03-12 15:56:18] [INFO ] Invariant cache hit.
[2023-03-12 15:56:18] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 15:56:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:18] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-12 15:56:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:56:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 15:56:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:56:18] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-12 15:56:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:56:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2023-03-12 15:56:18] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 15:56:18] [INFO ] Added : 6 causal constraints over 3 iterations in 9 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-12 15:56:18] [INFO ] Invariant cache hit.
[2023-03-12 15:56:18] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-12 15:56:18] [INFO ] Invariant cache hit.
[2023-03-12 15:56:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 15:56:18] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2023-03-12 15:56:18] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 15:56:18] [INFO ] Invariant cache hit.
[2023-03-12 15:56:18] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-14 in 684 ms.
[2023-03-12 15:56:18] [INFO ] Flatten gal took : 22 ms
[2023-03-12 15:56:18] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-12 15:56:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 40 places, 64 transitions and 168 arcs took 1 ms.
Total runtime 280151 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running JoinFreeModules (PT), instance 0200
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 40 places, 64 transitions, 168 arcs.
Final Score: 176.184
Took : 1 seconds
Bounds file is: UpperBounds.xml
FORMULA JoinFreeModules-PT-0200-UpperBounds-00 202 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA JoinFreeModules-PT-0200-UpperBounds-01 201 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA JoinFreeModules-PT-0200-UpperBounds-03 202 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA JoinFreeModules-PT-0200-UpperBounds-04 201 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA JoinFreeModules-PT-0200-UpperBounds-07 202 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA JoinFreeModules-PT-0200-UpperBounds-08 200 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA JoinFreeModules-PT-0200-UpperBounds-11 202 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA JoinFreeModules-PT-0200-UpperBounds-14 201 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1678636583023

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="JoinFreeModules-PT-0200"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is JoinFreeModules-PT-0200, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r235-tall-167856421400197"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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