Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r251-tall-174915605100114.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
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 r251-tall-174915605100114
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 7.0K May 29 14:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 29 14:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K May 29 14:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 207K May 29 14: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

echo here is the order used to build the result vector(from xml 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 1749196999199

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Vasy2003-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-06 08:03:20] [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]
[2025-06-06 08:03:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 08:03:20] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2025-06-06 08:03:20] [INFO ] Transformed 485 places.
[2025-06-06 08:03:20] [INFO ] Transformed 776 transitions.
[2025-06-06 08:03:20] [INFO ] Found NUPN structural information;
[2025-06-06 08:03:20] [INFO ] Parsed PT model containing 485 places and 776 transitions and 2809 arcs in 200 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 24 transitions
Reduce redundant transitions removed 24 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-06 08:03:20] [INFO ] Flow matrix only has 696 transitions (discarded 56 similar events)
// Phase 1: matrix 696 rows 485 cols
[2025-06-06 08:03:20] [INFO ] Computed 66 invariants in 25 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 74 ms. (133 steps per ms)
FORMULA Vasy2003-PT-none-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Vasy2003-PT-none-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Vasy2003-PT-none-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Vasy2003-PT-none-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Vasy2003-PT-none-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Vasy2003-PT-none-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Vasy2003-PT-none-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Vasy2003-PT-none-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Vasy2003-PT-none-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Vasy2003-PT-none-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60006 steps (12 resets) in 102 ms. (582 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-06-06 08:03:20] [INFO ] Flow matrix only has 696 transitions (discarded 56 similar events)
[2025-06-06 08:03:20] [INFO ] Invariant cache hit.
[2025-06-06 08:03:21] [INFO ] [Real]Absence check using 59 positive place invariants in 19 ms returned sat
[2025-06-06 08:03:21] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 5 ms returned sat
[2025-06-06 08:03:21] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2025-06-06 08:03:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 08:03:21] [INFO ] [Nat]Absence check using 59 positive place invariants in 25 ms returned sat
[2025-06-06 08:03:21] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 4 ms returned sat
[2025-06-06 08:03:22] [INFO ] [Nat]Absence check using state equation in 472 ms returned sat
[2025-06-06 08:03:22] [INFO ] State equation strengthened by 73 read => feed constraints.
[2025-06-06 08:03:22] [INFO ] [Nat]Added 73 Read/Feed constraints in 105 ms returned sat
[2025-06-06 08:03:22] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 101 ms.
[2025-06-06 08:03:22] [INFO ] Added : 28 causal constraints over 6 iterations in 625 ms. Result :sat
Minimization took 574 ms.
[2025-06-06 08:03:23] [INFO ] [Real]Absence check using 59 positive place invariants in 34 ms returned sat
[2025-06-06 08:03:23] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 4 ms returned sat
[2025-06-06 08:03:24] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2025-06-06 08:03:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 08:03:24] [INFO ] [Nat]Absence check using 59 positive place invariants in 14 ms returned sat
[2025-06-06 08:03:24] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 4 ms returned sat
[2025-06-06 08:03:24] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2025-06-06 08:03:24] [INFO ] [Nat]Added 73 Read/Feed constraints in 52 ms returned sat
[2025-06-06 08:03:24] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 107 ms.
[2025-06-06 08:03:24] [INFO ] Added : 26 causal constraints over 6 iterations in 456 ms. Result :sat
Minimization took 508 ms.
[2025-06-06 08:03:25] [INFO ] [Real]Absence check using 59 positive place invariants in 15 ms returned sat
[2025-06-06 08:03:25] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 4 ms returned sat
[2025-06-06 08:03:25] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2025-06-06 08:03:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 08:03:25] [INFO ] [Nat]Absence check using 59 positive place invariants in 15 ms returned sat
[2025-06-06 08:03:25] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 4 ms returned sat
[2025-06-06 08:03:25] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2025-06-06 08:03:25] [INFO ] [Nat]Added 73 Read/Feed constraints in 30 ms returned sat
[2025-06-06 08:03:26] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 51 ms.
[2025-06-06 08:03:26] [INFO ] Added : 39 causal constraints over 8 iterations in 607 ms. Result :sat
Minimization took 566 ms.
[2025-06-06 08:03:27] [INFO ] [Real]Absence check using 59 positive place invariants in 14 ms returned sat
[2025-06-06 08:03:27] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 4 ms returned sat
[2025-06-06 08:03:27] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2025-06-06 08:03:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 08:03:27] [INFO ] [Nat]Absence check using 59 positive place invariants in 15 ms returned sat
[2025-06-06 08:03:27] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 5 ms returned sat
[2025-06-06 08:03:27] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2025-06-06 08:03:27] [INFO ] [Nat]Added 73 Read/Feed constraints in 30 ms returned sat
[2025-06-06 08:03:27] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 37 ms.
[2025-06-06 08:03:28] [INFO ] Added : 36 causal constraints over 8 iterations in 570 ms. Result :sat
Minimization took 553 ms.
[2025-06-06 08:03:29] [INFO ] [Real]Absence check using 59 positive place invariants in 14 ms returned sat
[2025-06-06 08:03:29] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 4 ms returned sat
[2025-06-06 08:03:29] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2025-06-06 08:03:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 08:03:29] [INFO ] [Nat]Absence check using 59 positive place invariants in 15 ms returned sat
[2025-06-06 08:03:29] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 4 ms returned sat
[2025-06-06 08:03:29] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2025-06-06 08:03:29] [INFO ] [Nat]Added 73 Read/Feed constraints in 48 ms returned sat
[2025-06-06 08:03:29] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 34 ms.
[2025-06-06 08:03:30] [INFO ] Added : 36 causal constraints over 8 iterations in 412 ms. Result :sat
Minimization took 558 ms.
[2025-06-06 08:03:30] [INFO ] [Real]Absence check using 59 positive place invariants in 14 ms returned sat
[2025-06-06 08:03:30] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 4 ms returned sat
[2025-06-06 08:03:30] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2025-06-06 08:03:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 08:03:30] [INFO ] [Nat]Absence check using 59 positive place invariants in 16 ms returned sat
[2025-06-06 08:03:30] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 4 ms returned sat
[2025-06-06 08:03:31] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2025-06-06 08:03:31] [INFO ] [Nat]Added 73 Read/Feed constraints in 35 ms returned sat
[2025-06-06 08:03:31] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 44 ms.
[2025-06-06 08:03:31] [INFO ] Added : 23 causal constraints over 6 iterations in 324 ms. Result :sat
Minimization took 552 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 485 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 485/485 places, 752/752 transitions.
Graph (trivial) has 165 edges and 485 vertex of which 4 / 485 are part of one of the 2 SCC in 16 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) 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.4 ms
Discarding 70 places :
Also discarding 55 output transitions
Drop transitions (Output transitions of discarded places.) removed 55 transitions
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 23 place count 412 transition count 653
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 55 place count 396 transition count 653
Discarding 133 places :
Symmetric choice reduction at 2 with 133 rule applications. Total rules 188 place count 263 transition count 520
Ensure Unique test removed 1 places
Iterating global reduction 2 with 134 rules applied. Total rules applied 322 place count 262 transition count 520
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 353 place count 262 transition count 489
Discarding 96 places :
Symmetric choice reduction at 3 with 96 rule applications. Total rules 449 place count 166 transition count 368
Iterating global reduction 3 with 96 rules applied. Total rules applied 545 place count 166 transition count 368
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 69 rules applied. Total rules applied 614 place count 166 transition count 299
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 615 place count 165 transition count 299
Discarding 37 places :
Symmetric choice reduction at 5 with 37 rule applications. Total rules 652 place count 128 transition count 233
Iterating global reduction 5 with 37 rules applied. Total rules applied 689 place count 128 transition count 233
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 5 with 33 rules applied. Total rules applied 722 place count 128 transition count 200
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 740 place count 119 transition count 191
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 743 place count 116 transition count 187
Iterating global reduction 6 with 3 rules applied. Total rules applied 746 place count 116 transition count 187
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 748 place count 116 transition count 185
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 750 place count 114 transition count 182
Iterating global reduction 7 with 2 rules applied. Total rules applied 752 place count 114 transition count 182
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 755 place count 114 transition count 179
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 763 place count 114 transition count 171
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 766 place count 114 transition count 168
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 775 place count 111 transition count 162
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 776 place count 110 transition count 161
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 102 vertex of which 4 / 102 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 9 with 13 rules applied. Total rules applied 789 place count 100 transition count 157
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 793 place count 100 transition count 153
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 5 Pre rules applied. Total rules applied 793 place count 100 transition count 148
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 808 place count 90 transition count 148
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 811 place count 90 transition count 145
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 2 Pre rules applied. Total rules applied 811 place count 90 transition count 143
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 5 rules applied. Total rules applied 816 place count 87 transition count 143
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 816 place count 87 transition count 142
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 819 place count 85 transition count 142
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 820 place count 85 transition count 141
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 826 place count 81 transition count 139
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 827 place count 80 transition count 138
Iterating global reduction 13 with 1 rules applied. Total rules applied 828 place count 80 transition count 138
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 832 place count 78 transition count 136
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 840 place count 78 transition count 128
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 841 place count 77 transition count 126
Iterating global reduction 14 with 1 rules applied. Total rules applied 842 place count 77 transition count 126
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 846 place count 77 transition count 122
Free-agglomeration rule applied 6 times.
Iterating global reduction 15 with 6 rules applied. Total rules applied 852 place count 77 transition count 116
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 12 rules applied. Total rules applied 864 place count 69 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 864 place count 69 transition count 111
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 867 place count 67 transition count 111
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 867 place count 67 transition count 110
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 3 rules applied. Total rules applied 870 place count 65 transition count 110
Graph (trivial) has 9 edges and 65 vertex of which 2 / 65 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 872 place count 63 transition count 110
Drop transitions (Empty/Sink Transition effects.) 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 875 place count 63 transition count 107
Free-agglomeration rule applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 876 place count 63 transition count 106
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 880 place count 61 transition count 104
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 882 place count 60 transition count 103
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 18 with 1 rules applied. Total rules applied 883 place count 60 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 884 place count 59 transition count 105
Applied a total of 884 rules in 218 ms. Remains 59 /485 variables (removed 426) and now considering 105/752 (removed 647) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 233 ms. Remains : 59/485 places, 105/752 transitions.
[2025-06-06 08:03:32] [INFO ] Flow matrix only has 91 transitions (discarded 14 similar events)
// Phase 1: matrix 91 rows 59 cols
[2025-06-06 08:03:32] [INFO ] Computed 13 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 967 ms. (1033 steps per ms)
FORMULA Vasy2003-PT-none-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Vasy2003-PT-none-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Vasy2003-PT-none-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Vasy2003-PT-none-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Vasy2003-PT-none-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Vasy2003-PT-none-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 269 ms. (3703 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-06 08:03:33] [INFO ] Flatten gal took : 38 ms
[2025-06-06 08:03:33] [INFO ] Flatten gal took : 16 ms
[2025-06-06 08:03:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4215013585382812591.gal : 11 ms
[2025-06-06 08:03:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6664734625626057759.prop : 1 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4215013585382812591.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6664734625626057759.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 13447 ms.

BK_STOP 1749197013935

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="Vasy2003-PT-none"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
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 r251-tall-174915605100114"
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.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 ;