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.r293-tall-167873945900765.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is PolyORBNT-PT-S10J30, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945900765
=====================================================================

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

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J30
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-16 11:39:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 11:39:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 11:39:58] [INFO ] Load time of PNML (sax parser for PT used): 568 ms
[2023-03-16 11:39:58] [INFO ] Transformed 664 places.
[2023-03-16 11:39:58] [INFO ] Transformed 12050 transitions.
[2023-03-16 11:39:58] [INFO ] Parsed PT model containing 664 places and 12050 transitions and 112559 arcs in 716 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 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-16 11:39:58] [INFO ] Computed 92 place invariants in 143 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 198 ms. (steps per millisecond=50 ) 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 106 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 105 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 14) seen :19
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 44 ms. (steps per millisecond=227 ) properties (out of 13) seen :13
Incomplete Best-First random walk after 10000 steps, including 102 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :13
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :13
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :13
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :13
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :13
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :13
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :13
[2023-03-16 11:39:59] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2023-03-16 11:39:59] [INFO ] Computed 92 place invariants in 72 ms
[2023-03-16 11:39:59] [INFO ] [Real]Absence check using 63 positive place invariants in 21 ms returned sat
[2023-03-16 11:39:59] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 31 ms returned unsat
[2023-03-16 11:40:00] [INFO ] [Real]Absence check using 63 positive place invariants in 19 ms returned sat
[2023-03-16 11:40:00] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 19 ms returned sat
[2023-03-16 11:40:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 11:40:00] [INFO ] [Real]Absence check using state equation in 725 ms returned sat
[2023-03-16 11:40:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 11:40:00] [INFO ] [Nat]Absence check using 63 positive place invariants in 15 ms returned sat
[2023-03-16 11:40:00] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 19 ms returned sat
[2023-03-16 11:40:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 11:40:04] [INFO ] [Nat]Absence check using state equation in 3405 ms returned sat
[2023-03-16 11:40:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 11:40:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2023-03-16 11:40:04] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 207 ms.
[2023-03-16 11:40:05] [INFO ] Added : 68 causal constraints over 14 iterations in 1389 ms. Result :unknown
[2023-03-16 11:40:05] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-16 11:40:05] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 12 ms returned unsat
[2023-03-16 11:40:06] [INFO ] [Real]Absence check using 63 positive place invariants in 14 ms returned sat
[2023-03-16 11:40:06] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 18 ms returned sat
[2023-03-16 11:40:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 11:40:06] [INFO ] [Real]Absence check using state equation in 625 ms returned sat
[2023-03-16 11:40:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 11:40:06] [INFO ] [Nat]Absence check using 63 positive place invariants in 18 ms returned sat
[2023-03-16 11:40:06] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 21 ms returned sat
[2023-03-16 11:40:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 11:40:07] [INFO ] [Nat]Absence check using state equation in 1041 ms returned sat
[2023-03-16 11:40:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 243 ms returned sat
[2023-03-16 11:40:08] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 129 ms.
[2023-03-16 11:40:11] [INFO ] Added : 5 causal constraints over 1 iterations in 3542 ms. Result :unknown
[2023-03-16 11:40:11] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-16 11:40:11] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 18 ms returned sat
[2023-03-16 11:40:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 11:40:12] [INFO ] [Real]Absence check using state equation in 365 ms returned unsat
[2023-03-16 11:40:12] [INFO ] [Real]Absence check using 63 positive place invariants in 15 ms returned sat
[2023-03-16 11:40:12] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 26 ms returned unsat
[2023-03-16 11:40:12] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-16 11:40:12] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 18 ms returned unsat
[2023-03-16 11:40:12] [INFO ] [Real]Absence check using 63 positive place invariants in 14 ms returned sat
[2023-03-16 11:40:12] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 18 ms returned sat
[2023-03-16 11:40:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 11:40:13] [INFO ] [Real]Absence check using state equation in 672 ms returned sat
[2023-03-16 11:40:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 11:40:13] [INFO ] [Nat]Absence check using 63 positive place invariants in 15 ms returned sat
[2023-03-16 11:40:13] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 26 ms returned sat
[2023-03-16 11:40:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 11:40:14] [INFO ] [Nat]Absence check using state equation in 1036 ms returned sat
[2023-03-16 11:40:17] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-16 11:40:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 3859 ms returned unknown
[2023-03-16 11:40:18] [INFO ] [Real]Absence check using 63 positive place invariants in 14 ms returned sat
[2023-03-16 11:40:18] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 18 ms returned sat
[2023-03-16 11:40:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 11:40:19] [INFO ] [Real]Absence check using state equation in 629 ms returned sat
[2023-03-16 11:40:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 11:40:19] [INFO ] [Nat]Absence check using 63 positive place invariants in 15 ms returned sat
[2023-03-16 11:40:19] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 20 ms returned sat
[2023-03-16 11:40:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 11:40:20] [INFO ] [Nat]Absence check using state equation in 1459 ms returned sat
[2023-03-16 11:40:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 170 ms returned sat
[2023-03-16 11:40:21] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 124 ms.
[2023-03-16 11:40:21] [INFO ] Added : 12 causal constraints over 3 iterations in 451 ms. Result :sat
Minimization took 802 ms.
[2023-03-16 11:40:22] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-16 11:40:22] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 21 ms returned sat
[2023-03-16 11:40:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 11:40:22] [INFO ] [Real]Absence check using state equation in 563 ms returned sat
[2023-03-16 11:40:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 11:40:23] [INFO ] [Nat]Absence check using 63 positive place invariants in 14 ms returned sat
[2023-03-16 11:40:23] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 21 ms returned sat
[2023-03-16 11:40:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 11:40:28] [INFO ] [Nat]Absence check using state equation in 4906 ms returned unknown
[2023-03-16 11:40:28] [INFO ] [Real]Absence check using 63 positive place invariants in 14 ms returned sat
[2023-03-16 11:40:28] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 20 ms returned sat
[2023-03-16 11:40:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 11:40:28] [INFO ] [Real]Absence check using state equation in 474 ms returned sat
[2023-03-16 11:40:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 11:40:28] [INFO ] [Nat]Absence check using 63 positive place invariants in 14 ms returned sat
[2023-03-16 11:40:28] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 34 ms returned sat
[2023-03-16 11:40:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 11:40:33] [INFO ] [Nat]Absence check using state equation in 4899 ms returned unknown
[2023-03-16 11:40:33] [INFO ] [Real]Absence check using 63 positive place invariants in 15 ms returned sat
[2023-03-16 11:40:33] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 14 ms returned unsat
[2023-03-16 11:40:33] [INFO ] [Real]Absence check using 63 positive place invariants in 23 ms returned sat
[2023-03-16 11:40:33] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 19 ms returned sat
[2023-03-16 11:40:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 11:40:34] [INFO ] [Real]Absence check using state equation in 889 ms returned sat
[2023-03-16 11:40:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 11:40:34] [INFO ] [Nat]Absence check using 63 positive place invariants in 14 ms returned sat
[2023-03-16 11:40:34] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 20 ms returned sat
[2023-03-16 11:40:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 11:40:36] [INFO ] [Nat]Absence check using state equation in 1065 ms returned sat
[2023-03-16 11:40:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 434 ms returned sat
[2023-03-16 11:40:36] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 121 ms.
[2023-03-16 11:40:36] [INFO ] Added : 12 causal constraints over 3 iterations in 464 ms. Result :sat
Minimization took 1399 ms.
Current structural bounds on expressions (after SMT) : [1, 151, 1, 280, 10, 1, 1, 226, 302, 1, 4, 1, 302] Max seen :[1, 0, 1, 1, 10, 1, 1, 0, 1, 0, 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
FORMULA PolyORBNT-PT-S10J30-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_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 1 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 1 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 335 ms. Remains 581 /664 variables (removed 83) and now considering 1867/1940 (removed 73) transitions.
[2023-03-16 11:40:39] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
// Phase 1: matrix 1858 rows 581 cols
[2023-03-16 11:40:39] [INFO ] Computed 82 place invariants in 40 ms
[2023-03-16 11:40:40] [INFO ] Dead Transitions using invariants and state equation in 870 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 37 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 1244 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-16 11:40:40] [INFO ] Computed 82 place invariants in 31 ms
Incomplete random walk after 1000000 steps, including 70237 resets, run finished after 6974 ms. (steps per millisecond=143 ) properties (out of 6) seen :16
Incomplete Best-First random walk after 1000001 steps, including 8824 resets, run finished after 1438 ms. (steps per millisecond=695 ) properties (out of 6) seen :16
Incomplete Best-First random walk after 1000001 steps, including 6019 resets, run finished after 1486 ms. (steps per millisecond=672 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000000 steps, including 8906 resets, run finished after 1439 ms. (steps per millisecond=694 ) properties (out of 6) seen :16
Incomplete Best-First random walk after 1000000 steps, including 8853 resets, run finished after 1439 ms. (steps per millisecond=694 ) properties (out of 6) seen :14
Incomplete Best-First random walk after 1000000 steps, including 8979 resets, run finished after 1447 ms. (steps per millisecond=691 ) properties (out of 6) seen :16
Incomplete Best-First random walk after 1000001 steps, including 8787 resets, run finished after 1432 ms. (steps per millisecond=698 ) properties (out of 6) seen :14
[2023-03-16 11:40:56] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-16 11:40:56] [INFO ] Computed 82 place invariants in 25 ms
[2023-03-16 11:40:56] [INFO ] [Real]Absence check using 63 positive place invariants in 12 ms returned sat
[2023-03-16 11:40:56] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 5 ms returned unsat
[2023-03-16 11:40:56] [INFO ] [Real]Absence check using 63 positive place invariants in 12 ms returned sat
[2023-03-16 11:40:56] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 5 ms returned unsat
[2023-03-16 11:40:56] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-16 11:40:56] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 5 ms returned unsat
[2023-03-16 11:40:56] [INFO ] [Real]Absence check using 63 positive place invariants in 12 ms returned sat
[2023-03-16 11:40:56] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 13 ms returned sat
[2023-03-16 11:40:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 11:40:57] [INFO ] [Real]Absence check using state equation in 1131 ms returned sat
[2023-03-16 11:40:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 11:40:57] [INFO ] [Nat]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-16 11:40:57] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 12 ms returned sat
[2023-03-16 11:40:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 11:40:58] [INFO ] [Nat]Absence check using state equation in 547 ms returned sat
[2023-03-16 11:40:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 11:40:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 1087 ms returned sat
[2023-03-16 11:40:59] [INFO ] Deduced a trap composed of 234 places in 275 ms of which 3 ms to minimize.
[2023-03-16 11:40:59] [INFO ] Deduced a trap composed of 216 places in 283 ms of which 1 ms to minimize.
[2023-03-16 11:41:00] [INFO ] Deduced a trap composed of 243 places in 266 ms of which 1 ms to minimize.
[2023-03-16 11:41:00] [INFO ] Deduced a trap composed of 236 places in 261 ms of which 1 ms to minimize.
[2023-03-16 11:41:00] [INFO ] Deduced a trap composed of 234 places in 260 ms of which 1 ms to minimize.
[2023-03-16 11:41:01] [INFO ] Deduced a trap composed of 234 places in 257 ms of which 0 ms to minimize.
[2023-03-16 11:41:01] [INFO ] Deduced a trap composed of 222 places in 262 ms of which 1 ms to minimize.
[2023-03-16 11:41:01] [INFO ] Deduced a trap composed of 240 places in 263 ms of which 1 ms to minimize.
[2023-03-16 11:41:02] [INFO ] Deduced a trap composed of 230 places in 264 ms of which 1 ms to minimize.
[2023-03-16 11:41:02] [INFO ] Deduced a trap composed of 228 places in 262 ms of which 1 ms to minimize.
[2023-03-16 11:41:02] [INFO ] Deduced a trap composed of 226 places in 257 ms of which 1 ms to minimize.
[2023-03-16 11:41:03] [INFO ] Deduced a trap composed of 234 places in 253 ms of which 0 ms to minimize.
[2023-03-16 11:41:03] [INFO ] Deduced a trap composed of 232 places in 252 ms of which 0 ms to minimize.
[2023-03-16 11:41:03] [INFO ] Deduced a trap composed of 228 places in 265 ms of which 0 ms to minimize.
[2023-03-16 11:41:04] [INFO ] Deduced a trap composed of 239 places in 262 ms of which 1 ms to minimize.
[2023-03-16 11:41:05] [INFO ] Deduced a trap composed of 228 places in 261 ms of which 1 ms to minimize.
[2023-03-16 11:41:06] [INFO ] Deduced a trap composed of 230 places in 262 ms of which 0 ms to minimize.
[2023-03-16 11:41:06] [INFO ] Deduced a trap composed of 222 places in 261 ms of which 1 ms to minimize.
[2023-03-16 11:41:07] [INFO ] Deduced a trap composed of 238 places in 265 ms of which 1 ms to minimize.
[2023-03-16 11:41:07] [INFO ] Deduced a trap composed of 226 places in 271 ms of which 0 ms to minimize.
[2023-03-16 11:41:08] [INFO ] Deduced a trap composed of 234 places in 271 ms of which 1 ms to minimize.
[2023-03-16 11:41:08] [INFO ] Deduced a trap composed of 216 places in 266 ms of which 1 ms to minimize.
[2023-03-16 11:41:08] [INFO ] Deduced a trap composed of 230 places in 271 ms of which 1 ms to minimize.
[2023-03-16 11:41:09] [INFO ] Deduced a trap composed of 224 places in 261 ms of which 1 ms to minimize.
[2023-03-16 11:41:09] [INFO ] Deduced a trap composed of 234 places in 259 ms of which 0 ms to minimize.
[2023-03-16 11:41:10] [INFO ] Deduced a trap composed of 226 places in 253 ms of which 1 ms to minimize.
[2023-03-16 11:41:10] [INFO ] Deduced a trap composed of 228 places in 266 ms of which 1 ms to minimize.
[2023-03-16 11:41:10] [INFO ] Deduced a trap composed of 230 places in 265 ms of which 0 ms to minimize.
[2023-03-16 11:41:11] [INFO ] Deduced a trap composed of 238 places in 259 ms of which 1 ms to minimize.
[2023-03-16 11:41:11] [INFO ] Deduced a trap composed of 232 places in 260 ms of which 1 ms to minimize.
[2023-03-16 11:41:12] [INFO ] Deduced a trap composed of 230 places in 255 ms of which 1 ms to minimize.
[2023-03-16 11:41:12] [INFO ] Deduced a trap composed of 243 places in 262 ms of which 1 ms to minimize.
[2023-03-16 11:41:12] [INFO ] Deduced a trap composed of 238 places in 269 ms of which 1 ms to minimize.
[2023-03-16 11:41:13] [INFO ] Deduced a trap composed of 238 places in 261 ms of which 1 ms to minimize.
[2023-03-16 11:41:13] [INFO ] Deduced a trap composed of 234 places in 265 ms of which 4 ms to minimize.
[2023-03-16 11:41:13] [INFO ] Deduced a trap composed of 236 places in 261 ms of which 1 ms to minimize.
[2023-03-16 11:41:14] [INFO ] Deduced a trap composed of 234 places in 261 ms of which 1 ms to minimize.
[2023-03-16 11:41:14] [INFO ] Deduced a trap composed of 230 places in 261 ms of which 1 ms to minimize.
[2023-03-16 11:41:15] [INFO ] Deduced a trap composed of 242 places in 272 ms of which 1 ms to minimize.
[2023-03-16 11:41:15] [INFO ] Deduced a trap composed of 230 places in 266 ms of which 1 ms to minimize.
[2023-03-16 11:41:15] [INFO ] Deduced a trap composed of 232 places in 261 ms of which 0 ms to minimize.
[2023-03-16 11:41:16] [INFO ] Deduced a trap composed of 237 places in 262 ms of which 0 ms to minimize.
[2023-03-16 11:41:16] [INFO ] Deduced a trap composed of 244 places in 268 ms of which 1 ms to minimize.
[2023-03-16 11:41:16] [INFO ] Deduced a trap composed of 232 places in 264 ms of which 0 ms to minimize.
[2023-03-16 11:41:17] [INFO ] Deduced a trap composed of 230 places in 265 ms of which 0 ms to minimize.
[2023-03-16 11:41:17] [INFO ] Deduced a trap composed of 236 places in 260 ms of which 1 ms to minimize.
[2023-03-16 11:41:17] [INFO ] Deduced a trap composed of 224 places in 262 ms of which 1 ms to minimize.
[2023-03-16 11:41:18] [INFO ] Deduced a trap composed of 236 places in 267 ms of which 0 ms to minimize.
[2023-03-16 11:41:18] [INFO ] Deduced a trap composed of 228 places in 270 ms of which 1 ms to minimize.
[2023-03-16 11:41:19] [INFO ] Deduced a trap composed of 222 places in 267 ms of which 1 ms to minimize.
[2023-03-16 11:41:19] [INFO ] Deduced a trap composed of 232 places in 265 ms of which 2 ms to minimize.
[2023-03-16 11:41:20] [INFO ] Deduced a trap composed of 226 places in 261 ms of which 1 ms to minimize.
[2023-03-16 11:41:20] [INFO ] Deduced a trap composed of 226 places in 270 ms of which 1 ms to minimize.
[2023-03-16 11:41:20] [INFO ] Deduced a trap composed of 234 places in 263 ms of which 1 ms to minimize.
[2023-03-16 11:41:21] [INFO ] Deduced a trap composed of 228 places in 255 ms of which 0 ms to minimize.
[2023-03-16 11:41:21] [INFO ] Deduced a trap composed of 229 places in 269 ms of which 3 ms to minimize.
[2023-03-16 11:41:22] [INFO ] Deduced a trap composed of 236 places in 263 ms of which 1 ms to minimize.
[2023-03-16 11:41:22] [INFO ] Deduced a trap composed of 232 places in 260 ms of which 0 ms to minimize.
[2023-03-16 11:41:22] [INFO ] Deduced a trap composed of 230 places in 254 ms of which 0 ms to minimize.
[2023-03-16 11:41:23] [INFO ] Deduced a trap composed of 228 places in 259 ms of which 0 ms to minimize.
[2023-03-16 11:41:23] [INFO ] Deduced a trap composed of 234 places in 257 ms of which 1 ms to minimize.
[2023-03-16 11:41:23] [INFO ] Deduced a trap composed of 236 places in 256 ms of which 0 ms to minimize.
[2023-03-16 11:41:23] [INFO ] Deduced a trap composed of 242 places in 261 ms of which 1 ms to minimize.
[2023-03-16 11:41:24] [INFO ] Deduced a trap composed of 222 places in 270 ms of which 1 ms to minimize.
[2023-03-16 11:41:24] [INFO ] Deduced a trap composed of 228 places in 259 ms of which 0 ms to minimize.
[2023-03-16 11:41:25] [INFO ] Deduced a trap composed of 234 places in 259 ms of which 1 ms to minimize.
[2023-03-16 11:41:25] [INFO ] Deduced a trap composed of 226 places in 266 ms of which 2 ms to minimize.
[2023-03-16 11:41:25] [INFO ] Deduced a trap composed of 234 places in 264 ms of which 4 ms to minimize.
[2023-03-16 11:41:26] [INFO ] Deduced a trap composed of 242 places in 268 ms of which 1 ms to minimize.
[2023-03-16 11:41:26] [INFO ] Deduced a trap composed of 230 places in 271 ms of which 1 ms to minimize.
[2023-03-16 11:41:28] [INFO ] Deduced a trap composed of 226 places in 262 ms of which 1 ms to minimize.
[2023-03-16 11:41:28] [INFO ] Deduced a trap composed of 230 places in 264 ms of which 0 ms to minimize.
[2023-03-16 11:41:29] [INFO ] Deduced a trap composed of 232 places in 265 ms of which 1 ms to minimize.
[2023-03-16 11:41:29] [INFO ] Deduced a trap composed of 234 places in 262 ms of which 0 ms to minimize.
[2023-03-16 11:41:29] [INFO ] Deduced a trap composed of 232 places in 263 ms of which 1 ms to minimize.
[2023-03-16 11:41:30] [INFO ] Deduced a trap composed of 236 places in 259 ms of which 1 ms to minimize.
[2023-03-16 11:41:30] [INFO ] Deduced a trap composed of 228 places in 259 ms of which 0 ms to minimize.
[2023-03-16 11:41:31] [INFO ] Deduced a trap composed of 231 places in 265 ms of which 1 ms to minimize.
[2023-03-16 11:41:31] [INFO ] Deduced a trap composed of 232 places in 252 ms of which 0 ms to minimize.
[2023-03-16 11:41:32] [INFO ] Deduced a trap composed of 234 places in 259 ms of which 0 ms to minimize.
[2023-03-16 11:41:32] [INFO ] Deduced a trap composed of 234 places in 267 ms of which 1 ms to minimize.
[2023-03-16 11:41:32] [INFO ] Deduced a trap composed of 234 places in 256 ms of which 1 ms to minimize.
[2023-03-16 11:41:33] [INFO ] Deduced a trap composed of 239 places in 260 ms of which 0 ms to minimize.
[2023-03-16 11:41:36] [INFO ] Trap strengthening (SAT) tested/added 83/83 trap constraints in 36759 ms
[2023-03-16 11:41:36] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-16 11:41:36] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 2 ms returned unsat
[2023-03-16 11:41:36] [INFO ] [Real]Absence check using 63 positive place invariants in 14 ms returned sat
[2023-03-16 11:41:36] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 12 ms returned sat
[2023-03-16 11:41:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 11:41:37] [INFO ] [Real]Absence check using state equation in 1147 ms returned sat
[2023-03-16 11:41:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 11:41:37] [INFO ] [Nat]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-16 11:41:37] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 13 ms returned sat
[2023-03-16 11:41:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 11:41:38] [INFO ] [Nat]Absence check using state equation in 782 ms returned sat
[2023-03-16 11:41:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 466 ms returned sat
[2023-03-16 11:41:39] [INFO ] Deduced a trap composed of 250 places in 277 ms of which 1 ms to minimize.
[2023-03-16 11:41:39] [INFO ] Deduced a trap composed of 228 places in 266 ms of which 0 ms to minimize.
[2023-03-16 11:41:39] [INFO ] Deduced a trap composed of 228 places in 266 ms of which 1 ms to minimize.
[2023-03-16 11:41:40] [INFO ] Deduced a trap composed of 238 places in 267 ms of which 0 ms to minimize.
[2023-03-16 11:41:40] [INFO ] Deduced a trap composed of 237 places in 263 ms of which 0 ms to minimize.
[2023-03-16 11:41:40] [INFO ] Deduced a trap composed of 241 places in 272 ms of which 1 ms to minimize.
[2023-03-16 11:41:40] [INFO ] Deduced a trap composed of 222 places in 267 ms of which 0 ms to minimize.
[2023-03-16 11:41:41] [INFO ] Deduced a trap composed of 234 places in 259 ms of which 1 ms to minimize.
[2023-03-16 11:41:41] [INFO ] Deduced a trap composed of 232 places in 258 ms of which 0 ms to minimize.
[2023-03-16 11:41:41] [INFO ] Deduced a trap composed of 234 places in 264 ms of which 1 ms to minimize.
[2023-03-16 11:41:42] [INFO ] Deduced a trap composed of 249 places in 273 ms of which 1 ms to minimize.
[2023-03-16 11:41:42] [INFO ] Deduced a trap composed of 233 places in 271 ms of which 0 ms to minimize.
[2023-03-16 11:41:43] [INFO ] Deduced a trap composed of 230 places in 266 ms of which 1 ms to minimize.
[2023-03-16 11:41:43] [INFO ] Deduced a trap composed of 234 places in 275 ms of which 1 ms to minimize.
[2023-03-16 11:41:43] [INFO ] Deduced a trap composed of 230 places in 270 ms of which 0 ms to minimize.
[2023-03-16 11:41:44] [INFO ] Deduced a trap composed of 228 places in 268 ms of which 0 ms to minimize.
[2023-03-16 11:41:44] [INFO ] Deduced a trap composed of 232 places in 264 ms of which 1 ms to minimize.
[2023-03-16 11:41:44] [INFO ] Deduced a trap composed of 234 places in 262 ms of which 0 ms to minimize.
[2023-03-16 11:41:45] [INFO ] Deduced a trap composed of 234 places in 260 ms of which 0 ms to minimize.
[2023-03-16 11:41:45] [INFO ] Deduced a trap composed of 234 places in 255 ms of which 1 ms to minimize.
[2023-03-16 11:41:45] [INFO ] Deduced a trap composed of 230 places in 269 ms of which 0 ms to minimize.
[2023-03-16 11:41:47] [INFO ] Deduced a trap composed of 251 places in 264 ms of which 0 ms to minimize.
[2023-03-16 11:41:47] [INFO ] Deduced a trap composed of 253 places in 263 ms of which 1 ms to minimize.
[2023-03-16 11:41:47] [INFO ] Deduced a trap composed of 228 places in 261 ms of which 1 ms to minimize.
[2023-03-16 11:41:47] [INFO ] Deduced a trap composed of 241 places in 263 ms of which 0 ms to minimize.
[2023-03-16 11:41:48] [INFO ] Deduced a trap composed of 230 places in 267 ms of which 0 ms to minimize.
[2023-03-16 11:41:48] [INFO ] Deduced a trap composed of 232 places in 259 ms of which 1 ms to minimize.
[2023-03-16 11:41:48] [INFO ] Deduced a trap composed of 225 places in 255 ms of which 0 ms to minimize.
[2023-03-16 11:41:49] [INFO ] Deduced a trap composed of 232 places in 259 ms of which 0 ms to minimize.
[2023-03-16 11:41:49] [INFO ] Deduced a trap composed of 226 places in 255 ms of which 1 ms to minimize.
[2023-03-16 11:41:50] [INFO ] Deduced a trap composed of 238 places in 261 ms of which 0 ms to minimize.
[2023-03-16 11:41:50] [INFO ] Deduced a trap composed of 226 places in 269 ms of which 1 ms to minimize.
[2023-03-16 11:41:50] [INFO ] Deduced a trap composed of 236 places in 257 ms of which 1 ms to minimize.
[2023-03-16 11:41:51] [INFO ] Deduced a trap composed of 229 places in 260 ms of which 0 ms to minimize.
[2023-03-16 11:41:51] [INFO ] Deduced a trap composed of 233 places in 259 ms of which 1 ms to minimize.
[2023-03-16 11:41:51] [INFO ] Deduced a trap composed of 232 places in 264 ms of which 0 ms to minimize.
[2023-03-16 11:41:52] [INFO ] Deduced a trap composed of 230 places in 265 ms of which 1 ms to minimize.
[2023-03-16 11:41:52] [INFO ] Deduced a trap composed of 229 places in 260 ms of which 0 ms to minimize.
[2023-03-16 11:41:53] [INFO ] Deduced a trap composed of 241 places in 266 ms of which 1 ms to minimize.
[2023-03-16 11:41:53] [INFO ] Deduced a trap composed of 224 places in 257 ms of which 1 ms to minimize.
[2023-03-16 11:41:53] [INFO ] Deduced a trap composed of 245 places in 258 ms of which 0 ms to minimize.
[2023-03-16 11:41:54] [INFO ] Deduced a trap composed of 232 places in 267 ms of which 0 ms to minimize.
[2023-03-16 11:41:55] [INFO ] Deduced a trap composed of 232 places in 265 ms of which 1 ms to minimize.
[2023-03-16 11:41:56] [INFO ] Deduced a trap composed of 232 places in 256 ms of which 1 ms to minimize.
[2023-03-16 11:41:56] [INFO ] Deduced a trap composed of 230 places in 275 ms of which 1 ms to minimize.
[2023-03-16 11:41:57] [INFO ] Deduced a trap composed of 238 places in 278 ms of which 0 ms to minimize.
[2023-03-16 11:41:57] [INFO ] Deduced a trap composed of 237 places in 259 ms of which 1 ms to minimize.
[2023-03-16 11:41:57] [INFO ] Deduced a trap composed of 232 places in 260 ms of which 0 ms to minimize.
[2023-03-16 11:41:57] [INFO ] Deduced a trap composed of 230 places in 275 ms of which 1 ms to minimize.
[2023-03-16 11:41:58] [INFO ] Deduced a trap composed of 230 places in 277 ms of which 0 ms to minimize.
[2023-03-16 11:41:58] [INFO ] Deduced a trap composed of 239 places in 265 ms of which 1 ms to minimize.
[2023-03-16 11:41:59] [INFO ] Deduced a trap composed of 232 places in 275 ms of which 1 ms to minimize.
[2023-03-16 11:41:59] [INFO ] Deduced a trap composed of 230 places in 279 ms of which 1 ms to minimize.
[2023-03-16 11:42:00] [INFO ] Deduced a trap composed of 228 places in 272 ms of which 0 ms to minimize.
[2023-03-16 11:42:00] [INFO ] Deduced a trap composed of 232 places in 278 ms of which 1 ms to minimize.
[2023-03-16 11:42:00] [INFO ] Deduced a trap composed of 224 places in 272 ms of which 0 ms to minimize.
[2023-03-16 11:42:01] [INFO ] Deduced a trap composed of 234 places in 275 ms of which 0 ms to minimize.
[2023-03-16 11:42:01] [INFO ] Deduced a trap composed of 234 places in 266 ms of which 0 ms to minimize.
[2023-03-16 11:42:01] [INFO ] Deduced a trap composed of 238 places in 272 ms of which 1 ms to minimize.
[2023-03-16 11:42:02] [INFO ] Deduced a trap composed of 250 places in 276 ms of which 1 ms to minimize.
[2023-03-16 11:42:02] [INFO ] Deduced a trap composed of 230 places in 273 ms of which 1 ms to minimize.
[2023-03-16 11:42:02] [INFO ] Deduced a trap composed of 228 places in 267 ms of which 0 ms to minimize.
[2023-03-16 11:42:03] [INFO ] Deduced a trap composed of 236 places in 263 ms of which 1 ms to minimize.
[2023-03-16 11:42:04] [INFO ] Deduced a trap composed of 244 places in 271 ms of which 1 ms to minimize.
[2023-03-16 11:42:05] [INFO ] Deduced a trap composed of 248 places in 275 ms of which 1 ms to minimize.
[2023-03-16 11:42:07] [INFO ] Deduced a trap composed of 237 places in 266 ms of which 1 ms to minimize.
[2023-03-16 11:42:07] [INFO ] Deduced a trap composed of 228 places in 266 ms of which 0 ms to minimize.
[2023-03-16 11:42:08] [INFO ] Deduced a trap composed of 234 places in 265 ms of which 0 ms to minimize.
[2023-03-16 11:42:09] [INFO ] Deduced a trap composed of 240 places in 262 ms of which 0 ms to minimize.
[2023-03-16 11:42:09] [INFO ] Deduced a trap composed of 243 places in 257 ms of which 0 ms to minimize.
[2023-03-16 11:42:09] [INFO ] Deduced a trap composed of 234 places in 260 ms of which 0 ms to minimize.
[2023-03-16 11:42:10] [INFO ] Deduced a trap composed of 241 places in 261 ms of which 1 ms to minimize.
[2023-03-16 11:42:10] [INFO ] Deduced a trap composed of 245 places in 260 ms of which 0 ms to minimize.
[2023-03-16 11:42:11] [INFO ] Deduced a trap composed of 231 places in 259 ms of which 1 ms to minimize.
[2023-03-16 11:42:14] [INFO ] Trap strengthening (SAT) tested/added 74/74 trap constraints in 35354 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 38 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 38 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-16 11:42:14] [INFO ] Computed 82 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 70218 resets, run finished after 6709 ms. (steps per millisecond=149 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 8863 resets, run finished after 1415 ms. (steps per millisecond=706 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000000 steps, including 9000 resets, run finished after 1416 ms. (steps per millisecond=706 ) properties (out of 2) seen :4
[2023-03-16 11:42:23] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-16 11:42:23] [INFO ] Computed 82 place invariants in 26 ms
[2023-03-16 11:42:23] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-16 11:42:23] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 13 ms returned sat
[2023-03-16 11:42:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 11:42:25] [INFO ] [Real]Absence check using state equation in 1163 ms returned sat
[2023-03-16 11:42:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 11:42:25] [INFO ] [Nat]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-16 11:42:25] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 12 ms returned sat
[2023-03-16 11:42:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 11:42:25] [INFO ] [Nat]Absence check using state equation in 543 ms returned sat
[2023-03-16 11:42:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 11:42:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1111 ms returned sat
[2023-03-16 11:42:27] [INFO ] Deduced a trap composed of 234 places in 263 ms of which 1 ms to minimize.
[2023-03-16 11:42:27] [INFO ] Deduced a trap composed of 216 places in 271 ms of which 0 ms to minimize.
[2023-03-16 11:42:27] [INFO ] Deduced a trap composed of 243 places in 262 ms of which 0 ms to minimize.
[2023-03-16 11:42:28] [INFO ] Deduced a trap composed of 236 places in 265 ms of which 0 ms to minimize.
[2023-03-16 11:42:28] [INFO ] Deduced a trap composed of 234 places in 273 ms of which 1 ms to minimize.
[2023-03-16 11:42:28] [INFO ] Deduced a trap composed of 234 places in 270 ms of which 1 ms to minimize.
[2023-03-16 11:42:29] [INFO ] Deduced a trap composed of 222 places in 271 ms of which 0 ms to minimize.
[2023-03-16 11:42:29] [INFO ] Deduced a trap composed of 240 places in 272 ms of which 1 ms to minimize.
[2023-03-16 11:42:29] [INFO ] Deduced a trap composed of 230 places in 273 ms of which 0 ms to minimize.
[2023-03-16 11:42:30] [INFO ] Deduced a trap composed of 228 places in 258 ms of which 0 ms to minimize.
[2023-03-16 11:42:30] [INFO ] Deduced a trap composed of 226 places in 264 ms of which 1 ms to minimize.
[2023-03-16 11:42:30] [INFO ] Deduced a trap composed of 234 places in 261 ms of which 0 ms to minimize.
[2023-03-16 11:42:31] [INFO ] Deduced a trap composed of 232 places in 264 ms of which 0 ms to minimize.
[2023-03-16 11:42:31] [INFO ] Deduced a trap composed of 228 places in 261 ms of which 1 ms to minimize.
[2023-03-16 11:42:31] [INFO ] Deduced a trap composed of 239 places in 268 ms of which 2 ms to minimize.
[2023-03-16 11:42:33] [INFO ] Deduced a trap composed of 228 places in 268 ms of which 0 ms to minimize.
[2023-03-16 11:42:33] [INFO ] Deduced a trap composed of 230 places in 258 ms of which 1 ms to minimize.
[2023-03-16 11:42:34] [INFO ] Deduced a trap composed of 222 places in 262 ms of which 1 ms to minimize.
[2023-03-16 11:42:34] [INFO ] Deduced a trap composed of 238 places in 263 ms of which 0 ms to minimize.
[2023-03-16 11:42:35] [INFO ] Deduced a trap composed of 226 places in 265 ms of which 1 ms to minimize.
[2023-03-16 11:42:35] [INFO ] Deduced a trap composed of 234 places in 260 ms of which 1 ms to minimize.
[2023-03-16 11:42:36] [INFO ] Deduced a trap composed of 216 places in 271 ms of which 0 ms to minimize.
[2023-03-16 11:42:36] [INFO ] Deduced a trap composed of 230 places in 266 ms of which 1 ms to minimize.
[2023-03-16 11:42:36] [INFO ] Deduced a trap composed of 224 places in 263 ms of which 1 ms to minimize.
[2023-03-16 11:42:37] [INFO ] Deduced a trap composed of 234 places in 265 ms of which 0 ms to minimize.
[2023-03-16 11:42:37] [INFO ] Deduced a trap composed of 226 places in 262 ms of which 0 ms to minimize.
[2023-03-16 11:42:38] [INFO ] Deduced a trap composed of 228 places in 252 ms of which 1 ms to minimize.
[2023-03-16 11:42:38] [INFO ] Deduced a trap composed of 230 places in 257 ms of which 1 ms to minimize.
[2023-03-16 11:42:39] [INFO ] Deduced a trap composed of 238 places in 256 ms of which 0 ms to minimize.
[2023-03-16 11:42:39] [INFO ] Deduced a trap composed of 232 places in 258 ms of which 0 ms to minimize.
[2023-03-16 11:42:39] [INFO ] Deduced a trap composed of 230 places in 253 ms of which 0 ms to minimize.
[2023-03-16 11:42:40] [INFO ] Deduced a trap composed of 243 places in 254 ms of which 1 ms to minimize.
[2023-03-16 11:42:40] [INFO ] Deduced a trap composed of 238 places in 250 ms of which 0 ms to minimize.
[2023-03-16 11:42:40] [INFO ] Deduced a trap composed of 238 places in 256 ms of which 0 ms to minimize.
[2023-03-16 11:42:40] [INFO ] Deduced a trap composed of 234 places in 259 ms of which 0 ms to minimize.
[2023-03-16 11:42:41] [INFO ] Deduced a trap composed of 236 places in 255 ms of which 0 ms to minimize.
[2023-03-16 11:42:41] [INFO ] Deduced a trap composed of 234 places in 258 ms of which 1 ms to minimize.
[2023-03-16 11:42:42] [INFO ] Deduced a trap composed of 230 places in 256 ms of which 1 ms to minimize.
[2023-03-16 11:42:42] [INFO ] Deduced a trap composed of 242 places in 262 ms of which 0 ms to minimize.
[2023-03-16 11:42:42] [INFO ] Deduced a trap composed of 230 places in 268 ms of which 1 ms to minimize.
[2023-03-16 11:42:43] [INFO ] Deduced a trap composed of 232 places in 271 ms of which 0 ms to minimize.
[2023-03-16 11:42:43] [INFO ] Deduced a trap composed of 237 places in 257 ms of which 0 ms to minimize.
[2023-03-16 11:42:44] [INFO ] Deduced a trap composed of 244 places in 261 ms of which 1 ms to minimize.
[2023-03-16 11:42:44] [INFO ] Deduced a trap composed of 232 places in 264 ms of which 1 ms to minimize.
[2023-03-16 11:42:44] [INFO ] Deduced a trap composed of 230 places in 260 ms of which 0 ms to minimize.
[2023-03-16 11:42:44] [INFO ] Deduced a trap composed of 236 places in 256 ms of which 1 ms to minimize.
[2023-03-16 11:42:45] [INFO ] Deduced a trap composed of 224 places in 254 ms of which 0 ms to minimize.
[2023-03-16 11:42:45] [INFO ] Deduced a trap composed of 236 places in 253 ms of which 0 ms to minimize.
[2023-03-16 11:42:46] [INFO ] Deduced a trap composed of 228 places in 258 ms of which 0 ms to minimize.
[2023-03-16 11:42:46] [INFO ] Deduced a trap composed of 222 places in 254 ms of which 1 ms to minimize.
[2023-03-16 11:42:47] [INFO ] Deduced a trap composed of 232 places in 262 ms of which 0 ms to minimize.
[2023-03-16 11:42:47] [INFO ] Deduced a trap composed of 226 places in 261 ms of which 0 ms to minimize.
[2023-03-16 11:42:47] [INFO ] Deduced a trap composed of 226 places in 263 ms of which 0 ms to minimize.
[2023-03-16 11:42:48] [INFO ] Deduced a trap composed of 234 places in 256 ms of which 0 ms to minimize.
[2023-03-16 11:42:48] [INFO ] Deduced a trap composed of 228 places in 253 ms of which 1 ms to minimize.
[2023-03-16 11:42:48] [INFO ] Deduced a trap composed of 229 places in 266 ms of which 0 ms to minimize.
[2023-03-16 11:42:49] [INFO ] Deduced a trap composed of 236 places in 261 ms of which 0 ms to minimize.
[2023-03-16 11:42:49] [INFO ] Deduced a trap composed of 232 places in 261 ms of which 1 ms to minimize.
[2023-03-16 11:42:50] [INFO ] Deduced a trap composed of 230 places in 258 ms of which 1 ms to minimize.
[2023-03-16 11:42:50] [INFO ] Deduced a trap composed of 228 places in 258 ms of which 1 ms to minimize.
[2023-03-16 11:42:50] [INFO ] Deduced a trap composed of 234 places in 256 ms of which 0 ms to minimize.
[2023-03-16 11:42:50] [INFO ] Deduced a trap composed of 236 places in 259 ms of which 1 ms to minimize.
[2023-03-16 11:42:51] [INFO ] Deduced a trap composed of 242 places in 265 ms of which 0 ms to minimize.
[2023-03-16 11:42:51] [INFO ] Deduced a trap composed of 222 places in 261 ms of which 1 ms to minimize.
[2023-03-16 11:42:52] [INFO ] Deduced a trap composed of 228 places in 259 ms of which 0 ms to minimize.
[2023-03-16 11:42:52] [INFO ] Deduced a trap composed of 234 places in 266 ms of which 0 ms to minimize.
[2023-03-16 11:42:52] [INFO ] Deduced a trap composed of 226 places in 259 ms of which 0 ms to minimize.
[2023-03-16 11:42:53] [INFO ] Deduced a trap composed of 234 places in 270 ms of which 0 ms to minimize.
[2023-03-16 11:42:53] [INFO ] Deduced a trap composed of 242 places in 267 ms of which 0 ms to minimize.
[2023-03-16 11:42:53] [INFO ] Deduced a trap composed of 230 places in 262 ms of which 1 ms to minimize.
[2023-03-16 11:42:55] [INFO ] Deduced a trap composed of 226 places in 256 ms of which 1 ms to minimize.
[2023-03-16 11:42:56] [INFO ] Deduced a trap composed of 230 places in 269 ms of which 0 ms to minimize.
[2023-03-16 11:42:56] [INFO ] Deduced a trap composed of 232 places in 264 ms of which 0 ms to minimize.
[2023-03-16 11:42:56] [INFO ] Deduced a trap composed of 234 places in 261 ms of which 0 ms to minimize.
[2023-03-16 11:42:57] [INFO ] Deduced a trap composed of 232 places in 259 ms of which 1 ms to minimize.
[2023-03-16 11:42:57] [INFO ] Deduced a trap composed of 236 places in 252 ms of which 0 ms to minimize.
[2023-03-16 11:42:58] [INFO ] Deduced a trap composed of 228 places in 264 ms of which 0 ms to minimize.
[2023-03-16 11:42:58] [INFO ] Deduced a trap composed of 231 places in 257 ms of which 0 ms to minimize.
[2023-03-16 11:42:58] [INFO ] Deduced a trap composed of 232 places in 262 ms of which 0 ms to minimize.
[2023-03-16 11:42:59] [INFO ] Deduced a trap composed of 234 places in 259 ms of which 2 ms to minimize.
[2023-03-16 11:42:59] [INFO ] Deduced a trap composed of 234 places in 253 ms of which 1 ms to minimize.
[2023-03-16 11:43:00] [INFO ] Deduced a trap composed of 234 places in 258 ms of which 1 ms to minimize.
[2023-03-16 11:43:00] [INFO ] Deduced a trap composed of 239 places in 258 ms of which 1 ms to minimize.
[2023-03-16 11:43:03] [INFO ] Trap strengthening (SAT) tested/added 83/83 trap constraints in 36516 ms
[2023-03-16 11:43:03] [INFO ] [Real]Absence check using 63 positive place invariants in 12 ms returned sat
[2023-03-16 11:43:03] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 12 ms returned sat
[2023-03-16 11:43:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 11:43:04] [INFO ] [Real]Absence check using state equation in 1146 ms returned sat
[2023-03-16 11:43:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 11:43:04] [INFO ] [Nat]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-16 11:43:04] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 13 ms returned sat
[2023-03-16 11:43:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 11:43:05] [INFO ] [Nat]Absence check using state equation in 784 ms returned sat
[2023-03-16 11:43:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 487 ms returned sat
[2023-03-16 11:43:06] [INFO ] Deduced a trap composed of 250 places in 272 ms of which 0 ms to minimize.
[2023-03-16 11:43:06] [INFO ] Deduced a trap composed of 228 places in 276 ms of which 0 ms to minimize.
[2023-03-16 11:43:06] [INFO ] Deduced a trap composed of 228 places in 273 ms of which 0 ms to minimize.
[2023-03-16 11:43:07] [INFO ] Deduced a trap composed of 238 places in 263 ms of which 0 ms to minimize.
[2023-03-16 11:43:07] [INFO ] Deduced a trap composed of 237 places in 265 ms of which 1 ms to minimize.
[2023-03-16 11:43:07] [INFO ] Deduced a trap composed of 241 places in 274 ms of which 1 ms to minimize.
[2023-03-16 11:43:08] [INFO ] Deduced a trap composed of 222 places in 269 ms of which 0 ms to minimize.
[2023-03-16 11:43:08] [INFO ] Deduced a trap composed of 234 places in 259 ms of which 0 ms to minimize.
[2023-03-16 11:43:08] [INFO ] Deduced a trap composed of 232 places in 260 ms of which 0 ms to minimize.
[2023-03-16 11:43:09] [INFO ] Deduced a trap composed of 234 places in 259 ms of which 1 ms to minimize.
[2023-03-16 11:43:09] [INFO ] Deduced a trap composed of 249 places in 263 ms of which 1 ms to minimize.
[2023-03-16 11:43:09] [INFO ] Deduced a trap composed of 233 places in 270 ms of which 0 ms to minimize.
[2023-03-16 11:43:10] [INFO ] Deduced a trap composed of 230 places in 253 ms of which 0 ms to minimize.
[2023-03-16 11:43:10] [INFO ] Deduced a trap composed of 234 places in 266 ms of which 1 ms to minimize.
[2023-03-16 11:43:11] [INFO ] Deduced a trap composed of 230 places in 262 ms of which 1 ms to minimize.
[2023-03-16 11:43:11] [INFO ] Deduced a trap composed of 228 places in 267 ms of which 1 ms to minimize.
[2023-03-16 11:43:11] [INFO ] Deduced a trap composed of 232 places in 260 ms of which 0 ms to minimize.
[2023-03-16 11:43:12] [INFO ] Deduced a trap composed of 234 places in 260 ms of which 1 ms to minimize.
[2023-03-16 11:43:12] [INFO ] Deduced a trap composed of 234 places in 267 ms of which 0 ms to minimize.
[2023-03-16 11:43:12] [INFO ] Deduced a trap composed of 234 places in 265 ms of which 1 ms to minimize.
[2023-03-16 11:43:13] [INFO ] Deduced a trap composed of 230 places in 267 ms of which 0 ms to minimize.
[2023-03-16 11:43:14] [INFO ] Deduced a trap composed of 251 places in 266 ms of which 1 ms to minimize.
[2023-03-16 11:43:14] [INFO ] Deduced a trap composed of 253 places in 261 ms of which 1 ms to minimize.
[2023-03-16 11:43:14] [INFO ] Deduced a trap composed of 228 places in 258 ms of which 1 ms to minimize.
[2023-03-16 11:43:15] [INFO ] Deduced a trap composed of 241 places in 271 ms of which 1 ms to minimize.
[2023-03-16 11:43:15] [INFO ] Deduced a trap composed of 230 places in 267 ms of which 1 ms to minimize.
[2023-03-16 11:43:15] [INFO ] Deduced a trap composed of 232 places in 267 ms of which 1 ms to minimize.
[2023-03-16 11:43:16] [INFO ] Deduced a trap composed of 225 places in 270 ms of which 0 ms to minimize.
[2023-03-16 11:43:16] [INFO ] Deduced a trap composed of 232 places in 266 ms of which 0 ms to minimize.
[2023-03-16 11:43:17] [INFO ] Deduced a trap composed of 226 places in 265 ms of which 0 ms to minimize.
[2023-03-16 11:43:17] [INFO ] Deduced a trap composed of 238 places in 278 ms of which 1 ms to minimize.
[2023-03-16 11:43:17] [INFO ] Deduced a trap composed of 226 places in 267 ms of which 1 ms to minimize.
[2023-03-16 11:43:18] [INFO ] Deduced a trap composed of 236 places in 272 ms of which 1 ms to minimize.
[2023-03-16 11:43:18] [INFO ] Deduced a trap composed of 229 places in 268 ms of which 0 ms to minimize.
[2023-03-16 11:43:18] [INFO ] Deduced a trap composed of 233 places in 261 ms of which 1 ms to minimize.
[2023-03-16 11:43:19] [INFO ] Deduced a trap composed of 232 places in 269 ms of which 0 ms to minimize.
[2023-03-16 11:43:19] [INFO ] Deduced a trap composed of 230 places in 254 ms of which 0 ms to minimize.
[2023-03-16 11:43:20] [INFO ] Deduced a trap composed of 229 places in 271 ms of which 0 ms to minimize.
[2023-03-16 11:43:20] [INFO ] Deduced a trap composed of 241 places in 255 ms of which 1 ms to minimize.
[2023-03-16 11:43:20] [INFO ] Deduced a trap composed of 224 places in 267 ms of which 1 ms to minimize.
[2023-03-16 11:43:21] [INFO ] Deduced a trap composed of 245 places in 268 ms of which 0 ms to minimize.
[2023-03-16 11:43:21] [INFO ] Deduced a trap composed of 232 places in 270 ms of which 0 ms to minimize.
[2023-03-16 11:43:23] [INFO ] Deduced a trap composed of 232 places in 268 ms of which 0 ms to minimize.
[2023-03-16 11:43:23] [INFO ] Deduced a trap composed of 232 places in 264 ms of which 1 ms to minimize.
[2023-03-16 11:43:24] [INFO ] Deduced a trap composed of 230 places in 265 ms of which 1 ms to minimize.
[2023-03-16 11:43:24] [INFO ] Deduced a trap composed of 238 places in 256 ms of which 1 ms to minimize.
[2023-03-16 11:43:24] [INFO ] Deduced a trap composed of 237 places in 257 ms of which 1 ms to minimize.
[2023-03-16 11:43:24] [INFO ] Deduced a trap composed of 232 places in 261 ms of which 0 ms to minimize.
[2023-03-16 11:43:25] [INFO ] Deduced a trap composed of 230 places in 260 ms of which 0 ms to minimize.
[2023-03-16 11:43:25] [INFO ] Deduced a trap composed of 230 places in 274 ms of which 1 ms to minimize.
[2023-03-16 11:43:26] [INFO ] Deduced a trap composed of 239 places in 263 ms of which 1 ms to minimize.
[2023-03-16 11:43:26] [INFO ] Deduced a trap composed of 232 places in 271 ms of which 1 ms to minimize.
[2023-03-16 11:43:26] [INFO ] Deduced a trap composed of 230 places in 262 ms of which 0 ms to minimize.
[2023-03-16 11:43:27] [INFO ] Deduced a trap composed of 228 places in 277 ms of which 1 ms to minimize.
[2023-03-16 11:43:27] [INFO ] Deduced a trap composed of 232 places in 268 ms of which 1 ms to minimize.
[2023-03-16 11:43:28] [INFO ] Deduced a trap composed of 224 places in 267 ms of which 0 ms to minimize.
[2023-03-16 11:43:28] [INFO ] Deduced a trap composed of 234 places in 278 ms of which 1 ms to minimize.
[2023-03-16 11:43:28] [INFO ] Deduced a trap composed of 234 places in 277 ms of which 3 ms to minimize.
[2023-03-16 11:43:29] [INFO ] Deduced a trap composed of 238 places in 280 ms of which 0 ms to minimize.
[2023-03-16 11:43:29] [INFO ] Deduced a trap composed of 250 places in 272 ms of which 0 ms to minimize.
[2023-03-16 11:43:29] [INFO ] Deduced a trap composed of 230 places in 273 ms of which 0 ms to minimize.
[2023-03-16 11:43:30] [INFO ] Deduced a trap composed of 228 places in 275 ms of which 1 ms to minimize.
[2023-03-16 11:43:30] [INFO ] Deduced a trap composed of 236 places in 275 ms of which 0 ms to minimize.
[2023-03-16 11:43:31] [INFO ] Deduced a trap composed of 244 places in 278 ms of which 1 ms to minimize.
[2023-03-16 11:43:32] [INFO ] Deduced a trap composed of 248 places in 276 ms of which 1 ms to minimize.
[2023-03-16 11:43:34] [INFO ] Deduced a trap composed of 237 places in 257 ms of which 1 ms to minimize.
[2023-03-16 11:43:34] [INFO ] Deduced a trap composed of 228 places in 257 ms of which 1 ms to minimize.
[2023-03-16 11:43:35] [INFO ] Deduced a trap composed of 234 places in 261 ms of which 1 ms to minimize.
[2023-03-16 11:43:36] [INFO ] Deduced a trap composed of 240 places in 249 ms of which 0 ms to minimize.
[2023-03-16 11:43:36] [INFO ] Deduced a trap composed of 243 places in 253 ms of which 1 ms to minimize.
[2023-03-16 11:43:36] [INFO ] Deduced a trap composed of 234 places in 261 ms of which 0 ms to minimize.
[2023-03-16 11:43:37] [INFO ] Deduced a trap composed of 241 places in 257 ms of which 1 ms to minimize.
[2023-03-16 11:43:37] [INFO ] Deduced a trap composed of 245 places in 259 ms of which 0 ms to minimize.
[2023-03-16 11:43:38] [INFO ] Deduced a trap composed of 231 places in 253 ms of which 1 ms to minimize.
[2023-03-16 11:43:41] [INFO ] Trap strengthening (SAT) tested/added 74/74 trap constraints in 35112 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 34 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 34 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 32 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-16 11:43:41] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-16 11:43:41] [INFO ] Invariant cache hit.
[2023-03-16 11:43:41] [INFO ] Implicit Places using invariants in 665 ms returned []
[2023-03-16 11:43:41] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-16 11:43:41] [INFO ] Invariant cache hit.
[2023-03-16 11:43:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 11:43:49] [INFO ] Implicit Places using invariants and state equation in 7271 ms returned []
Implicit Place search using SMT with State Equation took 7938 ms to find 0 implicit places.
[2023-03-16 11:43:49] [INFO ] Redundant transitions in 75 ms returned []
[2023-03-16 11:43:49] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-16 11:43:49] [INFO ] Invariant cache hit.
[2023-03-16 11:43:49] [INFO ] Dead Transitions using invariants and state equation in 615 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8664 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-16 11:43:49] [INFO ] Computed 82 place invariants in 14 ms
Incomplete random walk after 10002 steps, including 705 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :3
[2023-03-16 11:43:49] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-16 11:43:50] [INFO ] Computed 82 place invariants in 23 ms
[2023-03-16 11:43:50] [INFO ] [Real]Absence check using 63 positive place invariants in 12 ms returned sat
[2023-03-16 11:43:50] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 12 ms returned sat
[2023-03-16 11:43:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 11:43:51] [INFO ] [Real]Absence check using state equation in 1152 ms returned sat
[2023-03-16 11:43:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 11:43:51] [INFO ] [Nat]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-16 11:43:51] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 13 ms returned sat
[2023-03-16 11:43:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 11:43:51] [INFO ] [Nat]Absence check using state equation in 560 ms returned sat
[2023-03-16 11:43:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 11:43:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 1122 ms returned sat
[2023-03-16 11:43:53] [INFO ] Deduced a trap composed of 234 places in 263 ms of which 1 ms to minimize.
[2023-03-16 11:43:53] [INFO ] Deduced a trap composed of 216 places in 269 ms of which 1 ms to minimize.
[2023-03-16 11:43:54] [INFO ] Deduced a trap composed of 243 places in 263 ms of which 1 ms to minimize.
[2023-03-16 11:43:54] [INFO ] Deduced a trap composed of 236 places in 263 ms of which 1 ms to minimize.
[2023-03-16 11:43:54] [INFO ] Deduced a trap composed of 234 places in 269 ms of which 0 ms to minimize.
[2023-03-16 11:43:54] [INFO ] Deduced a trap composed of 234 places in 262 ms of which 0 ms to minimize.
[2023-03-16 11:43:55] [INFO ] Deduced a trap composed of 222 places in 263 ms of which 1 ms to minimize.
[2023-03-16 11:43:55] [INFO ] Deduced a trap composed of 240 places in 273 ms of which 0 ms to minimize.
[2023-03-16 11:43:55] [INFO ] Deduced a trap composed of 230 places in 269 ms of which 1 ms to minimize.
[2023-03-16 11:43:56] [INFO ] Deduced a trap composed of 228 places in 269 ms of which 1 ms to minimize.
[2023-03-16 11:43:56] [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 31 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-16 11:43:56] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-16 11:43:56] [INFO ] Invariant cache hit.
[2023-03-16 11:43:57] [INFO ] Dead Transitions using invariants and state equation in 650 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 682 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-16 11:43:57] [INFO ] Computed 82 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 70118 resets, run finished after 6681 ms. (steps per millisecond=149 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 8935 resets, run finished after 1423 ms. (steps per millisecond=702 ) properties (out of 1) seen :3
[2023-03-16 11:44:05] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-16 11:44:05] [INFO ] Computed 82 place invariants in 26 ms
[2023-03-16 11:44:05] [INFO ] [Real]Absence check using 63 positive place invariants in 12 ms returned sat
[2023-03-16 11:44:05] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 12 ms returned sat
[2023-03-16 11:44:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 11:44:06] [INFO ] [Real]Absence check using state equation in 1161 ms returned sat
[2023-03-16 11:44:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 11:44:06] [INFO ] [Nat]Absence check using 63 positive place invariants in 14 ms returned sat
[2023-03-16 11:44:06] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 13 ms returned sat
[2023-03-16 11:44:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 11:44:07] [INFO ] [Nat]Absence check using state equation in 575 ms returned sat
[2023-03-16 11:44:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 11:44:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 1134 ms returned sat
[2023-03-16 11:44:08] [INFO ] Deduced a trap composed of 234 places in 276 ms of which 1 ms to minimize.
[2023-03-16 11:44:08] [INFO ] Deduced a trap composed of 216 places in 273 ms of which 0 ms to minimize.
[2023-03-16 11:44:09] [INFO ] Deduced a trap composed of 243 places in 276 ms of which 0 ms to minimize.
[2023-03-16 11:44:09] [INFO ] Deduced a trap composed of 236 places in 269 ms of which 1 ms to minimize.
[2023-03-16 11:44:09] [INFO ] Deduced a trap composed of 234 places in 263 ms of which 1 ms to minimize.
[2023-03-16 11:44:10] [INFO ] Deduced a trap composed of 234 places in 254 ms of which 0 ms to minimize.
[2023-03-16 11:44:10] [INFO ] Deduced a trap composed of 222 places in 262 ms of which 0 ms to minimize.
[2023-03-16 11:44:10] [INFO ] Deduced a trap composed of 240 places in 272 ms of which 1 ms to minimize.
[2023-03-16 11:44:11] [INFO ] Deduced a trap composed of 230 places in 268 ms of which 1 ms to minimize.
[2023-03-16 11:44:11] [INFO ] Deduced a trap composed of 228 places in 263 ms of which 1 ms to minimize.
[2023-03-16 11:44:11] [INFO ] Deduced a trap composed of 226 places in 264 ms of which 1 ms to minimize.
[2023-03-16 11:44:12] [INFO ] Deduced a trap composed of 234 places in 255 ms of which 1 ms to minimize.
[2023-03-16 11:44:12] [INFO ] Deduced a trap composed of 232 places in 258 ms of which 1 ms to minimize.
[2023-03-16 11:44:12] [INFO ] Deduced a trap composed of 228 places in 270 ms of which 1 ms to minimize.
[2023-03-16 11:44:13] [INFO ] Deduced a trap composed of 239 places in 264 ms of which 1 ms to minimize.
[2023-03-16 11:44:14] [INFO ] Deduced a trap composed of 228 places in 261 ms of which 1 ms to minimize.
[2023-03-16 11:44:15] [INFO ] Deduced a trap composed of 230 places in 259 ms of which 0 ms to minimize.
[2023-03-16 11:44:15] [INFO ] Deduced a trap composed of 222 places in 263 ms of which 0 ms to minimize.
[2023-03-16 11:44:16] [INFO ] Deduced a trap composed of 238 places in 267 ms of which 0 ms to minimize.
[2023-03-16 11:44:16] [INFO ] Deduced a trap composed of 226 places in 269 ms of which 1 ms to minimize.
[2023-03-16 11:44:17] [INFO ] Deduced a trap composed of 234 places in 271 ms of which 0 ms to minimize.
[2023-03-16 11:44:17] [INFO ] Deduced a trap composed of 216 places in 281 ms of which 1 ms to minimize.
[2023-03-16 11:44:17] [INFO ] Deduced a trap composed of 230 places in 277 ms of which 1 ms to minimize.
[2023-03-16 11:44:18] [INFO ] Deduced a trap composed of 224 places in 273 ms of which 1 ms to minimize.
[2023-03-16 11:44:18] [INFO ] Deduced a trap composed of 234 places in 279 ms of which 0 ms to minimize.
[2023-03-16 11:44:19] [INFO ] Deduced a trap composed of 226 places in 265 ms of which 0 ms to minimize.
[2023-03-16 11:44:19] [INFO ] Deduced a trap composed of 228 places in 273 ms of which 0 ms to minimize.
[2023-03-16 11:44:20] [INFO ] Deduced a trap composed of 230 places in 281 ms of which 1 ms to minimize.
[2023-03-16 11:44:20] [INFO ] Deduced a trap composed of 238 places in 272 ms of which 0 ms to minimize.
[2023-03-16 11:44:21] [INFO ] Deduced a trap composed of 232 places in 267 ms of which 0 ms to minimize.
[2023-03-16 11:44:21] [INFO ] Deduced a trap composed of 230 places in 266 ms of which 0 ms to minimize.
[2023-03-16 11:44:21] [INFO ] Deduced a trap composed of 243 places in 273 ms of which 1 ms to minimize.
[2023-03-16 11:44:22] [INFO ] Deduced a trap composed of 238 places in 269 ms of which 1 ms to minimize.
[2023-03-16 11:44:22] [INFO ] Deduced a trap composed of 238 places in 272 ms of which 1 ms to minimize.
[2023-03-16 11:44:22] [INFO ] Deduced a trap composed of 234 places in 266 ms of which 1 ms to minimize.
[2023-03-16 11:44:23] [INFO ] Deduced a trap composed of 236 places in 273 ms of which 0 ms to minimize.
[2023-03-16 11:44:23] [INFO ] Deduced a trap composed of 234 places in 262 ms of which 0 ms to minimize.
[2023-03-16 11:44:24] [INFO ] Deduced a trap composed of 230 places in 256 ms of which 0 ms to minimize.
[2023-03-16 11:44:24] [INFO ] Deduced a trap composed of 242 places in 265 ms of which 0 ms to minimize.
[2023-03-16 11:44:24] [INFO ] Deduced a trap composed of 230 places in 265 ms of which 0 ms to minimize.
[2023-03-16 11:44:25] [INFO ] Deduced a trap composed of 232 places in 269 ms of which 0 ms to minimize.
[2023-03-16 11:44:25] [INFO ] Deduced a trap composed of 237 places in 270 ms of which 1 ms to minimize.
[2023-03-16 11:44:25] [INFO ] Deduced a trap composed of 244 places in 259 ms of which 1 ms to minimize.
[2023-03-16 11:44:26] [INFO ] Deduced a trap composed of 232 places in 252 ms of which 0 ms to minimize.
[2023-03-16 11:44:26] [INFO ] Deduced a trap composed of 230 places in 268 ms of which 1 ms to minimize.
[2023-03-16 11:44:26] [INFO ] Deduced a trap composed of 236 places in 250 ms of which 1 ms to minimize.
[2023-03-16 11:44:27] [INFO ] Deduced a trap composed of 224 places in 256 ms of which 0 ms to minimize.
[2023-03-16 11:44:27] [INFO ] Deduced a trap composed of 236 places in 261 ms of which 0 ms to minimize.
[2023-03-16 11:44:27] [INFO ] Deduced a trap composed of 228 places in 251 ms of which 0 ms to minimize.
[2023-03-16 11:44:28] [INFO ] Deduced a trap composed of 222 places in 262 ms of which 1 ms to minimize.
[2023-03-16 11:44:29] [INFO ] Deduced a trap composed of 232 places in 261 ms of which 1 ms to minimize.
[2023-03-16 11:44:29] [INFO ] Deduced a trap composed of 226 places in 253 ms of which 1 ms to minimize.
[2023-03-16 11:44:29] [INFO ] Deduced a trap composed of 226 places in 259 ms of which 1 ms to minimize.
[2023-03-16 11:44:30] [INFO ] Deduced a trap composed of 234 places in 258 ms of which 1 ms to minimize.
[2023-03-16 11:44:30] [INFO ] Deduced a trap composed of 228 places in 264 ms of which 1 ms to minimize.
[2023-03-16 11:44:30] [INFO ] Deduced a trap composed of 229 places in 256 ms of which 0 ms to minimize.
[2023-03-16 11:44:31] [INFO ] Deduced a trap composed of 236 places in 253 ms of which 1 ms to minimize.
[2023-03-16 11:44:31] [INFO ] Deduced a trap composed of 232 places in 261 ms of which 1 ms to minimize.
[2023-03-16 11:44:31] [INFO ] Deduced a trap composed of 230 places in 273 ms of which 0 ms to minimize.
[2023-03-16 11:44:32] [INFO ] Deduced a trap composed of 228 places in 263 ms of which 1 ms to minimize.
[2023-03-16 11:44:32] [INFO ] Deduced a trap composed of 234 places in 255 ms of which 0 ms to minimize.
[2023-03-16 11:44:32] [INFO ] Deduced a trap composed of 236 places in 254 ms of which 0 ms to minimize.
[2023-03-16 11:44:33] [INFO ] Deduced a trap composed of 242 places in 257 ms of which 0 ms to minimize.
[2023-03-16 11:44:33] [INFO ] Deduced a trap composed of 222 places in 274 ms of which 0 ms to minimize.
[2023-03-16 11:44:33] [INFO ] Deduced a trap composed of 228 places in 275 ms of which 0 ms to minimize.
[2023-03-16 11:44:34] [INFO ] Deduced a trap composed of 234 places in 257 ms of which 0 ms to minimize.
[2023-03-16 11:44:34] [INFO ] Deduced a trap composed of 226 places in 255 ms of which 1 ms to minimize.
[2023-03-16 11:44:34] [INFO ] Deduced a trap composed of 234 places in 257 ms of which 1 ms to minimize.
[2023-03-16 11:44:35] [INFO ] Deduced a trap composed of 242 places in 261 ms of which 0 ms to minimize.
[2023-03-16 11:44:35] [INFO ] Deduced a trap composed of 230 places in 267 ms of which 1 ms to minimize.
[2023-03-16 11:44:37] [INFO ] Deduced a trap composed of 226 places in 252 ms of which 1 ms to minimize.
[2023-03-16 11:44:38] [INFO ] Deduced a trap composed of 230 places in 260 ms of which 1 ms to minimize.
[2023-03-16 11:44:38] [INFO ] Deduced a trap composed of 232 places in 268 ms of which 1 ms to minimize.
[2023-03-16 11:44:38] [INFO ] Deduced a trap composed of 234 places in 267 ms of which 1 ms to minimize.
[2023-03-16 11:44:39] [INFO ] Deduced a trap composed of 232 places in 259 ms of which 0 ms to minimize.
[2023-03-16 11:44:39] [INFO ] Deduced a trap composed of 236 places in 266 ms of which 1 ms to minimize.
[2023-03-16 11:44:39] [INFO ] Deduced a trap composed of 228 places in 264 ms of which 0 ms to minimize.
[2023-03-16 11:44:40] [INFO ] Deduced a trap composed of 231 places in 263 ms of which 1 ms to minimize.
[2023-03-16 11:44:40] [INFO ] Deduced a trap composed of 232 places in 267 ms of which 0 ms to minimize.
[2023-03-16 11:44:41] [INFO ] Deduced a trap composed of 234 places in 254 ms of which 0 ms to minimize.
[2023-03-16 11:44:41] [INFO ] Deduced a trap composed of 234 places in 266 ms of which 0 ms to minimize.
[2023-03-16 11:44:41] [INFO ] Deduced a trap composed of 234 places in 270 ms of which 1 ms to minimize.
[2023-03-16 11:44:42] [INFO ] Deduced a trap composed of 239 places in 263 ms of which 1 ms to minimize.
[2023-03-16 11:44:45] [INFO ] Trap strengthening (SAT) tested/added 83/83 trap constraints in 36939 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 28 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 29 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-16 11:44:45] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-16 11:44:45] [INFO ] Invariant cache hit.
[2023-03-16 11:44:46] [INFO ] Implicit Places using invariants in 667 ms returned []
[2023-03-16 11:44:46] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-16 11:44:46] [INFO ] Invariant cache hit.
[2023-03-16 11:44:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 11:44:54] [INFO ] Implicit Places using invariants and state equation in 8193 ms returned []
Implicit Place search using SMT with State Equation took 8863 ms to find 0 implicit places.
[2023-03-16 11:44:54] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-16 11:44:54] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-16 11:44:54] [INFO ] Invariant cache hit.
[2023-03-16 11:44:54] [INFO ] Dead Transitions using invariants and state equation in 657 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9581 ms. Remains : 581/581 places, 1252/1252 transitions.
Ending property specific reduction for PolyORBNT-PT-S10J30-UpperBounds-09 in 65042 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-16 11:44:54] [INFO ] Computed 82 place invariants in 15 ms
Incomplete random walk after 10000 steps, including 702 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :3
[2023-03-16 11:44:55] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-16 11:44:55] [INFO ] Computed 82 place invariants in 24 ms
[2023-03-16 11:44:55] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-16 11:44:55] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 16 ms returned sat
[2023-03-16 11:44:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 11:44:56] [INFO ] [Real]Absence check using state equation in 1157 ms returned sat
[2023-03-16 11:44:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 11:44:56] [INFO ] [Nat]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-16 11:44:56] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 13 ms returned sat
[2023-03-16 11:44:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 11:44:57] [INFO ] [Nat]Absence check using state equation in 788 ms returned sat
[2023-03-16 11:44:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 11:44:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 469 ms returned sat
[2023-03-16 11:44:58] [INFO ] Deduced a trap composed of 250 places in 268 ms of which 0 ms to minimize.
[2023-03-16 11:44:58] [INFO ] Deduced a trap composed of 228 places in 275 ms of which 1 ms to minimize.
[2023-03-16 11:44:58] [INFO ] Deduced a trap composed of 228 places in 283 ms of which 0 ms to minimize.
[2023-03-16 11:44:59] [INFO ] Deduced a trap composed of 238 places in 283 ms of which 1 ms to minimize.
[2023-03-16 11:44:59] [INFO ] Deduced a trap composed of 237 places in 271 ms of which 1 ms to minimize.
[2023-03-16 11:44:59] [INFO ] Deduced a trap composed of 241 places in 278 ms of which 0 ms to minimize.
[2023-03-16 11:44:59] [INFO ] Deduced a trap composed of 222 places in 275 ms of which 0 ms to minimize.
[2023-03-16 11:45:00] [INFO ] Deduced a trap composed of 234 places in 268 ms of which 0 ms to minimize.
[2023-03-16 11:45:00] [INFO ] Deduced a trap composed of 232 places in 267 ms of which 1 ms to minimize.
[2023-03-16 11:45:00] [INFO ] Deduced a trap composed of 234 places in 272 ms of which 1 ms to minimize.
[2023-03-16 11:45:01] [INFO ] Deduced a trap composed of 249 places in 256 ms of which 0 ms to minimize.
[2023-03-16 11:45:01] [INFO ] Deduced a trap composed of 233 places in 265 ms of which 1 ms to minimize.
[2023-03-16 11:45:01] [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 28 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-16 11:45:01] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-16 11:45:01] [INFO ] Invariant cache hit.
[2023-03-16 11:45:02] [INFO ] Dead Transitions using invariants and state equation in 624 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 652 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-16 11:45:02] [INFO ] Computed 82 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 70380 resets, run finished after 6783 ms. (steps per millisecond=147 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 8910 resets, run finished after 1473 ms. (steps per millisecond=678 ) properties (out of 1) seen :3
[2023-03-16 11:45:10] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-16 11:45:10] [INFO ] Computed 82 place invariants in 23 ms
[2023-03-16 11:45:10] [INFO ] [Real]Absence check using 63 positive place invariants in 14 ms returned sat
[2023-03-16 11:45:10] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 13 ms returned sat
[2023-03-16 11:45:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 11:45:11] [INFO ] [Real]Absence check using state equation in 1187 ms returned sat
[2023-03-16 11:45:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 11:45:11] [INFO ] [Nat]Absence check using 63 positive place invariants in 14 ms returned sat
[2023-03-16 11:45:11] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 22 ms returned sat
[2023-03-16 11:45:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 11:45:12] [INFO ] [Nat]Absence check using state equation in 788 ms returned sat
[2023-03-16 11:45:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 11:45:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 491 ms returned sat
[2023-03-16 11:45:13] [INFO ] Deduced a trap composed of 250 places in 278 ms of which 1 ms to minimize.
[2023-03-16 11:45:13] [INFO ] Deduced a trap composed of 228 places in 276 ms of which 1 ms to minimize.
[2023-03-16 11:45:14] [INFO ] Deduced a trap composed of 228 places in 267 ms of which 1 ms to minimize.
[2023-03-16 11:45:14] [INFO ] Deduced a trap composed of 238 places in 272 ms of which 0 ms to minimize.
[2023-03-16 11:45:14] [INFO ] Deduced a trap composed of 237 places in 277 ms of which 1 ms to minimize.
[2023-03-16 11:45:15] [INFO ] Deduced a trap composed of 241 places in 270 ms of which 0 ms to minimize.
[2023-03-16 11:45:15] [INFO ] Deduced a trap composed of 222 places in 280 ms of which 0 ms to minimize.
[2023-03-16 11:45:15] [INFO ] Deduced a trap composed of 234 places in 272 ms of which 1 ms to minimize.
[2023-03-16 11:45:16] [INFO ] Deduced a trap composed of 232 places in 272 ms of which 0 ms to minimize.
[2023-03-16 11:45:16] [INFO ] Deduced a trap composed of 234 places in 276 ms of which 1 ms to minimize.
[2023-03-16 11:45:16] [INFO ] Deduced a trap composed of 249 places in 275 ms of which 0 ms to minimize.
[2023-03-16 11:45:17] [INFO ] Deduced a trap composed of 233 places in 267 ms of which 1 ms to minimize.
[2023-03-16 11:45:17] [INFO ] Deduced a trap composed of 230 places in 265 ms of which 1 ms to minimize.
[2023-03-16 11:45:17] [INFO ] Deduced a trap composed of 234 places in 267 ms of which 1 ms to minimize.
[2023-03-16 11:45:18] [INFO ] Deduced a trap composed of 230 places in 275 ms of which 1 ms to minimize.
[2023-03-16 11:45:18] [INFO ] Deduced a trap composed of 228 places in 276 ms of which 1 ms to minimize.
[2023-03-16 11:45:19] [INFO ] Deduced a trap composed of 232 places in 269 ms of which 0 ms to minimize.
[2023-03-16 11:45:19] [INFO ] Deduced a trap composed of 234 places in 275 ms of which 1 ms to minimize.
[2023-03-16 11:45:19] [INFO ] Deduced a trap composed of 234 places in 270 ms of which 0 ms to minimize.
[2023-03-16 11:45:20] [INFO ] Deduced a trap composed of 234 places in 263 ms of which 0 ms to minimize.
[2023-03-16 11:45:20] [INFO ] Deduced a trap composed of 230 places in 278 ms of which 0 ms to minimize.
[2023-03-16 11:45:21] [INFO ] Deduced a trap composed of 251 places in 274 ms of which 1 ms to minimize.
[2023-03-16 11:45:22] [INFO ] Deduced a trap composed of 253 places in 273 ms of which 1 ms to minimize.
[2023-03-16 11:45:22] [INFO ] Deduced a trap composed of 228 places in 263 ms of which 1 ms to minimize.
[2023-03-16 11:45:22] [INFO ] Deduced a trap composed of 241 places in 261 ms of which 0 ms to minimize.
[2023-03-16 11:45:22] [INFO ] Deduced a trap composed of 230 places in 270 ms of which 0 ms to minimize.
[2023-03-16 11:45:23] [INFO ] Deduced a trap composed of 232 places in 265 ms of which 1 ms to minimize.
[2023-03-16 11:45:23] [INFO ] Deduced a trap composed of 225 places in 274 ms of which 1 ms to minimize.
[2023-03-16 11:45:24] [INFO ] Deduced a trap composed of 232 places in 266 ms of which 1 ms to minimize.
[2023-03-16 11:45:24] [INFO ] Deduced a trap composed of 226 places in 273 ms of which 0 ms to minimize.
[2023-03-16 11:45:24] [INFO ] Deduced a trap composed of 238 places in 274 ms of which 1 ms to minimize.
[2023-03-16 11:45:25] [INFO ] Deduced a trap composed of 226 places in 269 ms of which 0 ms to minimize.
[2023-03-16 11:45:25] [INFO ] Deduced a trap composed of 236 places in 280 ms of which 1 ms to minimize.
[2023-03-16 11:45:25] [INFO ] Deduced a trap composed of 229 places in 269 ms of which 1 ms to minimize.
[2023-03-16 11:45:26] [INFO ] Deduced a trap composed of 233 places in 275 ms of which 1 ms to minimize.
[2023-03-16 11:45:26] [INFO ] Deduced a trap composed of 232 places in 277 ms of which 0 ms to minimize.
[2023-03-16 11:45:27] [INFO ] Deduced a trap composed of 230 places in 287 ms of which 1 ms to minimize.
[2023-03-16 11:45:27] [INFO ] Deduced a trap composed of 229 places in 277 ms of which 0 ms to minimize.
[2023-03-16 11:45:27] [INFO ] Deduced a trap composed of 241 places in 259 ms of which 1 ms to minimize.
[2023-03-16 11:45:28] [INFO ] Deduced a trap composed of 224 places in 278 ms of which 1 ms to minimize.
[2023-03-16 11:45:28] [INFO ] Deduced a trap composed of 245 places in 272 ms of which 0 ms to minimize.
[2023-03-16 11:45:29] [INFO ] Deduced a trap composed of 232 places in 272 ms of which 0 ms to minimize.
[2023-03-16 11:45:30] [INFO ] Deduced a trap composed of 232 places in 280 ms of which 1 ms to minimize.
[2023-03-16 11:45:31] [INFO ] Deduced a trap composed of 232 places in 275 ms of which 0 ms to minimize.
[2023-03-16 11:45:31] [INFO ] Deduced a trap composed of 230 places in 283 ms of which 1 ms to minimize.
[2023-03-16 11:45:32] [INFO ] Deduced a trap composed of 238 places in 268 ms of which 0 ms to minimize.
[2023-03-16 11:45:32] [INFO ] Deduced a trap composed of 237 places in 272 ms of which 0 ms to minimize.
[2023-03-16 11:45:32] [INFO ] Deduced a trap composed of 232 places in 273 ms of which 1 ms to minimize.
[2023-03-16 11:45:33] [INFO ] Deduced a trap composed of 230 places in 280 ms of which 0 ms to minimize.
[2023-03-16 11:45:33] [INFO ] Deduced a trap composed of 230 places in 267 ms of which 1 ms to minimize.
[2023-03-16 11:45:33] [INFO ] Deduced a trap composed of 239 places in 269 ms of which 0 ms to minimize.
[2023-03-16 11:45:34] [INFO ] Deduced a trap composed of 232 places in 272 ms of which 1 ms to minimize.
[2023-03-16 11:45:34] [INFO ] Deduced a trap composed of 230 places in 277 ms of which 1 ms to minimize.
[2023-03-16 11:45:35] [INFO ] Deduced a trap composed of 228 places in 280 ms of which 1 ms to minimize.
[2023-03-16 11:45:35] [INFO ] Deduced a trap composed of 232 places in 272 ms of which 0 ms to minimize.
[2023-03-16 11:45:35] [INFO ] Deduced a trap composed of 224 places in 269 ms of which 0 ms to minimize.
[2023-03-16 11:45:36] [INFO ] Deduced a trap composed of 234 places in 267 ms of which 1 ms to minimize.
[2023-03-16 11:45:36] [INFO ] Deduced a trap composed of 234 places in 268 ms of which 1 ms to minimize.
[2023-03-16 11:45:36] [INFO ] Deduced a trap composed of 238 places in 273 ms of which 1 ms to minimize.
[2023-03-16 11:45:37] [INFO ] Deduced a trap composed of 250 places in 259 ms of which 1 ms to minimize.
[2023-03-16 11:45:37] [INFO ] Deduced a trap composed of 230 places in 253 ms of which 1 ms to minimize.
[2023-03-16 11:45:38] [INFO ] Deduced a trap composed of 228 places in 281 ms of which 1 ms to minimize.
[2023-03-16 11:45:38] [INFO ] Deduced a trap composed of 236 places in 275 ms of which 1 ms to minimize.
[2023-03-16 11:45:39] [INFO ] Deduced a trap composed of 244 places in 277 ms of which 0 ms to minimize.
[2023-03-16 11:45:40] [INFO ] Deduced a trap composed of 248 places in 269 ms of which 1 ms to minimize.
[2023-03-16 11:45:42] [INFO ] Deduced a trap composed of 237 places in 278 ms of which 0 ms to minimize.
[2023-03-16 11:45:42] [INFO ] Deduced a trap composed of 228 places in 275 ms of which 1 ms to minimize.
[2023-03-16 11:45:43] [INFO ] Deduced a trap composed of 234 places in 272 ms of which 1 ms to minimize.
[2023-03-16 11:45:44] [INFO ] Deduced a trap composed of 240 places in 269 ms of which 1 ms to minimize.
[2023-03-16 11:45:44] [INFO ] Deduced a trap composed of 243 places in 268 ms of which 1 ms to minimize.
[2023-03-16 11:45:45] [INFO ] Deduced a trap composed of 234 places in 265 ms of which 0 ms to minimize.
[2023-03-16 11:45:45] [INFO ] Deduced a trap composed of 241 places in 274 ms of which 1 ms to minimize.
[2023-03-16 11:45:45] [INFO ] Deduced a trap composed of 245 places in 283 ms of which 1 ms to minimize.
[2023-03-16 11:45:46] [INFO ] Deduced a trap composed of 231 places in 270 ms of which 0 ms to minimize.
[2023-03-16 11:45:49] [INFO ] Trap strengthening (SAT) tested/added 74/74 trap constraints in 36087 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 28 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 27 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-16 11:45:49] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-16 11:45:49] [INFO ] Invariant cache hit.
[2023-03-16 11:45:50] [INFO ] Implicit Places using invariants in 706 ms returned []
[2023-03-16 11:45:50] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-16 11:45:50] [INFO ] Invariant cache hit.
[2023-03-16 11:45:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 11:45:57] [INFO ] Implicit Places using invariants and state equation in 7703 ms returned []
Implicit Place search using SMT with State Equation took 8411 ms to find 0 implicit places.
[2023-03-16 11:45:57] [INFO ] Redundant transitions in 76 ms returned []
[2023-03-16 11:45:57] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-16 11:45:57] [INFO ] Invariant cache hit.
[2023-03-16 11:45:58] [INFO ] Dead Transitions using invariants and state equation in 617 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9139 ms. Remains : 581/581 places, 1252/1252 transitions.
Ending property specific reduction for PolyORBNT-PT-S10J30-UpperBounds-14 in 63554 ms.
[2023-03-16 11:45:58] [INFO ] Flatten gal took : 173 ms
[2023-03-16 11:45:58] [INFO ] Applying decomposition
[2023-03-16 11:45:59] [INFO ] Flatten gal took : 113 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12743542889639772020.txt' '-o' '/tmp/graph12743542889639772020.bin' '-w' '/tmp/graph12743542889639772020.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12743542889639772020.bin' '-l' '-1' '-v' '-w' '/tmp/graph12743542889639772020.weights' '-q' '0' '-e' '0.001'
[2023-03-16 11:45:59] [INFO ] Decomposing Gal with order
[2023-03-16 11:45:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 11:45:59] [INFO ] Removed a total of 3070 redundant transitions.
[2023-03-16 11:45:59] [INFO ] Flatten gal took : 324 ms
[2023-03-16 11:45:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 343 labels/synchronizations in 59 ms.
[2023-03-16 11:45:59] [INFO ] Time to serialize gal into /tmp/UpperBounds3680433401835372017.gal : 24 ms
[2023-03-16 11:45:59] [INFO ] Time to serialize properties into /tmp/UpperBounds16042122002237421180.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds3680433401835372017.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16042122002237421180.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds16042122002237421180.prop.
Detected timeout of ITS tools.
[2023-03-16 12:08:02] [INFO ] Flatten gal took : 411 ms
[2023-03-16 12:08:02] [INFO ] Time to serialize gal into /tmp/UpperBounds10072921196484611741.gal : 78 ms
[2023-03-16 12:08:02] [INFO ] Time to serialize properties into /tmp/UpperBounds11115922783190455625.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds10072921196484611741.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11115922783190455625.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/UpperBounds11115922783190455625.prop.
Detected timeout of ITS tools.
[2023-03-16 12:30:12] [INFO ] Flatten gal took : 611 ms
[2023-03-16 12:30:13] [INFO ] Input system was already deterministic with 1252 transitions.
[2023-03-16 12:30:13] [INFO ] Transformed 581 places.
[2023-03-16 12:30:13] [INFO ] Transformed 1252 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-16 12:30:43] [INFO ] Time to serialize gal into /tmp/UpperBounds3202020306528239689.gal : 9 ms
[2023-03-16 12:30:43] [INFO ] Time to serialize properties into /tmp/UpperBounds16761272113137750286.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds3202020306528239689.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16761272113137750286.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds16761272113137750286.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 1450288 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16066148 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S10J30"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is 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 r293-tall-167873945900765"
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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;