MCC'2022- Execution of r168-tall-165277017200837

About the Execution of ITS-Tools for PolyORBNT-PT-S05J60

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16215.216	3600000.00	3114335.00	330735.00	? 1 3 1 1 1 61 1 ? ? 1 10 1 3 1 1	normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 44K Apr 30 03:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 205K Apr 30 03:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 107K Apr 30 03:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 501K Apr 30 03:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 24K May 9 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 9 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 9 08:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 9 08:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 9 08:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.7K May 9 08:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.5M May 10 09:34 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-S05J60-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652962983907

Running Version 202205111006
[2022-05-19 12:23:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 12:23:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 12:23:05] [INFO ] Load time of PNML (sax parser for PT used): 215 ms
[2022-05-19 12:23:05] [INFO ] Transformed 909 places.
[2022-05-19 12:23:05] [INFO ] Transformed 1970 transitions.
[2022-05-19 12:23:05] [INFO ] Parsed PT model containing 909 places and 1970 transitions in 343 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Normalized transition count is 1311 out of 1315 initially.
// Phase 1: matrix 1311 rows 909 cols
[2022-05-19 12:23:05] [INFO ] Computed 142 place invariants in 128 ms
FORMULA PolyORBNT-PT-S05J60-UpperBounds-13 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-UpperBounds-06 61 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 675 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 13) seen :19
FORMULA PolyORBNT-PT-S05J60-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 109 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :17
Incomplete Best-First random walk after 10001 steps, including 119 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :18
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :18
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :18
Incomplete Best-First random walk after 10001 steps, including 139 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :18
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :17
Incomplete Best-First random walk after 10000 steps, including 108 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :19
Incomplete Best-First random walk after 10001 steps, including 151 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :12
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :17
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :19
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :17
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :12
[2022-05-19 12:23:06] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2022-05-19 12:23:06] [INFO ] Computed 142 place invariants in 60 ms
[2022-05-19 12:23:06] [INFO ] [Real]Absence check using 111 positive place invariants in 34 ms returned sat
[2022-05-19 12:23:06] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 33 ms returned sat
[2022-05-19 12:23:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 12:23:06] [INFO ] [Real]Absence check using state equation in 476 ms returned sat
[2022-05-19 12:23:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 12:23:07] [INFO ] [Nat]Absence check using 111 positive place invariants in 22 ms returned sat
[2022-05-19 12:23:07] [INFO ] [Nat]Absence check using 111 positive and 31 generalized place invariants in 34 ms returned sat
[2022-05-19 12:23:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 12:23:07] [INFO ] [Nat]Absence check using state equation in 673 ms returned sat
[2022-05-19 12:23:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:23:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 224 ms returned sat
[2022-05-19 12:23:08] [INFO ] Deduced a trap composed of 540 places in 534 ms of which 3 ms to minimize.
[2022-05-19 12:23:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 725 ms
[2022-05-19 12:23:08] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 127 ms.
[2022-05-19 12:23:09] [INFO ] Added : 16 causal constraints over 4 iterations in 1047 ms. Result :sat
Minimization took 295 ms.
[2022-05-19 12:23:10] [INFO ] [Real]Absence check using 111 positive place invariants in 27 ms returned sat
[2022-05-19 12:23:10] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 25 ms returned unsat
[2022-05-19 12:23:10] [INFO ] [Real]Absence check using 111 positive place invariants in 23 ms returned sat
[2022-05-19 12:23:10] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 19 ms returned unsat
[2022-05-19 12:23:10] [INFO ] [Real]Absence check using 111 positive place invariants in 23 ms returned sat
[2022-05-19 12:23:10] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 27 ms returned unsat
[2022-05-19 12:23:10] [INFO ] [Real]Absence check using 111 positive place invariants in 24 ms returned sat
[2022-05-19 12:23:10] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 32 ms returned unsat
[2022-05-19 12:23:10] [INFO ] [Real]Absence check using 111 positive place invariants in 24 ms returned sat
[2022-05-19 12:23:10] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 51 ms returned unsat
[2022-05-19 12:23:11] [INFO ] [Real]Absence check using 111 positive place invariants in 35 ms returned sat
[2022-05-19 12:23:11] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 22 ms returned unsat
[2022-05-19 12:23:11] [INFO ] [Real]Absence check using 111 positive place invariants in 25 ms returned sat
[2022-05-19 12:23:11] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 33 ms returned sat
[2022-05-19 12:23:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 12:23:11] [INFO ] [Real]Absence check using state equation in 504 ms returned sat
[2022-05-19 12:23:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 12:23:11] [INFO ] [Nat]Absence check using 111 positive place invariants in 31 ms returned sat
[2022-05-19 12:23:11] [INFO ] [Nat]Absence check using 111 positive and 31 generalized place invariants in 33 ms returned sat
[2022-05-19 12:23:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 12:23:12] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2022-05-19 12:23:15] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-19 12:23:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 4474 ms returned unknown
[2022-05-19 12:23:16] [INFO ] [Real]Absence check using 111 positive place invariants in 45 ms returned sat
[2022-05-19 12:23:16] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 33 ms returned sat
[2022-05-19 12:23:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 12:23:17] [INFO ] [Real]Absence check using state equation in 492 ms returned sat
[2022-05-19 12:23:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 12:23:17] [INFO ] [Nat]Absence check using 111 positive place invariants in 23 ms returned sat
[2022-05-19 12:23:17] [INFO ] [Nat]Absence check using 111 positive and 31 generalized place invariants in 38 ms returned sat
[2022-05-19 12:23:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 12:23:18] [INFO ] [Nat]Absence check using state equation in 704 ms returned sat
[2022-05-19 12:23:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 237 ms returned sat
[2022-05-19 12:23:19] [INFO ] Deduced a trap composed of 540 places in 363 ms of which 1 ms to minimize.
[2022-05-19 12:23:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 523 ms
[2022-05-19 12:23:19] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 92 ms.
[2022-05-19 12:23:20] [INFO ] Added : 16 causal constraints over 4 iterations in 1037 ms. Result :sat
Minimization took 296 ms.
[2022-05-19 12:23:20] [INFO ] [Real]Absence check using 111 positive place invariants in 25 ms returned sat
[2022-05-19 12:23:20] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 20 ms returned unsat
[2022-05-19 12:23:20] [INFO ] [Real]Absence check using 111 positive place invariants in 25 ms returned sat
[2022-05-19 12:23:20] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 31 ms returned unsat
[2022-05-19 12:23:20] [INFO ] [Real]Absence check using 111 positive place invariants in 22 ms returned sat
[2022-05-19 12:23:20] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 29 ms returned unsat
Current structural bounds on expressions (after SMT) : [262, 1, 3, 1, 1, 1, 1, 262, 262, 1, 1, 1] Max seen :[3, 1, 3, 1, 1, 1, 1, 3, 3, 1, 1, 1]
FORMULA PolyORBNT-PT-S05J60-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-02 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 909 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 904 transition count 1250
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 136 place count 839 transition count 1249
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 137 place count 838 transition count 1249
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 137 place count 838 transition count 1185
Deduced a syphon composed of 64 places in 3 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 265 place count 774 transition count 1185
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 266 place count 773 transition count 1184
Iterating global reduction 3 with 1 rules applied. Total rules applied 267 place count 773 transition count 1184
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 271 place count 771 transition count 1182
Applied a total of 271 rules in 306 ms. Remains 771 /909 variables (removed 138) and now considering 1182/1315 (removed 133) transitions.
[2022-05-19 12:23:21] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
// Phase 1: matrix 1178 rows 771 cols
[2022-05-19 12:23:21] [INFO ] Computed 137 place invariants in 37 ms
[2022-05-19 12:23:22] [INFO ] Dead Transitions using invariants and state equation in 1306 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 771/909 places, 1087/1315 transitions.
Applied a total of 0 rules in 57 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 771/909 places, 1087/1315 transitions.
Normalized transition count is 1083 out of 1087 initially.
// Phase 1: matrix 1083 rows 771 cols
[2022-05-19 12:23:22] [INFO ] Computed 137 place invariants in 20 ms
Incomplete random walk after 1000000 steps, including 47521 resets, run finished after 6442 ms. (steps per millisecond=155 ) properties (out of 3) seen :9
Incomplete Best-First random walk after 1000001 steps, including 3317 resets, run finished after 1528 ms. (steps per millisecond=654 ) properties (out of 3) seen :9
Incomplete Best-First random walk after 1000001 steps, including 3373 resets, run finished after 1543 ms. (steps per millisecond=648 ) properties (out of 3) seen :9
Incomplete Best-First random walk after 1000001 steps, including 3354 resets, run finished after 1588 ms. (steps per millisecond=629 ) properties (out of 3) seen :9
[2022-05-19 12:23:33] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2022-05-19 12:23:33] [INFO ] Computed 137 place invariants in 30 ms
[2022-05-19 12:23:33] [INFO ] [Real]Absence check using 112 positive place invariants in 21 ms returned sat
[2022-05-19 12:23:33] [INFO ] [Real]Absence check using 112 positive and 25 generalized place invariants in 21 ms returned sat
[2022-05-19 12:23:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 12:23:34] [INFO ] [Real]Absence check using state equation in 818 ms returned sat
[2022-05-19 12:23:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 12:23:34] [INFO ] [Nat]Absence check using 112 positive place invariants in 23 ms returned sat
[2022-05-19 12:23:34] [INFO ] [Nat]Absence check using 112 positive and 25 generalized place invariants in 20 ms returned sat
[2022-05-19 12:23:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 12:23:35] [INFO ] [Nat]Absence check using state equation in 282 ms returned sat
[2022-05-19 12:23:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:23:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 735 ms returned sat
[2022-05-19 12:23:36] [INFO ] Deduced a trap composed of 263 places in 306 ms of which 1 ms to minimize.
[2022-05-19 12:23:36] [INFO ] Deduced a trap composed of 252 places in 255 ms of which 1 ms to minimize.
[2022-05-19 12:23:37] [INFO ] Deduced a trap composed of 244 places in 255 ms of which 1 ms to minimize.
[2022-05-19 12:23:37] [INFO ] Deduced a trap composed of 259 places in 243 ms of which 1 ms to minimize.
[2022-05-19 12:23:37] [INFO ] Deduced a trap composed of 236 places in 250 ms of which 1 ms to minimize.
[2022-05-19 12:23:38] [INFO ] Deduced a trap composed of 240 places in 258 ms of which 1 ms to minimize.
[2022-05-19 12:23:38] [INFO ] Deduced a trap composed of 233 places in 248 ms of which 1 ms to minimize.
[2022-05-19 12:23:38] [INFO ] Deduced a trap composed of 248 places in 244 ms of which 0 ms to minimize.
[2022-05-19 12:23:39] [INFO ] Deduced a trap composed of 254 places in 257 ms of which 1 ms to minimize.
[2022-05-19 12:23:39] [INFO ] Deduced a trap composed of 239 places in 247 ms of which 1 ms to minimize.
[2022-05-19 12:23:39] [INFO ] Deduced a trap composed of 245 places in 242 ms of which 1 ms to minimize.
[2022-05-19 12:23:40] [INFO ] Deduced a trap composed of 230 places in 261 ms of which 0 ms to minimize.
[2022-05-19 12:23:40] [INFO ] Deduced a trap composed of 257 places in 256 ms of which 1 ms to minimize.
[2022-05-19 12:23:40] [INFO ] Deduced a trap composed of 258 places in 260 ms of which 0 ms to minimize.
[2022-05-19 12:23:41] [INFO ] Deduced a trap composed of 242 places in 273 ms of which 1 ms to minimize.
[2022-05-19 12:23:41] [INFO ] Deduced a trap composed of 252 places in 264 ms of which 1 ms to minimize.
[2022-05-19 12:23:41] [INFO ] Deduced a trap composed of 260 places in 261 ms of which 1 ms to minimize.
[2022-05-19 12:23:42] [INFO ] Deduced a trap composed of 258 places in 266 ms of which 1 ms to minimize.
[2022-05-19 12:23:44] [INFO ] Deduced a trap composed of 252 places in 262 ms of which 5 ms to minimize.
[2022-05-19 12:23:46] [INFO ] Deduced a trap composed of 270 places in 263 ms of which 1 ms to minimize.
[2022-05-19 12:23:47] [INFO ] Deduced a trap composed of 252 places in 263 ms of which 1 ms to minimize.
[2022-05-19 12:23:47] [INFO ] Deduced a trap composed of 254 places in 262 ms of which 0 ms to minimize.
[2022-05-19 12:23:48] [INFO ] Deduced a trap composed of 246 places in 256 ms of which 0 ms to minimize.
[2022-05-19 12:23:48] [INFO ] Deduced a trap composed of 274 places in 260 ms of which 1 ms to minimize.
[2022-05-19 12:23:48] [INFO ] Deduced a trap composed of 260 places in 257 ms of which 1 ms to minimize.
[2022-05-19 12:23:49] [INFO ] Deduced a trap composed of 246 places in 255 ms of which 1 ms to minimize.
[2022-05-19 12:23:49] [INFO ] Deduced a trap composed of 250 places in 245 ms of which 1 ms to minimize.
[2022-05-19 12:23:49] [INFO ] Deduced a trap composed of 260 places in 246 ms of which 1 ms to minimize.
[2022-05-19 12:23:50] [INFO ] Deduced a trap composed of 242 places in 263 ms of which 3 ms to minimize.
[2022-05-19 12:23:50] [INFO ] Deduced a trap composed of 249 places in 282 ms of which 1 ms to minimize.
[2022-05-19 12:23:51] [INFO ] Deduced a trap composed of 252 places in 261 ms of which 1 ms to minimize.
[2022-05-19 12:23:52] [INFO ] Deduced a trap composed of 257 places in 247 ms of which 1 ms to minimize.
[2022-05-19 12:23:52] [INFO ] Deduced a trap composed of 240 places in 265 ms of which 5 ms to minimize.
[2022-05-19 12:23:53] [INFO ] Deduced a trap composed of 257 places in 239 ms of which 0 ms to minimize.
[2022-05-19 12:23:53] [INFO ] Deduced a trap composed of 230 places in 236 ms of which 0 ms to minimize.
[2022-05-19 12:23:55] [INFO ] Deduced a trap composed of 242 places in 234 ms of which 1 ms to minimize.
[2022-05-19 12:23:58] [INFO ] Trap strengthening (SAT) tested/added 36/36 trap constraints in 22649 ms
[2022-05-19 12:23:58] [INFO ] [Real]Absence check using 112 positive place invariants in 21 ms returned sat
[2022-05-19 12:23:58] [INFO ] [Real]Absence check using 112 positive and 25 generalized place invariants in 21 ms returned sat
[2022-05-19 12:23:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 12:23:59] [INFO ] [Real]Absence check using state equation in 698 ms returned sat
[2022-05-19 12:23:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 12:23:59] [INFO ] [Nat]Absence check using 112 positive place invariants in 21 ms returned sat
[2022-05-19 12:23:59] [INFO ] [Nat]Absence check using 112 positive and 25 generalized place invariants in 21 ms returned sat
[2022-05-19 12:23:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 12:24:00] [INFO ] [Nat]Absence check using state equation in 762 ms returned sat
[2022-05-19 12:24:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 285 ms returned sat
[2022-05-19 12:24:01] [INFO ] Deduced a trap composed of 259 places in 289 ms of which 1 ms to minimize.
[2022-05-19 12:24:01] [INFO ] Deduced a trap composed of 261 places in 284 ms of which 0 ms to minimize.
[2022-05-19 12:24:01] [INFO ] Deduced a trap composed of 266 places in 293 ms of which 0 ms to minimize.
[2022-05-19 12:24:02] [INFO ] Deduced a trap composed of 264 places in 281 ms of which 1 ms to minimize.
[2022-05-19 12:24:02] [INFO ] Deduced a trap composed of 270 places in 249 ms of which 1 ms to minimize.
[2022-05-19 12:24:02] [INFO ] Deduced a trap composed of 248 places in 267 ms of which 1 ms to minimize.
[2022-05-19 12:24:03] [INFO ] Deduced a trap composed of 235 places in 256 ms of which 1 ms to minimize.
[2022-05-19 12:24:03] [INFO ] Deduced a trap composed of 249 places in 255 ms of which 1 ms to minimize.
[2022-05-19 12:24:03] [INFO ] Deduced a trap composed of 260 places in 255 ms of which 1 ms to minimize.
[2022-05-19 12:24:04] [INFO ] Deduced a trap composed of 237 places in 281 ms of which 0 ms to minimize.
[2022-05-19 12:24:04] [INFO ] Deduced a trap composed of 255 places in 259 ms of which 1 ms to minimize.
[2022-05-19 12:24:04] [INFO ] Deduced a trap composed of 257 places in 260 ms of which 1 ms to minimize.
[2022-05-19 12:24:04] [INFO ] Deduced a trap composed of 244 places in 263 ms of which 1 ms to minimize.
[2022-05-19 12:24:05] [INFO ] Deduced a trap composed of 239 places in 258 ms of which 0 ms to minimize.
[2022-05-19 12:24:05] [INFO ] Deduced a trap composed of 269 places in 256 ms of which 0 ms to minimize.
[2022-05-19 12:24:06] [INFO ] Deduced a trap composed of 253 places in 275 ms of which 0 ms to minimize.
[2022-05-19 12:24:06] [INFO ] Deduced a trap composed of 273 places in 266 ms of which 0 ms to minimize.
[2022-05-19 12:24:06] [INFO ] Deduced a trap composed of 236 places in 258 ms of which 7 ms to minimize.
[2022-05-19 12:24:07] [INFO ] Deduced a trap composed of 246 places in 237 ms of which 1 ms to minimize.
[2022-05-19 12:24:07] [INFO ] Deduced a trap composed of 252 places in 258 ms of which 1 ms to minimize.
[2022-05-19 12:24:07] [INFO ] Deduced a trap composed of 218 places in 239 ms of which 1 ms to minimize.
[2022-05-19 12:24:09] [INFO ] Deduced a trap composed of 261 places in 238 ms of which 1 ms to minimize.
[2022-05-19 12:24:10] [INFO ] Deduced a trap composed of 242 places in 280 ms of which 1 ms to minimize.
[2022-05-19 12:24:13] [INFO ] Deduced a trap composed of 260 places in 256 ms of which 1 ms to minimize.
[2022-05-19 12:24:14] [INFO ] Deduced a trap composed of 244 places in 261 ms of which 1 ms to minimize.
[2022-05-19 12:24:14] [INFO ] Deduced a trap composed of 247 places in 263 ms of which 1 ms to minimize.
[2022-05-19 12:24:14] [INFO ] Deduced a trap composed of 244 places in 261 ms of which 0 ms to minimize.
[2022-05-19 12:24:15] [INFO ] Deduced a trap composed of 263 places in 277 ms of which 2 ms to minimize.
[2022-05-19 12:24:15] [INFO ] Deduced a trap composed of 226 places in 244 ms of which 2 ms to minimize.
[2022-05-19 12:24:16] [INFO ] Deduced a trap composed of 239 places in 267 ms of which 10 ms to minimize.
[2022-05-19 12:24:17] [INFO ] Deduced a trap composed of 246 places in 261 ms of which 1 ms to minimize.
[2022-05-19 12:24:18] [INFO ] Deduced a trap composed of 268 places in 256 ms of which 1 ms to minimize.
[2022-05-19 12:24:18] [INFO ] Deduced a trap composed of 245 places in 260 ms of which 1 ms to minimize.
[2022-05-19 12:24:18] [INFO ] Deduced a trap composed of 242 places in 259 ms of which 1 ms to minimize.
[2022-05-19 12:24:19] [INFO ] Deduced a trap composed of 243 places in 243 ms of which 1 ms to minimize.
[2022-05-19 12:24:19] [INFO ] Deduced a trap composed of 251 places in 248 ms of which 0 ms to minimize.
[2022-05-19 12:24:20] [INFO ] Deduced a trap composed of 254 places in 273 ms of which 2 ms to minimize.
[2022-05-19 12:24:20] [INFO ] Deduced a trap composed of 256 places in 260 ms of which 1 ms to minimize.
[2022-05-19 12:24:20] [INFO ] Deduced a trap composed of 254 places in 247 ms of which 1 ms to minimize.
[2022-05-19 12:24:21] [INFO ] Deduced a trap composed of 271 places in 260 ms of which 1 ms to minimize.
[2022-05-19 12:24:21] [INFO ] Deduced a trap composed of 247 places in 259 ms of which 1 ms to minimize.
[2022-05-19 12:24:21] [INFO ] Deduced a trap composed of 263 places in 242 ms of which 1 ms to minimize.
[2022-05-19 12:24:22] [INFO ] Deduced a trap composed of 255 places in 259 ms of which 1 ms to minimize.
[2022-05-19 12:24:22] [INFO ] Deduced a trap composed of 242 places in 249 ms of which 1 ms to minimize.
[2022-05-19 12:24:23] [INFO ] Deduced a trap composed of 245 places in 252 ms of which 1 ms to minimize.
[2022-05-19 12:24:23] [INFO ] Deduced a trap composed of 275 places in 268 ms of which 1 ms to minimize.
[2022-05-19 12:24:24] [INFO ] Deduced a trap composed of 251 places in 248 ms of which 1 ms to minimize.
[2022-05-19 12:24:24] [INFO ] Deduced a trap composed of 264 places in 252 ms of which 0 ms to minimize.
[2022-05-19 12:24:24] [INFO ] Deduced a trap composed of 253 places in 243 ms of which 0 ms to minimize.
[2022-05-19 12:24:28] [INFO ] Deduced a trap composed of 261 places in 237 ms of which 0 ms to minimize.
[2022-05-19 12:24:28] [INFO ] Deduced a trap composed of 249 places in 259 ms of which 1 ms to minimize.
[2022-05-19 12:24:31] [INFO ] Trap strengthening (SAT) tested/added 51/51 trap constraints in 30708 ms
[2022-05-19 12:24:31] [INFO ] [Real]Absence check using 112 positive place invariants in 23 ms returned sat
[2022-05-19 12:24:31] [INFO ] [Real]Absence check using 112 positive and 25 generalized place invariants in 22 ms returned sat
[2022-05-19 12:24:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 12:24:32] [INFO ] [Real]Absence check using state equation in 838 ms returned sat
[2022-05-19 12:24:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 12:24:32] [INFO ] [Nat]Absence check using 112 positive place invariants in 25 ms returned sat
[2022-05-19 12:24:32] [INFO ] [Nat]Absence check using 112 positive and 25 generalized place invariants in 22 ms returned sat
[2022-05-19 12:24:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 12:24:32] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2022-05-19 12:24:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 724 ms returned sat
[2022-05-19 12:24:33] [INFO ] Deduced a trap composed of 263 places in 285 ms of which 0 ms to minimize.
[2022-05-19 12:24:34] [INFO ] Deduced a trap composed of 252 places in 244 ms of which 0 ms to minimize.
[2022-05-19 12:24:34] [INFO ] Deduced a trap composed of 244 places in 260 ms of which 1 ms to minimize.
[2022-05-19 12:24:34] [INFO ] Deduced a trap composed of 259 places in 257 ms of which 1 ms to minimize.
[2022-05-19 12:24:35] [INFO ] Deduced a trap composed of 236 places in 256 ms of which 1 ms to minimize.
[2022-05-19 12:24:35] [INFO ] Deduced a trap composed of 240 places in 255 ms of which 1 ms to minimize.
[2022-05-19 12:24:36] [INFO ] Deduced a trap composed of 233 places in 261 ms of which 1 ms to minimize.
[2022-05-19 12:24:36] [INFO ] Deduced a trap composed of 248 places in 258 ms of which 0 ms to minimize.
[2022-05-19 12:24:36] [INFO ] Deduced a trap composed of 254 places in 253 ms of which 1 ms to minimize.
[2022-05-19 12:24:37] [INFO ] Deduced a trap composed of 239 places in 251 ms of which 1 ms to minimize.
[2022-05-19 12:24:37] [INFO ] Deduced a trap composed of 245 places in 251 ms of which 1 ms to minimize.
[2022-05-19 12:24:37] [INFO ] Deduced a trap composed of 230 places in 260 ms of which 0 ms to minimize.
[2022-05-19 12:24:37] [INFO ] Deduced a trap composed of 257 places in 285 ms of which 1 ms to minimize.
[2022-05-19 12:24:38] [INFO ] Deduced a trap composed of 258 places in 268 ms of which 1 ms to minimize.
[2022-05-19 12:24:38] [INFO ] Deduced a trap composed of 242 places in 268 ms of which 1 ms to minimize.
[2022-05-19 12:24:39] [INFO ] Deduced a trap composed of 252 places in 276 ms of which 1 ms to minimize.
[2022-05-19 12:24:39] [INFO ] Deduced a trap composed of 260 places in 289 ms of which 0 ms to minimize.
[2022-05-19 12:24:39] [INFO ] Deduced a trap composed of 258 places in 281 ms of which 0 ms to minimize.
[2022-05-19 12:24:41] [INFO ] Deduced a trap composed of 252 places in 251 ms of which 1 ms to minimize.
[2022-05-19 12:24:44] [INFO ] Deduced a trap composed of 270 places in 254 ms of which 1 ms to minimize.
[2022-05-19 12:24:44] [INFO ] Deduced a trap composed of 252 places in 263 ms of which 1 ms to minimize.
[2022-05-19 12:24:45] [INFO ] Deduced a trap composed of 254 places in 243 ms of which 1 ms to minimize.
[2022-05-19 12:24:45] [INFO ] Deduced a trap composed of 246 places in 284 ms of which 1 ms to minimize.
[2022-05-19 12:24:45] [INFO ] Deduced a trap composed of 274 places in 262 ms of which 0 ms to minimize.
[2022-05-19 12:24:46] [INFO ] Deduced a trap composed of 260 places in 256 ms of which 1 ms to minimize.
[2022-05-19 12:24:46] [INFO ] Deduced a trap composed of 246 places in 258 ms of which 1 ms to minimize.
[2022-05-19 12:24:46] [INFO ] Deduced a trap composed of 250 places in 260 ms of which 0 ms to minimize.
[2022-05-19 12:24:47] [INFO ] Deduced a trap composed of 260 places in 327 ms of which 1 ms to minimize.
[2022-05-19 12:24:47] [INFO ] Deduced a trap composed of 242 places in 258 ms of which 0 ms to minimize.
[2022-05-19 12:24:48] [INFO ] Deduced a trap composed of 249 places in 254 ms of which 1 ms to minimize.
[2022-05-19 12:24:48] [INFO ] Deduced a trap composed of 252 places in 266 ms of which 1 ms to minimize.
[2022-05-19 12:24:49] [INFO ] Deduced a trap composed of 257 places in 234 ms of which 1 ms to minimize.
[2022-05-19 12:24:49] [INFO ] Deduced a trap composed of 240 places in 248 ms of which 1 ms to minimize.
[2022-05-19 12:24:50] [INFO ] Deduced a trap composed of 257 places in 254 ms of which 1 ms to minimize.
[2022-05-19 12:24:51] [INFO ] Deduced a trap composed of 230 places in 236 ms of which 1 ms to minimize.
[2022-05-19 12:24:53] [INFO ] Deduced a trap composed of 242 places in 241 ms of which 1 ms to minimize.
[2022-05-19 12:24:56] [INFO ] Trap strengthening (SAT) tested/added 36/36 trap constraints in 22458 ms
Current structural bounds on expressions (after SMT) : [4, 142, 4] Max seen :[3, 3, 3]
Support contains 2 out of 771 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 38 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 771/771 places, 1087/1087 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 36 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
[2022-05-19 12:24:56] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2022-05-19 12:24:56] [INFO ] Computed 137 place invariants in 35 ms
[2022-05-19 12:24:57] [INFO ] Implicit Places using invariants in 1306 ms returned []
[2022-05-19 12:24:57] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2022-05-19 12:24:57] [INFO ] Computed 137 place invariants in 30 ms
[2022-05-19 12:24:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:25:13] [INFO ] Implicit Places using invariants and state equation in 16040 ms returned []
Implicit Place search using SMT with State Equation took 17351 ms to find 0 implicit places.
[2022-05-19 12:25:13] [INFO ] Redundant transitions in 77 ms returned []
[2022-05-19 12:25:13] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2022-05-19 12:25:13] [INFO ] Computed 137 place invariants in 27 ms
[2022-05-19 12:25:14] [INFO ] Dead Transitions using invariants and state equation in 1228 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 771/771 places, 1087/1087 transitions.
Starting property specific reduction for PolyORBNT-PT-S05J60-UpperBounds-00
Normalized transition count is 1083 out of 1087 initially.
// Phase 1: matrix 1083 rows 771 cols
[2022-05-19 12:25:14] [INFO ] Computed 137 place invariants in 23 ms
Incomplete random walk after 10000 steps, including 501 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :3
[2022-05-19 12:25:14] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2022-05-19 12:25:14] [INFO ] Computed 137 place invariants in 29 ms
[2022-05-19 12:25:15] [INFO ] [Real]Absence check using 112 positive place invariants in 23 ms returned sat
[2022-05-19 12:25:15] [INFO ] [Real]Absence check using 112 positive and 25 generalized place invariants in 22 ms returned sat
[2022-05-19 12:25:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 12:25:15] [INFO ] [Real]Absence check using state equation in 820 ms returned sat
[2022-05-19 12:25:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 12:25:16] [INFO ] [Nat]Absence check using 112 positive place invariants in 24 ms returned sat
[2022-05-19 12:25:16] [INFO ] [Nat]Absence check using 112 positive and 25 generalized place invariants in 21 ms returned sat
[2022-05-19 12:25:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 12:25:16] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2022-05-19 12:25:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:25:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 732 ms returned sat
[2022-05-19 12:25:17] [INFO ] Deduced a trap composed of 263 places in 287 ms of which 1 ms to minimize.
[2022-05-19 12:25:17] [INFO ] Deduced a trap composed of 252 places in 259 ms of which 1 ms to minimize.
[2022-05-19 12:25:18] [INFO ] Deduced a trap composed of 244 places in 245 ms of which 1 ms to minimize.
[2022-05-19 12:25:18] [INFO ] Deduced a trap composed of 259 places in 241 ms of which 1 ms to minimize.
[2022-05-19 12:25:18] [INFO ] Deduced a trap composed of 236 places in 239 ms of which 1 ms to minimize.
[2022-05-19 12:25:19] [INFO ] Deduced a trap composed of 240 places in 254 ms of which 1 ms to minimize.
[2022-05-19 12:25:19] [INFO ] Deduced a trap composed of 233 places in 247 ms of which 0 ms to minimize.
[2022-05-19 12:25:19] [INFO ] Deduced a trap composed of 248 places in 256 ms of which 0 ms to minimize.
[2022-05-19 12:25:20] [INFO ] Deduced a trap composed of 254 places in 246 ms of which 0 ms to minimize.
[2022-05-19 12:25:20] [INFO ] Deduced a trap composed of 239 places in 247 ms of which 0 ms to minimize.
[2022-05-19 12:25:20] [INFO ] Deduced a trap composed of 245 places in 240 ms of which 0 ms to minimize.
[2022-05-19 12:25:21] [INFO ] Deduced a trap composed of 230 places in 243 ms of which 0 ms to minimize.
[2022-05-19 12:25:21] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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) : [4] Max seen :[3]
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 771/771 places, 1087/1087 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 771 transition count 1086
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 770 transition count 1086
Applied a total of 2 rules in 49 ms. Remains 770 /771 variables (removed 1) and now considering 1086/1087 (removed 1) transitions.
[2022-05-19 12:25:21] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-19 12:25:21] [INFO ] Computed 137 place invariants in 18 ms
[2022-05-19 12:25:22] [INFO ] Dead Transitions using invariants and state equation in 1149 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 770/771 places, 1086/1087 transitions.
Normalized transition count is 1082 out of 1086 initially.
// Phase 1: matrix 1082 rows 770 cols
[2022-05-19 12:25:22] [INFO ] Computed 137 place invariants in 25 ms
Incomplete random walk after 1000000 steps, including 52007 resets, run finished after 6766 ms. (steps per millisecond=147 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 3363 resets, run finished after 1542 ms. (steps per millisecond=648 ) properties (out of 1) seen :3
[2022-05-19 12:25:30] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-19 12:25:30] [INFO ] Computed 137 place invariants in 26 ms
[2022-05-19 12:25:30] [INFO ] [Real]Absence check using 111 positive place invariants in 23 ms returned sat
[2022-05-19 12:25:30] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 27 ms returned sat
[2022-05-19 12:25:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 12:25:31] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2022-05-19 12:25:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 12:25:31] [INFO ] [Nat]Absence check using 111 positive place invariants in 22 ms returned sat
[2022-05-19 12:25:31] [INFO ] [Nat]Absence check using 111 positive and 26 generalized place invariants in 25 ms returned sat
[2022-05-19 12:25:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 12:25:31] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2022-05-19 12:25:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:25:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 307 ms returned sat
[2022-05-19 12:25:32] [INFO ] Deduced a trap composed of 263 places in 285 ms of which 0 ms to minimize.
[2022-05-19 12:25:32] [INFO ] Deduced a trap composed of 356 places in 265 ms of which 1 ms to minimize.
[2022-05-19 12:25:32] [INFO ] Deduced a trap composed of 234 places in 254 ms of which 0 ms to minimize.
[2022-05-19 12:25:33] [INFO ] Deduced a trap composed of 262 places in 249 ms of which 0 ms to minimize.
[2022-05-19 12:25:33] [INFO ] Deduced a trap composed of 247 places in 242 ms of which 0 ms to minimize.
[2022-05-19 12:25:33] [INFO ] Deduced a trap composed of 259 places in 242 ms of which 1 ms to minimize.
[2022-05-19 12:25:34] [INFO ] Deduced a trap composed of 280 places in 246 ms of which 1 ms to minimize.
[2022-05-19 12:25:35] [INFO ] Deduced a trap composed of 249 places in 243 ms of which 1 ms to minimize.
[2022-05-19 12:25:36] [INFO ] Deduced a trap composed of 239 places in 250 ms of which 1 ms to minimize.
[2022-05-19 12:25:36] [INFO ] Deduced a trap composed of 268 places in 266 ms of which 1 ms to minimize.
[2022-05-19 12:25:36] [INFO ] Deduced a trap composed of 251 places in 265 ms of which 1 ms to minimize.
[2022-05-19 12:25:37] [INFO ] Deduced a trap composed of 250 places in 258 ms of which 1 ms to minimize.
[2022-05-19 12:25:37] [INFO ] Deduced a trap composed of 250 places in 260 ms of which 0 ms to minimize.
[2022-05-19 12:25:37] [INFO ] Deduced a trap composed of 252 places in 254 ms of which 0 ms to minimize.
[2022-05-19 12:25:38] [INFO ] Deduced a trap composed of 252 places in 236 ms of which 1 ms to minimize.
[2022-05-19 12:25:38] [INFO ] Deduced a trap composed of 242 places in 255 ms of which 1 ms to minimize.
[2022-05-19 12:25:38] [INFO ] Deduced a trap composed of 232 places in 254 ms of which 1 ms to minimize.
[2022-05-19 12:25:40] [INFO ] Deduced a trap composed of 267 places in 254 ms of which 1 ms to minimize.
[2022-05-19 12:25:41] [INFO ] Deduced a trap composed of 270 places in 260 ms of which 1 ms to minimize.
[2022-05-19 12:25:41] [INFO ] Deduced a trap composed of 246 places in 256 ms of which 1 ms to minimize.
[2022-05-19 12:25:42] [INFO ] Deduced a trap composed of 261 places in 236 ms of which 1 ms to minimize.
[2022-05-19 12:25:42] [INFO ] Deduced a trap composed of 247 places in 223 ms of which 0 ms to minimize.
[2022-05-19 12:25:43] [INFO ] Deduced a trap composed of 256 places in 244 ms of which 1 ms to minimize.
[2022-05-19 12:25:43] [INFO ] Deduced a trap composed of 272 places in 246 ms of which 1 ms to minimize.
[2022-05-19 12:25:44] [INFO ] Deduced a trap composed of 261 places in 235 ms of which 0 ms to minimize.
[2022-05-19 12:25:44] [INFO ] Deduced a trap composed of 249 places in 244 ms of which 0 ms to minimize.
[2022-05-19 12:25:45] [INFO ] Deduced a trap composed of 259 places in 235 ms of which 1 ms to minimize.
[2022-05-19 12:25:45] [INFO ] Deduced a trap composed of 254 places in 251 ms of which 1 ms to minimize.
[2022-05-19 12:25:45] [INFO ] Deduced a trap composed of 253 places in 237 ms of which 0 ms to minimize.
[2022-05-19 12:25:46] [INFO ] Deduced a trap composed of 243 places in 234 ms of which 1 ms to minimize.
[2022-05-19 12:25:46] [INFO ] Deduced a trap composed of 252 places in 250 ms of which 1 ms to minimize.
[2022-05-19 12:25:47] [INFO ] Deduced a trap composed of 257 places in 235 ms of which 1 ms to minimize.
[2022-05-19 12:25:48] [INFO ] Deduced a trap composed of 256 places in 240 ms of which 1 ms to minimize.
[2022-05-19 12:25:48] [INFO ] Deduced a trap composed of 273 places in 251 ms of which 0 ms to minimize.
[2022-05-19 12:25:49] [INFO ] Deduced a trap composed of 281 places in 276 ms of which 0 ms to minimize.
[2022-05-19 12:25:50] [INFO ] Deduced a trap composed of 244 places in 251 ms of which 1 ms to minimize.
[2022-05-19 12:25:50] [INFO ] Deduced a trap composed of 239 places in 242 ms of which 0 ms to minimize.
[2022-05-19 12:25:50] [INFO ] Deduced a trap composed of 225 places in 256 ms of which 0 ms to minimize.
[2022-05-19 12:25:51] [INFO ] Deduced a trap composed of 253 places in 254 ms of which 0 ms to minimize.
[2022-05-19 12:25:51] [INFO ] Deduced a trap composed of 244 places in 259 ms of which 0 ms to minimize.
[2022-05-19 12:25:52] [INFO ] Deduced a trap composed of 236 places in 276 ms of which 0 ms to minimize.
[2022-05-19 12:25:53] [INFO ] Deduced a trap composed of 249 places in 251 ms of which 0 ms to minimize.
[2022-05-19 12:25:56] [INFO ] Trap strengthening (SAT) tested/added 42/42 trap constraints in 24250 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 48 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 32 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2022-05-19 12:25:56] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-19 12:25:56] [INFO ] Computed 137 place invariants in 24 ms
[2022-05-19 12:25:57] [INFO ] Implicit Places using invariants in 1331 ms returned []
[2022-05-19 12:25:57] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-19 12:25:57] [INFO ] Computed 137 place invariants in 17 ms
[2022-05-19 12:25:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:26:10] [INFO ] Implicit Places using invariants and state equation in 13027 ms returned []
Implicit Place search using SMT with State Equation took 14384 ms to find 0 implicit places.
[2022-05-19 12:26:10] [INFO ] Redundant transitions in 39 ms returned []
[2022-05-19 12:26:10] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-19 12:26:10] [INFO ] Computed 137 place invariants in 17 ms
[2022-05-19 12:26:11] [INFO ] Dead Transitions using invariants and state equation in 1140 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 770/770 places, 1086/1086 transitions.
Ending property specific reduction for PolyORBNT-PT-S05J60-UpperBounds-00 in 57054 ms.
Starting property specific reduction for PolyORBNT-PT-S05J60-UpperBounds-08
Normalized transition count is 1083 out of 1087 initially.
// Phase 1: matrix 1083 rows 771 cols
[2022-05-19 12:26:11] [INFO ] Computed 137 place invariants in 20 ms
Incomplete random walk after 10000 steps, including 481 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :3
[2022-05-19 12:26:11] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2022-05-19 12:26:12] [INFO ] Computed 137 place invariants in 23 ms
[2022-05-19 12:26:12] [INFO ] [Real]Absence check using 112 positive place invariants in 20 ms returned sat
[2022-05-19 12:26:12] [INFO ] [Real]Absence check using 112 positive and 25 generalized place invariants in 20 ms returned sat
[2022-05-19 12:26:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 12:26:12] [INFO ] [Real]Absence check using state equation in 678 ms returned sat
[2022-05-19 12:26:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 12:26:12] [INFO ] [Nat]Absence check using 112 positive place invariants in 20 ms returned sat
[2022-05-19 12:26:13] [INFO ] [Nat]Absence check using 112 positive and 25 generalized place invariants in 19 ms returned sat
[2022-05-19 12:26:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 12:26:13] [INFO ] [Nat]Absence check using state equation in 728 ms returned sat
[2022-05-19 12:26:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:26:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 282 ms returned sat
[2022-05-19 12:26:14] [INFO ] Deduced a trap composed of 259 places in 276 ms of which 1 ms to minimize.
[2022-05-19 12:26:14] [INFO ] Deduced a trap composed of 261 places in 266 ms of which 1 ms to minimize.
[2022-05-19 12:26:15] [INFO ] Deduced a trap composed of 266 places in 278 ms of which 1 ms to minimize.
[2022-05-19 12:26:15] [INFO ] Deduced a trap composed of 264 places in 315 ms of which 1 ms to minimize.
[2022-05-19 12:26:15] [INFO ] Deduced a trap composed of 270 places in 240 ms of which 1 ms to minimize.
[2022-05-19 12:26:16] [INFO ] Deduced a trap composed of 248 places in 265 ms of which 0 ms to minimize.
[2022-05-19 12:26:16] [INFO ] Deduced a trap composed of 235 places in 263 ms of which 1 ms to minimize.
[2022-05-19 12:26:16] [INFO ] Deduced a trap composed of 249 places in 254 ms of which 1 ms to minimize.
[2022-05-19 12:26:16] [INFO ] Deduced a trap composed of 260 places in 264 ms of which 0 ms to minimize.
[2022-05-19 12:26:17] [INFO ] Deduced a trap composed of 237 places in 276 ms of which 1 ms to minimize.
[2022-05-19 12:26:17] [INFO ] Deduced a trap composed of 255 places in 256 ms of which 0 ms to minimize.
[2022-05-19 12:26:17] [INFO ] Deduced a trap composed of 257 places in 294 ms of which 5 ms to minimize.
[2022-05-19 12:26:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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) : [142] Max seen :[3]
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 32 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
[2022-05-19 12:26:17] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2022-05-19 12:26:17] [INFO ] Computed 137 place invariants in 17 ms
[2022-05-19 12:26:19] [INFO ] Dead Transitions using invariants and state equation in 1225 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 771/771 places, 1087/1087 transitions.
Normalized transition count is 1083 out of 1087 initially.
// Phase 1: matrix 1083 rows 771 cols
[2022-05-19 12:26:19] [INFO ] Computed 137 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 47107 resets, run finished after 6211 ms. (steps per millisecond=161 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 3231 resets, run finished after 1517 ms. (steps per millisecond=659 ) properties (out of 1) seen :3
[2022-05-19 12:26:26] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2022-05-19 12:26:27] [INFO ] Computed 137 place invariants in 24 ms
[2022-05-19 12:26:27] [INFO ] [Real]Absence check using 112 positive place invariants in 23 ms returned sat
[2022-05-19 12:26:27] [INFO ] [Real]Absence check using 112 positive and 25 generalized place invariants in 20 ms returned sat
[2022-05-19 12:26:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 12:26:27] [INFO ] [Real]Absence check using state equation in 668 ms returned sat
[2022-05-19 12:26:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 12:26:27] [INFO ] [Nat]Absence check using 112 positive place invariants in 23 ms returned sat
[2022-05-19 12:26:27] [INFO ] [Nat]Absence check using 112 positive and 25 generalized place invariants in 20 ms returned sat
[2022-05-19 12:26:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 12:26:28] [INFO ] [Nat]Absence check using state equation in 767 ms returned sat
[2022-05-19 12:26:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:26:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 277 ms returned sat
[2022-05-19 12:26:29] [INFO ] Deduced a trap composed of 259 places in 280 ms of which 0 ms to minimize.
[2022-05-19 12:26:29] [INFO ] Deduced a trap composed of 261 places in 291 ms of which 0 ms to minimize.
[2022-05-19 12:26:30] [INFO ] Deduced a trap composed of 266 places in 272 ms of which 0 ms to minimize.
[2022-05-19 12:26:30] [INFO ] Deduced a trap composed of 264 places in 274 ms of which 1 ms to minimize.
[2022-05-19 12:26:30] [INFO ] Deduced a trap composed of 270 places in 242 ms of which 1 ms to minimize.
[2022-05-19 12:26:31] [INFO ] Deduced a trap composed of 248 places in 246 ms of which 1 ms to minimize.
[2022-05-19 12:26:31] [INFO ] Deduced a trap composed of 235 places in 257 ms of which 1 ms to minimize.
[2022-05-19 12:26:31] [INFO ] Deduced a trap composed of 249 places in 257 ms of which 1 ms to minimize.
[2022-05-19 12:26:31] [INFO ] Deduced a trap composed of 260 places in 253 ms of which 1 ms to minimize.
[2022-05-19 12:26:32] [INFO ] Deduced a trap composed of 237 places in 250 ms of which 1 ms to minimize.
[2022-05-19 12:26:32] [INFO ] Deduced a trap composed of 255 places in 247 ms of which 1 ms to minimize.
[2022-05-19 12:26:32] [INFO ] Deduced a trap composed of 257 places in 243 ms of which 1 ms to minimize.
[2022-05-19 12:26:33] [INFO ] Deduced a trap composed of 244 places in 251 ms of which 0 ms to minimize.
[2022-05-19 12:26:33] [INFO ] Deduced a trap composed of 239 places in 263 ms of which 0 ms to minimize.
[2022-05-19 12:26:33] [INFO ] Deduced a trap composed of 269 places in 252 ms of which 1 ms to minimize.
[2022-05-19 12:26:34] [INFO ] Deduced a trap composed of 253 places in 248 ms of which 0 ms to minimize.
[2022-05-19 12:26:34] [INFO ] Deduced a trap composed of 273 places in 248 ms of which 1 ms to minimize.
[2022-05-19 12:26:35] [INFO ] Deduced a trap composed of 236 places in 244 ms of which 0 ms to minimize.
[2022-05-19 12:26:35] [INFO ] Deduced a trap composed of 246 places in 258 ms of which 0 ms to minimize.
[2022-05-19 12:26:35] [INFO ] Deduced a trap composed of 252 places in 251 ms of which 1 ms to minimize.
[2022-05-19 12:26:36] [INFO ] Deduced a trap composed of 218 places in 251 ms of which 0 ms to minimize.
[2022-05-19 12:26:37] [INFO ] Deduced a trap composed of 261 places in 254 ms of which 0 ms to minimize.
[2022-05-19 12:26:38] [INFO ] Deduced a trap composed of 242 places in 260 ms of which 1 ms to minimize.
[2022-05-19 12:26:41] [INFO ] Deduced a trap composed of 260 places in 247 ms of which 2 ms to minimize.
[2022-05-19 12:26:42] [INFO ] Deduced a trap composed of 244 places in 248 ms of which 0 ms to minimize.
[2022-05-19 12:26:42] [INFO ] Deduced a trap composed of 247 places in 266 ms of which 1 ms to minimize.
[2022-05-19 12:26:42] [INFO ] Deduced a trap composed of 244 places in 259 ms of which 0 ms to minimize.
[2022-05-19 12:26:43] [INFO ] Deduced a trap composed of 263 places in 243 ms of which 0 ms to minimize.
[2022-05-19 12:26:43] [INFO ] Deduced a trap composed of 226 places in 247 ms of which 0 ms to minimize.
[2022-05-19 12:26:44] [INFO ] Deduced a trap composed of 239 places in 255 ms of which 1 ms to minimize.
[2022-05-19 12:26:45] [INFO ] Deduced a trap composed of 246 places in 262 ms of which 1 ms to minimize.
[2022-05-19 12:26:46] [INFO ] Deduced a trap composed of 268 places in 255 ms of which 1 ms to minimize.
[2022-05-19 12:26:46] [INFO ] Deduced a trap composed of 245 places in 255 ms of which 0 ms to minimize.
[2022-05-19 12:26:46] [INFO ] Deduced a trap composed of 242 places in 252 ms of which 0 ms to minimize.
[2022-05-19 12:26:47] [INFO ] Deduced a trap composed of 243 places in 231 ms of which 1 ms to minimize.
[2022-05-19 12:26:47] [INFO ] Deduced a trap composed of 251 places in 257 ms of which 1 ms to minimize.
[2022-05-19 12:26:48] [INFO ] Deduced a trap composed of 254 places in 261 ms of which 1 ms to minimize.
[2022-05-19 12:26:48] [INFO ] Deduced a trap composed of 256 places in 254 ms of which 1 ms to minimize.
[2022-05-19 12:26:48] [INFO ] Deduced a trap composed of 254 places in 255 ms of which 0 ms to minimize.
[2022-05-19 12:26:49] [INFO ] Deduced a trap composed of 271 places in 314 ms of which 1 ms to minimize.
[2022-05-19 12:26:49] [INFO ] Deduced a trap composed of 247 places in 242 ms of which 1 ms to minimize.
[2022-05-19 12:26:49] [INFO ] Deduced a trap composed of 263 places in 248 ms of which 0 ms to minimize.
[2022-05-19 12:26:50] [INFO ] Deduced a trap composed of 255 places in 264 ms of which 1 ms to minimize.
[2022-05-19 12:26:50] [INFO ] Deduced a trap composed of 242 places in 261 ms of which 1 ms to minimize.
[2022-05-19 12:26:51] [INFO ] Deduced a trap composed of 245 places in 260 ms of which 5 ms to minimize.
[2022-05-19 12:26:51] [INFO ] Deduced a trap composed of 275 places in 259 ms of which 0 ms to minimize.
[2022-05-19 12:26:52] [INFO ] Deduced a trap composed of 251 places in 250 ms of which 0 ms to minimize.
[2022-05-19 12:26:52] [INFO ] Deduced a trap composed of 264 places in 254 ms of which 0 ms to minimize.
[2022-05-19 12:26:52] [INFO ] Deduced a trap composed of 253 places in 257 ms of which 1 ms to minimize.
[2022-05-19 12:26:55] [INFO ] Trap strengthening (SAT) tested/added 49/49 trap constraints in 26883 ms
Current structural bounds on expressions (after SMT) : [142] Max seen :[3]
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 31 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 771/771 places, 1087/1087 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 32 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
[2022-05-19 12:26:56] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2022-05-19 12:26:56] [INFO ] Computed 137 place invariants in 20 ms
[2022-05-19 12:26:57] [INFO ] Implicit Places using invariants in 1332 ms returned []
[2022-05-19 12:26:57] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2022-05-19 12:26:57] [INFO ] Computed 137 place invariants in 25 ms
[2022-05-19 12:26:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:27:20] [INFO ] Implicit Places using invariants and state equation in 23609 ms returned []
Implicit Place search using SMT with State Equation took 24943 ms to find 0 implicit places.
[2022-05-19 12:27:20] [INFO ] Redundant transitions in 19 ms returned []
[2022-05-19 12:27:20] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2022-05-19 12:27:21] [INFO ] Computed 137 place invariants in 24 ms
[2022-05-19 12:27:22] [INFO ] Dead Transitions using invariants and state equation in 1204 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 771/771 places, 1087/1087 transitions.
Ending property specific reduction for PolyORBNT-PT-S05J60-UpperBounds-08 in 70320 ms.
Starting property specific reduction for PolyORBNT-PT-S05J60-UpperBounds-09
Normalized transition count is 1083 out of 1087 initially.
// Phase 1: matrix 1083 rows 771 cols
[2022-05-19 12:27:22] [INFO ] Computed 137 place invariants in 18 ms
Incomplete random walk after 10000 steps, including 471 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :3
[2022-05-19 12:27:22] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2022-05-19 12:27:22] [INFO ] Computed 137 place invariants in 26 ms
[2022-05-19 12:27:22] [INFO ] [Real]Absence check using 112 positive place invariants in 27 ms returned sat
[2022-05-19 12:27:22] [INFO ] [Real]Absence check using 112 positive and 25 generalized place invariants in 21 ms returned sat
[2022-05-19 12:27:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 12:27:23] [INFO ] [Real]Absence check using state equation in 774 ms returned sat
[2022-05-19 12:27:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 12:27:23] [INFO ] [Nat]Absence check using 112 positive place invariants in 22 ms returned sat
[2022-05-19 12:27:23] [INFO ] [Nat]Absence check using 112 positive and 25 generalized place invariants in 20 ms returned sat
[2022-05-19 12:27:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 12:27:23] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2022-05-19 12:27:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:27:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 700 ms returned sat
[2022-05-19 12:27:24] [INFO ] Deduced a trap composed of 263 places in 283 ms of which 0 ms to minimize.
[2022-05-19 12:27:25] [INFO ] Deduced a trap composed of 252 places in 280 ms of which 0 ms to minimize.
[2022-05-19 12:27:25] [INFO ] Deduced a trap composed of 244 places in 274 ms of which 1 ms to minimize.
[2022-05-19 12:27:25] [INFO ] Deduced a trap composed of 259 places in 263 ms of which 0 ms to minimize.
[2022-05-19 12:27:26] [INFO ] Deduced a trap composed of 236 places in 259 ms of which 1 ms to minimize.
[2022-05-19 12:27:26] [INFO ] Deduced a trap composed of 240 places in 251 ms of which 0 ms to minimize.
[2022-05-19 12:27:26] [INFO ] Deduced a trap composed of 233 places in 253 ms of which 1 ms to minimize.
[2022-05-19 12:27:27] [INFO ] Deduced a trap composed of 248 places in 252 ms of which 1 ms to minimize.
[2022-05-19 12:27:27] [INFO ] Deduced a trap composed of 254 places in 259 ms of which 1 ms to minimize.
[2022-05-19 12:27:27] [INFO ] Deduced a trap composed of 239 places in 253 ms of which 0 ms to minimize.
[2022-05-19 12:27:28] [INFO ] Deduced a trap composed of 245 places in 251 ms of which 1 ms to minimize.
[2022-05-19 12:27:28] [INFO ] Deduced a trap composed of 230 places in 242 ms of which 0 ms to minimize.
[2022-05-19 12:27:28] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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) : [4] Max seen :[3]
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 771/771 places, 1087/1087 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 771 transition count 1086
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 770 transition count 1086
Applied a total of 2 rules in 42 ms. Remains 770 /771 variables (removed 1) and now considering 1086/1087 (removed 1) transitions.
[2022-05-19 12:27:28] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-19 12:27:28] [INFO ] Computed 137 place invariants in 30 ms
[2022-05-19 12:27:29] [INFO ] Dead Transitions using invariants and state equation in 1229 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 770/771 places, 1086/1087 transitions.
Normalized transition count is 1082 out of 1086 initially.
// Phase 1: matrix 1082 rows 770 cols
[2022-05-19 12:27:29] [INFO ] Computed 137 place invariants in 21 ms
Incomplete random walk after 1000000 steps, including 51943 resets, run finished after 6729 ms. (steps per millisecond=148 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 3409 resets, run finished after 1581 ms. (steps per millisecond=632 ) properties (out of 1) seen :3
[2022-05-19 12:27:37] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-19 12:27:38] [INFO ] Computed 137 place invariants in 23 ms
[2022-05-19 12:27:38] [INFO ] [Real]Absence check using 111 positive place invariants in 23 ms returned sat
[2022-05-19 12:27:38] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 25 ms returned sat
[2022-05-19 12:27:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 12:27:38] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2022-05-19 12:27:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 12:27:38] [INFO ] [Nat]Absence check using 111 positive place invariants in 21 ms returned sat
[2022-05-19 12:27:38] [INFO ] [Nat]Absence check using 111 positive and 26 generalized place invariants in 24 ms returned sat
[2022-05-19 12:27:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 12:27:38] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2022-05-19 12:27:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:27:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 296 ms returned sat
[2022-05-19 12:27:39] [INFO ] Deduced a trap composed of 263 places in 326 ms of which 1 ms to minimize.
[2022-05-19 12:27:39] [INFO ] Deduced a trap composed of 356 places in 285 ms of which 1 ms to minimize.
[2022-05-19 12:27:40] [INFO ] Deduced a trap composed of 234 places in 272 ms of which 1 ms to minimize.
[2022-05-19 12:27:40] [INFO ] Deduced a trap composed of 262 places in 239 ms of which 1 ms to minimize.
[2022-05-19 12:27:40] [INFO ] Deduced a trap composed of 247 places in 250 ms of which 1 ms to minimize.
[2022-05-19 12:27:41] [INFO ] Deduced a trap composed of 259 places in 249 ms of which 1 ms to minimize.
[2022-05-19 12:27:41] [INFO ] Deduced a trap composed of 280 places in 280 ms of which 1 ms to minimize.
[2022-05-19 12:27:43] [INFO ] Deduced a trap composed of 249 places in 253 ms of which 0 ms to minimize.
[2022-05-19 12:27:43] [INFO ] Deduced a trap composed of 239 places in 263 ms of which 0 ms to minimize.
[2022-05-19 12:27:43] [INFO ] Deduced a trap composed of 268 places in 264 ms of which 1 ms to minimize.
[2022-05-19 12:27:43] [INFO ] Deduced a trap composed of 251 places in 255 ms of which 0 ms to minimize.
[2022-05-19 12:27:44] [INFO ] Deduced a trap composed of 250 places in 245 ms of which 1 ms to minimize.
[2022-05-19 12:27:44] [INFO ] Deduced a trap composed of 250 places in 258 ms of which 1 ms to minimize.
[2022-05-19 12:27:45] [INFO ] Deduced a trap composed of 252 places in 282 ms of which 0 ms to minimize.
[2022-05-19 12:27:45] [INFO ] Deduced a trap composed of 252 places in 252 ms of which 0 ms to minimize.
[2022-05-19 12:27:45] [INFO ] Deduced a trap composed of 242 places in 248 ms of which 1 ms to minimize.
[2022-05-19 12:27:46] [INFO ] Deduced a trap composed of 232 places in 255 ms of which 1 ms to minimize.
[2022-05-19 12:27:48] [INFO ] Deduced a trap composed of 267 places in 272 ms of which 0 ms to minimize.
[2022-05-19 12:27:48] [INFO ] Deduced a trap composed of 270 places in 245 ms of which 0 ms to minimize.
[2022-05-19 12:27:49] [INFO ] Deduced a trap composed of 246 places in 263 ms of which 0 ms to minimize.
[2022-05-19 12:27:49] [INFO ] Deduced a trap composed of 261 places in 241 ms of which 0 ms to minimize.
[2022-05-19 12:27:49] [INFO ] Deduced a trap composed of 247 places in 241 ms of which 0 ms to minimize.
[2022-05-19 12:27:50] [INFO ] Deduced a trap composed of 256 places in 246 ms of which 0 ms to minimize.
[2022-05-19 12:27:50] [INFO ] Deduced a trap composed of 272 places in 235 ms of which 0 ms to minimize.
[2022-05-19 12:27:51] [INFO ] Deduced a trap composed of 261 places in 247 ms of which 1 ms to minimize.
[2022-05-19 12:27:52] [INFO ] Deduced a trap composed of 249 places in 245 ms of which 1 ms to minimize.
[2022-05-19 12:27:52] [INFO ] Deduced a trap composed of 259 places in 242 ms of which 1 ms to minimize.
[2022-05-19 12:27:52] [INFO ] Deduced a trap composed of 254 places in 247 ms of which 1 ms to minimize.
[2022-05-19 12:27:53] [INFO ] Deduced a trap composed of 253 places in 243 ms of which 0 ms to minimize.
[2022-05-19 12:27:53] [INFO ] Deduced a trap composed of 243 places in 249 ms of which 0 ms to minimize.
[2022-05-19 12:27:54] [INFO ] Deduced a trap composed of 252 places in 245 ms of which 1 ms to minimize.
[2022-05-19 12:27:54] [INFO ] Deduced a trap composed of 257 places in 248 ms of which 1 ms to minimize.
[2022-05-19 12:27:55] [INFO ] Deduced a trap composed of 256 places in 241 ms of which 1 ms to minimize.
[2022-05-19 12:27:56] [INFO ] Deduced a trap composed of 273 places in 242 ms of which 1 ms to minimize.
[2022-05-19 12:27:56] [INFO ] Deduced a trap composed of 281 places in 234 ms of which 0 ms to minimize.
[2022-05-19 12:27:57] [INFO ] Deduced a trap composed of 244 places in 236 ms of which 1 ms to minimize.
[2022-05-19 12:27:57] [INFO ] Deduced a trap composed of 239 places in 236 ms of which 1 ms to minimize.
[2022-05-19 12:27:58] [INFO ] Deduced a trap composed of 225 places in 255 ms of which 0 ms to minimize.
[2022-05-19 12:27:59] [INFO ] Deduced a trap composed of 253 places in 245 ms of which 0 ms to minimize.
[2022-05-19 12:27:59] [INFO ] Deduced a trap composed of 244 places in 261 ms of which 0 ms to minimize.
[2022-05-19 12:27:59] [INFO ] Deduced a trap composed of 236 places in 252 ms of which 1 ms to minimize.
[2022-05-19 12:28:00] [INFO ] Deduced a trap composed of 249 places in 263 ms of which 1 ms to minimize.
[2022-05-19 12:28:03] [INFO ] Trap strengthening (SAT) tested/added 42/42 trap constraints in 24505 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 33 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 32 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2022-05-19 12:28:03] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-19 12:28:03] [INFO ] Computed 137 place invariants in 27 ms
[2022-05-19 12:28:05] [INFO ] Implicit Places using invariants in 1430 ms returned []
[2022-05-19 12:28:05] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-19 12:28:05] [INFO ] Computed 137 place invariants in 16 ms
[2022-05-19 12:28:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:28:18] [INFO ] Implicit Places using invariants and state equation in 13646 ms returned []
Implicit Place search using SMT with State Equation took 15078 ms to find 0 implicit places.
[2022-05-19 12:28:18] [INFO ] Redundant transitions in 16 ms returned []
[2022-05-19 12:28:18] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-19 12:28:18] [INFO ] Computed 137 place invariants in 25 ms
[2022-05-19 12:28:20] [INFO ] Dead Transitions using invariants and state equation in 1192 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 770/770 places, 1086/1086 transitions.
Ending property specific reduction for PolyORBNT-PT-S05J60-UpperBounds-09 in 57877 ms.
[2022-05-19 12:28:20] [INFO ] Flatten gal took : 156 ms
[2022-05-19 12:28:20] [INFO ] Applying decomposition
[2022-05-19 12:28:20] [INFO ] Flatten gal took : 85 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2906676193914061190.txt' '-o' '/tmp/graph2906676193914061190.bin' '-w' '/tmp/graph2906676193914061190.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2906676193914061190.bin' '-l' '-1' '-v' '-w' '/tmp/graph2906676193914061190.weights' '-q' '0' '-e' '0.001'
[2022-05-19 12:28:20] [INFO ] Decomposing Gal with order
[2022-05-19 12:28:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 12:28:21] [INFO ] Removed a total of 1081 redundant transitions.
[2022-05-19 12:28:21] [INFO ] Flatten gal took : 442 ms
[2022-05-19 12:28:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 494 labels/synchronizations in 75 ms.
[2022-05-19 12:28:21] [INFO ] Time to serialize gal into /tmp/UpperBounds2234705759612447292.gal : 28 ms
[2022-05-19 12:28:21] [INFO ] Time to serialize properties into /tmp/UpperBounds7767802392877790579.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds2234705759612447292.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7767802392877790579.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...274
Loading property file /tmp/UpperBounds7767802392877790579.prop.
Detected timeout of ITS tools.
[2022-05-19 12:50:12] [INFO ] Flatten gal took : 425 ms
[2022-05-19 12:50:12] [INFO ] Time to serialize gal into /tmp/UpperBounds5035146899762836518.gal : 64 ms
[2022-05-19 12:50:12] [INFO ] Time to serialize properties into /tmp/UpperBounds1741983592023087566.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds5035146899762836518.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1741983592023087566.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...295
Loading property file /tmp/UpperBounds1741983592023087566.prop.
Detected timeout of ITS tools.
[2022-05-19 13:12:17] [INFO ] Flatten gal took : 363 ms
[2022-05-19 13:12:19] [INFO ] Input system was already deterministic with 1087 transitions.
[2022-05-19 13:12:19] [INFO ] Transformed 771 places.
[2022-05-19 13:12:19] [INFO ] Transformed 1087 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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//..//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
[2022-05-19 13:12:49] [INFO ] Time to serialize gal into /tmp/UpperBounds4029932620462730767.gal : 16 ms
[2022-05-19 13:12:49] [INFO ] Time to serialize properties into /tmp/UpperBounds5153311057941124727.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4029932620462730767.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5153311057941124727.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...340
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds5153311057941124727.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-S05J60"
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-4028"
echo " Executing tool itstools"
echo " Input is PolyORBNT-PT-S05J60, 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 r168-tall-165277017200837"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J60.tgz
mv PolyORBNT-PT-S05J60 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 ;