Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r109-tall-171624208500431.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is DES-PT-20b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-tall-171624208500431
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 12 08:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 08:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 12 08:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 91K May 18 16:42 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-20b-UpperBounds-00
FORMULA_NAME DES-PT-20b-UpperBounds-01
FORMULA_NAME DES-PT-20b-UpperBounds-02
FORMULA_NAME DES-PT-20b-UpperBounds-03
FORMULA_NAME DES-PT-20b-UpperBounds-04
FORMULA_NAME DES-PT-20b-UpperBounds-05
FORMULA_NAME DES-PT-20b-UpperBounds-06
FORMULA_NAME DES-PT-20b-UpperBounds-07
FORMULA_NAME DES-PT-20b-UpperBounds-08
FORMULA_NAME DES-PT-20b-UpperBounds-09
FORMULA_NAME DES-PT-20b-UpperBounds-10
FORMULA_NAME DES-PT-20b-UpperBounds-11
FORMULA_NAME DES-PT-20b-UpperBounds-12
FORMULA_NAME DES-PT-20b-UpperBounds-13
FORMULA_NAME DES-PT-20b-UpperBounds-14
FORMULA_NAME DES-PT-20b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716336547094

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-20b
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-22 00:09:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 00:09:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:09:08] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2024-05-22 00:09:08] [INFO ] Transformed 360 places.
[2024-05-22 00:09:08] [INFO ] Transformed 311 transitions.
[2024-05-22 00:09:08] [INFO ] Found NUPN structural information;
[2024-05-22 00:09:08] [INFO ] Parsed PT model containing 360 places and 311 transitions and 987 arcs in 128 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
// Phase 1: matrix 311 rows 360 cols
[2024-05-22 00:09:08] [INFO ] Computed 65 invariants in 32 ms
Incomplete random walk after 10000 steps, including 88 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 16) seen :15
FORMULA DES-PT-20b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
[2024-05-22 00:09:09] [INFO ] Invariant cache hit.
[2024-05-22 00:09:09] [INFO ] [Real]Absence check using 39 positive place invariants in 26 ms returned sat
[2024-05-22 00:09:09] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 13 ms returned sat
[2024-05-22 00:09:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 00:09:09] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2024-05-22 00:09:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:09:09] [INFO ] [Nat]Absence check using 39 positive place invariants in 13 ms returned sat
[2024-05-22 00:09:09] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 11 ms returned sat
[2024-05-22 00:09:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 00:09:09] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2024-05-22 00:09:09] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:09:09] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 0 ms to minimize.
[2024-05-22 00:09:10] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:09:10] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
[2024-05-22 00:09:10] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:09:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 517 ms
[2024-05-22 00:09:10] [INFO ] Computed and/alt/rep : 305/595/305 causal constraints (skipped 5 transitions) in 18 ms.
[2024-05-22 00:09:11] [INFO ] Added : 255 causal constraints over 51 iterations in 1739 ms. Result :sat
Minimization took 149 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 360 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 310/310 transitions.
Graph (complete) has 738 edges and 360 vertex of which 349 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 348 transition count 281
Reduce places removed 22 places and 1 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 47 place count 326 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 325 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 49 place count 324 transition count 278
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 50 place count 323 transition count 277
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 51 place count 322 transition count 276
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 52 place count 321 transition count 275
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 52 place count 321 transition count 266
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 70 place count 312 transition count 266
Discarding 19 places :
Symmetric choice reduction at 7 with 19 rule applications. Total rules 89 place count 293 transition count 247
Iterating global reduction 7 with 19 rules applied. Total rules applied 108 place count 293 transition count 247
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 108 place count 293 transition count 246
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 110 place count 292 transition count 246
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 125 place count 277 transition count 231
Iterating global reduction 7 with 15 rules applied. Total rules applied 140 place count 277 transition count 231
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 15 rules applied. Total rules applied 155 place count 277 transition count 216
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 158 place count 275 transition count 215
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 3 Pre rules applied. Total rules applied 158 place count 275 transition count 212
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 164 place count 272 transition count 212
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 9 with 154 rules applied. Total rules applied 318 place count 195 transition count 135
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 322 place count 193 transition count 137
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 323 place count 193 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 324 place count 192 transition count 136
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 325 place count 192 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 326 place count 191 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 327 place count 190 transition count 135
Applied a total of 327 rules in 141 ms. Remains 190 /360 variables (removed 170) and now considering 135/310 (removed 175) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 190/360 places, 135/310 transitions.
// Phase 1: matrix 135 rows 190 cols
[2024-05-22 00:09:12] [INFO ] Computed 61 invariants in 6 ms
Incomplete random walk after 1000000 steps, including 47722 resets, run finished after 1813 ms. (steps per millisecond=551 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9070 resets, run finished after 890 ms. (steps per millisecond=1123 ) properties (out of 1) seen :0
[2024-05-22 00:09:15] [INFO ] Invariant cache hit.
[2024-05-22 00:09:15] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-22 00:09:15] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 6 ms returned sat
[2024-05-22 00:09:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 00:09:15] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-05-22 00:09:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:09:15] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-22 00:09:15] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 199 ms returned sat
[2024-05-22 00:09:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 00:09:15] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-05-22 00:09:15] [INFO ] Computed and/alt/rep : 121/239/121 causal constraints (skipped 11 transitions) in 8 ms.
[2024-05-22 00:09:16] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:09:16] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-05-22 00:09:16] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2024-05-22 00:09:16] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 0 ms to minimize.
[2024-05-22 00:09:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 250 ms
[2024-05-22 00:09:16] [INFO ] Added : 105 causal constraints over 22 iterations in 524 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 135/135 transitions.
Applied a total of 0 rules in 7 ms. Remains 190 /190 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 190/190 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 135/135 transitions.
Applied a total of 0 rules in 6 ms. Remains 190 /190 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2024-05-22 00:09:16] [INFO ] Invariant cache hit.
[2024-05-22 00:09:16] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-22 00:09:16] [INFO ] Invariant cache hit.
[2024-05-22 00:09:16] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2024-05-22 00:09:16] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-22 00:09:16] [INFO ] Invariant cache hit.
[2024-05-22 00:09:16] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 425 ms. Remains : 190/190 places, 135/135 transitions.
Starting property specific reduction for DES-PT-20b-UpperBounds-02
[2024-05-22 00:09:16] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 460 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
[2024-05-22 00:09:16] [INFO ] Invariant cache hit.
[2024-05-22 00:09:17] [INFO ] [Real]Absence check using 37 positive place invariants in 5 ms returned sat
[2024-05-22 00:09:17] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 6 ms returned sat
[2024-05-22 00:09:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 00:09:17] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-05-22 00:09:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:09:17] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2024-05-22 00:09:17] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 194 ms returned sat
[2024-05-22 00:09:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 00:09:17] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-05-22 00:09:17] [INFO ] Computed and/alt/rep : 121/239/121 causal constraints (skipped 11 transitions) in 10 ms.
[2024-05-22 00:09:17] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:09:17] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-05-22 00:09:17] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2024-05-22 00:09:17] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-05-22 00:09:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 243 ms
[2024-05-22 00:09:17] [INFO ] Added : 105 causal constraints over 22 iterations in 518 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 135/135 transitions.
Applied a total of 0 rules in 7 ms. Remains 190 /190 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 190/190 places, 135/135 transitions.
[2024-05-22 00:09:18] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 47658 resets, run finished after 1783 ms. (steps per millisecond=560 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9150 resets, run finished after 846 ms. (steps per millisecond=1182 ) properties (out of 1) seen :0
[2024-05-22 00:09:20] [INFO ] Invariant cache hit.
[2024-05-22 00:09:20] [INFO ] [Real]Absence check using 37 positive place invariants in 5 ms returned sat
[2024-05-22 00:09:20] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 19 ms returned sat
[2024-05-22 00:09:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 00:09:20] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-22 00:09:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:09:20] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2024-05-22 00:09:21] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 192 ms returned sat
[2024-05-22 00:09:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 00:09:21] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-22 00:09:21] [INFO ] Computed and/alt/rep : 121/239/121 causal constraints (skipped 11 transitions) in 22 ms.
[2024-05-22 00:09:21] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-05-22 00:09:21] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:09:21] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2024-05-22 00:09:21] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-22 00:09:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 229 ms
[2024-05-22 00:09:21] [INFO ] Added : 105 causal constraints over 22 iterations in 485 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 135/135 transitions.
Applied a total of 0 rules in 6 ms. Remains 190 /190 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 190/190 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 135/135 transitions.
Applied a total of 0 rules in 6 ms. Remains 190 /190 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2024-05-22 00:09:21] [INFO ] Invariant cache hit.
[2024-05-22 00:09:21] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-22 00:09:21] [INFO ] Invariant cache hit.
[2024-05-22 00:09:22] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2024-05-22 00:09:22] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-22 00:09:22] [INFO ] Invariant cache hit.
[2024-05-22 00:09:22] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 389 ms. Remains : 190/190 places, 135/135 transitions.
Ending property specific reduction for DES-PT-20b-UpperBounds-02 in 5258 ms.
[2024-05-22 00:09:22] [INFO ] Flatten gal took : 59 ms
[2024-05-22 00:09:22] [INFO ] Applying decomposition
[2024-05-22 00:09:22] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6670188170330089550.txt' '-o' '/tmp/graph6670188170330089550.bin' '-w' '/tmp/graph6670188170330089550.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6670188170330089550.bin' '-l' '-1' '-v' '-w' '/tmp/graph6670188170330089550.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:09:22] [INFO ] Decomposing Gal with order
[2024-05-22 00:09:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:09:22] [INFO ] Removed a total of 57 redundant transitions.
[2024-05-22 00:09:22] [INFO ] Flatten gal took : 39 ms
[2024-05-22 00:09:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 6 ms.
[2024-05-22 00:09:22] [INFO ] Time to serialize gal into /tmp/UpperBounds6921396815455353427.gal : 7 ms
[2024-05-22 00:09:22] [INFO ] Time to serialize properties into /tmp/UpperBounds17963794813109461152.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds6921396815455353427.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17963794813109461152.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds17963794813109461152.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,6.245e+12,2.06772,63364,8063,1043,135757,2789,307,200418,213,11606,0
Total reachable state count : 6245002019800

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-20b-UpperBounds-02 :0 <= i3.u14.p14 <= 1
FORMULA DES-PT-20b-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-20b-UpperBounds-02,0,2.36881,63620,1,0,135757,8499,488,200418,258,43462,2326
Total runtime 16535 ms.

BK_STOP 1716336566072

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-20b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is DES-PT-20b, 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 r109-tall-171624208500431"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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