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.r046-smll-165252115900169.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 gold2021
Input is DES-PT-10a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r046-smll-165252115900169
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 4.7K Apr 29 15:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Apr 29 15:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 29 15:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 29 15:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 07:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 9 07:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 43K May 10 09:33 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 DES-PT-10a-UpperBounds-00
FORMULA_NAME DES-PT-10a-UpperBounds-01
FORMULA_NAME DES-PT-10a-UpperBounds-02
FORMULA_NAME DES-PT-10a-UpperBounds-03
FORMULA_NAME DES-PT-10a-UpperBounds-04
FORMULA_NAME DES-PT-10a-UpperBounds-05
FORMULA_NAME DES-PT-10a-UpperBounds-06
FORMULA_NAME DES-PT-10a-UpperBounds-07
FORMULA_NAME DES-PT-10a-UpperBounds-08
FORMULA_NAME DES-PT-10a-UpperBounds-09
FORMULA_NAME DES-PT-10a-UpperBounds-10
FORMULA_NAME DES-PT-10a-UpperBounds-11
FORMULA_NAME DES-PT-10a-UpperBounds-12
FORMULA_NAME DES-PT-10a-UpperBounds-13
FORMULA_NAME DES-PT-10a-UpperBounds-14
FORMULA_NAME DES-PT-10a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652526224325

Running Version 0
[2022-05-14 11:03:47] [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-14 11:03:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 11:03:47] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2022-05-14 11:03:48] [INFO ] Transformed 155 places.
[2022-05-14 11:03:48] [INFO ] Transformed 112 transitions.
[2022-05-14 11:03:48] [INFO ] Found NUPN structural information;
[2022-05-14 11:03:48] [INFO ] Parsed PT model containing 155 places and 112 transitions in 202 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
// Phase 1: matrix 98 rows 155 cols
[2022-05-14 11:03:48] [INFO ] Computed 59 place invariants in 27 ms
Incomplete random walk after 10000 steps, including 218 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 16) seen :14
FORMULA DES-PT-10a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
// Phase 1: matrix 98 rows 155 cols
[2022-05-14 11:03:48] [INFO ] Computed 59 place invariants in 13 ms
[2022-05-14 11:03:48] [INFO ] [Real]Absence check using 34 positive place invariants in 19 ms returned sat
[2022-05-14 11:03:48] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 22 ms returned sat
[2022-05-14 11:03:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:03:48] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2022-05-14 11:03:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:03:48] [INFO ] [Nat]Absence check using 34 positive place invariants in 27 ms returned sat
[2022-05-14 11:03:48] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 47 ms returned sat
[2022-05-14 11:03:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:03:49] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2022-05-14 11:03:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-14 11:03:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2022-05-14 11:03:49] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 6 ms to minimize.
[2022-05-14 11:03:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2022-05-14 11:03:49] [INFO ] Computed and/alt/rep : 90/273/90 causal constraints (skipped 7 transitions) in 41 ms.
[2022-05-14 11:03:49] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
[2022-05-14 11:03:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2022-05-14 11:03:50] [INFO ] Added : 75 causal constraints over 16 iterations in 623 ms. Result :sat
Minimization took 80 ms.
[2022-05-14 11:03:50] [INFO ] [Real]Absence check using 34 positive place invariants in 19 ms returned sat
[2022-05-14 11:03:50] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 16 ms returned sat
[2022-05-14 11:03:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:03:50] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2022-05-14 11:03:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:03:50] [INFO ] [Nat]Absence check using 34 positive place invariants in 22 ms returned sat
[2022-05-14 11:03:50] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 46 ms returned sat
[2022-05-14 11:03:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:03:50] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2022-05-14 11:03:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-14 11:03:50] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 2 ms to minimize.
[2022-05-14 11:03:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2022-05-14 11:03:50] [INFO ] Computed and/alt/rep : 90/273/90 causal constraints (skipped 7 transitions) in 12 ms.
[2022-05-14 11:03:51] [INFO ] Added : 59 causal constraints over 12 iterations in 341 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Incomplete Parikh walk after 18500 steps, including 995 resets, run finished after 112 ms. (steps per millisecond=165 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 53400 steps, including 1505 resets, run finished after 131 ms. (steps per millisecond=407 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 155/155 places, 98/98 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 155 transition count 96
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 154 transition count 95
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 154 transition count 95
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 154 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 153 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 152 transition count 94
Applied a total of 11 rules in 78 ms. Remains 152 /155 variables (removed 3) and now considering 94/98 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 152/155 places, 94/98 transitions.
// Phase 1: matrix 94 rows 152 cols
[2022-05-14 11:03:51] [INFO ] Computed 60 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 13657 resets, run finished after 2544 ms. (steps per millisecond=393 ) properties (out of 2) seen :1
FORMULA DES-PT-10a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2286 resets, run finished after 1071 ms. (steps per millisecond=933 ) properties (out of 1) seen :0
// Phase 1: matrix 94 rows 152 cols
[2022-05-14 11:03:55] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-14 11:03:55] [INFO ] [Real]Absence check using 36 positive place invariants in 11 ms returned sat
[2022-05-14 11:03:55] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2022-05-14 11:03:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:03:55] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2022-05-14 11:03:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:03:55] [INFO ] [Nat]Absence check using 36 positive place invariants in 13 ms returned sat
[2022-05-14 11:03:55] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 137 ms returned sat
[2022-05-14 11:03:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:03:55] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2022-05-14 11:03:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-14 11:03:55] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2022-05-14 11:03:55] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 3 ms to minimize.
[2022-05-14 11:03:55] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2022-05-14 11:03:55] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2022-05-14 11:03:55] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 2 ms to minimize.
[2022-05-14 11:03:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 298 ms
[2022-05-14 11:03:55] [INFO ] Computed and/alt/rep : 85/165/85 causal constraints (skipped 6 transitions) in 15 ms.
[2022-05-14 11:03:56] [INFO ] Added : 81 causal constraints over 17 iterations in 361 ms. Result :sat
Minimization took 70 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 47400 steps, including 822 resets, run finished after 181 ms. (steps per millisecond=261 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 13 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 152/152 places, 94/94 transitions.
// Phase 1: matrix 94 rows 152 cols
[2022-05-14 11:03:56] [INFO ] Computed 60 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 13683 resets, run finished after 2462 ms. (steps per millisecond=406 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2301 resets, run finished after 1291 ms. (steps per millisecond=774 ) properties (out of 1) seen :0
// Phase 1: matrix 94 rows 152 cols
[2022-05-14 11:04:00] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-14 11:04:00] [INFO ] [Real]Absence check using 36 positive place invariants in 31 ms returned sat
[2022-05-14 11:04:00] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2022-05-14 11:04:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:04:00] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2022-05-14 11:04:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:04:00] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2022-05-14 11:04:00] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 121 ms returned sat
[2022-05-14 11:04:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:04:00] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2022-05-14 11:04:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-14 11:04:00] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2022-05-14 11:04:00] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2022-05-14 11:04:00] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 0 ms to minimize.
[2022-05-14 11:04:01] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2022-05-14 11:04:01] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2022-05-14 11:04:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 307 ms
[2022-05-14 11:04:01] [INFO ] Computed and/alt/rep : 85/165/85 causal constraints (skipped 6 transitions) in 12 ms.
[2022-05-14 11:04:01] [INFO ] Added : 81 causal constraints over 17 iterations in 334 ms. Result :sat
Minimization took 58 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 47400 steps, including 837 resets, run finished after 153 ms. (steps per millisecond=309 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 13 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 152/152 places, 94/94 transitions.
Starting structural reductions, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 10 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
// Phase 1: matrix 94 rows 152 cols
[2022-05-14 11:04:01] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-14 11:04:01] [INFO ] Implicit Places using invariants in 185 ms returned []
// Phase 1: matrix 94 rows 152 cols
[2022-05-14 11:04:01] [INFO ] Computed 60 place invariants in 10 ms
[2022-05-14 11:04:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-14 11:04:02] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
[2022-05-14 11:04:02] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 94 rows 152 cols
[2022-05-14 11:04:02] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-14 11:04:02] [INFO ] Dead Transitions using invariants and state equation in 117 ms returned []
Finished structural reductions, in 1 iterations. Remains : 152/152 places, 94/94 transitions.
Starting property specific reduction for DES-PT-10a-UpperBounds-02
// Phase 1: matrix 94 rows 152 cols
[2022-05-14 11:04:02] [INFO ] Computed 60 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 137 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
// Phase 1: matrix 94 rows 152 cols
[2022-05-14 11:04:02] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-14 11:04:02] [INFO ] [Real]Absence check using 36 positive place invariants in 11 ms returned sat
[2022-05-14 11:04:02] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2022-05-14 11:04:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:04:02] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2022-05-14 11:04:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:04:02] [INFO ] [Nat]Absence check using 36 positive place invariants in 13 ms returned sat
[2022-05-14 11:04:02] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 136 ms returned sat
[2022-05-14 11:04:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:04:02] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2022-05-14 11:04:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-14 11:04:02] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2022-05-14 11:04:02] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2022-05-14 11:04:02] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2022-05-14 11:04:02] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2022-05-14 11:04:02] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2022-05-14 11:04:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 184 ms
[2022-05-14 11:04:03] [INFO ] Computed and/alt/rep : 85/165/85 causal constraints (skipped 6 transitions) in 9 ms.
[2022-05-14 11:04:03] [INFO ] Added : 81 causal constraints over 17 iterations in 312 ms. Result :sat
Minimization took 59 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 47400 steps, including 832 resets, run finished after 183 ms. (steps per millisecond=259 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 12 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 152/152 places, 94/94 transitions.
// Phase 1: matrix 94 rows 152 cols
[2022-05-14 11:04:03] [INFO ] Computed 60 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 13675 resets, run finished after 2245 ms. (steps per millisecond=445 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2228 resets, run finished after 958 ms. (steps per millisecond=1043 ) properties (out of 1) seen :0
// Phase 1: matrix 94 rows 152 cols
[2022-05-14 11:04:06] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-14 11:04:06] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned sat
[2022-05-14 11:04:06] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2022-05-14 11:04:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:04:06] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2022-05-14 11:04:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:04:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 12 ms returned sat
[2022-05-14 11:04:07] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 84 ms returned sat
[2022-05-14 11:04:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:04:07] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2022-05-14 11:04:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-14 11:04:07] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2022-05-14 11:04:07] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2022-05-14 11:04:07] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2022-05-14 11:04:07] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2022-05-14 11:04:07] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2022-05-14 11:04:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 232 ms
[2022-05-14 11:04:07] [INFO ] Computed and/alt/rep : 85/165/85 causal constraints (skipped 6 transitions) in 7 ms.
[2022-05-14 11:04:07] [INFO ] Added : 81 causal constraints over 17 iterations in 293 ms. Result :sat
Minimization took 60 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 47400 steps, including 839 resets, run finished after 178 ms. (steps per millisecond=266 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 12 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 152/152 places, 94/94 transitions.
Starting structural reductions, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 11 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
// Phase 1: matrix 94 rows 152 cols
[2022-05-14 11:04:07] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-14 11:04:08] [INFO ] Implicit Places using invariants in 228 ms returned []
// Phase 1: matrix 94 rows 152 cols
[2022-05-14 11:04:08] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-14 11:04:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-14 11:04:08] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
[2022-05-14 11:04:08] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 94 rows 152 cols
[2022-05-14 11:04:08] [INFO ] Computed 60 place invariants in 1 ms
[2022-05-14 11:04:08] [INFO ] Dead Transitions using invariants and state equation in 155 ms returned []
Finished structural reductions, in 1 iterations. Remains : 152/152 places, 94/94 transitions.
Ending property specific reduction for DES-PT-10a-UpperBounds-02 in 6414 ms.
[2022-05-14 11:04:09] [INFO ] Flatten gal took : 78 ms
[2022-05-14 11:04:09] [INFO ] Applying decomposition
[2022-05-14 11:04:09] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17939779246141490979.txt, -o, /tmp/graph17939779246141490979.bin, -w, /tmp/graph17939779246141490979.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17939779246141490979.bin, -l, -1, -v, -w, /tmp/graph17939779246141490979.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-14 11:04:09] [INFO ] Decomposing Gal with order
[2022-05-14 11:04:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 11:04:09] [INFO ] Removed a total of 19 redundant transitions.
[2022-05-14 11:04:09] [INFO ] Flatten gal took : 95 ms
[2022-05-14 11:04:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 10 ms.
[2022-05-14 11:04:09] [INFO ] Time to serialize gal into /tmp/UpperBounds4989649230752984490.gal : 16 ms
[2022-05-14 11:04:09] [INFO ] Time to serialize properties into /tmp/UpperBounds18001058712284929706.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds4989649230752984490.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds18001058712284929706.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds4989649230752984490.gal -t CGAL -reachable-file /tmp/UpperBounds18001058712284929706.prop --nowitness
Loading property file /tmp/UpperBounds18001058712284929706.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,7.76117e+11,1.75903,33604,3139,666,64049,1854,229,115965,134,8072,0
Total reachable state count : 776117383448

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-10a-UpperBounds-02 :0 <= i2.u2.p32 <= 1
FORMULA DES-PT-10a-UpperBounds-02 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-10a-UpperBounds-02,0,2.04264,33604,1,0,64049,2345,405,152655,178,16498,2505

BK_STOP 1652526252964

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="DES-PT-10a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is DES-PT-10a, 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 r046-smll-165252115900169"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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