fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r055-tall-174854041300062
Last Updated
June 24, 2025

About the Execution of 2024-gold for CO4-PT-15

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15692.120 22567.00 36164.00 146.30 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 255K 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 CO4-PT-15-UpperBounds-00
FORMULA_NAME CO4-PT-15-UpperBounds-01
FORMULA_NAME CO4-PT-15-UpperBounds-02
FORMULA_NAME CO4-PT-15-UpperBounds-03
FORMULA_NAME CO4-PT-15-UpperBounds-04
FORMULA_NAME CO4-PT-15-UpperBounds-05
FORMULA_NAME CO4-PT-15-UpperBounds-06
FORMULA_NAME CO4-PT-15-UpperBounds-07
FORMULA_NAME CO4-PT-15-UpperBounds-08
FORMULA_NAME CO4-PT-15-UpperBounds-09
FORMULA_NAME CO4-PT-15-UpperBounds-10
FORMULA_NAME CO4-PT-15-UpperBounds-11
FORMULA_NAME CO4-PT-15-UpperBounds-12
FORMULA_NAME CO4-PT-15-UpperBounds-13
FORMULA_NAME CO4-PT-15-UpperBounds-14
FORMULA_NAME CO4-PT-15-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748602003213

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-30 10:46:44] [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-05-30 10:46:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 10:46:44] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2025-05-30 10:46:44] [INFO ] Transformed 833 places.
[2025-05-30 10:46:44] [INFO ] Transformed 1106 transitions.
[2025-05-30 10:46:44] [INFO ] Found NUPN structural information;
[2025-05-30 10:46:44] [INFO ] Parsed PT model containing 833 places and 1106 transitions and 2980 arcs in 195 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 124 places in 10 ms
Reduce places removed 124 places and 197 transitions.
FORMULA CO4-PT-15-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA CO4-PT-15-UpperBounds-08 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, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 909 rows 709 cols
[2025-05-30 10:46:44] [INFO ] Computed 12 invariants in 43 ms
Current structural bounds on expressions (after invariants) : Max Seen:[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]
RANDOM walk for 10000 steps (224 resets) in 45 ms. (217 steps per ms)
FORMULA CO4-PT-15-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-15-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-15-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-15-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-15-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-15-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-15-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70005 steps (249 resets) in 65 ms. (1060 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2025-05-30 10:46:44] [INFO ] Invariant cache hit.
[2025-05-30 10:46:45] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2025-05-30 10:46:45] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 5 ms returned sat
[2025-05-30 10:46:45] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2025-05-30 10:46:45] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 69 ms.
[2025-05-30 10:46:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 20 ms returned sat
[2025-05-30 10:46:45] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:46:46] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2025-05-30 10:46:46] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 60 ms.
[2025-05-30 10:46:47] [INFO ] Added : 92 causal constraints over 19 iterations in 928 ms. Result :sat
Minimization took 762 ms.
[2025-05-30 10:46:48] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2025-05-30 10:46:48] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:46:48] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2025-05-30 10:46:48] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 60 ms.
[2025-05-30 10:46:48] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 16 ms returned sat
[2025-05-30 10:46:48] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:46:48] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2025-05-30 10:46:48] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 69 ms.
[2025-05-30 10:46:49] [INFO ] Added : 94 causal constraints over 19 iterations in 949 ms. Result :sat
Minimization took 659 ms.
[2025-05-30 10:46:50] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2025-05-30 10:46:50] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:46:50] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2025-05-30 10:46:50] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 56 ms.
[2025-05-30 10:46:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2025-05-30 10:46:51] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 4 ms returned sat
[2025-05-30 10:46:51] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2025-05-30 10:46:51] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 46 ms.
[2025-05-30 10:46:52] [INFO ] Added : 83 causal constraints over 17 iterations in 789 ms. Result :sat
Minimization took 786 ms.
[2025-05-30 10:46:53] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2025-05-30 10:46:53] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:46:53] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2025-05-30 10:46:53] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 46 ms.
[2025-05-30 10:46:53] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2025-05-30 10:46:53] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:46:53] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2025-05-30 10:46:53] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 53 ms.
[2025-05-30 10:46:54] [INFO ] Added : 83 causal constraints over 17 iterations in 831 ms. Result :sat
Minimization took 726 ms.
[2025-05-30 10:46:55] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2025-05-30 10:46:55] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:46:55] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2025-05-30 10:46:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 16 ms returned sat
[2025-05-30 10:46:55] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:46:56] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2025-05-30 10:46:56] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 50 ms.
[2025-05-30 10:46:57] [INFO ] Added : 118 causal constraints over 24 iterations in 1130 ms. Result :sat
Minimization took 676 ms.
[2025-05-30 10:46:58] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2025-05-30 10:46:58] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-30 10:46:58] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2025-05-30 10:46:58] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 49 ms.
[2025-05-30 10:46:58] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2025-05-30 10:46:58] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:46:58] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2025-05-30 10:46:58] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 44 ms.
[2025-05-30 10:46:59] [INFO ] Deduced a trap composed of 16 places in 200 ms of which 40 ms to minimize.
[2025-05-30 10:47:00] [INFO ] Deduced a trap composed of 208 places in 170 ms of which 4 ms to minimize.
[2025-05-30 10:47:00] [INFO ] Deduced a trap composed of 219 places in 153 ms of which 4 ms to minimize.
[2025-05-30 10:47:00] [INFO ] Deduced a trap composed of 53 places in 160 ms of which 3 ms to minimize.
[2025-05-30 10:47:00] [INFO ] Deduced a trap composed of 339 places in 148 ms of which 3 ms to minimize.
[2025-05-30 10:47:00] [INFO ] Deduced a trap composed of 330 places in 145 ms of which 2 ms to minimize.
[2025-05-30 10:47:00] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1257 ms
[2025-05-30 10:47:00] [INFO ] Added : 90 causal constraints over 18 iterations in 2146 ms. Result :sat
Minimization took 740 ms.
[2025-05-30 10:47:01] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2025-05-30 10:47:01] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:47:02] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2025-05-30 10:47:02] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 48 ms.
[2025-05-30 10:47:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2025-05-30 10:47:02] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:47:02] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2025-05-30 10:47:02] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 51 ms.
[2025-05-30 10:47:03] [INFO ] Added : 91 causal constraints over 19 iterations in 918 ms. Result :sat
Minimization took 627 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 709 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 709/709 places, 909/909 transitions.
Graph (trivial) has 725 edges and 709 vertex of which 2 / 709 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1304 edges and 708 vertex of which 657 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.3 ms
Discarding 51 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 transitions
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 343 transitions
Trivial Post-agglo rules discarded 343 transitions
Performed 343 trivial Post agglomeration. Transition count delta: 343
Iterating post reduction 0 with 373 rules applied. Total rules applied 375 place count 657 transition count 511
Reduce places removed 343 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 372 rules applied. Total rules applied 747 place count 314 transition count 482
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 28 rules applied. Total rules applied 775 place count 301 transition count 467
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 8 rules applied. Total rules applied 783 place count 298 transition count 462
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 6 rules applied. Total rules applied 789 place count 296 transition count 458
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 5 with 9 rules applied. Total rules applied 798 place count 294 transition count 451
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 804 place count 289 transition count 450
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 804 place count 289 transition count 449
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 806 place count 288 transition count 449
Discarding 45 places :
Symmetric choice reduction at 7 with 45 rule applications. Total rules 851 place count 243 transition count 404
Iterating global reduction 7 with 45 rules applied. Total rules applied 896 place count 243 transition count 404
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 13 Pre rules applied. Total rules applied 896 place count 243 transition count 391
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 922 place count 230 transition count 391
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 950 place count 202 transition count 347
Iterating global reduction 7 with 28 rules applied. Total rules applied 978 place count 202 transition count 347
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 983 place count 202 transition count 342
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 987 place count 198 transition count 337
Iterating global reduction 8 with 4 rules applied. Total rules applied 991 place count 198 transition count 337
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 995 place count 198 transition count 333
Performed 75 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 9 with 150 rules applied. Total rules applied 1145 place count 123 transition count 248
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1148 place count 123 transition count 245
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 10 with 74 rules applied. Total rules applied 1222 place count 86 transition count 284
Drop transitions (Empty/Sink Transition effects.) removed 37 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 10 with 57 rules applied. Total rules applied 1279 place count 86 transition count 227
Discarding 26 places :
Symmetric choice reduction at 11 with 26 rule applications. Total rules 1305 place count 60 transition count 149
Iterating global reduction 11 with 26 rules applied. Total rules applied 1331 place count 60 transition count 149
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 11 with 18 rules applied. Total rules applied 1349 place count 60 transition count 131
Discarding 5 places :
Symmetric choice reduction at 12 with 5 rule applications. Total rules 1354 place count 55 transition count 106
Iterating global reduction 12 with 5 rules applied. Total rules applied 1359 place count 55 transition count 106
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 1363 place count 55 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1365 place count 54 transition count 119
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1367 place count 54 transition count 117
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 14 with 9 rules applied. Total rules applied 1376 place count 54 transition count 108
Free-agglomeration rule applied 9 times.
Iterating global reduction 14 with 9 rules applied. Total rules applied 1385 place count 54 transition count 99
Reduce places removed 9 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 11 rules applied. Total rules applied 1396 place count 45 transition count 97
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1397 place count 45 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1398 place count 44 transition count 96
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t511.t836 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 21 edges and 40 vertex of which 4 / 40 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 15 with 4 rules applied. Total rules applied 1402 place count 37 transition count 93
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (trivial) has 20 edges and 35 vertex of which 5 / 35 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 10 rules applied. Total rules applied 1412 place count 31 transition count 86
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 17 with 21 rules applied. Total rules applied 1433 place count 31 transition count 65
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 1434 place count 30 transition count 63
Iterating global reduction 18 with 1 rules applied. Total rules applied 1435 place count 30 transition count 63
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 18 with 9 rules applied. Total rules applied 1444 place count 30 transition count 54
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 1445 place count 29 transition count 52
Iterating global reduction 18 with 1 rules applied. Total rules applied 1446 place count 29 transition count 52
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 18 with 3 rules applied. Total rules applied 1449 place count 29 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 1450 place count 29 transition count 48
Free-agglomeration rule applied 3 times.
Iterating global reduction 19 with 3 rules applied. Total rules applied 1453 place count 29 transition count 45
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 19 with 3 rules applied. Total rules applied 1456 place count 26 transition count 45
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 20 with 3 rules applied. Total rules applied 1459 place count 26 transition count 42
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 20 with 3 rules applied. Total rules applied 1462 place count 26 transition count 42
Applied a total of 1462 rules in 178 ms. Remains 26 /709 variables (removed 683) and now considering 42/909 (removed 867) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 26/709 places, 42/909 transitions.
[2025-05-30 10:47:04] [INFO ] Flow matrix only has 41 transitions (discarded 1 similar events)
// Phase 1: matrix 41 rows 26 cols
[2025-05-30 10:47:04] [INFO ] Computed 6 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 896 ms. (1114 steps per ms)
FORMULA CO4-PT-15-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-15-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-15-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-15-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-15-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-15-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-15-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 249 ms. (4000 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-05-30 10:47:05] [INFO ] Flatten gal took : 24 ms
[2025-05-30 10:47:05] [INFO ] Flatten gal took : 6 ms
[2025-05-30 10:47:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2647773639590240471.gal : 5 ms
[2025-05-30 10:47:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2781587209605384663.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/ReachabilityCardinality2647773639590240471.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2781587209605384663.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

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 21376 ms.

BK_STOP 1748602025780

--------------------
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="CO4-PT-15"
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 CO4-PT-15, 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 r055-tall-174854041300062"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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