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.r139-smll-174876533200035.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 MedleyA-PT-23, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-smll-174876533200035
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 150K 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 MedleyA-PT-23-UpperBounds-00
FORMULA_NAME MedleyA-PT-23-UpperBounds-01
FORMULA_NAME MedleyA-PT-23-UpperBounds-02
FORMULA_NAME MedleyA-PT-23-UpperBounds-03
FORMULA_NAME MedleyA-PT-23-UpperBounds-04
FORMULA_NAME MedleyA-PT-23-UpperBounds-05
FORMULA_NAME MedleyA-PT-23-UpperBounds-06
FORMULA_NAME MedleyA-PT-23-UpperBounds-07
FORMULA_NAME MedleyA-PT-23-UpperBounds-08
FORMULA_NAME MedleyA-PT-23-UpperBounds-09
FORMULA_NAME MedleyA-PT-23-UpperBounds-10
FORMULA_NAME MedleyA-PT-23-UpperBounds-11
FORMULA_NAME MedleyA-PT-23-UpperBounds-12
FORMULA_NAME MedleyA-PT-23-UpperBounds-13
FORMULA_NAME MedleyA-PT-23-UpperBounds-14
FORMULA_NAME MedleyA-PT-23-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748896447974

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-23
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 20:34: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 20:34:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 20:34:11] [INFO ] Load time of PNML (sax parser for PT used): 222 ms
[2025-06-02 20:34:11] [INFO ] Transformed 378 places.
[2025-06-02 20:34:11] [INFO ] Transformed 614 transitions.
[2025-06-02 20:34:11] [INFO ] Found NUPN structural information;
[2025-06-02 20:34:11] [INFO ] Parsed PT model containing 378 places and 614 transitions and 1969 arcs in 674 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
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]
// Phase 1: matrix 614 rows 378 cols
[2025-06-02 20:34:11] [INFO ] Computed 11 invariants in 45 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 (4 resets) in 119 ms. (83 steps per ms)
FORMULA MedleyA-PT-23-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-23-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-23-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-23-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-23-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-23-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-23-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-23-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-23-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-23-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-23-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50002 steps (48 resets) in 203 ms. (245 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2025-06-02 20:34:11] [INFO ] Invariant cache hit.
[2025-06-02 20:34:12] [INFO ] [Real]Absence check using 9 positive place invariants in 22 ms returned sat
[2025-06-02 20:34:12] [INFO ] [Real]Absence check using 9 positive and 2 generalized place invariants in 9 ms returned sat
[2025-06-02 20:34:12] [INFO ] [Real]Absence check using state equation in 484 ms returned sat
[2025-06-02 20:34:13] [INFO ] Deduced a trap composed of 84 places in 310 ms of which 20 ms to minimize.
[2025-06-02 20:34:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:34:13] [INFO ] [Nat]Absence check using 9 positive place invariants in 18 ms returned sat
[2025-06-02 20:34:13] [INFO ] [Nat]Absence check using 9 positive and 2 generalized place invariants in 7 ms returned sat
[2025-06-02 20:34:14] [INFO ] [Nat]Absence check using state equation in 367 ms returned sat
[2025-06-02 20:34:14] [INFO ] Deduced a trap composed of 84 places in 149 ms of which 15 ms to minimize.
[2025-06-02 20:34:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2025-06-02 20:34:14] [INFO ] Computed and/alt/rep : 509/1869/509 causal constraints (skipped 104 transitions) in 79 ms.
[2025-06-02 20:34:16] [INFO ] Added : 174 causal constraints over 35 iterations in 2233 ms. Result :sat
Minimization took 480 ms.
[2025-06-02 20:34:17] [INFO ] [Real]Absence check using 9 positive place invariants in 16 ms returned sat
[2025-06-02 20:34:17] [INFO ] [Real]Absence check using 9 positive and 2 generalized place invariants in 7 ms returned sat
[2025-06-02 20:34:17] [INFO ] [Real]Absence check using state equation in 337 ms returned sat
[2025-06-02 20:34:17] [INFO ] Computed and/alt/rep : 509/1869/509 causal constraints (skipped 104 transitions) in 105 ms.
[2025-06-02 20:34:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:34:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 18 ms returned sat
[2025-06-02 20:34:18] [INFO ] [Nat]Absence check using 9 positive and 2 generalized place invariants in 6 ms returned sat
[2025-06-02 20:34:18] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2025-06-02 20:34:18] [INFO ] Computed and/alt/rep : 509/1869/509 causal constraints (skipped 104 transitions) in 99 ms.
[2025-06-02 20:34:20] [INFO ] Added : 163 causal constraints over 33 iterations in 2256 ms. Result :sat
Minimization took 477 ms.
[2025-06-02 20:34:21] [INFO ] [Real]Absence check using 9 positive place invariants in 16 ms returned sat
[2025-06-02 20:34:21] [INFO ] [Real]Absence check using 9 positive and 2 generalized place invariants in 7 ms returned sat
[2025-06-02 20:34:21] [INFO ] [Real]Absence check using state equation in 337 ms returned sat
[2025-06-02 20:34:21] [INFO ] Computed and/alt/rep : 509/1869/509 causal constraints (skipped 104 transitions) in 81 ms.
[2025-06-02 20:34:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:34:22] [INFO ] [Nat]Absence check using 9 positive place invariants in 19 ms returned sat
[2025-06-02 20:34:22] [INFO ] [Nat]Absence check using 9 positive and 2 generalized place invariants in 6 ms returned sat
[2025-06-02 20:34:22] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2025-06-02 20:34:22] [INFO ] Computed and/alt/rep : 509/1869/509 causal constraints (skipped 104 transitions) in 76 ms.
[2025-06-02 20:34:24] [INFO ] Added : 154 causal constraints over 31 iterations in 1743 ms. Result :sat
Minimization took 454 ms.
[2025-06-02 20:34:25] [INFO ] [Real]Absence check using 9 positive place invariants in 17 ms returned sat
[2025-06-02 20:34:25] [INFO ] [Real]Absence check using 9 positive and 2 generalized place invariants in 6 ms returned sat
[2025-06-02 20:34:25] [INFO ] [Real]Absence check using state equation in 331 ms returned sat
[2025-06-02 20:34:25] [INFO ] Deduced a trap composed of 19 places in 309 ms of which 5 ms to minimize.
[2025-06-02 20:34:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:34:26] [INFO ] [Nat]Absence check using 9 positive place invariants in 18 ms returned sat
[2025-06-02 20:34:26] [INFO ] [Nat]Absence check using 9 positive and 2 generalized place invariants in 5 ms returned sat
[2025-06-02 20:34:26] [INFO ] [Nat]Absence check using state equation in 338 ms returned sat
[2025-06-02 20:34:26] [INFO ] Deduced a trap composed of 19 places in 327 ms of which 5 ms to minimize.
[2025-06-02 20:34:27] [INFO ] Deduced a trap composed of 66 places in 271 ms of which 5 ms to minimize.
[2025-06-02 20:34:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 704 ms
[2025-06-02 20:34:27] [INFO ] Computed and/alt/rep : 509/1869/509 causal constraints (skipped 104 transitions) in 85 ms.
[2025-06-02 20:34:28] [INFO ] Added : 173 causal constraints over 35 iterations in 1764 ms. Result :sat
Minimization took 335 ms.
[2025-06-02 20:34:29] [INFO ] [Real]Absence check using 9 positive place invariants in 19 ms returned sat
[2025-06-02 20:34:29] [INFO ] [Real]Absence check using 9 positive and 2 generalized place invariants in 6 ms returned sat
[2025-06-02 20:34:29] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2025-06-02 20:34:30] [INFO ] Deduced a trap composed of 19 places in 195 ms of which 4 ms to minimize.
[2025-06-02 20:34:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:34:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 19 ms returned sat
[2025-06-02 20:34:30] [INFO ] [Nat]Absence check using 9 positive and 2 generalized place invariants in 6 ms returned sat
[2025-06-02 20:34:30] [INFO ] [Nat]Absence check using state equation in 332 ms returned sat
[2025-06-02 20:34:30] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 2 ms to minimize.
[2025-06-02 20:34:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2025-06-02 20:34:30] [INFO ] Computed and/alt/rep : 509/1869/509 causal constraints (skipped 104 transitions) in 46 ms.
[2025-06-02 20:34:32] [INFO ] Added : 173 causal constraints over 35 iterations in 1574 ms. Result :sat
Minimization took 324 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA MedleyA-PT-23-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-23-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-23-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 614/614 transitions.
Graph (trivial) has 334 edges and 378 vertex of which 39 / 378 are part of one of the 3 SCC in 9 ms
Free SCC test removed 36 places
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (complete) has 1035 edges and 342 vertex of which 339 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 117 rules applied. Total rules applied 119 place count 339 transition count 449
Reduce places removed 114 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 225 transition count 445
Discarding 73 places :
Symmetric choice reduction at 2 with 73 rule applications. Total rules 310 place count 152 transition count 372
Iterating global reduction 2 with 73 rules applied. Total rules applied 383 place count 152 transition count 372
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 383 place count 152 transition count 362
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 403 place count 142 transition count 362
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 406 place count 142 transition count 359
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 440 place count 108 transition count 257
Iterating global reduction 3 with 34 rules applied. Total rules applied 474 place count 108 transition count 257
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 3 with 15 rules applied. Total rules applied 489 place count 108 transition count 242
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 495 place count 105 transition count 239
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 497 place count 103 transition count 235
Iterating global reduction 5 with 2 rules applied. Total rules applied 499 place count 103 transition count 235
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 501 place count 101 transition count 229
Iterating global reduction 5 with 2 rules applied. Total rules applied 503 place count 101 transition count 229
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 505 place count 101 transition count 227
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 533 place count 87 transition count 213
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 553 place count 77 transition count 229
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 562 place count 77 transition count 220
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 565 place count 74 transition count 211
Iterating global reduction 6 with 3 rules applied. Total rules applied 568 place count 74 transition count 211
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 571 place count 74 transition count 208
Free-agglomeration rule applied 20 times.
Iterating global reduction 7 with 20 rules applied. Total rules applied 591 place count 74 transition count 188
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 29 rules applied. Total rules applied 620 place count 54 transition count 179
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 626 place count 51 transition count 176
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 627 place count 50 transition count 175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 628 place count 49 transition count 175
Applied a total of 628 rules in 267 ms. Remains 49 /378 variables (removed 329) and now considering 175/614 (removed 439) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 287 ms. Remains : 49/378 places, 175/614 transitions.
[2025-06-02 20:34:33] [INFO ] Flow matrix only has 169 transitions (discarded 6 similar events)
// Phase 1: matrix 169 rows 49 cols
[2025-06-02 20:34:33] [INFO ] Computed 10 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (13563 resets) in 2529 ms. (395 steps per ms)
FORMULA MedleyA-PT-23-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-23-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (1389 resets) in 682 ms. (1464 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-02 20:34:37] [INFO ] Flatten gal took : 105 ms
[2025-06-02 20:34:37] [INFO ] Flatten gal took : 37 ms
[2025-06-02 20:34:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7682124253203254314.gal : 24 ms
[2025-06-02 20:34:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1076589749783730174.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/ReachabilityCardinality7682124253203254314.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1076589749783730174.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 26966 ms.

BK_STOP 1748896477580

--------------------
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="MedleyA-PT-23"
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 MedleyA-PT-23, 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 r139-smll-174876533200035"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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