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.r287-smll-165307357000106.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 Vasy2003-PT-none, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r287-smll-165307357000106
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 6.6K Apr 29 11:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 29 11:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 29 11:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 29 11:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 9 09:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 09:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 09:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 09:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 207K 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 Vasy2003-PT-none-UpperBounds-00
FORMULA_NAME Vasy2003-PT-none-UpperBounds-01
FORMULA_NAME Vasy2003-PT-none-UpperBounds-02
FORMULA_NAME Vasy2003-PT-none-UpperBounds-03
FORMULA_NAME Vasy2003-PT-none-UpperBounds-04
FORMULA_NAME Vasy2003-PT-none-UpperBounds-05
FORMULA_NAME Vasy2003-PT-none-UpperBounds-06
FORMULA_NAME Vasy2003-PT-none-UpperBounds-07
FORMULA_NAME Vasy2003-PT-none-UpperBounds-08
FORMULA_NAME Vasy2003-PT-none-UpperBounds-09
FORMULA_NAME Vasy2003-PT-none-UpperBounds-10
FORMULA_NAME Vasy2003-PT-none-UpperBounds-11
FORMULA_NAME Vasy2003-PT-none-UpperBounds-12
FORMULA_NAME Vasy2003-PT-none-UpperBounds-13
FORMULA_NAME Vasy2003-PT-none-UpperBounds-14
FORMULA_NAME Vasy2003-PT-none-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1653145852247

Running Version 0
[2022-05-21 15:10:55] [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-21 15:10:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 15:10:55] [INFO ] Load time of PNML (sax parser for PT used): 226 ms
[2022-05-21 15:10:55] [INFO ] Transformed 485 places.
[2022-05-21 15:10:55] [INFO ] Transformed 776 transitions.
[2022-05-21 15:10:55] [INFO ] Found NUPN structural information;
[2022-05-21 15:10:55] [INFO ] Parsed PT model containing 485 places and 776 transitions in 328 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
Ensure Unique test removed 24 transitions
Reduce redundant transitions removed 24 transitions.
Normalized transition count is 696 out of 752 initially.
// Phase 1: matrix 696 rows 485 cols
[2022-05-21 15:10:56] [INFO ] Computed 66 place invariants in 66 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 16) seen :9
FORMULA Vasy2003-PT-none-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
[2022-05-21 15:10:56] [INFO ] Flow matrix only has 696 transitions (discarded 56 similar events)
// Phase 1: matrix 696 rows 485 cols
[2022-05-21 15:10:56] [INFO ] Computed 66 place invariants in 14 ms
[2022-05-21 15:10:57] [INFO ] [Real]Absence check using 59 positive place invariants in 43 ms returned sat
[2022-05-21 15:10:57] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-21 15:10:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 15:10:57] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2022-05-21 15:10:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 15:10:57] [INFO ] [Nat]Absence check using 59 positive place invariants in 52 ms returned sat
[2022-05-21 15:10:57] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 10 ms returned sat
[2022-05-21 15:10:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 15:10:58] [INFO ] [Nat]Absence check using state equation in 361 ms returned sat
[2022-05-21 15:10:58] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-05-21 15:10:58] [INFO ] [Nat]Added 73 Read/Feed constraints in 32 ms returned sat
[2022-05-21 15:10:58] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 123 ms.
[2022-05-21 15:11:02] [INFO ] Added : 202 causal constraints over 41 iterations in 3805 ms. Result :sat
Minimization took 397 ms.
[2022-05-21 15:11:02] [INFO ] [Real]Absence check using 59 positive place invariants in 45 ms returned sat
[2022-05-21 15:11:02] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 10 ms returned sat
[2022-05-21 15:11:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 15:11:03] [INFO ] [Real]Absence check using state equation in 434 ms returned sat
[2022-05-21 15:11:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 15:11:03] [INFO ] [Nat]Absence check using 59 positive place invariants in 47 ms returned sat
[2022-05-21 15:11:03] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 11 ms returned sat
[2022-05-21 15:11:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 15:11:04] [INFO ] [Nat]Absence check using state equation in 411 ms returned sat
[2022-05-21 15:11:04] [INFO ] [Nat]Added 73 Read/Feed constraints in 51 ms returned sat
[2022-05-21 15:11:04] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 119 ms.
[2022-05-21 15:11:07] [INFO ] Added : 183 causal constraints over 37 iterations in 2936 ms. Result :sat
Minimization took 348 ms.
[2022-05-21 15:11:07] [INFO ] [Real]Absence check using 59 positive place invariants in 43 ms returned sat
[2022-05-21 15:11:07] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 12 ms returned sat
[2022-05-21 15:11:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 15:11:08] [INFO ] [Real]Absence check using state equation in 390 ms returned sat
[2022-05-21 15:11:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 15:11:08] [INFO ] [Nat]Absence check using 59 positive place invariants in 39 ms returned sat
[2022-05-21 15:11:08] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 9 ms returned sat
[2022-05-21 15:11:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 15:11:08] [INFO ] [Nat]Absence check using state equation in 369 ms returned sat
[2022-05-21 15:11:08] [INFO ] [Nat]Added 73 Read/Feed constraints in 36 ms returned sat
[2022-05-21 15:11:08] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 76 ms.
[2022-05-21 15:11:12] [INFO ] Deduced a trap composed of 132 places in 330 ms of which 8 ms to minimize.
[2022-05-21 15:11:12] [INFO ] Deduced a trap composed of 124 places in 186 ms of which 2 ms to minimize.
[2022-05-21 15:11:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 745 ms
[2022-05-21 15:11:13] [INFO ] Added : 208 causal constraints over 43 iterations in 4349 ms. Result :unknown
[2022-05-21 15:11:13] [INFO ] [Real]Absence check using 59 positive place invariants in 37 ms returned sat
[2022-05-21 15:11:13] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-21 15:11:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 15:11:13] [INFO ] [Real]Absence check using state equation in 386 ms returned sat
[2022-05-21 15:11:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 15:11:14] [INFO ] [Nat]Absence check using 59 positive place invariants in 44 ms returned sat
[2022-05-21 15:11:14] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 10 ms returned sat
[2022-05-21 15:11:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 15:11:14] [INFO ] [Nat]Absence check using state equation in 386 ms returned sat
[2022-05-21 15:11:14] [INFO ] [Nat]Added 73 Read/Feed constraints in 36 ms returned sat
[2022-05-21 15:11:14] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 56 ms.
[2022-05-21 15:11:17] [INFO ] Added : 189 causal constraints over 38 iterations in 2515 ms. Result :sat
Minimization took 345 ms.
[2022-05-21 15:11:17] [INFO ] [Real]Absence check using 59 positive place invariants in 43 ms returned sat
[2022-05-21 15:11:17] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 13 ms returned sat
[2022-05-21 15:11:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 15:11:18] [INFO ] [Real]Absence check using state equation in 384 ms returned sat
[2022-05-21 15:11:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 15:11:18] [INFO ] [Nat]Absence check using 59 positive place invariants in 42 ms returned sat
[2022-05-21 15:11:18] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 10 ms returned sat
[2022-05-21 15:11:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 15:11:18] [INFO ] [Nat]Absence check using state equation in 384 ms returned sat
[2022-05-21 15:11:18] [INFO ] [Nat]Added 73 Read/Feed constraints in 31 ms returned sat
[2022-05-21 15:11:18] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 77 ms.
[2022-05-21 15:11:20] [INFO ] Added : 107 causal constraints over 23 iterations in 1912 ms. Result :sat
Minimization took 297 ms.
[2022-05-21 15:11:21] [INFO ] [Real]Absence check using 59 positive place invariants in 41 ms returned sat
[2022-05-21 15:11:21] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 10 ms returned sat
[2022-05-21 15:11:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 15:11:21] [INFO ] [Real]Absence check using state equation in 380 ms returned sat
[2022-05-21 15:11:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 15:11:21] [INFO ] [Nat]Absence check using 59 positive place invariants in 40 ms returned sat
[2022-05-21 15:11:21] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 10 ms returned sat
[2022-05-21 15:11:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 15:11:22] [INFO ] [Nat]Absence check using state equation in 373 ms returned sat
[2022-05-21 15:11:22] [INFO ] [Nat]Added 73 Read/Feed constraints in 39 ms returned sat
[2022-05-21 15:11:22] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 71 ms.
[2022-05-21 15:11:26] [INFO ] Added : 223 causal constraints over 45 iterations in 4074 ms. Result :sat
Minimization took 218 ms.
[2022-05-21 15:11:26] [INFO ] [Real]Absence check using 59 positive place invariants in 39 ms returned sat
[2022-05-21 15:11:26] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 11 ms returned sat
[2022-05-21 15:11:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 15:11:27] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2022-05-21 15:11:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 15:11:27] [INFO ] [Nat]Absence check using 59 positive place invariants in 41 ms returned sat
[2022-05-21 15:11:27] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 10 ms returned sat
[2022-05-21 15:11:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 15:11:27] [INFO ] [Nat]Absence check using state equation in 392 ms returned sat
[2022-05-21 15:11:27] [INFO ] [Nat]Added 73 Read/Feed constraints in 38 ms returned sat
[2022-05-21 15:11:28] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 70 ms.
[2022-05-21 15:11:31] [INFO ] Added : 185 causal constraints over 37 iterations in 3037 ms. Result :sat
Minimization took 296 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 39800 steps, including 412 resets, run finished after 305 ms. (steps per millisecond=130 ) properties (out of 7) seen :2 could not realise parikh vector
FORMULA Vasy2003-PT-none-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Vasy2003-PT-none-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 18500 steps, including 191 resets, run finished after 119 ms. (steps per millisecond=155 ) properties (out of 5) seen :1 could not realise parikh vector
FORMULA Vasy2003-PT-none-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 71400 steps, including 825 resets, run finished after 392 ms. (steps per millisecond=182 ) properties (out of 4) seen :1 could not realise parikh vector
FORMULA Vasy2003-PT-none-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 85300 steps, including 667 resets, run finished after 375 ms. (steps per millisecond=227 ) properties (out of 3) seen :1 could not realise parikh vector
FORMULA Vasy2003-PT-none-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 64000 steps, including 779 resets, run finished after 252 ms. (steps per millisecond=253 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 65200 steps, including 746 resets, run finished after 255 ms. (steps per millisecond=255 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 485 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 485/485 places, 752/752 transitions.
Graph (trivial) has 167 edges and 485 vertex of which 4 / 485 are part of one of the 2 SCC in 18 ms
Free SCC test removed 2 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1555 edges and 483 vertex of which 413 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.14 ms
Discarding 70 places :
Also discarding 55 output transitions
Drop transitions removed 55 transitions
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 413 transition count 669
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 412 transition count 669
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 23 place count 412 transition count 651
Deduced a syphon composed of 18 places in 3 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 59 place count 394 transition count 651
Discarding 135 places :
Symmetric choice reduction at 2 with 135 rule applications. Total rules 194 place count 259 transition count 516
Ensure Unique test removed 1 places
Iterating global reduction 2 with 136 rules applied. Total rules applied 330 place count 258 transition count 516
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 361 place count 258 transition count 485
Discarding 101 places :
Symmetric choice reduction at 3 with 101 rule applications. Total rules 462 place count 157 transition count 358
Iterating global reduction 3 with 101 rules applied. Total rules applied 563 place count 157 transition count 358
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 73 rules applied. Total rules applied 636 place count 157 transition count 285
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 637 place count 156 transition count 285
Discarding 41 places :
Symmetric choice reduction at 5 with 41 rule applications. Total rules 678 place count 115 transition count 212
Iterating global reduction 5 with 41 rules applied. Total rules applied 719 place count 115 transition count 212
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 5 with 38 rules applied. Total rules applied 757 place count 115 transition count 174
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 758 place count 114 transition count 168
Iterating global reduction 6 with 1 rules applied. Total rules applied 759 place count 114 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 760 place count 114 transition count 167
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 761 place count 113 transition count 166
Iterating global reduction 7 with 1 rules applied. Total rules applied 762 place count 113 transition count 166
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 764 place count 113 transition count 164
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 776 place count 107 transition count 158
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 782 place count 107 transition count 152
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 784 place count 107 transition count 150
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 786 place count 105 transition count 150
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 787 place count 104 transition count 149
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 16 edges and 96 vertex of which 4 / 96 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 9 with 13 rules applied. Total rules applied 800 place count 94 transition count 145
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 804 place count 94 transition count 141
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 5 Pre rules applied. Total rules applied 804 place count 94 transition count 136
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 11 with 15 rules applied. Total rules applied 819 place count 84 transition count 136
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 822 place count 84 transition count 133
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 2 Pre rules applied. Total rules applied 822 place count 84 transition count 131
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 5 rules applied. Total rules applied 827 place count 81 transition count 131
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 827 place count 81 transition count 130
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 830 place count 79 transition count 130
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 831 place count 79 transition count 129
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 4 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 837 place count 75 transition count 127
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 838 place count 74 transition count 126
Iterating global reduction 13 with 1 rules applied. Total rules applied 839 place count 74 transition count 126
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 13 with 4 rules applied. Total rules applied 843 place count 72 transition count 124
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 851 place count 72 transition count 116
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 852 place count 71 transition count 114
Iterating global reduction 14 with 1 rules applied. Total rules applied 853 place count 71 transition count 114
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 857 place count 71 transition count 110
Free-agglomeration rule applied 5 times.
Iterating global reduction 15 with 5 rules applied. Total rules applied 862 place count 71 transition count 105
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 11 rules applied. Total rules applied 873 place count 64 transition count 101
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 873 place count 64 transition count 100
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 3 rules applied. Total rules applied 876 place count 62 transition count 100
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 876 place count 62 transition count 99
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 3 rules applied. Total rules applied 879 place count 60 transition count 99
Graph (trivial) has 10 edges and 60 vertex of which 2 / 60 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 881 place count 58 transition count 99
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 884 place count 58 transition count 96
Free-agglomeration rule applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 885 place count 58 transition count 95
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 889 place count 56 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 891 place count 55 transition count 92
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 18 with 2 rules applied. Total rules applied 893 place count 55 transition count 96
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 18 with 10 rules applied. Total rules applied 903 place count 53 transition count 88
Applied a total of 903 rules in 316 ms. Remains 53 /485 variables (removed 432) and now considering 88/752 (removed 664) transitions.
Finished structural reductions, in 1 iterations. Remains : 53/485 places, 88/752 transitions.
Normalized transition count is 74 out of 88 initially.
// Phase 1: matrix 74 rows 53 cols
[2022-05-21 15:11:33] [INFO ] Computed 13 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1359 ms. (steps per millisecond=735 ) properties (out of 2) seen :2
FORMULA Vasy2003-PT-none-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1653145896270

--------------------
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="Vasy2003-PT-none"
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 Vasy2003-PT-none, 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 r287-smll-165307357000106"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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