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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 289K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 234K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 38K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 122K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 98K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 102K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 469K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 61K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 284K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 298K May 29 14:32 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 Peterson-PT-4-UpperBounds-00
FORMULA_NAME Peterson-PT-4-UpperBounds-01
FORMULA_NAME Peterson-PT-4-UpperBounds-02
FORMULA_NAME Peterson-PT-4-UpperBounds-03
FORMULA_NAME Peterson-PT-4-UpperBounds-04
FORMULA_NAME Peterson-PT-4-UpperBounds-05
FORMULA_NAME Peterson-PT-4-UpperBounds-06
FORMULA_NAME Peterson-PT-4-UpperBounds-07
FORMULA_NAME Peterson-PT-4-UpperBounds-08
FORMULA_NAME Peterson-PT-4-UpperBounds-09
FORMULA_NAME Peterson-PT-4-UpperBounds-10
FORMULA_NAME Peterson-PT-4-UpperBounds-11
FORMULA_NAME Peterson-PT-4-UpperBounds-12
FORMULA_NAME Peterson-PT-4-UpperBounds-13
FORMULA_NAME Peterson-PT-4-UpperBounds-14
FORMULA_NAME Peterson-PT-4-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748841549233

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-4
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 05:19:10] [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-02 05:19:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:19:10] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2025-06-02 05:19:10] [INFO ] Transformed 480 places.
[2025-06-02 05:19:10] [INFO ] Transformed 690 transitions.
[2025-06-02 05:19:10] [INFO ] Found NUPN structural information;
[2025-06-02 05:19:10] [INFO ] Parsed PT model containing 480 places and 690 transitions and 2120 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Reduction of identical properties reduced properties to check from 16 to 14
FORMULA Peterson-PT-4-UpperBounds-07 5 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-UpperBounds-01 5 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0] Max Struct:[80, 20, 100, 100, 5, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA Peterson-PT-4-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[80, 20, 100, 100, 5, 1, 1, 1, 1, 1, 1]
[2025-06-02 05:19:10] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2025-06-02 05:19:10] [INFO ] Computed 19 invariants in 26 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[80, 20, 100, 100, 5, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 77 ms. (128 steps per ms)
FORMULA Peterson-PT-4-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-4-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-4-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-4-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-4-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70007 steps (14 resets) in 121 ms. (573 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 5, 3, 5, 1, 0] Max Struct:[80, 20, 100, 100, 5, 1]
[2025-06-02 05:19:11] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2025-06-02 05:19:11] [INFO ] Invariant cache hit.
[2025-06-02 05:19:11] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned unsat
[2025-06-02 05:19:11] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned unsat
[2025-06-02 05:19:11] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2025-06-02 05:19:11] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:19:11] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2025-06-02 05:19:11] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-02 05:19:11] [INFO ] [Real]Added 116 Read/Feed constraints in 208 ms returned sat
[2025-06-02 05:19:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:19:12] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2025-06-02 05:19:12] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:19:12] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2025-06-02 05:19:12] [INFO ] [Nat]Added 116 Read/Feed constraints in 61 ms returned sat
[2025-06-02 05:19:12] [INFO ] Deduced a trap composed of 17 places in 293 ms of which 32 ms to minimize.
[2025-06-02 05:19:12] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 3 ms to minimize.
[2025-06-02 05:19:13] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 4 ms to minimize.
[2025-06-02 05:19:13] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 3 ms to minimize.
[2025-06-02 05:19:13] [INFO ] Deduced a trap composed of 21 places in 166 ms of which 3 ms to minimize.
[2025-06-02 05:19:13] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 1 ms to minimize.
[2025-06-02 05:19:13] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 2 ms to minimize.
[2025-06-02 05:19:13] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 2 ms to minimize.
[2025-06-02 05:19:14] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 2 ms to minimize.
[2025-06-02 05:19:14] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 1 ms to minimize.
[2025-06-02 05:19:14] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 1 ms to minimize.
[2025-06-02 05:19:14] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 2 ms to minimize.
[2025-06-02 05:19:14] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 2 ms to minimize.
[2025-06-02 05:19:14] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 3 ms to minimize.
[2025-06-02 05:19:14] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 2 ms to minimize.
[2025-06-02 05:19:14] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 3 ms to minimize.
[2025-06-02 05:19:15] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 1 ms to minimize.
[2025-06-02 05:19:15] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2776 ms
[2025-06-02 05:19:15] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 39 ms.
[2025-06-02 05:19:17] [INFO ] Added : 225 causal constraints over 45 iterations in 1883 ms. Result :unknown
[2025-06-02 05:19:17] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned unsat
[2025-06-02 05:19:17] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2025-06-02 05:19:17] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:19:17] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2025-06-02 05:19:17] [INFO ] [Real]Added 116 Read/Feed constraints in 27 ms returned sat
[2025-06-02 05:19:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:19:17] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2025-06-02 05:19:17] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:19:17] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2025-06-02 05:19:17] [INFO ] [Nat]Added 116 Read/Feed constraints in 73 ms returned sat
[2025-06-02 05:19:17] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 2 ms to minimize.
[2025-06-02 05:19:18] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 2 ms to minimize.
[2025-06-02 05:19:18] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 2 ms to minimize.
[2025-06-02 05:19:18] [INFO ] Deduced a trap composed of 61 places in 138 ms of which 3 ms to minimize.
[2025-06-02 05:19:18] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 3 ms to minimize.
[2025-06-02 05:19:18] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 3 ms to minimize.
[2025-06-02 05:19:18] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 3 ms to minimize.
[2025-06-02 05:19:19] [INFO ] Deduced a trap composed of 54 places in 124 ms of which 3 ms to minimize.
[2025-06-02 05:19:19] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 3 ms to minimize.
[2025-06-02 05:19:19] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 3 ms to minimize.
[2025-06-02 05:19:19] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 3 ms to minimize.
[2025-06-02 05:19:19] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 2 ms to minimize.
[2025-06-02 05:19:19] [INFO ] Deduced a trap composed of 54 places in 119 ms of which 3 ms to minimize.
[2025-06-02 05:19:20] [INFO ] Deduced a trap composed of 65 places in 112 ms of which 2 ms to minimize.
[2025-06-02 05:19:20] [INFO ] Deduced a trap composed of 65 places in 112 ms of which 2 ms to minimize.
[2025-06-02 05:19:20] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 3 ms to minimize.
[2025-06-02 05:19:20] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 3 ms to minimize.
[2025-06-02 05:19:20] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 2 ms to minimize.
[2025-06-02 05:19:21] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 2 ms to minimize.
[2025-06-02 05:19:21] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 3 ms to minimize.
[2025-06-02 05:19:21] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 2 ms to minimize.
[2025-06-02 05:19:21] [INFO ] Deduced a trap composed of 65 places in 118 ms of which 3 ms to minimize.
[2025-06-02 05:19:21] [INFO ] Deduced a trap composed of 147 places in 123 ms of which 2 ms to minimize.
[2025-06-02 05:19:21] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 2 ms to minimize.
[2025-06-02 05:19:22] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 2 ms to minimize.
[2025-06-02 05:19:22] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 2 ms to minimize.
[2025-06-02 05:19:22] [INFO ] Deduced a trap composed of 58 places in 114 ms of which 3 ms to minimize.
[2025-06-02 05:19:22] [INFO ] Trap strengthening (SAT) tested/added 27/27 trap constraints in 4686 ms
[2025-06-02 05:19:22] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2025-06-02 05:19:22] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:19:22] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2025-06-02 05:19:22] [INFO ] [Real]Added 116 Read/Feed constraints in 11 ms returned sat
[2025-06-02 05:19:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:19:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2025-06-02 05:19:22] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 0 ms returned sat
[2025-06-02 05:19:22] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2025-06-02 05:19:23] [INFO ] [Nat]Added 116 Read/Feed constraints in 17 ms returned sat
[2025-06-02 05:19:23] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 31 ms.
[2025-06-02 05:19:23] [INFO ] Added : 61 causal constraints over 13 iterations in 547 ms. Result :sat
Minimization took 183 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 5, 3, 5, 1, 0] Max Struct:[5, 5, 100, 5, 5, 1]
FORMULA Peterson-PT-4-UpperBounds-05 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-03 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-02 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-00 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 1] Max Struct:[100, 5]
Support contains 105 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 480 transition count 610
Reduce places removed 80 places and 0 transitions.
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Iterating post reduction 1 with 160 rules applied. Total rules applied 240 place count 400 transition count 530
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 320 place count 320 transition count 530
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 320 place count 320 transition count 495
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 390 place count 285 transition count 495
Applied a total of 390 rules in 70 ms. Remains 285 /480 variables (removed 195) and now considering 495/690 (removed 195) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 285/480 places, 495/690 transitions.
[2025-06-02 05:19:24] [INFO ] Flow matrix only has 435 transitions (discarded 60 similar events)
// Phase 1: matrix 435 rows 285 cols
[2025-06-02 05:19:24] [INFO ] Computed 19 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3, 1] Max Struct:[100, 5]
RANDOM walk for 1000000 steps (2 resets) in 2169 ms. (460 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 1795 ms. (1113 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 1] Max Struct:[100, 5]
[2025-06-02 05:19:28] [INFO ] Flow matrix only has 435 transitions (discarded 60 similar events)
[2025-06-02 05:19:28] [INFO ] Invariant cache hit.
[2025-06-02 05:19:28] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned unsat
[2025-06-02 05:19:28] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2025-06-02 05:19:28] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:19:28] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2025-06-02 05:19:28] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-02 05:19:28] [INFO ] [Real]Added 116 Read/Feed constraints in 12 ms returned sat
[2025-06-02 05:19:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:19:28] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2025-06-02 05:19:28] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:19:28] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2025-06-02 05:19:28] [INFO ] [Nat]Added 116 Read/Feed constraints in 30 ms returned sat
[2025-06-02 05:19:28] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 2 ms to minimize.
[2025-06-02 05:19:28] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2025-06-02 05:19:28] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
[2025-06-02 05:19:29] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2025-06-02 05:19:29] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 2 ms to minimize.
[2025-06-02 05:19:29] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 2 ms to minimize.
[2025-06-02 05:19:29] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 2 ms to minimize.
[2025-06-02 05:19:29] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2025-06-02 05:19:29] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 2 ms to minimize.
[2025-06-02 05:19:29] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 2 ms to minimize.
[2025-06-02 05:19:29] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2025-06-02 05:19:29] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2025-06-02 05:19:29] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 8 ms to minimize.
[2025-06-02 05:19:30] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 2 ms to minimize.
[2025-06-02 05:19:30] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2025-06-02 05:19:30] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 2 ms to minimize.
[2025-06-02 05:19:30] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 1 ms to minimize.
[2025-06-02 05:19:30] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 2 ms to minimize.
[2025-06-02 05:19:30] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 2 ms to minimize.
[2025-06-02 05:19:30] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 2 ms to minimize.
[2025-06-02 05:19:30] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 1 ms to minimize.
[2025-06-02 05:19:30] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2025-06-02 05:19:31] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 9 ms to minimize.
[2025-06-02 05:19:31] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 2 ms to minimize.
[2025-06-02 05:19:31] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:19:31] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 1 ms to minimize.
[2025-06-02 05:19:31] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 1 ms to minimize.
[2025-06-02 05:19:32] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2025-06-02 05:19:32] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
[2025-06-02 05:19:32] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2025-06-02 05:19:32] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2025-06-02 05:19:32] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 1 ms to minimize.
[2025-06-02 05:19:32] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 1 ms to minimize.
[2025-06-02 05:19:32] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 1 ms to minimize.
[2025-06-02 05:19:32] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2025-06-02 05:19:33] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2025-06-02 05:19:33] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 2 ms to minimize.
[2025-06-02 05:19:33] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 2 ms to minimize.
[2025-06-02 05:19:33] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 1 ms to minimize.
[2025-06-02 05:19:33] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 1 ms to minimize.
[2025-06-02 05:19:33] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 2 ms to minimize.
[2025-06-02 05:19:33] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 2 ms to minimize.
[2025-06-02 05:19:34] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 1 ms to minimize.
[2025-06-02 05:19:34] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:19:34] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:19:34] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 2 ms to minimize.
[2025-06-02 05:19:35] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2025-06-02 05:19:35] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 1 ms to minimize.
[2025-06-02 05:19:36] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:19:36] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:19:36] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2025-06-02 05:19:36] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:19:37] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:19:37] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2025-06-02 05:19:37] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 2 ms to minimize.
[2025-06-02 05:19:37] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:19:37] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:19:38] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:19:38] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:19:38] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2025-06-02 05:19:38] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2025-06-02 05:19:39] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 2 ms to minimize.
[2025-06-02 05:19:39] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2025-06-02 05:19:39] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:19:39] [INFO ] Deduced a trap composed of 52 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:19:40] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:19:40] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 1 ms to minimize.
[2025-06-02 05:19:41] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:19:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 68 trap constraints in 14695 ms
Current structural bounds on expressions (after SMT) : Max Seen:[5, 1] Max Struct:[5, 1]
FORMULA Peterson-PT-4-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-04 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided 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-02 05:19:43] [INFO ] Flatten gal took : 73 ms
[2025-06-02 05:19:43] [INFO ] Flatten gal took : 30 ms
[2025-06-02 05:19:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10650397446556216144.gal : 17 ms
[2025-06-02 05:19:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9254893970810184319.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10650397446556216144.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9254893970810184319.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 ...329
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 33375 ms.

BK_STOP 1748841583881

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="Peterson-PT-4"
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 Peterson-PT-4, 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 r153-tall-174876824800077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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