About the Execution of Smart+red for PolyORBNT-PT-S10J30
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6498.928 | 3600000.00 | 3662867.00 | 7675.00 | 1 2 1 1 4 10 1 1 3 ? 1 1 1 1 ? 1 | normal |
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.r299-tall-167873953400765.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 PolyORBNT-PT-S10J30, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r299-tall-167873953400765
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 20K Feb 26 00:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 26 00:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 973K Feb 26 00:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.4M Feb 26 00:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 98K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 306K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 50K Feb 26 01:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 245K Feb 26 01:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 343K Feb 26 01:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.4M Feb 26 01:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 14M Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679547512967
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=PolyORBNT-PT-S10J30
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 04:58:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 04:58:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 04:58:35] [INFO ] Load time of PNML (sax parser for PT used): 608 ms
[2023-03-23 04:58:35] [INFO ] Transformed 664 places.
[2023-03-23 04:58:35] [INFO ] Transformed 12050 transitions.
[2023-03-23 04:58:35] [INFO ] Parsed PT model containing 664 places and 12050 transitions and 112559 arcs in 756 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Normalized transition count is 1931 out of 1940 initially.
// Phase 1: matrix 1931 rows 664 cols
[2023-03-23 04:58:35] [INFO ] Computed 92 place invariants in 135 ms
FORMULA PolyORBNT-PT-S10J30-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 559 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :20
FORMULA PolyORBNT-PT-S10J30-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :13
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 12) seen :13
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :13
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :13
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :13
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :13
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :13
[2023-03-23 04:58:36] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2023-03-23 04:58:36] [INFO ] Computed 92 place invariants in 59 ms
[2023-03-23 04:58:36] [INFO ] [Real]Absence check using 63 positive place invariants in 27 ms returned sat
[2023-03-23 04:58:36] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 23 ms returned unsat
[2023-03-23 04:58:36] [INFO ] [Real]Absence check using 63 positive place invariants in 15 ms returned sat
[2023-03-23 04:58:36] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 19 ms returned sat
[2023-03-23 04:58:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:58:37] [INFO ] [Real]Absence check using state equation in 719 ms returned sat
[2023-03-23 04:58:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:58:37] [INFO ] [Nat]Absence check using 63 positive place invariants in 14 ms returned sat
[2023-03-23 04:58:37] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 19 ms returned sat
[2023-03-23 04:58:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:58:40] [INFO ] [Nat]Absence check using state equation in 3438 ms returned sat
[2023-03-23 04:58:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 04:58:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 14 ms returned sat
[2023-03-23 04:58:41] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 208 ms.
[2023-03-23 04:58:41] [INFO ] Added : 28 causal constraints over 6 iterations in 813 ms. Result :sat
Minimization took 536 ms.
[2023-03-23 04:58:42] [INFO ] [Real]Absence check using 63 positive place invariants in 14 ms returned sat
[2023-03-23 04:58:42] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 13 ms returned unsat
[2023-03-23 04:58:42] [INFO ] [Real]Absence check using 63 positive place invariants in 17 ms returned sat
[2023-03-23 04:58:42] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 22 ms returned sat
[2023-03-23 04:58:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:58:43] [INFO ] [Real]Absence check using state equation in 639 ms returned sat
[2023-03-23 04:58:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:58:43] [INFO ] [Nat]Absence check using 63 positive place invariants in 16 ms returned sat
[2023-03-23 04:58:43] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 19 ms returned sat
[2023-03-23 04:58:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:58:44] [INFO ] [Nat]Absence check using state equation in 1028 ms returned sat
[2023-03-23 04:58:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 235 ms returned sat
[2023-03-23 04:58:44] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 123 ms.
[2023-03-23 04:58:48] [INFO ] Added : 5 causal constraints over 1 iterations in 3568 ms. Result :unknown
[2023-03-23 04:58:48] [INFO ] [Real]Absence check using 63 positive place invariants in 14 ms returned sat
[2023-03-23 04:58:48] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 18 ms returned sat
[2023-03-23 04:58:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:58:48] [INFO ] [Real]Absence check using state equation in 372 ms returned unsat
[2023-03-23 04:58:48] [INFO ] [Real]Absence check using 63 positive place invariants in 14 ms returned sat
[2023-03-23 04:58:48] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 19 ms returned unsat
[2023-03-23 04:58:48] [INFO ] [Real]Absence check using 63 positive place invariants in 14 ms returned sat
[2023-03-23 04:58:49] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 19 ms returned unsat
[2023-03-23 04:58:49] [INFO ] [Real]Absence check using 63 positive place invariants in 16 ms returned sat
[2023-03-23 04:58:49] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 18 ms returned sat
[2023-03-23 04:58:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:58:49] [INFO ] [Real]Absence check using state equation in 699 ms returned sat
[2023-03-23 04:58:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:58:49] [INFO ] [Nat]Absence check using 63 positive place invariants in 18 ms returned sat
[2023-03-23 04:58:49] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 35 ms returned sat
[2023-03-23 04:58:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:58:51] [INFO ] [Nat]Absence check using state equation in 1059 ms returned sat
[2023-03-23 04:58:54] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 04:58:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 3831 ms returned unknown
[2023-03-23 04:58:54] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-23 04:58:54] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 18 ms returned sat
[2023-03-23 04:58:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:58:55] [INFO ] [Real]Absence check using state equation in 629 ms returned sat
[2023-03-23 04:58:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:58:55] [INFO ] [Nat]Absence check using 63 positive place invariants in 22 ms returned sat
[2023-03-23 04:58:55] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 18 ms returned sat
[2023-03-23 04:58:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:58:57] [INFO ] [Nat]Absence check using state equation in 1404 ms returned sat
[2023-03-23 04:58:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 173 ms returned sat
[2023-03-23 04:58:57] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 124 ms.
[2023-03-23 04:58:57] [INFO ] Added : 12 causal constraints over 3 iterations in 459 ms. Result :sat
Minimization took 778 ms.
[2023-03-23 04:58:58] [INFO ] [Real]Absence check using 63 positive place invariants in 14 ms returned sat
[2023-03-23 04:58:58] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 23 ms returned sat
[2023-03-23 04:58:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:58:59] [INFO ] [Real]Absence check using state equation in 476 ms returned sat
[2023-03-23 04:58:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:58:59] [INFO ] [Nat]Absence check using 63 positive place invariants in 14 ms returned sat
[2023-03-23 04:58:59] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 20 ms returned sat
[2023-03-23 04:58:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:59:04] [INFO ] [Nat]Absence check using state equation in 4901 ms returned unknown
[2023-03-23 04:59:04] [INFO ] [Real]Absence check using 63 positive place invariants in 15 ms returned sat
[2023-03-23 04:59:04] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 18 ms returned unsat
[2023-03-23 04:59:04] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-23 04:59:04] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 19 ms returned sat
[2023-03-23 04:59:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:59:05] [INFO ] [Real]Absence check using state equation in 882 ms returned sat
[2023-03-23 04:59:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:59:05] [INFO ] [Nat]Absence check using 63 positive place invariants in 15 ms returned sat
[2023-03-23 04:59:05] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 28 ms returned sat
[2023-03-23 04:59:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:59:06] [INFO ] [Nat]Absence check using state equation in 1066 ms returned sat
[2023-03-23 04:59:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 437 ms returned sat
[2023-03-23 04:59:07] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 135 ms.
[2023-03-23 04:59:07] [INFO ] Added : 12 causal constraints over 3 iterations in 481 ms. Result :sat
Minimization took 1405 ms.
Current structural bounds on expressions (after SMT) : [1, 151, 1, 280, 10, 1, 1, 226, 302, 4, 1, 302] Max seen :[1, 0, 1, 1, 10, 1, 1, 0, 1, 0, 1, 1]
FORMULA PolyORBNT-PT-S10J30-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 15 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 654 transition count 1905
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 81 place count 619 transition count 1904
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 618 transition count 1904
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 82 place count 618 transition count 1870
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 150 place count 584 transition count 1870
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 151 place count 583 transition count 1869
Iterating global reduction 3 with 1 rules applied. Total rules applied 152 place count 583 transition count 1869
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 156 place count 581 transition count 1867
Applied a total of 156 rules in 334 ms. Remains 581 /664 variables (removed 83) and now considering 1867/1940 (removed 73) transitions.
[2023-03-23 04:59:09] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
// Phase 1: matrix 1858 rows 581 cols
[2023-03-23 04:59:09] [INFO ] Computed 82 place invariants in 36 ms
[2023-03-23 04:59:10] [INFO ] Dead Transitions using invariants and state equation in 966 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 581/664 places, 1252/1940 transitions.
Applied a total of 0 rules in 35 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1339 ms. Remains : 581/664 places, 1252/1940 transitions.
Normalized transition count is 1243 out of 1252 initially.
// Phase 1: matrix 1243 rows 581 cols
[2023-03-23 04:59:10] [INFO ] Computed 82 place invariants in 31 ms
Incomplete random walk after 1000000 steps, including 70390 resets, run finished after 6945 ms. (steps per millisecond=143 ) properties (out of 6) seen :16
Incomplete Best-First random walk after 1000001 steps, including 8893 resets, run finished after 1410 ms. (steps per millisecond=709 ) properties (out of 6) seen :16
Incomplete Best-First random walk after 1000001 steps, including 5984 resets, run finished after 1455 ms. (steps per millisecond=687 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000001 steps, including 8862 resets, run finished after 1414 ms. (steps per millisecond=707 ) properties (out of 6) seen :16
Incomplete Best-First random walk after 1000001 steps, including 8862 resets, run finished after 1416 ms. (steps per millisecond=706 ) properties (out of 6) seen :14
Incomplete Best-First random walk after 1000001 steps, including 8845 resets, run finished after 1412 ms. (steps per millisecond=708 ) properties (out of 6) seen :16
Incomplete Best-First random walk after 1000001 steps, including 8910 resets, run finished after 1423 ms. (steps per millisecond=702 ) properties (out of 6) seen :14
[2023-03-23 04:59:26] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-23 04:59:26] [INFO ] Computed 82 place invariants in 24 ms
[2023-03-23 04:59:26] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-23 04:59:26] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 5 ms returned unsat
[2023-03-23 04:59:26] [INFO ] [Real]Absence check using 63 positive place invariants in 12 ms returned sat
[2023-03-23 04:59:26] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 5 ms returned unsat
[2023-03-23 04:59:26] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-23 04:59:26] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 5 ms returned unsat
[2023-03-23 04:59:26] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-23 04:59:26] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 19 ms returned sat
[2023-03-23 04:59:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:59:27] [INFO ] [Real]Absence check using state equation in 1131 ms returned sat
[2023-03-23 04:59:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:59:27] [INFO ] [Nat]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-23 04:59:27] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 21 ms returned sat
[2023-03-23 04:59:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:59:28] [INFO ] [Nat]Absence check using state equation in 540 ms returned sat
[2023-03-23 04:59:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 04:59:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 1087 ms returned sat
[2023-03-23 04:59:29] [INFO ] Deduced a trap composed of 234 places in 287 ms of which 4 ms to minimize.
[2023-03-23 04:59:30] [INFO ] Deduced a trap composed of 216 places in 315 ms of which 1 ms to minimize.
[2023-03-23 04:59:30] [INFO ] Deduced a trap composed of 243 places in 278 ms of which 1 ms to minimize.
[2023-03-23 04:59:30] [INFO ] Deduced a trap composed of 236 places in 284 ms of which 2 ms to minimize.
[2023-03-23 04:59:31] [INFO ] Deduced a trap composed of 234 places in 277 ms of which 0 ms to minimize.
[2023-03-23 04:59:31] [INFO ] Deduced a trap composed of 234 places in 268 ms of which 1 ms to minimize.
[2023-03-23 04:59:31] [INFO ] Deduced a trap composed of 222 places in 273 ms of which 1 ms to minimize.
[2023-03-23 04:59:32] [INFO ] Deduced a trap composed of 240 places in 278 ms of which 1 ms to minimize.
[2023-03-23 04:59:32] [INFO ] Deduced a trap composed of 230 places in 261 ms of which 0 ms to minimize.
[2023-03-23 04:59:32] [INFO ] Deduced a trap composed of 228 places in 259 ms of which 0 ms to minimize.
[2023-03-23 04:59:33] [INFO ] Deduced a trap composed of 226 places in 259 ms of which 0 ms to minimize.
[2023-03-23 04:59:33] [INFO ] Deduced a trap composed of 234 places in 261 ms of which 0 ms to minimize.
[2023-03-23 04:59:33] [INFO ] Deduced a trap composed of 232 places in 260 ms of which 1 ms to minimize.
[2023-03-23 04:59:34] [INFO ] Deduced a trap composed of 228 places in 269 ms of which 1 ms to minimize.
[2023-03-23 04:59:34] [INFO ] Deduced a trap composed of 239 places in 261 ms of which 0 ms to minimize.
[2023-03-23 04:59:35] [INFO ] Deduced a trap composed of 228 places in 258 ms of which 1 ms to minimize.
[2023-03-23 04:59:36] [INFO ] Deduced a trap composed of 230 places in 249 ms of which 0 ms to minimize.
[2023-03-23 04:59:36] [INFO ] Deduced a trap composed of 222 places in 258 ms of which 0 ms to minimize.
[2023-03-23 04:59:37] [INFO ] Deduced a trap composed of 238 places in 276 ms of which 0 ms to minimize.
[2023-03-23 04:59:38] [INFO ] Deduced a trap composed of 226 places in 275 ms of which 0 ms to minimize.
[2023-03-23 04:59:38] [INFO ] Deduced a trap composed of 234 places in 269 ms of which 1 ms to minimize.
[2023-03-23 04:59:38] [INFO ] Deduced a trap composed of 216 places in 267 ms of which 0 ms to minimize.
[2023-03-23 04:59:38] [INFO ] Deduced a trap composed of 230 places in 284 ms of which 1 ms to minimize.
[2023-03-23 04:59:39] [INFO ] Deduced a trap composed of 224 places in 273 ms of which 0 ms to minimize.
[2023-03-23 04:59:39] [INFO ] Deduced a trap composed of 234 places in 257 ms of which 0 ms to minimize.
[2023-03-23 04:59:40] [INFO ] Deduced a trap composed of 226 places in 257 ms of which 0 ms to minimize.
[2023-03-23 04:59:40] [INFO ] Deduced a trap composed of 228 places in 263 ms of which 1 ms to minimize.
[2023-03-23 04:59:41] [INFO ] Deduced a trap composed of 230 places in 263 ms of which 1 ms to minimize.
[2023-03-23 04:59:41] [INFO ] Deduced a trap composed of 238 places in 261 ms of which 0 ms to minimize.
[2023-03-23 04:59:42] [INFO ] Deduced a trap composed of 232 places in 256 ms of which 0 ms to minimize.
[2023-03-23 04:59:42] [INFO ] Deduced a trap composed of 230 places in 249 ms of which 1 ms to minimize.
[2023-03-23 04:59:42] [INFO ] Deduced a trap composed of 243 places in 264 ms of which 0 ms to minimize.
[2023-03-23 04:59:43] [INFO ] Deduced a trap composed of 238 places in 258 ms of which 1 ms to minimize.
[2023-03-23 04:59:43] [INFO ] Deduced a trap composed of 238 places in 251 ms of which 1 ms to minimize.
[2023-03-23 04:59:43] [INFO ] Deduced a trap composed of 234 places in 256 ms of which 2 ms to minimize.
[2023-03-23 04:59:44] [INFO ] Deduced a trap composed of 236 places in 261 ms of which 1 ms to minimize.
[2023-03-23 04:59:44] [INFO ] Deduced a trap composed of 234 places in 255 ms of which 1 ms to minimize.
[2023-03-23 04:59:44] [INFO ] Deduced a trap composed of 230 places in 258 ms of which 0 ms to minimize.
[2023-03-23 04:59:45] [INFO ] Deduced a trap composed of 242 places in 259 ms of which 0 ms to minimize.
[2023-03-23 04:59:45] [INFO ] Deduced a trap composed of 230 places in 263 ms of which 0 ms to minimize.
[2023-03-23 04:59:45] [INFO ] Deduced a trap composed of 232 places in 266 ms of which 0 ms to minimize.
[2023-03-23 04:59:46] [INFO ] Deduced a trap composed of 237 places in 259 ms of which 0 ms to minimize.
[2023-03-23 04:59:46] [INFO ] Deduced a trap composed of 244 places in 260 ms of which 0 ms to minimize.
[2023-03-23 04:59:47] [INFO ] Deduced a trap composed of 232 places in 267 ms of which 0 ms to minimize.
[2023-03-23 04:59:47] [INFO ] Deduced a trap composed of 230 places in 262 ms of which 0 ms to minimize.
[2023-03-23 04:59:47] [INFO ] Deduced a trap composed of 236 places in 259 ms of which 1 ms to minimize.
[2023-03-23 04:59:47] [INFO ] Deduced a trap composed of 224 places in 256 ms of which 0 ms to minimize.
[2023-03-23 04:59:48] [INFO ] Deduced a trap composed of 236 places in 255 ms of which 0 ms to minimize.
[2023-03-23 04:59:48] [INFO ] Deduced a trap composed of 228 places in 263 ms of which 1 ms to minimize.
[2023-03-23 04:59:49] [INFO ] Deduced a trap composed of 222 places in 251 ms of which 1 ms to minimize.
[2023-03-23 04:59:49] [INFO ] Deduced a trap composed of 232 places in 270 ms of which 1 ms to minimize.
[2023-03-23 04:59:50] [INFO ] Deduced a trap composed of 226 places in 262 ms of which 0 ms to minimize.
[2023-03-23 04:59:50] [INFO ] Deduced a trap composed of 226 places in 254 ms of which 1 ms to minimize.
[2023-03-23 04:59:50] [INFO ] Deduced a trap composed of 234 places in 252 ms of which 0 ms to minimize.
[2023-03-23 04:59:51] [INFO ] Deduced a trap composed of 228 places in 261 ms of which 1 ms to minimize.
[2023-03-23 04:59:51] [INFO ] Deduced a trap composed of 229 places in 262 ms of which 5 ms to minimize.
[2023-03-23 04:59:52] [INFO ] Deduced a trap composed of 236 places in 254 ms of which 0 ms to minimize.
[2023-03-23 04:59:52] [INFO ] Deduced a trap composed of 232 places in 259 ms of which 0 ms to minimize.
[2023-03-23 04:59:52] [INFO ] Deduced a trap composed of 230 places in 265 ms of which 0 ms to minimize.
[2023-03-23 04:59:53] [INFO ] Deduced a trap composed of 228 places in 274 ms of which 1 ms to minimize.
[2023-03-23 04:59:53] [INFO ] Deduced a trap composed of 234 places in 284 ms of which 1 ms to minimize.
[2023-03-23 04:59:53] [INFO ] Deduced a trap composed of 236 places in 261 ms of which 0 ms to minimize.
[2023-03-23 04:59:54] [INFO ] Deduced a trap composed of 242 places in 275 ms of which 0 ms to minimize.
[2023-03-23 04:59:54] [INFO ] Deduced a trap composed of 222 places in 257 ms of which 1 ms to minimize.
[2023-03-23 04:59:54] [INFO ] Deduced a trap composed of 228 places in 306 ms of which 2 ms to minimize.
[2023-03-23 04:59:55] [INFO ] Deduced a trap composed of 234 places in 268 ms of which 0 ms to minimize.
[2023-03-23 04:59:55] [INFO ] Deduced a trap composed of 226 places in 266 ms of which 2 ms to minimize.
[2023-03-23 04:59:55] [INFO ] Deduced a trap composed of 234 places in 273 ms of which 9 ms to minimize.
[2023-03-23 04:59:56] [INFO ] Deduced a trap composed of 242 places in 262 ms of which 1 ms to minimize.
[2023-03-23 04:59:56] [INFO ] Deduced a trap composed of 230 places in 265 ms of which 1 ms to minimize.
[2023-03-23 04:59:58] [INFO ] Deduced a trap composed of 226 places in 263 ms of which 1 ms to minimize.
[2023-03-23 04:59:58] [INFO ] Deduced a trap composed of 230 places in 261 ms of which 0 ms to minimize.
[2023-03-23 04:59:59] [INFO ] Deduced a trap composed of 232 places in 253 ms of which 0 ms to minimize.
[2023-03-23 04:59:59] [INFO ] Deduced a trap composed of 234 places in 261 ms of which 1 ms to minimize.
[2023-03-23 05:00:00] [INFO ] Deduced a trap composed of 232 places in 257 ms of which 1 ms to minimize.
[2023-03-23 05:00:00] [INFO ] Deduced a trap composed of 236 places in 265 ms of which 1 ms to minimize.
[2023-03-23 05:00:00] [INFO ] Deduced a trap composed of 228 places in 259 ms of which 0 ms to minimize.
[2023-03-23 05:00:01] [INFO ] Deduced a trap composed of 231 places in 257 ms of which 1 ms to minimize.
[2023-03-23 05:00:01] [INFO ] Deduced a trap composed of 232 places in 263 ms of which 0 ms to minimize.
[2023-03-23 05:00:02] [INFO ] Deduced a trap composed of 234 places in 269 ms of which 1 ms to minimize.
[2023-03-23 05:00:02] [INFO ] Deduced a trap composed of 234 places in 257 ms of which 1 ms to minimize.
[2023-03-23 05:00:02] [INFO ] Deduced a trap composed of 234 places in 264 ms of which 1 ms to minimize.
[2023-03-23 05:00:03] [INFO ] Deduced a trap composed of 239 places in 266 ms of which 1 ms to minimize.
[2023-03-23 05:00:06] [INFO ] Trap strengthening (SAT) tested/added 83/83 trap constraints in 36749 ms
[2023-03-23 05:00:06] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-23 05:00:06] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 3 ms returned unsat
[2023-03-23 05:00:06] [INFO ] [Real]Absence check using 63 positive place invariants in 12 ms returned sat
[2023-03-23 05:00:06] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 13 ms returned sat
[2023-03-23 05:00:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 05:00:07] [INFO ] [Real]Absence check using state equation in 1137 ms returned sat
[2023-03-23 05:00:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 05:00:07] [INFO ] [Nat]Absence check using 63 positive place invariants in 16 ms returned sat
[2023-03-23 05:00:07] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 12 ms returned sat
[2023-03-23 05:00:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 05:00:08] [INFO ] [Nat]Absence check using state equation in 751 ms returned sat
[2023-03-23 05:00:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 455 ms returned sat
[2023-03-23 05:00:09] [INFO ] Deduced a trap composed of 250 places in 260 ms of which 0 ms to minimize.
[2023-03-23 05:00:09] [INFO ] Deduced a trap composed of 228 places in 257 ms of which 0 ms to minimize.
[2023-03-23 05:00:09] [INFO ] Deduced a trap composed of 228 places in 265 ms of which 1 ms to minimize.
[2023-03-23 05:00:10] [INFO ] Deduced a trap composed of 238 places in 264 ms of which 1 ms to minimize.
[2023-03-23 05:00:10] [INFO ] Deduced a trap composed of 237 places in 261 ms of which 0 ms to minimize.
[2023-03-23 05:00:10] [INFO ] Deduced a trap composed of 241 places in 254 ms of which 0 ms to minimize.
[2023-03-23 05:00:10] [INFO ] Deduced a trap composed of 222 places in 254 ms of which 0 ms to minimize.
[2023-03-23 05:00:11] [INFO ] Deduced a trap composed of 234 places in 255 ms of which 1 ms to minimize.
[2023-03-23 05:00:11] [INFO ] Deduced a trap composed of 232 places in 259 ms of which 0 ms to minimize.
[2023-03-23 05:00:11] [INFO ] Deduced a trap composed of 234 places in 254 ms of which 1 ms to minimize.
[2023-03-23 05:00:12] [INFO ] Deduced a trap composed of 249 places in 263 ms of which 1 ms to minimize.
[2023-03-23 05:00:12] [INFO ] Deduced a trap composed of 233 places in 260 ms of which 0 ms to minimize.
[2023-03-23 05:00:13] [INFO ] Deduced a trap composed of 230 places in 277 ms of which 1 ms to minimize.
[2023-03-23 05:00:13] [INFO ] Deduced a trap composed of 234 places in 269 ms of which 0 ms to minimize.
[2023-03-23 05:00:13] [INFO ] Deduced a trap composed of 230 places in 268 ms of which 1 ms to minimize.
[2023-03-23 05:00:14] [INFO ] Deduced a trap composed of 228 places in 270 ms of which 0 ms to minimize.
[2023-03-23 05:00:14] [INFO ] Deduced a trap composed of 232 places in 250 ms of which 0 ms to minimize.
[2023-03-23 05:00:14] [INFO ] Deduced a trap composed of 234 places in 247 ms of which 0 ms to minimize.
[2023-03-23 05:00:15] [INFO ] Deduced a trap composed of 234 places in 259 ms of which 1 ms to minimize.
[2023-03-23 05:00:15] [INFO ] Deduced a trap composed of 234 places in 261 ms of which 1 ms to minimize.
[2023-03-23 05:00:15] [INFO ] Deduced a trap composed of 230 places in 278 ms of which 16 ms to minimize.
[2023-03-23 05:00:16] [INFO ] Deduced a trap composed of 251 places in 260 ms of which 1 ms to minimize.
[2023-03-23 05:00:17] [INFO ] Deduced a trap composed of 253 places in 257 ms of which 1 ms to minimize.
[2023-03-23 05:00:17] [INFO ] Deduced a trap composed of 228 places in 260 ms of which 0 ms to minimize.
[2023-03-23 05:00:17] [INFO ] Deduced a trap composed of 241 places in 259 ms of which 0 ms to minimize.
[2023-03-23 05:00:18] [INFO ] Deduced a trap composed of 230 places in 253 ms of which 1 ms to minimize.
[2023-03-23 05:00:18] [INFO ] Deduced a trap composed of 232 places in 263 ms of which 0 ms to minimize.
[2023-03-23 05:00:18] [INFO ] Deduced a trap composed of 225 places in 262 ms of which 0 ms to minimize.
[2023-03-23 05:00:19] [INFO ] Deduced a trap composed of 232 places in 253 ms of which 1 ms to minimize.
[2023-03-23 05:00:19] [INFO ] Deduced a trap composed of 226 places in 262 ms of which 0 ms to minimize.
[2023-03-23 05:00:19] [INFO ] Deduced a trap composed of 238 places in 259 ms of which 1 ms to minimize.
[2023-03-23 05:00:20] [INFO ] Deduced a trap composed of 226 places in 286 ms of which 1 ms to minimize.
[2023-03-23 05:00:20] [INFO ] Deduced a trap composed of 236 places in 262 ms of which 1 ms to minimize.
[2023-03-23 05:00:20] [INFO ] Deduced a trap composed of 229 places in 264 ms of which 0 ms to minimize.
[2023-03-23 05:00:21] [INFO ] Deduced a trap composed of 233 places in 258 ms of which 0 ms to minimize.
[2023-03-23 05:00:21] [INFO ] Deduced a trap composed of 232 places in 266 ms of which 1 ms to minimize.
[2023-03-23 05:00:22] [INFO ] Deduced a trap composed of 230 places in 289 ms of which 0 ms to minimize.
[2023-03-23 05:00:22] [INFO ] Deduced a trap composed of 229 places in 263 ms of which 0 ms to minimize.
[2023-03-23 05:00:22] [INFO ] Deduced a trap composed of 241 places in 270 ms of which 1 ms to minimize.
[2023-03-23 05:00:23] [INFO ] Deduced a trap composed of 224 places in 263 ms of which 0 ms to minimize.
[2023-03-23 05:00:23] [INFO ] Deduced a trap composed of 245 places in 259 ms of which 1 ms to minimize.
[2023-03-23 05:00:23] [INFO ] Deduced a trap composed of 232 places in 271 ms of which 1 ms to minimize.
[2023-03-23 05:00:25] [INFO ] Deduced a trap composed of 232 places in 259 ms of which 0 ms to minimize.
[2023-03-23 05:00:25] [INFO ] Deduced a trap composed of 232 places in 262 ms of which 1 ms to minimize.
[2023-03-23 05:00:26] [INFO ] Deduced a trap composed of 230 places in 267 ms of which 1 ms to minimize.
[2023-03-23 05:00:26] [INFO ] Deduced a trap composed of 238 places in 259 ms of which 1 ms to minimize.
[2023-03-23 05:00:27] [INFO ] Deduced a trap composed of 237 places in 256 ms of which 0 ms to minimize.
[2023-03-23 05:00:27] [INFO ] Deduced a trap composed of 232 places in 259 ms of which 0 ms to minimize.
[2023-03-23 05:00:27] [INFO ] Deduced a trap composed of 230 places in 261 ms of which 1 ms to minimize.
[2023-03-23 05:00:28] [INFO ] Deduced a trap composed of 230 places in 261 ms of which 1 ms to minimize.
[2023-03-23 05:00:28] [INFO ] Deduced a trap composed of 239 places in 270 ms of which 1 ms to minimize.
[2023-03-23 05:00:28] [INFO ] Deduced a trap composed of 232 places in 266 ms of which 0 ms to minimize.
[2023-03-23 05:00:29] [INFO ] Deduced a trap composed of 230 places in 263 ms of which 0 ms to minimize.
[2023-03-23 05:00:29] [INFO ] Deduced a trap composed of 228 places in 265 ms of which 0 ms to minimize.
[2023-03-23 05:00:30] [INFO ] Deduced a trap composed of 232 places in 265 ms of which 0 ms to minimize.
[2023-03-23 05:00:30] [INFO ] Deduced a trap composed of 224 places in 261 ms of which 1 ms to minimize.
[2023-03-23 05:00:30] [INFO ] Deduced a trap composed of 234 places in 271 ms of which 1 ms to minimize.
[2023-03-23 05:00:31] [INFO ] Deduced a trap composed of 234 places in 261 ms of which 0 ms to minimize.
[2023-03-23 05:00:31] [INFO ] Deduced a trap composed of 238 places in 252 ms of which 1 ms to minimize.
[2023-03-23 05:00:31] [INFO ] Deduced a trap composed of 250 places in 263 ms of which 2 ms to minimize.
[2023-03-23 05:00:32] [INFO ] Deduced a trap composed of 230 places in 257 ms of which 0 ms to minimize.
[2023-03-23 05:00:32] [INFO ] Deduced a trap composed of 228 places in 270 ms of which 1 ms to minimize.
[2023-03-23 05:00:32] [INFO ] Deduced a trap composed of 236 places in 263 ms of which 0 ms to minimize.
[2023-03-23 05:00:33] [INFO ] Deduced a trap composed of 244 places in 258 ms of which 1 ms to minimize.
[2023-03-23 05:00:34] [INFO ] Deduced a trap composed of 248 places in 260 ms of which 1 ms to minimize.
[2023-03-23 05:00:36] [INFO ] Deduced a trap composed of 237 places in 259 ms of which 0 ms to minimize.
[2023-03-23 05:00:36] [INFO ] Deduced a trap composed of 228 places in 269 ms of which 1 ms to minimize.
[2023-03-23 05:00:37] [INFO ] Deduced a trap composed of 234 places in 257 ms of which 1 ms to minimize.
[2023-03-23 05:00:38] [INFO ] Deduced a trap composed of 240 places in 259 ms of which 1 ms to minimize.
[2023-03-23 05:00:38] [INFO ] Deduced a trap composed of 243 places in 269 ms of which 1 ms to minimize.
[2023-03-23 05:00:39] [INFO ] Deduced a trap composed of 234 places in 285 ms of which 0 ms to minimize.
[2023-03-23 05:00:39] [INFO ] Deduced a trap composed of 241 places in 259 ms of which 0 ms to minimize.
[2023-03-23 05:00:40] [INFO ] Deduced a trap composed of 245 places in 267 ms of which 0 ms to minimize.
[2023-03-23 05:00:40] [INFO ] Deduced a trap composed of 231 places in 257 ms of which 1 ms to minimize.
[2023-03-23 05:00:43] [INFO ] Trap strengthening (SAT) tested/added 74/74 trap constraints in 34575 ms
Current structural bounds on expressions (after SMT) : [2, 4, 3, 60, 1, 60] Max seen :[2, 4, 3, 3, 1, 3]
FORMULA PolyORBNT-PT-S10J30-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-08 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 36 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 581/581 places, 1252/1252 transitions.
Normalized transition count is 1243 out of 1252 initially.
// Phase 1: matrix 1243 rows 581 cols
[2023-03-23 05:00:43] [INFO ] Computed 82 place invariants in 21 ms
Incomplete random walk after 1000000 steps, including 70266 resets, run finished after 6431 ms. (steps per millisecond=155 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 8775 resets, run finished after 1358 ms. (steps per millisecond=736 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 8819 resets, run finished after 1361 ms. (steps per millisecond=734 ) properties (out of 2) seen :4
[2023-03-23 05:00:52] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-23 05:00:52] [INFO ] Computed 82 place invariants in 23 ms
[2023-03-23 05:00:52] [INFO ] [Real]Absence check using 63 positive place invariants in 12 ms returned sat
[2023-03-23 05:00:52] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 12 ms returned sat
[2023-03-23 05:00:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 05:00:53] [INFO ] [Real]Absence check using state equation in 1109 ms returned sat
[2023-03-23 05:00:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 05:00:53] [INFO ] [Nat]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-23 05:00:53] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 12 ms returned sat
[2023-03-23 05:00:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 05:00:54] [INFO ] [Nat]Absence check using state equation in 545 ms returned sat
[2023-03-23 05:00:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 05:00:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 1082 ms returned sat
[2023-03-23 05:00:55] [INFO ] Deduced a trap composed of 234 places in 253 ms of which 1 ms to minimize.
[2023-03-23 05:00:56] [INFO ] Deduced a trap composed of 216 places in 265 ms of which 0 ms to minimize.
[2023-03-23 05:00:56] [INFO ] Deduced a trap composed of 243 places in 261 ms of which 1 ms to minimize.
[2023-03-23 05:00:56] [INFO ] Deduced a trap composed of 236 places in 264 ms of which 0 ms to minimize.
[2023-03-23 05:00:57] [INFO ] Deduced a trap composed of 234 places in 268 ms of which 1 ms to minimize.
[2023-03-23 05:00:57] [INFO ] Deduced a trap composed of 234 places in 258 ms of which 1 ms to minimize.
[2023-03-23 05:00:57] [INFO ] Deduced a trap composed of 222 places in 258 ms of which 1 ms to minimize.
[2023-03-23 05:00:58] [INFO ] Deduced a trap composed of 240 places in 261 ms of which 0 ms to minimize.
[2023-03-23 05:00:58] [INFO ] Deduced a trap composed of 230 places in 260 ms of which 0 ms to minimize.
[2023-03-23 05:00:58] [INFO ] Deduced a trap composed of 228 places in 262 ms of which 1 ms to minimize.
[2023-03-23 05:00:59] [INFO ] Deduced a trap composed of 226 places in 257 ms of which 0 ms to minimize.
[2023-03-23 05:00:59] [INFO ] Deduced a trap composed of 234 places in 255 ms of which 0 ms to minimize.
[2023-03-23 05:00:59] [INFO ] Deduced a trap composed of 232 places in 258 ms of which 0 ms to minimize.
[2023-03-23 05:01:00] [INFO ] Deduced a trap composed of 228 places in 258 ms of which 1 ms to minimize.
[2023-03-23 05:01:00] [INFO ] Deduced a trap composed of 239 places in 258 ms of which 1 ms to minimize.
[2023-03-23 05:01:01] [INFO ] Deduced a trap composed of 228 places in 258 ms of which 0 ms to minimize.
[2023-03-23 05:01:02] [INFO ] Deduced a trap composed of 230 places in 261 ms of which 1 ms to minimize.
[2023-03-23 05:01:02] [INFO ] Deduced a trap composed of 222 places in 257 ms of which 0 ms to minimize.
[2023-03-23 05:01:03] [INFO ] Deduced a trap composed of 238 places in 256 ms of which 0 ms to minimize.
[2023-03-23 05:01:04] [INFO ] Deduced a trap composed of 226 places in 265 ms of which 0 ms to minimize.
[2023-03-23 05:01:04] [INFO ] Deduced a trap composed of 234 places in 265 ms of which 0 ms to minimize.
[2023-03-23 05:01:04] [INFO ] Deduced a trap composed of 216 places in 260 ms of which 1 ms to minimize.
[2023-03-23 05:01:04] [INFO ] Deduced a trap composed of 230 places in 260 ms of which 1 ms to minimize.
[2023-03-23 05:01:05] [INFO ] Deduced a trap composed of 224 places in 263 ms of which 1 ms to minimize.
[2023-03-23 05:01:05] [INFO ] Deduced a trap composed of 234 places in 256 ms of which 0 ms to minimize.
[2023-03-23 05:01:06] [INFO ] Deduced a trap composed of 226 places in 247 ms of which 0 ms to minimize.
[2023-03-23 05:01:06] [INFO ] Deduced a trap composed of 228 places in 272 ms of which 1 ms to minimize.
[2023-03-23 05:01:07] [INFO ] Deduced a trap composed of 230 places in 263 ms of which 0 ms to minimize.
[2023-03-23 05:01:07] [INFO ] Deduced a trap composed of 238 places in 266 ms of which 0 ms to minimize.
[2023-03-23 05:01:08] [INFO ] Deduced a trap composed of 232 places in 257 ms of which 0 ms to minimize.
[2023-03-23 05:01:08] [INFO ] Deduced a trap composed of 230 places in 262 ms of which 0 ms to minimize.
[2023-03-23 05:01:08] [INFO ] Deduced a trap composed of 243 places in 253 ms of which 1 ms to minimize.
[2023-03-23 05:01:09] [INFO ] Deduced a trap composed of 238 places in 258 ms of which 0 ms to minimize.
[2023-03-23 05:01:09] [INFO ] Deduced a trap composed of 238 places in 256 ms of which 1 ms to minimize.
[2023-03-23 05:01:09] [INFO ] Deduced a trap composed of 234 places in 255 ms of which 0 ms to minimize.
[2023-03-23 05:01:10] [INFO ] Deduced a trap composed of 236 places in 270 ms of which 1 ms to minimize.
[2023-03-23 05:01:10] [INFO ] Deduced a trap composed of 234 places in 284 ms of which 0 ms to minimize.
[2023-03-23 05:01:10] [INFO ] Deduced a trap composed of 230 places in 285 ms of which 1 ms to minimize.
[2023-03-23 05:01:11] [INFO ] Deduced a trap composed of 242 places in 286 ms of which 1 ms to minimize.
[2023-03-23 05:01:11] [INFO ] Deduced a trap composed of 230 places in 292 ms of which 1 ms to minimize.
[2023-03-23 05:01:12] [INFO ] Deduced a trap composed of 232 places in 299 ms of which 1 ms to minimize.
[2023-03-23 05:01:12] [INFO ] Deduced a trap composed of 237 places in 289 ms of which 1 ms to minimize.
[2023-03-23 05:01:12] [INFO ] Deduced a trap composed of 244 places in 289 ms of which 1 ms to minimize.
[2023-03-23 05:01:13] [INFO ] Deduced a trap composed of 232 places in 284 ms of which 1 ms to minimize.
[2023-03-23 05:01:13] [INFO ] Deduced a trap composed of 230 places in 286 ms of which 0 ms to minimize.
[2023-03-23 05:01:13] [INFO ] Deduced a trap composed of 236 places in 279 ms of which 1 ms to minimize.
[2023-03-23 05:01:14] [INFO ] Deduced a trap composed of 224 places in 290 ms of which 0 ms to minimize.
[2023-03-23 05:01:14] [INFO ] Deduced a trap composed of 236 places in 264 ms of which 0 ms to minimize.
[2023-03-23 05:01:15] [INFO ] Deduced a trap composed of 228 places in 287 ms of which 1 ms to minimize.
[2023-03-23 05:01:15] [INFO ] Deduced a trap composed of 222 places in 280 ms of which 1 ms to minimize.
[2023-03-23 05:01:16] [INFO ] Deduced a trap composed of 232 places in 282 ms of which 1 ms to minimize.
[2023-03-23 05:01:16] [INFO ] Deduced a trap composed of 226 places in 282 ms of which 0 ms to minimize.
[2023-03-23 05:01:17] [INFO ] Deduced a trap composed of 226 places in 283 ms of which 1 ms to minimize.
[2023-03-23 05:01:17] [INFO ] Deduced a trap composed of 234 places in 277 ms of which 1 ms to minimize.
[2023-03-23 05:01:17] [INFO ] Deduced a trap composed of 228 places in 274 ms of which 1 ms to minimize.
[2023-03-23 05:01:18] [INFO ] Deduced a trap composed of 229 places in 287 ms of which 0 ms to minimize.
[2023-03-23 05:01:18] [INFO ] Deduced a trap composed of 236 places in 284 ms of which 0 ms to minimize.
[2023-03-23 05:01:18] [INFO ] Deduced a trap composed of 232 places in 281 ms of which 1 ms to minimize.
[2023-03-23 05:01:19] [INFO ] Deduced a trap composed of 230 places in 281 ms of which 0 ms to minimize.
[2023-03-23 05:01:19] [INFO ] Deduced a trap composed of 228 places in 278 ms of which 0 ms to minimize.
[2023-03-23 05:01:19] [INFO ] Deduced a trap composed of 234 places in 286 ms of which 0 ms to minimize.
[2023-03-23 05:01:20] [INFO ] Deduced a trap composed of 236 places in 285 ms of which 0 ms to minimize.
[2023-03-23 05:01:20] [INFO ] Deduced a trap composed of 242 places in 281 ms of which 0 ms to minimize.
[2023-03-23 05:01:21] [INFO ] Deduced a trap composed of 222 places in 282 ms of which 0 ms to minimize.
[2023-03-23 05:01:21] [INFO ] Deduced a trap composed of 228 places in 280 ms of which 0 ms to minimize.
[2023-03-23 05:01:21] [INFO ] Deduced a trap composed of 234 places in 279 ms of which 0 ms to minimize.
[2023-03-23 05:01:22] [INFO ] Deduced a trap composed of 226 places in 286 ms of which 0 ms to minimize.
[2023-03-23 05:01:22] [INFO ] Deduced a trap composed of 234 places in 288 ms of which 1 ms to minimize.
[2023-03-23 05:01:22] [INFO ] Deduced a trap composed of 242 places in 281 ms of which 0 ms to minimize.
[2023-03-23 05:01:23] [INFO ] Deduced a trap composed of 230 places in 287 ms of which 1 ms to minimize.
[2023-03-23 05:01:25] [INFO ] Deduced a trap composed of 226 places in 280 ms of which 1 ms to minimize.
[2023-03-23 05:01:25] [INFO ] Deduced a trap composed of 230 places in 280 ms of which 1 ms to minimize.
[2023-03-23 05:01:26] [INFO ] Deduced a trap composed of 232 places in 284 ms of which 1 ms to minimize.
[2023-03-23 05:01:26] [INFO ] Deduced a trap composed of 234 places in 284 ms of which 0 ms to minimize.
[2023-03-23 05:01:26] [INFO ] Deduced a trap composed of 232 places in 274 ms of which 2 ms to minimize.
[2023-03-23 05:01:27] [INFO ] Deduced a trap composed of 236 places in 282 ms of which 1 ms to minimize.
[2023-03-23 05:01:27] [INFO ] Deduced a trap composed of 228 places in 282 ms of which 1 ms to minimize.
[2023-03-23 05:01:28] [INFO ] Deduced a trap composed of 231 places in 272 ms of which 1 ms to minimize.
[2023-03-23 05:01:28] [INFO ] Deduced a trap composed of 232 places in 279 ms of which 1 ms to minimize.
[2023-03-23 05:01:28] [INFO ] Deduced a trap composed of 234 places in 282 ms of which 1 ms to minimize.
[2023-03-23 05:01:29] [INFO ] Deduced a trap composed of 234 places in 283 ms of which 1 ms to minimize.
[2023-03-23 05:01:29] [INFO ] Deduced a trap composed of 234 places in 284 ms of which 1 ms to minimize.
[2023-03-23 05:01:30] [INFO ] Deduced a trap composed of 239 places in 275 ms of which 0 ms to minimize.
[2023-03-23 05:01:33] [INFO ] Trap strengthening (SAT) tested/added 83/83 trap constraints in 37480 ms
[2023-03-23 05:01:33] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-23 05:01:33] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 13 ms returned sat
[2023-03-23 05:01:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 05:01:34] [INFO ] [Real]Absence check using state equation in 1164 ms returned sat
[2023-03-23 05:01:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 05:01:34] [INFO ] [Nat]Absence check using 63 positive place invariants in 14 ms returned sat
[2023-03-23 05:01:34] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 14 ms returned sat
[2023-03-23 05:01:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 05:01:35] [INFO ] [Nat]Absence check using state equation in 764 ms returned sat
[2023-03-23 05:01:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 463 ms returned sat
[2023-03-23 05:01:36] [INFO ] Deduced a trap composed of 250 places in 273 ms of which 0 ms to minimize.
[2023-03-23 05:01:36] [INFO ] Deduced a trap composed of 228 places in 279 ms of which 1 ms to minimize.
[2023-03-23 05:01:36] [INFO ] Deduced a trap composed of 228 places in 277 ms of which 0 ms to minimize.
[2023-03-23 05:01:37] [INFO ] Deduced a trap composed of 238 places in 285 ms of which 1 ms to minimize.
[2023-03-23 05:01:37] [INFO ] Deduced a trap composed of 237 places in 281 ms of which 0 ms to minimize.
[2023-03-23 05:01:37] [INFO ] Deduced a trap composed of 241 places in 278 ms of which 0 ms to minimize.
[2023-03-23 05:01:37] [INFO ] Deduced a trap composed of 222 places in 280 ms of which 1 ms to minimize.
[2023-03-23 05:01:38] [INFO ] Deduced a trap composed of 234 places in 280 ms of which 1 ms to minimize.
[2023-03-23 05:01:38] [INFO ] Deduced a trap composed of 232 places in 252 ms of which 2 ms to minimize.
[2023-03-23 05:01:38] [INFO ] Deduced a trap composed of 234 places in 255 ms of which 1 ms to minimize.
[2023-03-23 05:01:39] [INFO ] Deduced a trap composed of 249 places in 258 ms of which 1 ms to minimize.
[2023-03-23 05:01:39] [INFO ] Deduced a trap composed of 233 places in 257 ms of which 0 ms to minimize.
[2023-03-23 05:01:40] [INFO ] Deduced a trap composed of 230 places in 260 ms of which 0 ms to minimize.
[2023-03-23 05:01:40] [INFO ] Deduced a trap composed of 234 places in 262 ms of which 1 ms to minimize.
[2023-03-23 05:01:40] [INFO ] Deduced a trap composed of 230 places in 253 ms of which 1 ms to minimize.
[2023-03-23 05:01:41] [INFO ] Deduced a trap composed of 228 places in 258 ms of which 3 ms to minimize.
[2023-03-23 05:01:41] [INFO ] Deduced a trap composed of 232 places in 261 ms of which 0 ms to minimize.
[2023-03-23 05:01:41] [INFO ] Deduced a trap composed of 234 places in 250 ms of which 1 ms to minimize.
[2023-03-23 05:01:42] [INFO ] Deduced a trap composed of 234 places in 264 ms of which 1 ms to minimize.
[2023-03-23 05:01:42] [INFO ] Deduced a trap composed of 234 places in 261 ms of which 1 ms to minimize.
[2023-03-23 05:01:42] [INFO ] Deduced a trap composed of 230 places in 260 ms of which 1 ms to minimize.
[2023-03-23 05:01:43] [INFO ] Deduced a trap composed of 251 places in 252 ms of which 0 ms to minimize.
[2023-03-23 05:01:44] [INFO ] Deduced a trap composed of 253 places in 265 ms of which 0 ms to minimize.
[2023-03-23 05:01:44] [INFO ] Deduced a trap composed of 228 places in 264 ms of which 0 ms to minimize.
[2023-03-23 05:01:44] [INFO ] Deduced a trap composed of 241 places in 266 ms of which 1 ms to minimize.
[2023-03-23 05:01:45] [INFO ] Deduced a trap composed of 230 places in 266 ms of which 0 ms to minimize.
[2023-03-23 05:01:45] [INFO ] Deduced a trap composed of 232 places in 260 ms of which 0 ms to minimize.
[2023-03-23 05:01:45] [INFO ] Deduced a trap composed of 225 places in 267 ms of which 1 ms to minimize.
[2023-03-23 05:01:46] [INFO ] Deduced a trap composed of 232 places in 264 ms of which 0 ms to minimize.
[2023-03-23 05:01:46] [INFO ] Deduced a trap composed of 226 places in 259 ms of which 1 ms to minimize.
[2023-03-23 05:01:46] [INFO ] Deduced a trap composed of 238 places in 251 ms of which 1 ms to minimize.
[2023-03-23 05:01:47] [INFO ] Deduced a trap composed of 226 places in 253 ms of which 0 ms to minimize.
[2023-03-23 05:01:47] [INFO ] Deduced a trap composed of 236 places in 265 ms of which 0 ms to minimize.
[2023-03-23 05:01:47] [INFO ] Deduced a trap composed of 229 places in 250 ms of which 0 ms to minimize.
[2023-03-23 05:01:48] [INFO ] Deduced a trap composed of 233 places in 261 ms of which 1 ms to minimize.
[2023-03-23 05:01:48] [INFO ] Deduced a trap composed of 232 places in 260 ms of which 0 ms to minimize.
[2023-03-23 05:01:49] [INFO ] Deduced a trap composed of 230 places in 268 ms of which 0 ms to minimize.
[2023-03-23 05:01:49] [INFO ] Deduced a trap composed of 229 places in 255 ms of which 1 ms to minimize.
[2023-03-23 05:01:49] [INFO ] Deduced a trap composed of 241 places in 260 ms of which 0 ms to minimize.
[2023-03-23 05:01:50] [INFO ] Deduced a trap composed of 224 places in 257 ms of which 1 ms to minimize.
[2023-03-23 05:01:50] [INFO ] Deduced a trap composed of 245 places in 262 ms of which 0 ms to minimize.
[2023-03-23 05:01:50] [INFO ] Deduced a trap composed of 232 places in 284 ms of which 0 ms to minimize.
[2023-03-23 05:01:52] [INFO ] Deduced a trap composed of 232 places in 264 ms of which 1 ms to minimize.
[2023-03-23 05:01:52] [INFO ] Deduced a trap composed of 232 places in 256 ms of which 0 ms to minimize.
[2023-03-23 05:01:53] [INFO ] Deduced a trap composed of 230 places in 259 ms of which 0 ms to minimize.
[2023-03-23 05:01:53] [INFO ] Deduced a trap composed of 238 places in 252 ms of which 0 ms to minimize.
[2023-03-23 05:01:54] [INFO ] Deduced a trap composed of 237 places in 258 ms of which 0 ms to minimize.
[2023-03-23 05:01:54] [INFO ] Deduced a trap composed of 232 places in 263 ms of which 1 ms to minimize.
[2023-03-23 05:01:54] [INFO ] Deduced a trap composed of 230 places in 262 ms of which 1 ms to minimize.
[2023-03-23 05:01:55] [INFO ] Deduced a trap composed of 230 places in 261 ms of which 0 ms to minimize.
[2023-03-23 05:01:55] [INFO ] Deduced a trap composed of 239 places in 250 ms of which 0 ms to minimize.
[2023-03-23 05:01:55] [INFO ] Deduced a trap composed of 232 places in 251 ms of which 0 ms to minimize.
[2023-03-23 05:01:56] [INFO ] Deduced a trap composed of 230 places in 259 ms of which 0 ms to minimize.
[2023-03-23 05:01:56] [INFO ] Deduced a trap composed of 228 places in 250 ms of which 0 ms to minimize.
[2023-03-23 05:01:57] [INFO ] Deduced a trap composed of 232 places in 257 ms of which 0 ms to minimize.
[2023-03-23 05:01:57] [INFO ] Deduced a trap composed of 224 places in 259 ms of which 1 ms to minimize.
[2023-03-23 05:01:57] [INFO ] Deduced a trap composed of 234 places in 262 ms of which 1 ms to minimize.
[2023-03-23 05:01:57] [INFO ] Deduced a trap composed of 234 places in 263 ms of which 0 ms to minimize.
[2023-03-23 05:01:58] [INFO ] Deduced a trap composed of 238 places in 265 ms of which 1 ms to minimize.
[2023-03-23 05:01:58] [INFO ] Deduced a trap composed of 250 places in 252 ms of which 0 ms to minimize.
[2023-03-23 05:01:59] [INFO ] Deduced a trap composed of 230 places in 266 ms of which 0 ms to minimize.
[2023-03-23 05:01:59] [INFO ] Deduced a trap composed of 228 places in 259 ms of which 0 ms to minimize.
[2023-03-23 05:01:59] [INFO ] Deduced a trap composed of 236 places in 259 ms of which 0 ms to minimize.
[2023-03-23 05:02:00] [INFO ] Deduced a trap composed of 244 places in 257 ms of which 0 ms to minimize.
[2023-03-23 05:02:01] [INFO ] Deduced a trap composed of 248 places in 265 ms of which 0 ms to minimize.
[2023-03-23 05:02:03] [INFO ] Deduced a trap composed of 237 places in 261 ms of which 1 ms to minimize.
[2023-03-23 05:02:03] [INFO ] Deduced a trap composed of 228 places in 260 ms of which 1 ms to minimize.
[2023-03-23 05:02:04] [INFO ] Deduced a trap composed of 234 places in 266 ms of which 1 ms to minimize.
[2023-03-23 05:02:05] [INFO ] Deduced a trap composed of 240 places in 266 ms of which 0 ms to minimize.
[2023-03-23 05:02:05] [INFO ] Deduced a trap composed of 243 places in 263 ms of which 0 ms to minimize.
[2023-03-23 05:02:06] [INFO ] Deduced a trap composed of 234 places in 260 ms of which 0 ms to minimize.
[2023-03-23 05:02:06] [INFO ] Deduced a trap composed of 241 places in 256 ms of which 0 ms to minimize.
[2023-03-23 05:02:06] [INFO ] Deduced a trap composed of 245 places in 261 ms of which 1 ms to minimize.
[2023-03-23 05:02:07] [INFO ] Deduced a trap composed of 231 places in 264 ms of which 0 ms to minimize.
[2023-03-23 05:02:10] [INFO ] Trap strengthening (SAT) tested/added 74/74 trap constraints in 34609 ms
Current structural bounds on expressions (after SMT) : [60, 60] Max seen :[3, 3]
Support contains 2 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 33 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 581/581 places, 1252/1252 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 30 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-23 05:02:10] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-23 05:02:10] [INFO ] Invariant cache hit.
[2023-03-23 05:02:11] [INFO ] Implicit Places using invariants in 664 ms returned []
[2023-03-23 05:02:11] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-23 05:02:11] [INFO ] Invariant cache hit.
[2023-03-23 05:02:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 05:02:18] [INFO ] Implicit Places using invariants and state equation in 7838 ms returned []
Implicit Place search using SMT with State Equation took 8504 ms to find 0 implicit places.
[2023-03-23 05:02:19] [INFO ] Redundant transitions in 79 ms returned []
[2023-03-23 05:02:19] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-23 05:02:19] [INFO ] Invariant cache hit.
[2023-03-23 05:02:19] [INFO ] Dead Transitions using invariants and state equation in 638 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9263 ms. Remains : 581/581 places, 1252/1252 transitions.
Starting property specific reduction for PolyORBNT-PT-S10J30-UpperBounds-09
Normalized transition count is 1243 out of 1252 initially.
// Phase 1: matrix 1243 rows 581 cols
[2023-03-23 05:02:19] [INFO ] Computed 82 place invariants in 19 ms
Incomplete random walk after 10000 steps, including 702 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10000 steps, including 90 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :3
[2023-03-23 05:02:19] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-23 05:02:19] [INFO ] Computed 82 place invariants in 23 ms
[2023-03-23 05:02:19] [INFO ] [Real]Absence check using 63 positive place invariants in 12 ms returned sat
[2023-03-23 05:02:19] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 12 ms returned sat
[2023-03-23 05:02:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 05:02:21] [INFO ] [Real]Absence check using state equation in 1121 ms returned sat
[2023-03-23 05:02:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 05:02:21] [INFO ] [Nat]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-23 05:02:21] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 13 ms returned sat
[2023-03-23 05:02:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 05:02:21] [INFO ] [Nat]Absence check using state equation in 541 ms returned sat
[2023-03-23 05:02:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 05:02:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 1078 ms returned sat
[2023-03-23 05:02:23] [INFO ] Deduced a trap composed of 234 places in 264 ms of which 1 ms to minimize.
[2023-03-23 05:02:23] [INFO ] Deduced a trap composed of 216 places in 261 ms of which 0 ms to minimize.
[2023-03-23 05:02:23] [INFO ] Deduced a trap composed of 243 places in 260 ms of which 1 ms to minimize.
[2023-03-23 05:02:24] [INFO ] Deduced a trap composed of 236 places in 265 ms of which 1 ms to minimize.
[2023-03-23 05:02:24] [INFO ] Deduced a trap composed of 234 places in 257 ms of which 1 ms to minimize.
[2023-03-23 05:02:24] [INFO ] Deduced a trap composed of 234 places in 260 ms of which 1 ms to minimize.
[2023-03-23 05:02:24] [INFO ] Deduced a trap composed of 222 places in 287 ms of which 1 ms to minimize.
[2023-03-23 05:02:25] [INFO ] Deduced a trap composed of 240 places in 264 ms of which 0 ms to minimize.
[2023-03-23 05:02:25] [INFO ] Deduced a trap composed of 230 places in 265 ms of which 1 ms to minimize.
[2023-03-23 05:02:26] [INFO ] Deduced a trap composed of 228 places in 259 ms of which 0 ms to minimize.
[2023-03-23 05:02:26] [INFO ] Deduced a trap composed of 2 places in 331 ms of which 1 ms to minimize.
[2023-03-23 05:02: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 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.verifyPossible(DeadlockTester.java:916)
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:733)
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) : [60] Max seen :[3]
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 30 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-23 05:02:26] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-23 05:02:26] [INFO ] Invariant cache hit.
[2023-03-23 05:02:27] [INFO ] Dead Transitions using invariants and state equation in 689 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 719 ms. Remains : 581/581 places, 1252/1252 transitions.
Normalized transition count is 1243 out of 1252 initially.
// Phase 1: matrix 1243 rows 581 cols
[2023-03-23 05:02:27] [INFO ] Computed 82 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 70489 resets, run finished after 6411 ms. (steps per millisecond=155 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 8732 resets, run finished after 1356 ms. (steps per millisecond=737 ) properties (out of 1) seen :3
[2023-03-23 05:02:34] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-23 05:02:34] [INFO ] Computed 82 place invariants in 21 ms
[2023-03-23 05:02:35] [INFO ] [Real]Absence check using 63 positive place invariants in 12 ms returned sat
[2023-03-23 05:02:35] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 17 ms returned sat
[2023-03-23 05:02:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 05:02:36] [INFO ] [Real]Absence check using state equation in 1110 ms returned sat
[2023-03-23 05:02:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 05:02:36] [INFO ] [Nat]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-23 05:02:36] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 22 ms returned sat
[2023-03-23 05:02:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 05:02:36] [INFO ] [Nat]Absence check using state equation in 534 ms returned sat
[2023-03-23 05:02:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 05:02:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 1072 ms returned sat
[2023-03-23 05:02:38] [INFO ] Deduced a trap composed of 234 places in 253 ms of which 1 ms to minimize.
[2023-03-23 05:02:38] [INFO ] Deduced a trap composed of 216 places in 263 ms of which 1 ms to minimize.
[2023-03-23 05:02:38] [INFO ] Deduced a trap composed of 243 places in 275 ms of which 0 ms to minimize.
[2023-03-23 05:02:39] [INFO ] Deduced a trap composed of 236 places in 254 ms of which 1 ms to minimize.
[2023-03-23 05:02:39] [INFO ] Deduced a trap composed of 234 places in 253 ms of which 1 ms to minimize.
[2023-03-23 05:02:39] [INFO ] Deduced a trap composed of 234 places in 258 ms of which 1 ms to minimize.
[2023-03-23 05:02:40] [INFO ] Deduced a trap composed of 222 places in 267 ms of which 1 ms to minimize.
[2023-03-23 05:02:40] [INFO ] Deduced a trap composed of 240 places in 266 ms of which 1 ms to minimize.
[2023-03-23 05:02:40] [INFO ] Deduced a trap composed of 230 places in 259 ms of which 0 ms to minimize.
[2023-03-23 05:02:41] [INFO ] Deduced a trap composed of 228 places in 259 ms of which 0 ms to minimize.
[2023-03-23 05:02:41] [INFO ] Deduced a trap composed of 226 places in 261 ms of which 1 ms to minimize.
[2023-03-23 05:02:41] [INFO ] Deduced a trap composed of 234 places in 262 ms of which 0 ms to minimize.
[2023-03-23 05:02:42] [INFO ] Deduced a trap composed of 232 places in 279 ms of which 1 ms to minimize.
[2023-03-23 05:02:42] [INFO ] Deduced a trap composed of 228 places in 257 ms of which 0 ms to minimize.
[2023-03-23 05:02:42] [INFO ] Deduced a trap composed of 239 places in 267 ms of which 0 ms to minimize.
[2023-03-23 05:02:44] [INFO ] Deduced a trap composed of 228 places in 259 ms of which 1 ms to minimize.
[2023-03-23 05:02:44] [INFO ] Deduced a trap composed of 230 places in 265 ms of which 1 ms to minimize.
[2023-03-23 05:02:45] [INFO ] Deduced a trap composed of 222 places in 259 ms of which 1 ms to minimize.
[2023-03-23 05:02:45] [INFO ] Deduced a trap composed of 238 places in 272 ms of which 0 ms to minimize.
[2023-03-23 05:02:46] [INFO ] Deduced a trap composed of 226 places in 262 ms of which 0 ms to minimize.
[2023-03-23 05:02:46] [INFO ] Deduced a trap composed of 234 places in 262 ms of which 1 ms to minimize.
[2023-03-23 05:02:46] [INFO ] Deduced a trap composed of 216 places in 262 ms of which 1 ms to minimize.
[2023-03-23 05:02:47] [INFO ] Deduced a trap composed of 230 places in 266 ms of which 1 ms to minimize.
[2023-03-23 05:02:47] [INFO ] Deduced a trap composed of 224 places in 267 ms of which 0 ms to minimize.
[2023-03-23 05:02:48] [INFO ] Deduced a trap composed of 234 places in 267 ms of which 0 ms to minimize.
[2023-03-23 05:02:48] [INFO ] Deduced a trap composed of 226 places in 253 ms of which 0 ms to minimize.
[2023-03-23 05:02:49] [INFO ] Deduced a trap composed of 228 places in 267 ms of which 0 ms to minimize.
[2023-03-23 05:02:49] [INFO ] Deduced a trap composed of 230 places in 260 ms of which 1 ms to minimize.
[2023-03-23 05:02:50] [INFO ] Deduced a trap composed of 238 places in 262 ms of which 0 ms to minimize.
[2023-03-23 05:02:50] [INFO ] Deduced a trap composed of 232 places in 257 ms of which 1 ms to minimize.
[2023-03-23 05:02:50] [INFO ] Deduced a trap composed of 230 places in 264 ms of which 1 ms to minimize.
[2023-03-23 05:02:50] [INFO ] Deduced a trap composed of 243 places in 258 ms of which 1 ms to minimize.
[2023-03-23 05:02:51] [INFO ] Deduced a trap composed of 238 places in 256 ms of which 0 ms to minimize.
[2023-03-23 05:02:51] [INFO ] Deduced a trap composed of 238 places in 257 ms of which 0 ms to minimize.
[2023-03-23 05:02:51] [INFO ] Deduced a trap composed of 234 places in 266 ms of which 1 ms to minimize.
[2023-03-23 05:02:52] [INFO ] Deduced a trap composed of 236 places in 261 ms of which 0 ms to minimize.
[2023-03-23 05:02:52] [INFO ] Deduced a trap composed of 234 places in 274 ms of which 1 ms to minimize.
[2023-03-23 05:02:53] [INFO ] Deduced a trap composed of 230 places in 251 ms of which 1 ms to minimize.
[2023-03-23 05:02:53] [INFO ] Deduced a trap composed of 242 places in 261 ms of which 0 ms to minimize.
[2023-03-23 05:02:53] [INFO ] Deduced a trap composed of 230 places in 272 ms of which 1 ms to minimize.
[2023-03-23 05:02:54] [INFO ] Deduced a trap composed of 232 places in 264 ms of which 1 ms to minimize.
[2023-03-23 05:02:54] [INFO ] Deduced a trap composed of 237 places in 261 ms of which 1 ms to minimize.
[2023-03-23 05:02:55] [INFO ] Deduced a trap composed of 244 places in 262 ms of which 0 ms to minimize.
[2023-03-23 05:02:55] [INFO ] Deduced a trap composed of 232 places in 259 ms of which 1 ms to minimize.
[2023-03-23 05:02:55] [INFO ] Deduced a trap composed of 230 places in 263 ms of which 1 ms to minimize.
[2023-03-23 05:02:55] [INFO ] Deduced a trap composed of 236 places in 260 ms of which 1 ms to minimize.
[2023-03-23 05:02:56] [INFO ] Deduced a trap composed of 224 places in 270 ms of which 0 ms to minimize.
[2023-03-23 05:02:56] [INFO ] Deduced a trap composed of 236 places in 257 ms of which 0 ms to minimize.
[2023-03-23 05:02:57] [INFO ] Deduced a trap composed of 228 places in 253 ms of which 1 ms to minimize.
[2023-03-23 05:02:57] [INFO ] Deduced a trap composed of 222 places in 258 ms of which 0 ms to minimize.
[2023-03-23 05:02:58] [INFO ] Deduced a trap composed of 232 places in 255 ms of which 1 ms to minimize.
[2023-03-23 05:02:58] [INFO ] Deduced a trap composed of 226 places in 265 ms of which 1 ms to minimize.
[2023-03-23 05:02:58] [INFO ] Deduced a trap composed of 226 places in 269 ms of which 1 ms to minimize.
[2023-03-23 05:02:59] [INFO ] Deduced a trap composed of 234 places in 255 ms of which 1 ms to minimize.
[2023-03-23 05:02:59] [INFO ] Deduced a trap composed of 228 places in 258 ms of which 0 ms to minimize.
[2023-03-23 05:02:59] [INFO ] Deduced a trap composed of 229 places in 260 ms of which 0 ms to minimize.
[2023-03-23 05:03:00] [INFO ] Deduced a trap composed of 236 places in 260 ms of which 1 ms to minimize.
[2023-03-23 05:03:00] [INFO ] Deduced a trap composed of 232 places in 263 ms of which 0 ms to minimize.
[2023-03-23 05:03:01] [INFO ] Deduced a trap composed of 230 places in 259 ms of which 0 ms to minimize.
[2023-03-23 05:03:01] [INFO ] Deduced a trap composed of 228 places in 261 ms of which 0 ms to minimize.
[2023-03-23 05:03:01] [INFO ] Deduced a trap composed of 234 places in 257 ms of which 0 ms to minimize.
[2023-03-23 05:03:01] [INFO ] Deduced a trap composed of 236 places in 256 ms of which 0 ms to minimize.
[2023-03-23 05:03:02] [INFO ] Deduced a trap composed of 242 places in 256 ms of which 1 ms to minimize.
[2023-03-23 05:03:02] [INFO ] Deduced a trap composed of 222 places in 263 ms of which 1 ms to minimize.
[2023-03-23 05:03:03] [INFO ] Deduced a trap composed of 228 places in 270 ms of which 0 ms to minimize.
[2023-03-23 05:03:03] [INFO ] Deduced a trap composed of 234 places in 264 ms of which 0 ms to minimize.
[2023-03-23 05:03:03] [INFO ] Deduced a trap composed of 226 places in 258 ms of which 0 ms to minimize.
[2023-03-23 05:03:04] [INFO ] Deduced a trap composed of 234 places in 259 ms of which 1 ms to minimize.
[2023-03-23 05:03:04] [INFO ] Deduced a trap composed of 242 places in 262 ms of which 1 ms to minimize.
[2023-03-23 05:03:04] [INFO ] Deduced a trap composed of 230 places in 265 ms of which 1 ms to minimize.
[2023-03-23 05:03:06] [INFO ] Deduced a trap composed of 226 places in 267 ms of which 1 ms to minimize.
[2023-03-23 05:03:07] [INFO ] Deduced a trap composed of 230 places in 255 ms of which 0 ms to minimize.
[2023-03-23 05:03:07] [INFO ] Deduced a trap composed of 232 places in 261 ms of which 1 ms to minimize.
[2023-03-23 05:03:07] [INFO ] Deduced a trap composed of 234 places in 263 ms of which 1 ms to minimize.
[2023-03-23 05:03:08] [INFO ] Deduced a trap composed of 232 places in 259 ms of which 1 ms to minimize.
[2023-03-23 05:03:08] [INFO ] Deduced a trap composed of 236 places in 260 ms of which 1 ms to minimize.
[2023-03-23 05:03:08] [INFO ] Deduced a trap composed of 228 places in 267 ms of which 1 ms to minimize.
[2023-03-23 05:03:09] [INFO ] Deduced a trap composed of 231 places in 261 ms of which 1 ms to minimize.
[2023-03-23 05:03:09] [INFO ] Deduced a trap composed of 232 places in 251 ms of which 1 ms to minimize.
[2023-03-23 05:03:10] [INFO ] Deduced a trap composed of 234 places in 249 ms of which 0 ms to minimize.
[2023-03-23 05:03:10] [INFO ] Deduced a trap composed of 234 places in 256 ms of which 0 ms to minimize.
[2023-03-23 05:03:10] [INFO ] Deduced a trap composed of 234 places in 259 ms of which 0 ms to minimize.
[2023-03-23 05:03:11] [INFO ] Deduced a trap composed of 239 places in 260 ms of which 1 ms to minimize.
[2023-03-23 05:03:14] [INFO ] Trap strengthening (SAT) tested/added 83/83 trap constraints in 36409 ms
Current structural bounds on expressions (after SMT) : [60] Max seen :[3]
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 29 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 581/581 places, 1252/1252 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 28 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-23 05:03:14] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-23 05:03:14] [INFO ] Invariant cache hit.
[2023-03-23 05:03:14] [INFO ] Implicit Places using invariants in 610 ms returned []
[2023-03-23 05:03:14] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-23 05:03:14] [INFO ] Invariant cache hit.
[2023-03-23 05:03:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 05:03:22] [INFO ] Implicit Places using invariants and state equation in 7246 ms returned []
Implicit Place search using SMT with State Equation took 7858 ms to find 0 implicit places.
[2023-03-23 05:03:22] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-23 05:03:22] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-23 05:03:22] [INFO ] Invariant cache hit.
[2023-03-23 05:03:22] [INFO ] Dead Transitions using invariants and state equation in 609 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8526 ms. Remains : 581/581 places, 1252/1252 transitions.
Ending property specific reduction for PolyORBNT-PT-S10J30-UpperBounds-09 in 63193 ms.
Starting property specific reduction for PolyORBNT-PT-S10J30-UpperBounds-14
Normalized transition count is 1243 out of 1252 initially.
// Phase 1: matrix 1243 rows 581 cols
[2023-03-23 05:03:22] [INFO ] Computed 82 place invariants in 14 ms
Incomplete random walk after 10000 steps, including 702 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :3
[2023-03-23 05:03:22] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-23 05:03:22] [INFO ] Computed 82 place invariants in 19 ms
[2023-03-23 05:03:23] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-23 05:03:23] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 13 ms returned sat
[2023-03-23 05:03:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 05:03:24] [INFO ] [Real]Absence check using state equation in 1123 ms returned sat
[2023-03-23 05:03:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 05:03:24] [INFO ] [Nat]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-23 05:03:24] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 20 ms returned sat
[2023-03-23 05:03:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 05:03:25] [INFO ] [Nat]Absence check using state equation in 758 ms returned sat
[2023-03-23 05:03:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 05:03:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 455 ms returned sat
[2023-03-23 05:03:25] [INFO ] Deduced a trap composed of 250 places in 258 ms of which 1 ms to minimize.
[2023-03-23 05:03:26] [INFO ] Deduced a trap composed of 228 places in 262 ms of which 0 ms to minimize.
[2023-03-23 05:03:26] [INFO ] Deduced a trap composed of 228 places in 269 ms of which 1 ms to minimize.
[2023-03-23 05:03:26] [INFO ] Deduced a trap composed of 238 places in 259 ms of which 0 ms to minimize.
[2023-03-23 05:03:27] [INFO ] Deduced a trap composed of 237 places in 263 ms of which 1 ms to minimize.
[2023-03-23 05:03:27] [INFO ] Deduced a trap composed of 241 places in 263 ms of which 1 ms to minimize.
[2023-03-23 05:03:27] [INFO ] Deduced a trap composed of 222 places in 257 ms of which 1 ms to minimize.
[2023-03-23 05:03:27] [INFO ] Deduced a trap composed of 234 places in 256 ms of which 0 ms to minimize.
[2023-03-23 05:03:28] [INFO ] Deduced a trap composed of 232 places in 267 ms of which 0 ms to minimize.
[2023-03-23 05:03:28] [INFO ] Deduced a trap composed of 234 places in 263 ms of which 1 ms to minimize.
[2023-03-23 05:03:28] [INFO ] Deduced a trap composed of 249 places in 262 ms of which 0 ms to minimize.
[2023-03-23 05:03:29] [INFO ] Deduced a trap composed of 233 places in 251 ms of which 1 ms to minimize.
[2023-03-23 05:03:29] [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.verifyPossible(DeadlockTester.java:916)
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:733)
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) : [60] Max seen :[3]
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 33 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-23 05:03:29] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-23 05:03:29] [INFO ] Invariant cache hit.
[2023-03-23 05:03:29] [INFO ] Dead Transitions using invariants and state equation in 635 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 668 ms. Remains : 581/581 places, 1252/1252 transitions.
Normalized transition count is 1243 out of 1252 initially.
// Phase 1: matrix 1243 rows 581 cols
[2023-03-23 05:03:29] [INFO ] Computed 82 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 70334 resets, run finished after 6381 ms. (steps per millisecond=156 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 8831 resets, run finished after 1374 ms. (steps per millisecond=727 ) properties (out of 1) seen :3
[2023-03-23 05:03:37] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-23 05:03:37] [INFO ] Computed 82 place invariants in 21 ms
[2023-03-23 05:03:37] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-23 05:03:37] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 13 ms returned sat
[2023-03-23 05:03:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 05:03:38] [INFO ] [Real]Absence check using state equation in 1137 ms returned sat
[2023-03-23 05:03:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 05:03:39] [INFO ] [Nat]Absence check using 63 positive place invariants in 14 ms returned sat
[2023-03-23 05:03:39] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 21 ms returned sat
[2023-03-23 05:03:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 05:03:39] [INFO ] [Nat]Absence check using state equation in 769 ms returned sat
[2023-03-23 05:03:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 05:03:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 455 ms returned sat
[2023-03-23 05:03:40] [INFO ] Deduced a trap composed of 250 places in 267 ms of which 1 ms to minimize.
[2023-03-23 05:03:40] [INFO ] Deduced a trap composed of 228 places in 261 ms of which 0 ms to minimize.
[2023-03-23 05:03:41] [INFO ] Deduced a trap composed of 228 places in 257 ms of which 1 ms to minimize.
[2023-03-23 05:03:41] [INFO ] Deduced a trap composed of 238 places in 264 ms of which 1 ms to minimize.
[2023-03-23 05:03:41] [INFO ] Deduced a trap composed of 237 places in 258 ms of which 0 ms to minimize.
[2023-03-23 05:03:42] [INFO ] Deduced a trap composed of 241 places in 266 ms of which 1 ms to minimize.
[2023-03-23 05:03:42] [INFO ] Deduced a trap composed of 222 places in 259 ms of which 0 ms to minimize.
[2023-03-23 05:03:42] [INFO ] Deduced a trap composed of 234 places in 261 ms of which 1 ms to minimize.
[2023-03-23 05:03:43] [INFO ] Deduced a trap composed of 232 places in 264 ms of which 0 ms to minimize.
[2023-03-23 05:03:43] [INFO ] Deduced a trap composed of 234 places in 257 ms of which 1 ms to minimize.
[2023-03-23 05:03:43] [INFO ] Deduced a trap composed of 249 places in 256 ms of which 1 ms to minimize.
[2023-03-23 05:03:44] [INFO ] Deduced a trap composed of 233 places in 268 ms of which 0 ms to minimize.
[2023-03-23 05:03:44] [INFO ] Deduced a trap composed of 230 places in 264 ms of which 0 ms to minimize.
[2023-03-23 05:03:44] [INFO ] Deduced a trap composed of 234 places in 273 ms of which 13 ms to minimize.
[2023-03-23 05:03:45] [INFO ] Deduced a trap composed of 230 places in 260 ms of which 0 ms to minimize.
[2023-03-23 05:03:45] [INFO ] Deduced a trap composed of 228 places in 257 ms of which 1 ms to minimize.
[2023-03-23 05:03:46] [INFO ] Deduced a trap composed of 232 places in 252 ms of which 1 ms to minimize.
[2023-03-23 05:03:46] [INFO ] Deduced a trap composed of 234 places in 259 ms of which 0 ms to minimize.
[2023-03-23 05:03:46] [INFO ] Deduced a trap composed of 234 places in 259 ms of which 1 ms to minimize.
[2023-03-23 05:03:46] [INFO ] Deduced a trap composed of 234 places in 257 ms of which 0 ms to minimize.
[2023-03-23 05:03:47] [INFO ] Deduced a trap composed of 230 places in 254 ms of which 0 ms to minimize.
[2023-03-23 05:03:48] [INFO ] Deduced a trap composed of 251 places in 268 ms of which 1 ms to minimize.
[2023-03-23 05:03:48] [INFO ] Deduced a trap composed of 253 places in 254 ms of which 1 ms to minimize.
[2023-03-23 05:03:48] [INFO ] Deduced a trap composed of 228 places in 256 ms of which 0 ms to minimize.
[2023-03-23 05:03:49] [INFO ] Deduced a trap composed of 241 places in 254 ms of which 1 ms to minimize.
[2023-03-23 05:03:49] [INFO ] Deduced a trap composed of 230 places in 256 ms of which 1 ms to minimize.
[2023-03-23 05:03:49] [INFO ] Deduced a trap composed of 232 places in 256 ms of which 1 ms to minimize.
[2023-03-23 05:03:50] [INFO ] Deduced a trap composed of 225 places in 266 ms of which 1 ms to minimize.
[2023-03-23 05:03:50] [INFO ] Deduced a trap composed of 232 places in 260 ms of which 1 ms to minimize.
[2023-03-23 05:03:51] [INFO ] Deduced a trap composed of 226 places in 252 ms of which 0 ms to minimize.
[2023-03-23 05:03:51] [INFO ] Deduced a trap composed of 238 places in 247 ms of which 1 ms to minimize.
[2023-03-23 05:03:51] [INFO ] Deduced a trap composed of 226 places in 254 ms of which 1 ms to minimize.
[2023-03-23 05:03:52] [INFO ] Deduced a trap composed of 236 places in 258 ms of which 1 ms to minimize.
[2023-03-23 05:03:52] [INFO ] Deduced a trap composed of 229 places in 266 ms of which 1 ms to minimize.
[2023-03-23 05:03:52] [INFO ] Deduced a trap composed of 233 places in 269 ms of which 1 ms to minimize.
[2023-03-23 05:03:52] [INFO ] Deduced a trap composed of 232 places in 260 ms of which 0 ms to minimize.
[2023-03-23 05:03:53] [INFO ] Deduced a trap composed of 230 places in 258 ms of which 0 ms to minimize.
[2023-03-23 05:03:53] [INFO ] Deduced a trap composed of 229 places in 272 ms of which 1 ms to minimize.
[2023-03-23 05:03:54] [INFO ] Deduced a trap composed of 241 places in 267 ms of which 0 ms to minimize.
[2023-03-23 05:03:54] [INFO ] Deduced a trap composed of 224 places in 267 ms of which 1 ms to minimize.
[2023-03-23 05:03:55] [INFO ] Deduced a trap composed of 245 places in 270 ms of which 1 ms to minimize.
[2023-03-23 05:03:55] [INFO ] Deduced a trap composed of 232 places in 263 ms of which 1 ms to minimize.
[2023-03-23 05:03:57] [INFO ] Deduced a trap composed of 232 places in 269 ms of which 1 ms to minimize.
[2023-03-23 05:03:57] [INFO ] Deduced a trap composed of 232 places in 267 ms of which 0 ms to minimize.
[2023-03-23 05:03:57] [INFO ] Deduced a trap composed of 230 places in 267 ms of which 0 ms to minimize.
[2023-03-23 05:03:58] [INFO ] Deduced a trap composed of 238 places in 257 ms of which 0 ms to minimize.
[2023-03-23 05:03:58] [INFO ] Deduced a trap composed of 237 places in 257 ms of which 1 ms to minimize.
[2023-03-23 05:03:58] [INFO ] Deduced a trap composed of 232 places in 258 ms of which 0 ms to minimize.
[2023-03-23 05:03:59] [INFO ] Deduced a trap composed of 230 places in 258 ms of which 1 ms to minimize.
[2023-03-23 05:03:59] [INFO ] Deduced a trap composed of 230 places in 267 ms of which 1 ms to minimize.
[2023-03-23 05:03:59] [INFO ] Deduced a trap composed of 239 places in 256 ms of which 0 ms to minimize.
[2023-03-23 05:04:00] [INFO ] Deduced a trap composed of 232 places in 258 ms of which 1 ms to minimize.
[2023-03-23 05:04:00] [INFO ] Deduced a trap composed of 230 places in 266 ms of which 0 ms to minimize.
[2023-03-23 05:04:01] [INFO ] Deduced a trap composed of 228 places in 261 ms of which 0 ms to minimize.
[2023-03-23 05:04:01] [INFO ] Deduced a trap composed of 232 places in 265 ms of which 1 ms to minimize.
[2023-03-23 05:04:01] [INFO ] Deduced a trap composed of 224 places in 263 ms of which 1 ms to minimize.
[2023-03-23 05:04:02] [INFO ] Deduced a trap composed of 234 places in 266 ms of which 1 ms to minimize.
[2023-03-23 05:04:02] [INFO ] Deduced a trap composed of 234 places in 260 ms of which 0 ms to minimize.
[2023-03-23 05:04:02] [INFO ] Deduced a trap composed of 238 places in 259 ms of which 1 ms to minimize.
[2023-03-23 05:04:03] [INFO ] Deduced a trap composed of 250 places in 266 ms of which 0 ms to minimize.
[2023-03-23 05:04:03] [INFO ] Deduced a trap composed of 230 places in 262 ms of which 1 ms to minimize.
[2023-03-23 05:04:03] [INFO ] Deduced a trap composed of 228 places in 257 ms of which 1 ms to minimize.
[2023-03-23 05:04:04] [INFO ] Deduced a trap composed of 236 places in 262 ms of which 1 ms to minimize.
[2023-03-23 05:04:04] [INFO ] Deduced a trap composed of 244 places in 262 ms of which 0 ms to minimize.
[2023-03-23 05:04:06] [INFO ] Deduced a trap composed of 248 places in 268 ms of which 0 ms to minimize.
[2023-03-23 05:04:07] [INFO ] Deduced a trap composed of 237 places in 271 ms of which 1 ms to minimize.
[2023-03-23 05:04:08] [INFO ] Deduced a trap composed of 228 places in 274 ms of which 1 ms to minimize.
[2023-03-23 05:04:09] [INFO ] Deduced a trap composed of 234 places in 265 ms of which 0 ms to minimize.
[2023-03-23 05:04:09] [INFO ] Deduced a trap composed of 240 places in 265 ms of which 0 ms to minimize.
[2023-03-23 05:04:10] [INFO ] Deduced a trap composed of 243 places in 257 ms of which 0 ms to minimize.
[2023-03-23 05:04:10] [INFO ] Deduced a trap composed of 234 places in 256 ms of which 0 ms to minimize.
[2023-03-23 05:04:11] [INFO ] Deduced a trap composed of 241 places in 252 ms of which 1 ms to minimize.
[2023-03-23 05:04:11] [INFO ] Deduced a trap composed of 245 places in 256 ms of which 0 ms to minimize.
[2023-03-23 05:04:11] [INFO ] Deduced a trap composed of 231 places in 261 ms of which 1 ms to minimize.
[2023-03-23 05:04:14] [INFO ] Trap strengthening (SAT) tested/added 74/74 trap constraints in 34579 ms
Current structural bounds on expressions (after SMT) : [60] Max seen :[3]
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 28 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 581/581 places, 1252/1252 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 28 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-23 05:04:14] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-23 05:04:14] [INFO ] Invariant cache hit.
[2023-03-23 05:04:15] [INFO ] Implicit Places using invariants in 663 ms returned []
[2023-03-23 05:04:15] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-23 05:04:15] [INFO ] Invariant cache hit.
[2023-03-23 05:04:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 05:04:23] [INFO ] Implicit Places using invariants and state equation in 8026 ms returned []
Implicit Place search using SMT with State Equation took 8691 ms to find 0 implicit places.
[2023-03-23 05:04:23] [INFO ] Redundant transitions in 75 ms returned []
[2023-03-23 05:04:23] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-23 05:04:23] [INFO ] Invariant cache hit.
[2023-03-23 05:04:24] [INFO ] Dead Transitions using invariants and state equation in 619 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9424 ms. Remains : 581/581 places, 1252/1252 transitions.
Ending property specific reduction for PolyORBNT-PT-S10J30-UpperBounds-14 in 61506 ms.
[2023-03-23 05:04:24] [INFO ] Flatten gal took : 187 ms
[2023-03-23 05:04:24] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-23 05:04:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 581 places, 1252 transitions and 7921 arcs took 11 ms.
Total runtime 350368 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running PolyORBNT (PT), instance S10J30
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: 581 places, 1252 transitions, 7921 arcs.
Final Score: 103689.963
Took : 32 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9629400 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16083588 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Caught signal 15, terminating.
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="PolyORBNT-PT-S10J30"
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 PolyORBNT-PT-S10J30, 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 r299-tall-167873953400765"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S10J30.tgz
mv PolyORBNT-PT-S10J30 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 '
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 ;