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-165277017100709.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 PolyORBLF-PT-S06J06T04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017100709
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.3M
-rw-r--r-- 1 mcc users 13K Apr 29 14:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 29 14:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Apr 29 14:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 133K Apr 29 14:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.6K May 9 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K 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 53K May 9 08:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.4K 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 10 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 6.9M 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 PolyORBLF-PT-S06J06T04-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652923075052

Running Version 202205111006
[2022-05-19 01:17:56] [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 01:17:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 01:17:56] [INFO ] Load time of PNML (sax parser for PT used): 426 ms
[2022-05-19 01:17:56] [INFO ] Transformed 506 places.
[2022-05-19 01:17:56] [INFO ] Transformed 7154 transitions.
[2022-05-19 01:17:56] [INFO ] Parsed PT model containing 506 places and 7154 transitions in 610 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Normalized transition count is 1750 out of 1774 initially.
// Phase 1: matrix 1750 rows 506 cols
[2022-05-19 01:17:57] [INFO ] Computed 54 place invariants in 111 ms
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-04 7 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 42 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 13) seen :19
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-14 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :13
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :12
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :11
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :10
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :11
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :11
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :11
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :11
[2022-05-19 01:17:57] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
// Phase 1: matrix 1750 rows 506 cols
[2022-05-19 01:17:57] [INFO ] Computed 54 place invariants in 56 ms
[2022-05-19 01:17:57] [INFO ] [Real]Absence check using 23 positive place invariants in 12 ms returned sat
[2022-05-19 01:17:57] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 26 ms returned unsat
[2022-05-19 01:17:57] [INFO ] [Real]Absence check using 23 positive place invariants in 12 ms returned sat
[2022-05-19 01:17:57] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 15 ms returned sat
[2022-05-19 01:17:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 01:17:59] [INFO ] [Real]Absence check using state equation in 1410 ms returned sat
[2022-05-19 01:17:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 01:17:59] [INFO ] [Nat]Absence check using 23 positive place invariants in 13 ms returned sat
[2022-05-19 01:17:59] [INFO ] [Nat]Absence check using 23 positive and 31 generalized place invariants in 15 ms returned unsat
[2022-05-19 01:17:59] [INFO ] [Real]Absence check using 23 positive place invariants in 9 ms returned sat
[2022-05-19 01:17:59] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 14 ms returned unsat
[2022-05-19 01:17:59] [INFO ] [Real]Absence check using 23 positive place invariants in 8 ms returned sat
[2022-05-19 01:17:59] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 10 ms returned unsat
[2022-05-19 01:17:59] [INFO ] [Real]Absence check using 23 positive place invariants in 5 ms returned unsat
[2022-05-19 01:17:59] [INFO ] [Real]Absence check using 23 positive place invariants in 9 ms returned sat
[2022-05-19 01:17:59] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 21 ms returned sat
[2022-05-19 01:17:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 01:18:00] [INFO ] [Real]Absence check using state equation in 1225 ms returned sat
[2022-05-19 01:18:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 01:18:01] [INFO ] [Nat]Absence check using 23 positive place invariants in 8 ms returned sat
[2022-05-19 01:18:01] [INFO ] [Nat]Absence check using 23 positive and 31 generalized place invariants in 14 ms returned sat
[2022-05-19 01:18:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 01:18:06] [INFO ] [Nat]Absence check using state equation in 4932 ms returned unknown
[2022-05-19 01:18:06] [INFO ] [Real]Absence check using 23 positive place invariants in 8 ms returned sat
[2022-05-19 01:18:06] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 14 ms returned unsat
[2022-05-19 01:18:06] [INFO ] [Real]Absence check using 23 positive place invariants in 8 ms returned sat
[2022-05-19 01:18:06] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 16 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 2, 1, 1, 1, 46, 4, 1] Max seen :[4, 2, 1, 1, 1, 1, 4, 1]
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 506 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 506/506 places, 1774/1774 transitions.
Ensure Unique test removed 6 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 500 transition count 1739
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 76 place count 465 transition count 1739
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 76 place count 465 transition count 1683
Deduced a syphon composed of 56 places in 3 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 188 place count 409 transition count 1683
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 282 place count 362 transition count 1636
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 290 place count 362 transition count 1628
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 298 place count 354 transition count 1628
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 299 place count 354 transition count 1628
Applied a total of 299 rules in 333 ms. Remains 354 /506 variables (removed 152) and now considering 1628/1774 (removed 146) transitions.
[2022-05-19 01:18:06] [INFO ] Flow matrix only has 1604 transitions (discarded 24 similar events)
// Phase 1: matrix 1604 rows 354 cols
[2022-05-19 01:18:06] [INFO ] Computed 48 place invariants in 38 ms
[2022-05-19 01:18:07] [INFO ] Dead Transitions using invariants and state equation in 805 ms found 612 transitions.
Found 612 dead transitions using SMT.
Drop transitions removed 612 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 612 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 354/506 places, 1016/1774 transitions.
Applied a total of 0 rules in 34 ms. Remains 354 /354 variables (removed 0) and now considering 1016/1016 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 354/506 places, 1016/1774 transitions.
Normalized transition count is 992 out of 1016 initially.
// Phase 1: matrix 992 rows 354 cols
[2022-05-19 01:18:07] [INFO ] Computed 48 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 9049 resets, run finished after 4771 ms. (steps per millisecond=209 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 1995 resets, run finished after 1502 ms. (steps per millisecond=665 ) properties (out of 1) seen :1
[2022-05-19 01:18:13] [INFO ] Flow matrix only has 992 transitions (discarded 24 similar events)
// Phase 1: matrix 992 rows 354 cols
[2022-05-19 01:18:13] [INFO ] Computed 48 place invariants in 23 ms
[2022-05-19 01:18:13] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2022-05-19 01:18:13] [INFO ] [Real]Absence check using 20 positive and 28 generalized place invariants in 12 ms returned sat
[2022-05-19 01:18:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 01:18:14] [INFO ] [Real]Absence check using state equation in 887 ms returned sat
[2022-05-19 01:18:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 01:18:14] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2022-05-19 01:18:14] [INFO ] [Nat]Absence check using 20 positive and 28 generalized place invariants in 10 ms returned sat
[2022-05-19 01:18:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 01:18:16] [INFO ] [Nat]Absence check using state equation in 2154 ms returned sat
[2022-05-19 01:18:16] [INFO ] State equation strengthened by 112 read => feed constraints.
[2022-05-19 01:18:17] [INFO ] [Nat]Added 112 Read/Feed constraints in 677 ms returned sat
[2022-05-19 01:18:17] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 2 ms to minimize.
[2022-05-19 01:18:18] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 1 ms to minimize.
[2022-05-19 01:18:18] [INFO ] Deduced a trap composed of 165 places in 236 ms of which 1 ms to minimize.
[2022-05-19 01:18:18] [INFO ] Deduced a trap composed of 165 places in 219 ms of which 1 ms to minimize.
[2022-05-19 01:18:19] [INFO ] Deduced a trap composed of 165 places in 224 ms of which 1 ms to minimize.
[2022-05-19 01:18:19] [INFO ] Deduced a trap composed of 184 places in 215 ms of which 1 ms to minimize.
[2022-05-19 01:18:19] [INFO ] Deduced a trap composed of 11 places in 218 ms of which 1 ms to minimize.
[2022-05-19 01:18:19] [INFO ] Deduced a trap composed of 158 places in 223 ms of which 1 ms to minimize.
[2022-05-19 01:18:20] [INFO ] Deduced a trap composed of 179 places in 216 ms of which 1 ms to minimize.
[2022-05-19 01:18:20] [INFO ] Deduced a trap composed of 160 places in 210 ms of which 0 ms to minimize.
[2022-05-19 01:18:20] [INFO ] Deduced a trap composed of 167 places in 215 ms of which 0 ms to minimize.
[2022-05-19 01:18:20] [INFO ] Deduced a trap composed of 158 places in 213 ms of which 1 ms to minimize.
[2022-05-19 01:18:21] [INFO ] Deduced a trap composed of 171 places in 205 ms of which 1 ms to minimize.
[2022-05-19 01:18:21] [INFO ] Deduced a trap composed of 163 places in 213 ms of which 1 ms to minimize.
[2022-05-19 01:18:21] [INFO ] Deduced a trap composed of 170 places in 206 ms of which 1 ms to minimize.
[2022-05-19 01:18:22] [INFO ] Deduced a trap composed of 178 places in 222 ms of which 1 ms to minimize.
[2022-05-19 01:18:22] [INFO ] Deduced a trap composed of 160 places in 210 ms of which 1 ms to minimize.
[2022-05-19 01:18:23] [INFO ] Deduced a trap composed of 178 places in 208 ms of which 0 ms to minimize.
[2022-05-19 01:18:23] [INFO ] Deduced a trap composed of 170 places in 213 ms of which 0 ms to minimize.
[2022-05-19 01:18:24] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 6486 ms
[2022-05-19 01:18:24] [INFO ] Computed and/alt/rep : 580/2816/575 causal constraints (skipped 411 transitions) in 94 ms.
[2022-05-19 01:18:26] [INFO ] Deduced a trap composed of 162 places in 215 ms of which 0 ms to minimize.
[2022-05-19 01:18:27] [INFO ] Deduced a trap composed of 180 places in 216 ms of which 0 ms to minimize.
[2022-05-19 01:18:27] [INFO ] Deduced a trap composed of 177 places in 223 ms of which 1 ms to minimize.
[2022-05-19 01:18:27] [INFO ] Deduced a trap composed of 175 places in 209 ms of which 1 ms to minimize.
[2022-05-19 01:18:27] [INFO ] Deduced a trap composed of 191 places in 204 ms of which 1 ms to minimize.
[2022-05-19 01:18:28] [INFO ] Deduced a trap composed of 193 places in 220 ms of which 0 ms to minimize.
[2022-05-19 01:18:28] [INFO ] Deduced a trap composed of 179 places in 221 ms of which 1 ms to minimize.
[2022-05-19 01:18:28] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2205 ms
[2022-05-19 01:18:28] [INFO ] Added : 104 causal constraints over 21 iterations in 4626 ms. Result :sat
Minimization took 3002 ms.
Current structural bounds on expressions (after SMT) : [46] Max seen :[1]
Support contains 1 out of 354 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 354/354 places, 1016/1016 transitions.
Applied a total of 0 rules in 25 ms. Remains 354 /354 variables (removed 0) and now considering 1016/1016 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 354/354 places, 1016/1016 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 354/354 places, 1016/1016 transitions.
Applied a total of 0 rules in 19 ms. Remains 354 /354 variables (removed 0) and now considering 1016/1016 (removed 0) transitions.
[2022-05-19 01:18:31] [INFO ] Flow matrix only has 992 transitions (discarded 24 similar events)
// Phase 1: matrix 992 rows 354 cols
[2022-05-19 01:18:31] [INFO ] Computed 48 place invariants in 16 ms
[2022-05-19 01:18:32] [INFO ] Implicit Places using invariants in 409 ms returned [17, 71, 146, 293]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 417 ms to find 4 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 350/354 places, 1016/1016 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 346 transition count 1012
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 346 transition count 1012
Applied a total of 8 rules in 52 ms. Remains 346 /350 variables (removed 4) and now considering 1012/1016 (removed 4) transitions.
[2022-05-19 01:18:32] [INFO ] Flow matrix only has 988 transitions (discarded 24 similar events)
// Phase 1: matrix 988 rows 346 cols
[2022-05-19 01:18:32] [INFO ] Computed 44 place invariants in 17 ms
[2022-05-19 01:18:32] [INFO ] Implicit Places using invariants in 386 ms returned []
[2022-05-19 01:18:32] [INFO ] Flow matrix only has 988 transitions (discarded 24 similar events)
// Phase 1: matrix 988 rows 346 cols
[2022-05-19 01:18:32] [INFO ] Computed 44 place invariants in 16 ms
[2022-05-19 01:18:33] [INFO ] State equation strengthened by 112 read => feed constraints.
[2022-05-19 01:18:44] [INFO ] Implicit Places using invariants and state equation in 12174 ms returned []
Implicit Place search using SMT with State Equation took 12563 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 346/354 places, 1012/1016 transitions.
Finished structural reductions, in 2 iterations. Remains : 346/354 places, 1012/1016 transitions.
Normalized transition count is 988 out of 1012 initially.
// Phase 1: matrix 988 rows 346 cols
[2022-05-19 01:18:44] [INFO ] Computed 44 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 9014 resets, run finished after 4558 ms. (steps per millisecond=219 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2061 resets, run finished after 1468 ms. (steps per millisecond=681 ) properties (out of 1) seen :1
[2022-05-19 01:18:50] [INFO ] Flow matrix only has 988 transitions (discarded 24 similar events)
// Phase 1: matrix 988 rows 346 cols
[2022-05-19 01:18:50] [INFO ] Computed 44 place invariants in 21 ms
[2022-05-19 01:18:50] [INFO ] [Real]Absence check using 22 positive place invariants in 7 ms returned sat
[2022-05-19 01:18:51] [INFO ] [Real]Absence check using 22 positive and 22 generalized place invariants in 12 ms returned sat
[2022-05-19 01:18:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 01:18:51] [INFO ] [Real]Absence check using state equation in 835 ms returned sat
[2022-05-19 01:18:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 01:18:51] [INFO ] [Nat]Absence check using 22 positive place invariants in 7 ms returned sat
[2022-05-19 01:18:51] [INFO ] [Nat]Absence check using 22 positive and 22 generalized place invariants in 22 ms returned sat
[2022-05-19 01:18:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 01:18:53] [INFO ] [Nat]Absence check using state equation in 1736 ms returned sat
[2022-05-19 01:18:53] [INFO ] State equation strengthened by 112 read => feed constraints.
[2022-05-19 01:18:54] [INFO ] [Nat]Added 112 Read/Feed constraints in 816 ms returned sat
[2022-05-19 01:18:54] [INFO ] Deduced a trap composed of 56 places in 183 ms of which 0 ms to minimize.
[2022-05-19 01:18:55] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 1 ms to minimize.
[2022-05-19 01:18:55] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 1 ms to minimize.
[2022-05-19 01:18:55] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 1 ms to minimize.
[2022-05-19 01:18:55] [INFO ] Deduced a trap composed of 181 places in 189 ms of which 0 ms to minimize.
[2022-05-19 01:18:56] [INFO ] Deduced a trap composed of 156 places in 191 ms of which 1 ms to minimize.
[2022-05-19 01:18:56] [INFO ] Deduced a trap composed of 165 places in 184 ms of which 0 ms to minimize.
[2022-05-19 01:18:56] [INFO ] Deduced a trap composed of 172 places in 189 ms of which 1 ms to minimize.
[2022-05-19 01:18:56] [INFO ] Deduced a trap composed of 176 places in 201 ms of which 3 ms to minimize.
[2022-05-19 01:18:57] [INFO ] Deduced a trap composed of 150 places in 199 ms of which 1 ms to minimize.
[2022-05-19 01:18:57] [INFO ] Deduced a trap composed of 165 places in 194 ms of which 0 ms to minimize.
[2022-05-19 01:18:57] [INFO ] Deduced a trap composed of 176 places in 200 ms of which 0 ms to minimize.
[2022-05-19 01:18:57] [INFO ] Deduced a trap composed of 184 places in 192 ms of which 1 ms to minimize.
[2022-05-19 01:18:58] [INFO ] Deduced a trap composed of 163 places in 191 ms of which 1 ms to minimize.
[2022-05-19 01:18:58] [INFO ] Deduced a trap composed of 153 places in 191 ms of which 0 ms to minimize.
[2022-05-19 01:18:58] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 0 ms to minimize.
[2022-05-19 01:18:59] [INFO ] Deduced a trap composed of 170 places in 204 ms of which 0 ms to minimize.
[2022-05-19 01:18:59] [INFO ] Deduced a trap composed of 163 places in 190 ms of which 0 ms to minimize.
[2022-05-19 01:18:59] [INFO ] Deduced a trap composed of 185 places in 199 ms of which 0 ms to minimize.
[2022-05-19 01:19:00] [INFO ] Deduced a trap composed of 188 places in 229 ms of which 1 ms to minimize.
[2022-05-19 01:19:00] [INFO ] Deduced a trap composed of 194 places in 230 ms of which 0 ms to minimize.
[2022-05-19 01:19:00] [INFO ] Deduced a trap composed of 179 places in 192 ms of which 0 ms to minimize.
[2022-05-19 01:19:01] [INFO ] Deduced a trap composed of 176 places in 197 ms of which 0 ms to minimize.
[2022-05-19 01:19:01] [INFO ] Deduced a trap composed of 183 places in 190 ms of which 1 ms to minimize.
[2022-05-19 01:19:01] [INFO ] Deduced a trap composed of 172 places in 194 ms of which 1 ms to minimize.
[2022-05-19 01:19:01] [INFO ] Deduced a trap composed of 191 places in 186 ms of which 0 ms to minimize.
[2022-05-19 01:19:02] [INFO ] Deduced a trap composed of 181 places in 185 ms of which 0 ms to minimize.
[2022-05-19 01:19:02] [INFO ] Deduced a trap composed of 188 places in 210 ms of which 0 ms to minimize.
[2022-05-19 01:19:02] [INFO ] Deduced a trap composed of 171 places in 189 ms of which 0 ms to minimize.
[2022-05-19 01:19:02] [INFO ] Deduced a trap composed of 191 places in 199 ms of which 1 ms to minimize.
[2022-05-19 01:19:03] [INFO ] Deduced a trap composed of 157 places in 223 ms of which 5 ms to minimize.
[2022-05-19 01:19:03] [INFO ] Deduced a trap composed of 178 places in 195 ms of which 0 ms to minimize.
[2022-05-19 01:19:03] [INFO ] Deduced a trap composed of 165 places in 184 ms of which 0 ms to minimize.
[2022-05-19 01:19:04] [INFO ] Deduced a trap composed of 177 places in 197 ms of which 1 ms to minimize.
[2022-05-19 01:19:04] [INFO ] Deduced a trap composed of 174 places in 210 ms of which 0 ms to minimize.
[2022-05-19 01:19:04] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 9927 ms
[2022-05-19 01:19:04] [INFO ] Computed and/alt/rep : 576/2811/571 causal constraints (skipped 411 transitions) in 64 ms.
[2022-05-19 01:19:06] [INFO ] Added : 81 causal constraints over 17 iterations in 1737 ms. Result :sat
Minimization took 1883 ms.
Current structural bounds on expressions (after SMT) : [46] Max seen :[1]
Support contains 1 out of 346 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 346/346 places, 1012/1012 transitions.
Applied a total of 0 rules in 22 ms. Remains 346 /346 variables (removed 0) and now considering 1012/1012 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 346/346 places, 1012/1012 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 346/346 places, 1012/1012 transitions.
Applied a total of 0 rules in 18 ms. Remains 346 /346 variables (removed 0) and now considering 1012/1012 (removed 0) transitions.
[2022-05-19 01:19:09] [INFO ] Flow matrix only has 988 transitions (discarded 24 similar events)
// Phase 1: matrix 988 rows 346 cols
[2022-05-19 01:19:09] [INFO ] Computed 44 place invariants in 25 ms
[2022-05-19 01:19:09] [INFO ] Implicit Places using invariants in 397 ms returned []
[2022-05-19 01:19:09] [INFO ] Flow matrix only has 988 transitions (discarded 24 similar events)
// Phase 1: matrix 988 rows 346 cols
[2022-05-19 01:19:09] [INFO ] Computed 44 place invariants in 15 ms
[2022-05-19 01:19:09] [INFO ] State equation strengthened by 112 read => feed constraints.
[2022-05-19 01:19:21] [INFO ] Implicit Places using invariants and state equation in 12214 ms returned []
Implicit Place search using SMT with State Equation took 12612 ms to find 0 implicit places.
[2022-05-19 01:19:21] [INFO ] Redundant transitions in 71 ms returned []
[2022-05-19 01:19:21] [INFO ] Flow matrix only has 988 transitions (discarded 24 similar events)
// Phase 1: matrix 988 rows 346 cols
[2022-05-19 01:19:21] [INFO ] Computed 44 place invariants in 18 ms
[2022-05-19 01:19:22] [INFO ] Dead Transitions using invariants and state equation in 536 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 346/346 places, 1012/1012 transitions.
Starting property specific reduction for PolyORBLF-PT-S06J06T04-UpperBounds-08
Normalized transition count is 988 out of 1012 initially.
// Phase 1: matrix 988 rows 346 cols
[2022-05-19 01:19:22] [INFO ] Computed 44 place invariants in 19 ms
Incomplete random walk after 10000 steps, including 102 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :1
[2022-05-19 01:19:22] [INFO ] Flow matrix only has 988 transitions (discarded 24 similar events)
// Phase 1: matrix 988 rows 346 cols
[2022-05-19 01:19:22] [INFO ] Computed 44 place invariants in 23 ms
[2022-05-19 01:19:22] [INFO ] [Real]Absence check using 22 positive place invariants in 5 ms returned sat
[2022-05-19 01:19:22] [INFO ] [Real]Absence check using 22 positive and 22 generalized place invariants in 12 ms returned sat
[2022-05-19 01:19:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 01:19:23] [INFO ] [Real]Absence check using state equation in 851 ms returned sat
[2022-05-19 01:19:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 01:19:23] [INFO ] [Nat]Absence check using 22 positive place invariants in 5 ms returned sat
[2022-05-19 01:19:23] [INFO ] [Nat]Absence check using 22 positive and 22 generalized place invariants in 15 ms returned sat
[2022-05-19 01:19:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 01:19:25] [INFO ] [Nat]Absence check using state equation in 1719 ms returned sat
[2022-05-19 01:19:25] [INFO ] State equation strengthened by 112 read => feed constraints.
[2022-05-19 01:19:25] [INFO ] [Nat]Added 112 Read/Feed constraints in 801 ms returned sat
[2022-05-19 01:19:26] [INFO ] Deduced a trap composed of 56 places in 193 ms of which 1 ms to minimize.
[2022-05-19 01:19:26] [INFO ] Deduced a trap composed of 56 places in 121 ms of which 1 ms to minimize.
[2022-05-19 01:19:26] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 0 ms to minimize.
[2022-05-19 01:19:27] [INFO ] Deduced a trap composed of 162 places in 191 ms of which 1 ms to minimize.
[2022-05-19 01:19:27] [INFO ] Deduced a trap composed of 181 places in 192 ms of which 3 ms to minimize.
[2022-05-19 01:19:27] [INFO ] Deduced a trap composed of 156 places in 195 ms of which 1 ms to minimize.
[2022-05-19 01:19:27] [INFO ] Deduced a trap composed of 165 places in 205 ms of which 7 ms to minimize.
[2022-05-19 01:19:28] [INFO ] Deduced a trap composed of 172 places in 189 ms of which 1 ms to minimize.
[2022-05-19 01:19:28] [INFO ] Deduced a trap composed of 176 places in 190 ms of which 0 ms to minimize.
[2022-05-19 01:19:28] [INFO ] Trap strengthening (SAT) tested/added 9/9 trap constraints in 2406 ms
Current structural bounds on expressions (after SMT) : [144] Max seen :[1]
Support contains 1 out of 346 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 346/346 places, 1012/1012 transitions.
Applied a total of 0 rules in 18 ms. Remains 346 /346 variables (removed 0) and now considering 1012/1012 (removed 0) transitions.
[2022-05-19 01:19:28] [INFO ] Flow matrix only has 988 transitions (discarded 24 similar events)
// Phase 1: matrix 988 rows 346 cols
[2022-05-19 01:19:28] [INFO ] Computed 44 place invariants in 23 ms
[2022-05-19 01:19:29] [INFO ] Dead Transitions using invariants and state equation in 609 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 346/346 places, 1012/1012 transitions.
Normalized transition count is 988 out of 1012 initially.
// Phase 1: matrix 988 rows 346 cols
[2022-05-19 01:19:29] [INFO ] Computed 44 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 9091 resets, run finished after 4545 ms. (steps per millisecond=220 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2003 resets, run finished after 1444 ms. (steps per millisecond=692 ) properties (out of 1) seen :1
[2022-05-19 01:19:35] [INFO ] Flow matrix only has 988 transitions (discarded 24 similar events)
// Phase 1: matrix 988 rows 346 cols
[2022-05-19 01:19:35] [INFO ] Computed 44 place invariants in 25 ms
[2022-05-19 01:19:35] [INFO ] [Real]Absence check using 22 positive place invariants in 5 ms returned sat
[2022-05-19 01:19:35] [INFO ] [Real]Absence check using 22 positive and 22 generalized place invariants in 21 ms returned sat
[2022-05-19 01:19:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 01:19:36] [INFO ] [Real]Absence check using state equation in 827 ms returned sat
[2022-05-19 01:19:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 01:19:36] [INFO ] [Nat]Absence check using 22 positive place invariants in 6 ms returned sat
[2022-05-19 01:19:36] [INFO ] [Nat]Absence check using 22 positive and 22 generalized place invariants in 17 ms returned sat
[2022-05-19 01:19:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 01:19:37] [INFO ] [Nat]Absence check using state equation in 1809 ms returned sat
[2022-05-19 01:19:37] [INFO ] State equation strengthened by 112 read => feed constraints.
[2022-05-19 01:19:38] [INFO ] [Nat]Added 112 Read/Feed constraints in 805 ms returned sat
[2022-05-19 01:19:38] [INFO ] Deduced a trap composed of 56 places in 192 ms of which 0 ms to minimize.
[2022-05-19 01:19:39] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 0 ms to minimize.
[2022-05-19 01:19:39] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 0 ms to minimize.
[2022-05-19 01:19:39] [INFO ] Deduced a trap composed of 162 places in 183 ms of which 1 ms to minimize.
[2022-05-19 01:19:40] [INFO ] Deduced a trap composed of 181 places in 196 ms of which 1 ms to minimize.
[2022-05-19 01:19:40] [INFO ] Deduced a trap composed of 156 places in 201 ms of which 1 ms to minimize.
[2022-05-19 01:19:40] [INFO ] Deduced a trap composed of 165 places in 194 ms of which 1 ms to minimize.
[2022-05-19 01:19:40] [INFO ] Deduced a trap composed of 172 places in 200 ms of which 1 ms to minimize.
[2022-05-19 01:19:41] [INFO ] Deduced a trap composed of 176 places in 201 ms of which 1 ms to minimize.
[2022-05-19 01:19:41] [INFO ] Deduced a trap composed of 150 places in 206 ms of which 0 ms to minimize.
[2022-05-19 01:19:41] [INFO ] Deduced a trap composed of 165 places in 197 ms of which 0 ms to minimize.
[2022-05-19 01:19:41] [INFO ] Deduced a trap composed of 176 places in 190 ms of which 1 ms to minimize.
[2022-05-19 01:19:42] [INFO ] Deduced a trap composed of 184 places in 197 ms of which 1 ms to minimize.
[2022-05-19 01:19:42] [INFO ] Deduced a trap composed of 163 places in 188 ms of which 0 ms to minimize.
[2022-05-19 01:19:42] [INFO ] Deduced a trap composed of 153 places in 183 ms of which 1 ms to minimize.
[2022-05-19 01:19:43] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 1 ms to minimize.
[2022-05-19 01:19:43] [INFO ] Deduced a trap composed of 170 places in 194 ms of which 1 ms to minimize.
[2022-05-19 01:19:43] [INFO ] Deduced a trap composed of 163 places in 185 ms of which 1 ms to minimize.
[2022-05-19 01:19:43] [INFO ] Deduced a trap composed of 185 places in 194 ms of which 0 ms to minimize.
[2022-05-19 01:19:44] [INFO ] Deduced a trap composed of 188 places in 222 ms of which 1 ms to minimize.
[2022-05-19 01:19:44] [INFO ] Deduced a trap composed of 194 places in 195 ms of which 1 ms to minimize.
[2022-05-19 01:19:44] [INFO ] Deduced a trap composed of 179 places in 185 ms of which 1 ms to minimize.
[2022-05-19 01:19:45] [INFO ] Deduced a trap composed of 176 places in 192 ms of which 1 ms to minimize.
[2022-05-19 01:19:45] [INFO ] Deduced a trap composed of 183 places in 214 ms of which 0 ms to minimize.
[2022-05-19 01:19:45] [INFO ] Deduced a trap composed of 172 places in 195 ms of which 1 ms to minimize.
[2022-05-19 01:19:45] [INFO ] Deduced a trap composed of 191 places in 186 ms of which 1 ms to minimize.
[2022-05-19 01:19:46] [INFO ] Deduced a trap composed of 181 places in 198 ms of which 1 ms to minimize.
[2022-05-19 01:19:46] [INFO ] Deduced a trap composed of 188 places in 198 ms of which 0 ms to minimize.
[2022-05-19 01:19:46] [INFO ] Deduced a trap composed of 171 places in 197 ms of which 1 ms to minimize.
[2022-05-19 01:19:46] [INFO ] Deduced a trap composed of 191 places in 197 ms of which 1 ms to minimize.
[2022-05-19 01:19:47] [INFO ] Deduced a trap composed of 157 places in 195 ms of which 0 ms to minimize.
[2022-05-19 01:19:47] [INFO ] Deduced a trap composed of 178 places in 213 ms of which 1 ms to minimize.
[2022-05-19 01:19:47] [INFO ] Deduced a trap composed of 165 places in 197 ms of which 0 ms to minimize.
[2022-05-19 01:19:48] [INFO ] Deduced a trap composed of 177 places in 186 ms of which 0 ms to minimize.
[2022-05-19 01:19:48] [INFO ] Deduced a trap composed of 174 places in 184 ms of which 0 ms to minimize.
[2022-05-19 01:19:48] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 9787 ms
[2022-05-19 01:19:48] [INFO ] Computed and/alt/rep : 576/2811/571 causal constraints (skipped 411 transitions) in 56 ms.
[2022-05-19 01:19:50] [INFO ] Added : 81 causal constraints over 17 iterations in 1666 ms. Result :sat
Minimization took 1809 ms.
Current structural bounds on expressions (after SMT) : [144] Max seen :[1]
Support contains 1 out of 346 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 346/346 places, 1012/1012 transitions.
Applied a total of 0 rules in 17 ms. Remains 346 /346 variables (removed 0) and now considering 1012/1012 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 346/346 places, 1012/1012 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 346/346 places, 1012/1012 transitions.
Applied a total of 0 rules in 28 ms. Remains 346 /346 variables (removed 0) and now considering 1012/1012 (removed 0) transitions.
[2022-05-19 01:19:52] [INFO ] Flow matrix only has 988 transitions (discarded 24 similar events)
// Phase 1: matrix 988 rows 346 cols
[2022-05-19 01:19:53] [INFO ] Computed 44 place invariants in 24 ms
[2022-05-19 01:19:53] [INFO ] Implicit Places using invariants in 386 ms returned []
[2022-05-19 01:19:53] [INFO ] Flow matrix only has 988 transitions (discarded 24 similar events)
// Phase 1: matrix 988 rows 346 cols
[2022-05-19 01:19:53] [INFO ] Computed 44 place invariants in 21 ms
[2022-05-19 01:19:53] [INFO ] State equation strengthened by 112 read => feed constraints.
[2022-05-19 01:20:03] [INFO ] Implicit Places using invariants and state equation in 10407 ms returned []
Implicit Place search using SMT with State Equation took 10801 ms to find 0 implicit places.
[2022-05-19 01:20:03] [INFO ] Redundant transitions in 45 ms returned []
[2022-05-19 01:20:03] [INFO ] Flow matrix only has 988 transitions (discarded 24 similar events)
// Phase 1: matrix 988 rows 346 cols
[2022-05-19 01:20:03] [INFO ] Computed 44 place invariants in 24 ms
[2022-05-19 01:20:04] [INFO ] Dead Transitions using invariants and state equation in 1075 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 346/346 places, 1012/1012 transitions.
Ending property specific reduction for PolyORBLF-PT-S06J06T04-UpperBounds-08 in 42634 ms.
[2022-05-19 01:20:05] [INFO ] Flatten gal took : 171 ms
[2022-05-19 01:20:05] [INFO ] Applying decomposition
[2022-05-19 01:20:05] [INFO ] Flatten gal took : 81 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/graph11743333765011535680.txt' '-o' '/tmp/graph11743333765011535680.bin' '-w' '/tmp/graph11743333765011535680.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11743333765011535680.bin' '-l' '-1' '-v' '-w' '/tmp/graph11743333765011535680.weights' '-q' '0' '-e' '0.001'
[2022-05-19 01:20:05] [INFO ] Decomposing Gal with order
[2022-05-19 01:20:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 01:20:05] [INFO ] Removed a total of 768 redundant transitions.
[2022-05-19 01:20:06] [INFO ] Flatten gal took : 275 ms
[2022-05-19 01:20:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 176 labels/synchronizations in 21 ms.
[2022-05-19 01:20:06] [INFO ] Time to serialize gal into /tmp/UpperBounds15046960543833569148.gal : 19 ms
[2022-05-19 01:20:06] [INFO ] Time to serialize properties into /tmp/UpperBounds5175420328437087347.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/UpperBounds15046960543833569148.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5175420328437087347.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/UpperBounds5175420328437087347.prop.
Detected timeout of ITS tools.
[2022-05-19 01:41:14] [INFO ] Flatten gal took : 353 ms
[2022-05-19 01:41:14] [INFO ] Time to serialize gal into /tmp/UpperBounds8591908441227495907.gal : 55 ms
[2022-05-19 01:41:14] [INFO ] Time to serialize properties into /tmp/UpperBounds3322628790743990669.prop : 3 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/UpperBounds8591908441227495907.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3322628790743990669.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/UpperBounds3322628790743990669.prop.
Detected timeout of ITS tools.
[2022-05-19 02:02:27] [INFO ] Flatten gal took : 409 ms
[2022-05-19 02:02:29] [INFO ] Input system was already deterministic with 1012 transitions.
[2022-05-19 02:02:29] [INFO ] Transformed 346 places.
[2022-05-19 02:02:29] [INFO ] Transformed 1012 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 02:02:59] [INFO ] Time to serialize gal into /tmp/UpperBounds11169868028167287160.gal : 6 ms
[2022-05-19 02:02:59] [INFO ] Time to serialize properties into /tmp/UpperBounds15321929235309671885.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/UpperBounds11169868028167287160.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15321929235309671885.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...342
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds15321929235309671885.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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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="PolyORBLF-PT-S06J06T04"
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 PolyORBLF-PT-S06J06T04, 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-165277017100709"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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