Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 32K Feb 26 00:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 183K Feb 26 00:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 248K Feb 25 23:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 935K Feb 25 23:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 23K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 48K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 143K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 78K Feb 26 01:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 358K Feb 26 01:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 999K Feb 26 01:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.3M Feb 26 01:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.2K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 14M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678880043759

Running Version 202205111006
[2023-03-15 11:34: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]
[2023-03-15 11:34:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 11:34:06] [INFO ] Load time of PNML (sax parser for PT used): 977 ms
[2023-03-15 11:34:06] [INFO ] Transformed 854 places.
[2023-03-15 11:34:06] [INFO ] Transformed 12340 transitions.
[2023-03-15 11:34:06] [INFO ] Parsed PT model containing 854 places and 12340 transitions in 1269 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Normalized transition count is 2221 out of 2230 initially.
// Phase 1: matrix 2221 rows 854 cols
[2023-03-15 11:34:06] [INFO ] Computed 112 place invariants in 251 ms
FORMULA PolyORBNT-PT-S10J40-UpperBounds-08 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J40-UpperBounds-02 41 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J40-UpperBounds-01 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 560 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 13) seen :14
FORMULA PolyORBNT-PT-S10J40-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 12) seen :20
FORMULA PolyORBNT-PT-S10J40-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :13
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :13
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :13
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :13
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :13
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :13
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :13
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :13
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :13
[2023-03-15 11:34:09] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
// Phase 1: matrix 2221 rows 854 cols
[2023-03-15 11:34:09] [INFO ] Computed 112 place invariants in 115 ms
[2023-03-15 11:34:09] [INFO ] [Real]Absence check using 81 positive place invariants in 31 ms returned sat
[2023-03-15 11:34:09] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 35 ms returned unsat
[2023-03-15 11:34:09] [INFO ] [Real]Absence check using 81 positive place invariants in 19 ms returned sat
[2023-03-15 11:34:10] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 48 ms returned unsat
[2023-03-15 11:34:10] [INFO ] [Real]Absence check using 81 positive place invariants in 19 ms returned sat
[2023-03-15 11:34:10] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 25 ms returned unsat
[2023-03-15 11:34:10] [INFO ] [Real]Absence check using 81 positive place invariants in 20 ms returned sat
[2023-03-15 11:34:10] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 39 ms returned sat
[2023-03-15 11:34:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:34:11] [INFO ] [Real]Absence check using state equation in 746 ms returned sat
[2023-03-15 11:34:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:34:11] [INFO ] [Nat]Absence check using 81 positive place invariants in 39 ms returned sat
[2023-03-15 11:34:11] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 26 ms returned sat
[2023-03-15 11:34:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:34:16] [INFO ] [Nat]Absence check using state equation in 4806 ms returned unknown
[2023-03-15 11:34:16] [INFO ] [Real]Absence check using 81 positive place invariants in 32 ms returned sat
[2023-03-15 11:34:16] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 51 ms returned unsat
[2023-03-15 11:34:16] [INFO ] [Real]Absence check using 81 positive place invariants in 20 ms returned sat
[2023-03-15 11:34:16] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 22 ms returned unsat
[2023-03-15 11:34:16] [INFO ] [Real]Absence check using 81 positive place invariants in 19 ms returned sat
[2023-03-15 11:34:16] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 39 ms returned unsat
[2023-03-15 11:34:16] [INFO ] [Real]Absence check using 81 positive place invariants in 20 ms returned sat
[2023-03-15 11:34:17] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 60 ms returned sat
[2023-03-15 11:34:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:34:18] [INFO ] [Real]Absence check using state equation in 1431 ms returned sat
[2023-03-15 11:34:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:34:18] [INFO ] [Nat]Absence check using 81 positive place invariants in 19 ms returned sat
[2023-03-15 11:34:18] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 22 ms returned sat
[2023-03-15 11:34:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:34:23] [INFO ] [Nat]Absence check using state equation in 4880 ms returned unknown
[2023-03-15 11:34:23] [INFO ] [Real]Absence check using 81 positive place invariants in 20 ms returned sat
[2023-03-15 11:34:23] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 5 ms returned unsat
[2023-03-15 11:34:23] [INFO ] [Real]Absence check using 81 positive place invariants in 20 ms returned sat
[2023-03-15 11:34:23] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 26 ms returned unsat
Current structural bounds on expressions (after SMT) : [10, 1, 1, 4, 1, 1, 1, 445, 1, 1] Max seen :[10, 1, 1, 0, 1, 1, 1, 1, 1, 1]
FORMULA PolyORBNT-PT-S10J40-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 854 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 854/854 places, 2230/2230 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 844 transition count 2185
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 101 place count 799 transition count 2184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 102 place count 798 transition count 2184
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 102 place count 798 transition count 2140
Deduced a syphon composed of 44 places in 3 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 190 place count 754 transition count 2140
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 191 place count 753 transition count 2139
Iterating global reduction 3 with 1 rules applied. Total rules applied 192 place count 753 transition count 2139
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 196 place count 751 transition count 2137
Applied a total of 196 rules in 423 ms. Remains 751 /854 variables (removed 103) and now considering 2137/2230 (removed 93) transitions.
[2023-03-15 11:34:24] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
// Phase 1: matrix 2128 rows 751 cols
[2023-03-15 11:34:24] [INFO ] Computed 102 place invariants in 88 ms
[2023-03-15 11:34:26] [INFO ] Dead Transitions using invariants and state equation in 1621 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 751/854 places, 1522/2230 transitions.
Applied a total of 0 rules in 80 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 751/854 places, 1522/2230 transitions.
Normalized transition count is 1513 out of 1522 initially.
// Phase 1: matrix 1513 rows 751 cols
[2023-03-15 11:34:26] [INFO ] Computed 102 place invariants in 26 ms
Incomplete random walk after 1000000 steps, including 70315 resets, run finished after 9243 ms. (steps per millisecond=108 ) properties (out of 2) seen :7
FORMULA PolyORBNT-PT-S10J40-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 8055 resets, run finished after 1807 ms. (steps per millisecond=553 ) properties (out of 1) seen :3
[2023-03-15 11:34:37] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-15 11:34:37] [INFO ] Computed 102 place invariants in 31 ms
[2023-03-15 11:34:37] [INFO ] [Real]Absence check using 81 positive place invariants in 17 ms returned sat
[2023-03-15 11:34:37] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 19 ms returned sat
[2023-03-15 11:34:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:34:37] [INFO ] [Real]Absence check using state equation in 662 ms returned sat
[2023-03-15 11:34:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:34:38] [INFO ] [Nat]Absence check using 81 positive place invariants in 19 ms returned sat
[2023-03-15 11:34:38] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 21 ms returned sat
[2023-03-15 11:34:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:34:38] [INFO ] [Nat]Absence check using state equation in 496 ms returned sat
[2023-03-15 11:34:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:34:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 463 ms returned sat
[2023-03-15 11:34:39] [INFO ] Deduced a trap composed of 288 places in 439 ms of which 4 ms to minimize.
[2023-03-15 11:34:40] [INFO ] Deduced a trap composed of 302 places in 553 ms of which 2 ms to minimize.
[2023-03-15 11:34:40] [INFO ] Deduced a trap composed of 286 places in 401 ms of which 1 ms to minimize.
[2023-03-15 11:34:41] [INFO ] Deduced a trap composed of 300 places in 369 ms of which 2 ms to minimize.
[2023-03-15 11:34:41] [INFO ] Deduced a trap composed of 305 places in 351 ms of which 1 ms to minimize.
[2023-03-15 11:34:41] [INFO ] Deduced a trap composed of 302 places in 340 ms of which 0 ms to minimize.
[2023-03-15 11:34:42] [INFO ] Deduced a trap composed of 307 places in 347 ms of which 1 ms to minimize.
[2023-03-15 11:34:42] [INFO ] Deduced a trap composed of 288 places in 591 ms of which 1 ms to minimize.
[2023-03-15 11:34:43] [INFO ] Deduced a trap composed of 294 places in 450 ms of which 1 ms to minimize.
[2023-03-15 11:34:43] [INFO ] Deduced a trap composed of 303 places in 377 ms of which 1 ms to minimize.
[2023-03-15 11:34:44] [INFO ] Deduced a trap composed of 318 places in 342 ms of which 2 ms to minimize.
[2023-03-15 11:34:44] [INFO ] Deduced a trap composed of 290 places in 336 ms of which 0 ms to minimize.
[2023-03-15 11:34:45] [INFO ] Deduced a trap composed of 299 places in 339 ms of which 1 ms to minimize.
[2023-03-15 11:34:45] [INFO ] Deduced a trap composed of 290 places in 342 ms of which 0 ms to minimize.
[2023-03-15 11:34:46] [INFO ] Deduced a trap composed of 304 places in 355 ms of which 0 ms to minimize.
[2023-03-15 11:34:46] [INFO ] Deduced a trap composed of 300 places in 339 ms of which 1 ms to minimize.
[2023-03-15 11:34:47] [INFO ] Deduced a trap composed of 306 places in 577 ms of which 1 ms to minimize.
[2023-03-15 11:34:47] [INFO ] Deduced a trap composed of 296 places in 574 ms of which 1 ms to minimize.
[2023-03-15 11:34:48] [INFO ] Deduced a trap composed of 305 places in 404 ms of which 1 ms to minimize.
[2023-03-15 11:34:48] [INFO ] Deduced a trap composed of 303 places in 343 ms of which 1 ms to minimize.
[2023-03-15 11:34:49] [INFO ] Deduced a trap composed of 312 places in 363 ms of which 1 ms to minimize.
[2023-03-15 11:34:49] [INFO ] Deduced a trap composed of 323 places in 443 ms of which 2 ms to minimize.
[2023-03-15 11:34:50] [INFO ] Deduced a trap composed of 308 places in 428 ms of which 1 ms to minimize.
[2023-03-15 11:34:50] [INFO ] Deduced a trap composed of 304 places in 362 ms of which 0 ms to minimize.
[2023-03-15 11:34:52] [INFO ] Deduced a trap composed of 321 places in 349 ms of which 1 ms to minimize.
[2023-03-15 11:34:52] [INFO ] Deduced a trap composed of 292 places in 351 ms of which 1 ms to minimize.
[2023-03-15 11:34:53] [INFO ] Deduced a trap composed of 299 places in 340 ms of which 0 ms to minimize.
[2023-03-15 11:34:53] [INFO ] Deduced a trap composed of 302 places in 363 ms of which 1 ms to minimize.
[2023-03-15 11:34:54] [INFO ] Deduced a trap composed of 300 places in 346 ms of which 0 ms to minimize.
[2023-03-15 11:34:54] [INFO ] Deduced a trap composed of 299 places in 336 ms of which 1 ms to minimize.
[2023-03-15 11:34:55] [INFO ] Deduced a trap composed of 298 places in 345 ms of which 0 ms to minimize.
[2023-03-15 11:34:55] [INFO ] Deduced a trap composed of 303 places in 344 ms of which 1 ms to minimize.
[2023-03-15 11:34:55] [INFO ] Deduced a trap composed of 311 places in 348 ms of which 1 ms to minimize.
[2023-03-15 11:34:56] [INFO ] Deduced a trap composed of 294 places in 353 ms of which 1 ms to minimize.
[2023-03-15 11:34:56] [INFO ] Deduced a trap composed of 306 places in 339 ms of which 6 ms to minimize.
[2023-03-15 11:34:57] [INFO ] Deduced a trap composed of 304 places in 351 ms of which 1 ms to minimize.
[2023-03-15 11:34:57] [INFO ] Deduced a trap composed of 314 places in 360 ms of which 1 ms to minimize.
[2023-03-15 11:34:58] [INFO ] Deduced a trap composed of 292 places in 350 ms of which 2 ms to minimize.
[2023-03-15 11:34:58] [INFO ] Deduced a trap composed of 309 places in 337 ms of which 1 ms to minimize.
[2023-03-15 11:34:59] [INFO ] Deduced a trap composed of 302 places in 355 ms of which 2 ms to minimize.
[2023-03-15 11:35:00] [INFO ] Deduced a trap composed of 302 places in 336 ms of which 0 ms to minimize.
[2023-03-15 11:35:00] [INFO ] Deduced a trap composed of 294 places in 370 ms of which 0 ms to minimize.
[2023-03-15 11:35:00] [INFO ] Deduced a trap composed of 302 places in 356 ms of which 0 ms to minimize.
[2023-03-15 11:35:01] [INFO ] Deduced a trap composed of 290 places in 348 ms of which 0 ms to minimize.
[2023-03-15 11:35:01] [INFO ] Deduced a trap composed of 306 places in 394 ms of which 1 ms to minimize.
[2023-03-15 11:35:02] [INFO ] Deduced a trap composed of 309 places in 608 ms of which 2 ms to minimize.
[2023-03-15 11:35:03] [INFO ] Deduced a trap composed of 294 places in 566 ms of which 1 ms to minimize.
[2023-03-15 11:35:03] [INFO ] Deduced a trap composed of 298 places in 564 ms of which 1 ms to minimize.
[2023-03-15 11:35:04] [INFO ] Deduced a trap composed of 296 places in 562 ms of which 1 ms to minimize.
[2023-03-15 11:35:05] [INFO ] Deduced a trap composed of 308 places in 374 ms of which 1 ms to minimize.
[2023-03-15 11:35:05] [INFO ] Deduced a trap composed of 288 places in 377 ms of which 1 ms to minimize.
[2023-03-15 11:35:06] [INFO ] Deduced a trap composed of 288 places in 379 ms of which 1 ms to minimize.
[2023-03-15 11:35:06] [INFO ] Deduced a trap composed of 312 places in 376 ms of which 1 ms to minimize.
[2023-03-15 11:35:07] [INFO ] Deduced a trap composed of 304 places in 341 ms of which 0 ms to minimize.
[2023-03-15 11:35:08] [INFO ] Deduced a trap composed of 306 places in 336 ms of which 0 ms to minimize.
[2023-03-15 11:35:08] [INFO ] Deduced a trap composed of 294 places in 341 ms of which 6 ms to minimize.
[2023-03-15 11:35:09] [INFO ] Deduced a trap composed of 307 places in 335 ms of which 1 ms to minimize.
[2023-03-15 11:35:09] [INFO ] Deduced a trap composed of 300 places in 329 ms of which 1 ms to minimize.
[2023-03-15 11:35:11] [INFO ] Deduced a trap composed of 307 places in 345 ms of which 1 ms to minimize.
[2023-03-15 11:35:11] [INFO ] Deduced a trap composed of 305 places in 339 ms of which 0 ms to minimize.
[2023-03-15 11:35:11] [INFO ] Deduced a trap composed of 295 places in 337 ms of which 1 ms to minimize.
[2023-03-15 11:35:12] [INFO ] Deduced a trap composed of 296 places in 347 ms of which 1 ms to minimize.
[2023-03-15 11:35:12] [INFO ] Deduced a trap composed of 308 places in 326 ms of which 1 ms to minimize.
[2023-03-15 11:35:13] [INFO ] Deduced a trap composed of 304 places in 362 ms of which 0 ms to minimize.
[2023-03-15 11:35:13] [INFO ] Deduced a trap composed of 308 places in 346 ms of which 1 ms to minimize.
[2023-03-15 11:35:14] [INFO ] Deduced a trap composed of 296 places in 355 ms of which 3 ms to minimize.
[2023-03-15 11:35:14] [INFO ] Deduced a trap composed of 284 places in 328 ms of which 2 ms to minimize.
[2023-03-15 11:35:15] [INFO ] Deduced a trap composed of 305 places in 328 ms of which 4 ms to minimize.
[2023-03-15 11:35:16] [INFO ] Deduced a trap composed of 305 places in 344 ms of which 1 ms to minimize.
[2023-03-15 11:35:17] [INFO ] Deduced a trap composed of 304 places in 349 ms of which 1 ms to minimize.
[2023-03-15 11:35:18] [INFO ] Deduced a trap composed of 296 places in 357 ms of which 1 ms to minimize.
[2023-03-15 11:35:20] [INFO ] Deduced a trap composed of 308 places in 349 ms of which 1 ms to minimize.
[2023-03-15 11:35:23] [INFO ] Trap strengthening (SAT) tested/added 72/72 trap constraints in 43910 ms
Current structural bounds on expressions (after SMT) : [181] Max seen :[3]
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 751/751 places, 1522/1522 transitions.
Applied a total of 0 rules in 55 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 751/751 places, 1522/1522 transitions.
Normalized transition count is 1513 out of 1522 initially.
// Phase 1: matrix 1513 rows 751 cols
[2023-03-15 11:35:23] [INFO ] Computed 102 place invariants in 22 ms
Incomplete random walk after 1000000 steps, including 70394 resets, run finished after 8837 ms. (steps per millisecond=113 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 8250 resets, run finished after 1737 ms. (steps per millisecond=575 ) properties (out of 1) seen :3
[2023-03-15 11:35:33] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-15 11:35:33] [INFO ] Computed 102 place invariants in 25 ms
[2023-03-15 11:35:33] [INFO ] [Real]Absence check using 81 positive place invariants in 17 ms returned sat
[2023-03-15 11:35:33] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 19 ms returned sat
[2023-03-15 11:35:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:35:34] [INFO ] [Real]Absence check using state equation in 667 ms returned sat
[2023-03-15 11:35:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:35:34] [INFO ] [Nat]Absence check using 81 positive place invariants in 17 ms returned sat
[2023-03-15 11:35:34] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 24 ms returned sat
[2023-03-15 11:35:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:35:35] [INFO ] [Nat]Absence check using state equation in 514 ms returned sat
[2023-03-15 11:35:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:35:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 456 ms returned sat
[2023-03-15 11:35:36] [INFO ] Deduced a trap composed of 288 places in 337 ms of which 1 ms to minimize.
[2023-03-15 11:35:36] [INFO ] Deduced a trap composed of 302 places in 443 ms of which 0 ms to minimize.
[2023-03-15 11:35:37] [INFO ] Deduced a trap composed of 286 places in 610 ms of which 1 ms to minimize.
[2023-03-15 11:35:37] [INFO ] Deduced a trap composed of 300 places in 342 ms of which 0 ms to minimize.
[2023-03-15 11:35:38] [INFO ] Deduced a trap composed of 305 places in 347 ms of which 1 ms to minimize.
[2023-03-15 11:35:38] [INFO ] Deduced a trap composed of 302 places in 352 ms of which 1 ms to minimize.
[2023-03-15 11:35:38] [INFO ] Deduced a trap composed of 307 places in 355 ms of which 1 ms to minimize.
[2023-03-15 11:35:39] [INFO ] Deduced a trap composed of 288 places in 353 ms of which 2 ms to minimize.
[2023-03-15 11:35:39] [INFO ] Deduced a trap composed of 294 places in 358 ms of which 1 ms to minimize.
[2023-03-15 11:35:40] [INFO ] Deduced a trap composed of 303 places in 351 ms of which 0 ms to minimize.
[2023-03-15 11:35:40] [INFO ] Deduced a trap composed of 318 places in 339 ms of which 0 ms to minimize.
[2023-03-15 11:35:40] [INFO ] Deduced a trap composed of 290 places in 329 ms of which 0 ms to minimize.
[2023-03-15 11:35:41] [INFO ] Deduced a trap composed of 299 places in 429 ms of which 1 ms to minimize.
[2023-03-15 11:35:41] [INFO ] Deduced a trap composed of 290 places in 363 ms of which 0 ms to minimize.
[2023-03-15 11:35:42] [INFO ] Deduced a trap composed of 304 places in 343 ms of which 0 ms to minimize.
[2023-03-15 11:35:42] [INFO ] Deduced a trap composed of 300 places in 370 ms of which 0 ms to minimize.
[2023-03-15 11:35:43] [INFO ] Deduced a trap composed of 306 places in 361 ms of which 1 ms to minimize.
[2023-03-15 11:35:43] [INFO ] Deduced a trap composed of 296 places in 348 ms of which 0 ms to minimize.
[2023-03-15 11:35:44] [INFO ] Deduced a trap composed of 305 places in 354 ms of which 1 ms to minimize.
[2023-03-15 11:35:44] [INFO ] Deduced a trap composed of 303 places in 357 ms of which 0 ms to minimize.
[2023-03-15 11:35:45] [INFO ] Deduced a trap composed of 312 places in 332 ms of which 1 ms to minimize.
[2023-03-15 11:35:45] [INFO ] Deduced a trap composed of 323 places in 379 ms of which 1 ms to minimize.
[2023-03-15 11:35:46] [INFO ] Deduced a trap composed of 308 places in 343 ms of which 1 ms to minimize.
[2023-03-15 11:35:46] [INFO ] Deduced a trap composed of 304 places in 345 ms of which 1 ms to minimize.
[2023-03-15 11:35:47] [INFO ] Deduced a trap composed of 321 places in 353 ms of which 1 ms to minimize.
[2023-03-15 11:35:48] [INFO ] Deduced a trap composed of 292 places in 403 ms of which 1 ms to minimize.
[2023-03-15 11:35:49] [INFO ] Deduced a trap composed of 299 places in 352 ms of which 1 ms to minimize.
[2023-03-15 11:35:49] [INFO ] Deduced a trap composed of 302 places in 347 ms of which 0 ms to minimize.
[2023-03-15 11:35:49] [INFO ] Deduced a trap composed of 300 places in 360 ms of which 1 ms to minimize.
[2023-03-15 11:35:50] [INFO ] Deduced a trap composed of 299 places in 348 ms of which 0 ms to minimize.
[2023-03-15 11:35:50] [INFO ] Deduced a trap composed of 298 places in 365 ms of which 1 ms to minimize.
[2023-03-15 11:35:51] [INFO ] Deduced a trap composed of 303 places in 356 ms of which 0 ms to minimize.
[2023-03-15 11:35:51] [INFO ] Deduced a trap composed of 311 places in 334 ms of which 1 ms to minimize.
[2023-03-15 11:35:52] [INFO ] Deduced a trap composed of 294 places in 350 ms of which 1 ms to minimize.
[2023-03-15 11:35:52] [INFO ] Deduced a trap composed of 306 places in 350 ms of which 1 ms to minimize.
[2023-03-15 11:35:53] [INFO ] Deduced a trap composed of 304 places in 349 ms of which 0 ms to minimize.
[2023-03-15 11:35:53] [INFO ] Deduced a trap composed of 314 places in 366 ms of which 0 ms to minimize.
[2023-03-15 11:35:53] [INFO ] Deduced a trap composed of 292 places in 382 ms of which 1 ms to minimize.
[2023-03-15 11:35:54] [INFO ] Deduced a trap composed of 309 places in 326 ms of which 0 ms to minimize.
[2023-03-15 11:35:55] [INFO ] Deduced a trap composed of 302 places in 338 ms of which 0 ms to minimize.
[2023-03-15 11:35:55] [INFO ] Deduced a trap composed of 302 places in 338 ms of which 1 ms to minimize.
[2023-03-15 11:35:56] [INFO ] Deduced a trap composed of 294 places in 340 ms of which 1 ms to minimize.
[2023-03-15 11:35:56] [INFO ] Deduced a trap composed of 302 places in 344 ms of which 1 ms to minimize.
[2023-03-15 11:35:57] [INFO ] Deduced a trap composed of 290 places in 338 ms of which 1 ms to minimize.
[2023-03-15 11:35:57] [INFO ] Deduced a trap composed of 306 places in 345 ms of which 1 ms to minimize.
[2023-03-15 11:35:57] [INFO ] Deduced a trap composed of 309 places in 375 ms of which 1 ms to minimize.
[2023-03-15 11:35:58] [INFO ] Deduced a trap composed of 294 places in 344 ms of which 1 ms to minimize.
[2023-03-15 11:35:58] [INFO ] Deduced a trap composed of 298 places in 352 ms of which 0 ms to minimize.
[2023-03-15 11:35:59] [INFO ] Deduced a trap composed of 296 places in 336 ms of which 0 ms to minimize.
[2023-03-15 11:35:59] [INFO ] Deduced a trap composed of 308 places in 360 ms of which 1 ms to minimize.
[2023-03-15 11:36:00] [INFO ] Deduced a trap composed of 288 places in 343 ms of which 0 ms to minimize.
[2023-03-15 11:36:00] [INFO ] Deduced a trap composed of 288 places in 361 ms of which 1 ms to minimize.
[2023-03-15 11:36:01] [INFO ] Deduced a trap composed of 312 places in 355 ms of which 1 ms to minimize.
[2023-03-15 11:36:01] [INFO ] Deduced a trap composed of 304 places in 365 ms of which 1 ms to minimize.
[2023-03-15 11:36:02] [INFO ] Deduced a trap composed of 306 places in 340 ms of which 1 ms to minimize.
[2023-03-15 11:36:03] [INFO ] Deduced a trap composed of 294 places in 341 ms of which 1 ms to minimize.
[2023-03-15 11:36:04] [INFO ] Deduced a trap composed of 307 places in 345 ms of which 0 ms to minimize.
[2023-03-15 11:36:04] [INFO ] Deduced a trap composed of 300 places in 339 ms of which 1 ms to minimize.
[2023-03-15 11:36:05] [INFO ] Deduced a trap composed of 307 places in 353 ms of which 1 ms to minimize.
[2023-03-15 11:36:06] [INFO ] Deduced a trap composed of 305 places in 335 ms of which 1 ms to minimize.
[2023-03-15 11:36:06] [INFO ] Deduced a trap composed of 295 places in 334 ms of which 1 ms to minimize.
[2023-03-15 11:36:07] [INFO ] Deduced a trap composed of 296 places in 319 ms of which 0 ms to minimize.
[2023-03-15 11:36:07] [INFO ] Deduced a trap composed of 308 places in 322 ms of which 1 ms to minimize.
[2023-03-15 11:36:07] [INFO ] Deduced a trap composed of 304 places in 361 ms of which 1 ms to minimize.
[2023-03-15 11:36:08] [INFO ] Deduced a trap composed of 308 places in 473 ms of which 0 ms to minimize.
[2023-03-15 11:36:09] [INFO ] Deduced a trap composed of 296 places in 408 ms of which 1 ms to minimize.
[2023-03-15 11:36:09] [INFO ] Deduced a trap composed of 284 places in 345 ms of which 0 ms to minimize.
[2023-03-15 11:36:10] [INFO ] Deduced a trap composed of 305 places in 361 ms of which 1 ms to minimize.
[2023-03-15 11:36:11] [INFO ] Deduced a trap composed of 305 places in 345 ms of which 1 ms to minimize.
[2023-03-15 11:36:12] [INFO ] Deduced a trap composed of 304 places in 315 ms of which 0 ms to minimize.
[2023-03-15 11:36:13] [INFO ] Deduced a trap composed of 296 places in 357 ms of which 1 ms to minimize.
[2023-03-15 11:36:15] [INFO ] Deduced a trap composed of 308 places in 330 ms of which 1 ms to minimize.
[2023-03-15 11:36:18] [INFO ] Trap strengthening (SAT) tested/added 72/72 trap constraints in 42553 ms
Current structural bounds on expressions (after SMT) : [181] Max seen :[3]
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 751/751 places, 1522/1522 transitions.
Applied a total of 0 rules in 41 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 751/751 places, 1522/1522 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 751/751 places, 1522/1522 transitions.
Applied a total of 0 rules in 42 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2023-03-15 11:36:18] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-15 11:36:18] [INFO ] Computed 102 place invariants in 19 ms
[2023-03-15 11:36:19] [INFO ] Implicit Places using invariants in 1150 ms returned []
[2023-03-15 11:36:19] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-15 11:36:19] [INFO ] Computed 102 place invariants in 30 ms
[2023-03-15 11:36:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:36:32] [INFO ] Implicit Places using invariants and state equation in 13466 ms returned []
Implicit Place search using SMT with State Equation took 14619 ms to find 0 implicit places.
[2023-03-15 11:36:33] [INFO ] Redundant transitions in 90 ms returned []
[2023-03-15 11:36:33] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-15 11:36:33] [INFO ] Computed 102 place invariants in 23 ms
[2023-03-15 11:36:34] [INFO ] Dead Transitions using invariants and state equation in 943 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 751/751 places, 1522/1522 transitions.
Starting property specific reduction for PolyORBNT-PT-S10J40-UpperBounds-13
Normalized transition count is 1513 out of 1522 initially.
// Phase 1: matrix 1513 rows 751 cols
[2023-03-15 11:36:34] [INFO ] Computed 102 place invariants in 21 ms
Incomplete random walk after 10000 steps, including 696 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :3
[2023-03-15 11:36:34] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-15 11:36:34] [INFO ] Computed 102 place invariants in 33 ms
[2023-03-15 11:36:34] [INFO ] [Real]Absence check using 81 positive place invariants in 18 ms returned sat
[2023-03-15 11:36:34] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 26 ms returned sat
[2023-03-15 11:36:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:36:34] [INFO ] [Real]Absence check using state equation in 640 ms returned sat
[2023-03-15 11:36:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:36:35] [INFO ] [Nat]Absence check using 81 positive place invariants in 17 ms returned sat
[2023-03-15 11:36:35] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 20 ms returned sat
[2023-03-15 11:36:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:36:35] [INFO ] [Nat]Absence check using state equation in 479 ms returned sat
[2023-03-15 11:36:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:36:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 450 ms returned sat
[2023-03-15 11:36:36] [INFO ] Deduced a trap composed of 288 places in 337 ms of which 1 ms to minimize.
[2023-03-15 11:36:36] [INFO ] Deduced a trap composed of 302 places in 332 ms of which 0 ms to minimize.
[2023-03-15 11:36:37] [INFO ] Deduced a trap composed of 286 places in 334 ms of which 1 ms to minimize.
[2023-03-15 11:36:37] [INFO ] Deduced a trap composed of 300 places in 334 ms of which 1 ms to minimize.
[2023-03-15 11:36:38] [INFO ] Deduced a trap composed of 305 places in 382 ms of which 1 ms to minimize.
[2023-03-15 11:36:38] [INFO ] Deduced a trap composed of 302 places in 338 ms of which 1 ms to minimize.
[2023-03-15 11:36:38] [INFO ] Deduced a trap composed of 307 places in 332 ms of which 1 ms to minimize.
[2023-03-15 11:36:39] [INFO ] Deduced a trap composed of 288 places in 326 ms of which 0 ms to minimize.
[2023-03-15 11:36:39] [INFO ] Deduced a trap composed of 294 places in 380 ms of which 0 ms to minimize.
[2023-03-15 11:36:40] [INFO ] Deduced a trap composed of 303 places in 349 ms of which 1 ms to minimize.
[2023-03-15 11:36:40] [INFO ] Trap strengthening (SAT) tested/added 10/10 trap constraints in 3976 ms
Current structural bounds on expressions (after SMT) : [181] Max seen :[3]
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 751/751 places, 1522/1522 transitions.
Applied a total of 0 rules in 42 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2023-03-15 11:36:40] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-15 11:36:40] [INFO ] Computed 102 place invariants in 19 ms
[2023-03-15 11:36:41] [INFO ] Dead Transitions using invariants and state equation in 1024 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 751/751 places, 1522/1522 transitions.
Normalized transition count is 1513 out of 1522 initially.
// Phase 1: matrix 1513 rows 751 cols
[2023-03-15 11:36:41] [INFO ] Computed 102 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 70082 resets, run finished after 8865 ms. (steps per millisecond=112 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 8202 resets, run finished after 1806 ms. (steps per millisecond=553 ) properties (out of 1) seen :3
[2023-03-15 11:36:51] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-15 11:36:51] [INFO ] Computed 102 place invariants in 27 ms
[2023-03-15 11:36:51] [INFO ] [Real]Absence check using 81 positive place invariants in 19 ms returned sat
[2023-03-15 11:36:51] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 20 ms returned sat
[2023-03-15 11:36:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 11:36:52] [INFO ] [Real]Absence check using state equation in 685 ms returned sat
[2023-03-15 11:36:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 11:36:52] [INFO ] [Nat]Absence check using 81 positive place invariants in 19 ms returned sat
[2023-03-15 11:36:52] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 21 ms returned sat
[2023-03-15 11:36:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 11:36:53] [INFO ] [Nat]Absence check using state equation in 503 ms returned sat
[2023-03-15 11:36:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:36:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 466 ms returned sat
[2023-03-15 11:36:54] [INFO ] Deduced a trap composed of 288 places in 332 ms of which 1 ms to minimize.
[2023-03-15 11:36:54] [INFO ] Deduced a trap composed of 302 places in 359 ms of which 1 ms to minimize.
[2023-03-15 11:36:55] [INFO ] Deduced a trap composed of 286 places in 349 ms of which 0 ms to minimize.
[2023-03-15 11:36:55] [INFO ] Deduced a trap composed of 300 places in 342 ms of which 0 ms to minimize.
[2023-03-15 11:36:55] [INFO ] Deduced a trap composed of 305 places in 353 ms of which 1 ms to minimize.
[2023-03-15 11:36:56] [INFO ] Deduced a trap composed of 302 places in 345 ms of which 1 ms to minimize.
[2023-03-15 11:36:56] [INFO ] Deduced a trap composed of 307 places in 351 ms of which 1 ms to minimize.
[2023-03-15 11:36:57] [INFO ] Deduced a trap composed of 288 places in 362 ms of which 1 ms to minimize.
[2023-03-15 11:36:57] [INFO ] Deduced a trap composed of 294 places in 345 ms of which 1 ms to minimize.
[2023-03-15 11:36:57] [INFO ] Deduced a trap composed of 303 places in 383 ms of which 1 ms to minimize.
[2023-03-15 11:36:58] [INFO ] Deduced a trap composed of 318 places in 370 ms of which 0 ms to minimize.
[2023-03-15 11:36:58] [INFO ] Deduced a trap composed of 290 places in 341 ms of which 1 ms to minimize.
[2023-03-15 11:36:59] [INFO ] Deduced a trap composed of 299 places in 340 ms of which 1 ms to minimize.
[2023-03-15 11:36:59] [INFO ] Deduced a trap composed of 290 places in 362 ms of which 1 ms to minimize.
[2023-03-15 11:37:00] [INFO ] Deduced a trap composed of 304 places in 367 ms of which 1 ms to minimize.
[2023-03-15 11:37:00] [INFO ] Deduced a trap composed of 300 places in 344 ms of which 0 ms to minimize.
[2023-03-15 11:37:01] [INFO ] Deduced a trap composed of 306 places in 348 ms of which 0 ms to minimize.
[2023-03-15 11:37:01] [INFO ] Deduced a trap composed of 296 places in 360 ms of which 0 ms to minimize.
[2023-03-15 11:37:01] [INFO ] Deduced a trap composed of 305 places in 354 ms of which 1 ms to minimize.
[2023-03-15 11:37:02] [INFO ] Deduced a trap composed of 303 places in 349 ms of which 1 ms to minimize.
[2023-03-15 11:37:02] [INFO ] Deduced a trap composed of 312 places in 349 ms of which 0 ms to minimize.
[2023-03-15 11:37:03] [INFO ] Deduced a trap composed of 323 places in 349 ms of which 0 ms to minimize.
[2023-03-15 11:37:03] [INFO ] Deduced a trap composed of 308 places in 336 ms of which 0 ms to minimize.
[2023-03-15 11:37:04] [INFO ] Deduced a trap composed of 304 places in 356 ms of which 0 ms to minimize.
[2023-03-15 11:37:05] [INFO ] Deduced a trap composed of 321 places in 332 ms of which 0 ms to minimize.
[2023-03-15 11:37:06] [INFO ] Deduced a trap composed of 292 places in 347 ms of which 1 ms to minimize.
[2023-03-15 11:37:06] [INFO ] Deduced a trap composed of 299 places in 334 ms of which 0 ms to minimize.
[2023-03-15 11:37:07] [INFO ] Deduced a trap composed of 302 places in 355 ms of which 1 ms to minimize.
[2023-03-15 11:37:07] [INFO ] Deduced a trap composed of 300 places in 353 ms of which 0 ms to minimize.
[2023-03-15 11:37:07] [INFO ] Deduced a trap composed of 299 places in 437 ms of which 1 ms to minimize.
[2023-03-15 11:37:08] [INFO ] Deduced a trap composed of 298 places in 345 ms of which 0 ms to minimize.
[2023-03-15 11:37:08] [INFO ] Deduced a trap composed of 303 places in 325 ms of which 1 ms to minimize.
[2023-03-15 11:37:09] [INFO ] Deduced a trap composed of 311 places in 338 ms of which 1 ms to minimize.
[2023-03-15 11:37:09] [INFO ] Deduced a trap composed of 294 places in 338 ms of which 1 ms to minimize.
[2023-03-15 11:37:10] [INFO ] Deduced a trap composed of 306 places in 333 ms of which 0 ms to minimize.
[2023-03-15 11:37:10] [INFO ] Deduced a trap composed of 304 places in 342 ms of which 1 ms to minimize.
[2023-03-15 11:37:11] [INFO ] Deduced a trap composed of 314 places in 331 ms of which 1 ms to minimize.
[2023-03-15 11:37:11] [INFO ] Deduced a trap composed of 292 places in 344 ms of which 0 ms to minimize.
[2023-03-15 11:37:12] [INFO ] Deduced a trap composed of 309 places in 319 ms of which 0 ms to minimize.
[2023-03-15 11:37:12] [INFO ] Deduced a trap composed of 302 places in 316 ms of which 1 ms to minimize.
[2023-03-15 11:37:13] [INFO ] Deduced a trap composed of 302 places in 364 ms of which 1 ms to minimize.
[2023-03-15 11:37:13] [INFO ] Deduced a trap composed of 294 places in 354 ms of which 1 ms to minimize.
[2023-03-15 11:37:14] [INFO ] Deduced a trap composed of 302 places in 335 ms of which 0 ms to minimize.
[2023-03-15 11:37:14] [INFO ] Deduced a trap composed of 290 places in 352 ms of which 1 ms to minimize.
[2023-03-15 11:37:15] [INFO ] Deduced a trap composed of 306 places in 518 ms of which 1 ms to minimize.
[2023-03-15 11:37:15] [INFO ] Deduced a trap composed of 309 places in 354 ms of which 0 ms to minimize.
[2023-03-15 11:37:16] [INFO ] Deduced a trap composed of 294 places in 364 ms of which 1 ms to minimize.
[2023-03-15 11:37:16] [INFO ] Deduced a trap composed of 298 places in 340 ms of which 1 ms to minimize.
[2023-03-15 11:37:17] [INFO ] Deduced a trap composed of 296 places in 333 ms of which 0 ms to minimize.
[2023-03-15 11:37:17] [INFO ] Deduced a trap composed of 308 places in 344 ms of which 0 ms to minimize.
[2023-03-15 11:37:18] [INFO ] Deduced a trap composed of 288 places in 342 ms of which 0 ms to minimize.
[2023-03-15 11:37:18] [INFO ] Deduced a trap composed of 288 places in 326 ms of which 0 ms to minimize.
[2023-03-15 11:37:18] [INFO ] Deduced a trap composed of 312 places in 336 ms of which 1 ms to minimize.
[2023-03-15 11:37:19] [INFO ] Deduced a trap composed of 304 places in 355 ms of which 1 ms to minimize.
[2023-03-15 11:37:20] [INFO ] Deduced a trap composed of 306 places in 337 ms of which 1 ms to minimize.
[2023-03-15 11:37:21] [INFO ] Deduced a trap composed of 294 places in 310 ms of which 0 ms to minimize.
[2023-03-15 11:37:21] [INFO ] Deduced a trap composed of 307 places in 342 ms of which 0 ms to minimize.
[2023-03-15 11:37:22] [INFO ] Deduced a trap composed of 300 places in 341 ms of which 0 ms to minimize.
[2023-03-15 11:37:23] [INFO ] Deduced a trap composed of 307 places in 351 ms of which 1 ms to minimize.
[2023-03-15 11:37:23] [INFO ] Deduced a trap composed of 305 places in 341 ms of which 0 ms to minimize.
[2023-03-15 11:37:24] [INFO ] Deduced a trap composed of 295 places in 342 ms of which 1 ms to minimize.
[2023-03-15 11:37:24] [INFO ] Deduced a trap composed of 296 places in 345 ms of which 0 ms to minimize.
[2023-03-15 11:37:25] [INFO ] Deduced a trap composed of 308 places in 341 ms of which 1 ms to minimize.
[2023-03-15 11:37:25] [INFO ] Deduced a trap composed of 304 places in 339 ms of which 0 ms to minimize.
[2023-03-15 11:37:26] [INFO ] Deduced a trap composed of 308 places in 348 ms of which 0 ms to minimize.
[2023-03-15 11:37:26] [INFO ] Deduced a trap composed of 296 places in 353 ms of which 0 ms to minimize.
[2023-03-15 11:37:27] [INFO ] Deduced a trap composed of 284 places in 422 ms of which 1 ms to minimize.
[2023-03-15 11:37:27] [INFO ] Deduced a trap composed of 305 places in 369 ms of which 1 ms to minimize.
[2023-03-15 11:37:29] [INFO ] Deduced a trap composed of 305 places in 343 ms of which 1 ms to minimize.
[2023-03-15 11:37:29] [INFO ] Deduced a trap composed of 304 places in 353 ms of which 1 ms to minimize.
[2023-03-15 11:37:30] [INFO ] Deduced a trap composed of 296 places in 356 ms of which 0 ms to minimize.
[2023-03-15 11:37:32] [INFO ] Deduced a trap composed of 308 places in 345 ms of which 1 ms to minimize.
[2023-03-15 11:37:35] [INFO ] Trap strengthening (SAT) tested/added 72/72 trap constraints in 41746 ms
Current structural bounds on expressions (after SMT) : [181] Max seen :[3]
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 751/751 places, 1522/1522 transitions.
Applied a total of 0 rules in 37 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 751/751 places, 1522/1522 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 751/751 places, 1522/1522 transitions.
Applied a total of 0 rules in 37 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2023-03-15 11:37:35] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-15 11:37:35] [INFO ] Computed 102 place invariants in 29 ms
[2023-03-15 11:37:36] [INFO ] Implicit Places using invariants in 1054 ms returned []
[2023-03-15 11:37:36] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-15 11:37:36] [INFO ] Computed 102 place invariants in 35 ms
[2023-03-15 11:37:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:37:48] [INFO ] Implicit Places using invariants and state equation in 11288 ms returned []
Implicit Place search using SMT with State Equation took 12344 ms to find 0 implicit places.
[2023-03-15 11:37:48] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-15 11:37:48] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-15 11:37:48] [INFO ] Computed 102 place invariants in 27 ms
[2023-03-15 11:37:49] [INFO ] Dead Transitions using invariants and state equation in 987 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 751/751 places, 1522/1522 transitions.
Ending property specific reduction for PolyORBNT-PT-S10J40-UpperBounds-13 in 75043 ms.
[2023-03-15 11:37:49] [INFO ] Flatten gal took : 240 ms
[2023-03-15 11:37:49] [INFO ] Applying decomposition
[2023-03-15 11:37:49] [INFO ] Flatten gal took : 163 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/graph16459000737578865767.txt' '-o' '/tmp/graph16459000737578865767.bin' '-w' '/tmp/graph16459000737578865767.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16459000737578865767.bin' '-l' '-1' '-v' '-w' '/tmp/graph16459000737578865767.weights' '-q' '0' '-e' '0.001'
[2023-03-15 11:37:50] [INFO ] Decomposing Gal with order
[2023-03-15 11:37:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 11:37:51] [INFO ] Removed a total of 3396 redundant transitions.
[2023-03-15 11:37:51] [INFO ] Flatten gal took : 868 ms
[2023-03-15 11:37:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 404 labels/synchronizations in 70 ms.
[2023-03-15 11:37:51] [INFO ] Time to serialize gal into /tmp/UpperBounds15750633707709140626.gal : 27 ms
[2023-03-15 11:37:51] [INFO ] Time to serialize properties into /tmp/UpperBounds9997555562999828730.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/UpperBounds15750633707709140626.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9997555562999828730.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...275
Loading property file /tmp/UpperBounds9997555562999828730.prop.
Detected timeout of ITS tools.
[2023-03-15 11:59:06] [INFO ] Flatten gal took : 77 ms
[2023-03-15 11:59:06] [INFO ] Time to serialize gal into /tmp/UpperBounds7719072062124114288.gal : 11 ms
[2023-03-15 11:59:06] [INFO ] Time to serialize properties into /tmp/UpperBounds8427219155868123463.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/UpperBounds7719072062124114288.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8427219155868123463.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/UpperBounds8427219155868123463.prop.
Detected timeout of ITS tools.
[2023-03-15 12:20:41] [INFO ] Flatten gal took : 648 ms
[2023-03-15 12:20:48] [INFO ] Input system was already deterministic with 1522 transitions.
[2023-03-15 12:20:48] [INFO ] Transformed 751 places.
[2023-03-15 12:20:48] [INFO ] Transformed 1522 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
[2023-03-15 12:21:18] [INFO ] Time to serialize gal into /tmp/UpperBounds6187572969247426986.gal : 26 ms
[2023-03-15 12:21:18] [INFO ] Time to serialize properties into /tmp/UpperBounds3886959454840040919.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/UpperBounds6187572969247426986.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3886959454840040919.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/UpperBounds3886959454840040919.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-S10J40"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
echo " Input is PolyORBNT-PT-S10J40, 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 r319-tall-167873970000097"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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