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.r013-tall-174853743000037.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 ASLink-PT-01b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r013-tall-174853743000037
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 736K
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 293K 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 ASLink-PT-01b-UpperBounds-00
FORMULA_NAME ASLink-PT-01b-UpperBounds-01
FORMULA_NAME ASLink-PT-01b-UpperBounds-02
FORMULA_NAME ASLink-PT-01b-UpperBounds-03
FORMULA_NAME ASLink-PT-01b-UpperBounds-04
FORMULA_NAME ASLink-PT-01b-UpperBounds-05
FORMULA_NAME ASLink-PT-01b-UpperBounds-06
FORMULA_NAME ASLink-PT-01b-UpperBounds-07
FORMULA_NAME ASLink-PT-01b-UpperBounds-08
FORMULA_NAME ASLink-PT-01b-UpperBounds-09
FORMULA_NAME ASLink-PT-01b-UpperBounds-10
FORMULA_NAME ASLink-PT-01b-UpperBounds-11
FORMULA_NAME ASLink-PT-01b-UpperBounds-12
FORMULA_NAME ASLink-PT-01b-UpperBounds-13
FORMULA_NAME ASLink-PT-01b-UpperBounds-14
FORMULA_NAME ASLink-PT-01b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748540231159

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-01b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 17:37:12] [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-29 17:37:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 17:37:12] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2025-05-29 17:37:12] [INFO ] Transformed 846 places.
[2025-05-29 17:37:12] [INFO ] Transformed 1148 transitions.
[2025-05-29 17:37:12] [INFO ] Found NUPN structural information;
[2025-05-29 17:37:12] [INFO ] Parsed PT model containing 846 places and 1148 transitions and 3624 arcs in 219 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 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 1148 rows 846 cols
[2025-05-29 17:37:12] [INFO ] Computed 82 invariants in 77 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 (51 resets) in 41 ms. (238 steps per ms)
FORMULA ASLink-PT-01b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10001 steps (16 resets) in 14 ms. (666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-29 17:37:12] [INFO ] Invariant cache hit.
[2025-05-29 17:37:13] [INFO ] [Real]Absence check using 19 positive place invariants in 19 ms returned sat
[2025-05-29 17:37:13] [INFO ] [Real]Absence check using 19 positive and 63 generalized place invariants in 20 ms returned sat
[2025-05-29 17:37:13] [INFO ] [Real]Absence check using state equation in 393 ms returned sat
[2025-05-29 17:37:13] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:37:13] [INFO ] [Nat]Absence check using 19 positive place invariants in 15 ms returned sat
[2025-05-29 17:37:13] [INFO ] [Nat]Absence check using 19 positive and 63 generalized place invariants in 17 ms returned sat
[2025-05-29 17:37:14] [INFO ] [Nat]Absence check using state equation in 648 ms returned sat
[2025-05-29 17:37:14] [INFO ] Deduced a trap composed of 14 places in 317 ms of which 39 ms to minimize.
[2025-05-29 17:37:15] [INFO ] Deduced a trap composed of 177 places in 268 ms of which 6 ms to minimize.
[2025-05-29 17:37:15] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 4 ms to minimize.
[2025-05-29 17:37:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1080 ms
[2025-05-29 17:37:15] [INFO ] Computed and/alt/rep : 932/2112/932 causal constraints (skipped 215 transitions) in 74 ms.
Maximisation of solution failed !
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 846 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p456) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 846/846 places, 1147/1147 transitions.
Graph (complete) has 2175 edges and 846 vertex of which 844 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Graph (complete) has 2169 edges and 842 vertex of which 841 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 188 transitions
Trivial Post-agglo rules discarded 188 transitions
Performed 188 trivial Post agglomeration. Transition count delta: 188
Iterating post reduction 0 with 191 rules applied. Total rules applied 192 place count 841 transition count 956
Reduce places removed 189 places and 1 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 1 with 199 rules applied. Total rules applied 391 place count 652 transition count 945
Reduce places removed 4 places and 1 transitions.
Graph (complete) has 1969 edges and 648 vertex of which 646 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 397 place count 646 transition count 942
Reduce places removed 3 places and 2 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 400 place count 643 transition count 940
Performed 187 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 187 Pre rules applied. Total rules applied 400 place count 643 transition count 753
Deduced a syphon composed of 187 places in 3 ms
Ensure Unique test removed 12 places
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 4 with 386 rules applied. Total rules applied 786 place count 444 transition count 753
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 4 with 10 rules applied. Total rules applied 796 place count 443 transition count 744
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 805 place count 434 transition count 744
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 805 place count 434 transition count 740
Deduced a syphon composed of 4 places in 3 ms
Ensure Unique test removed 4 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 817 place count 426 transition count 740
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 817 place count 426 transition count 736
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 825 place count 422 transition count 736
Discarding 23 places :
Symmetric choice reduction at 6 with 23 rule applications. Total rules 848 place count 399 transition count 713
Iterating global reduction 6 with 23 rules applied. Total rules applied 871 place count 399 transition count 713
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 872 place count 399 transition count 712
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 10 Pre rules applied. Total rules applied 872 place count 399 transition count 702
Deduced a syphon composed of 10 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 21 rules applied. Total rules applied 893 place count 388 transition count 702
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 893 place count 388 transition count 701
Deduced a syphon composed of 1 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 896 place count 386 transition count 701
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 898 place count 384 transition count 686
Iterating global reduction 7 with 2 rules applied. Total rules applied 900 place count 384 transition count 686
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 900 place count 384 transition count 685
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 902 place count 383 transition count 685
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 903 place count 382 transition count 677
Iterating global reduction 7 with 1 rules applied. Total rules applied 904 place count 382 transition count 677
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 905 place count 381 transition count 669
Iterating global reduction 7 with 1 rules applied. Total rules applied 906 place count 381 transition count 669
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 907 place count 380 transition count 661
Iterating global reduction 7 with 1 rules applied. Total rules applied 908 place count 380 transition count 661
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 909 place count 379 transition count 653
Iterating global reduction 7 with 1 rules applied. Total rules applied 910 place count 379 transition count 653
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 911 place count 378 transition count 645
Iterating global reduction 7 with 1 rules applied. Total rules applied 912 place count 378 transition count 645
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 913 place count 377 transition count 637
Iterating global reduction 7 with 1 rules applied. Total rules applied 914 place count 377 transition count 637
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 915 place count 376 transition count 629
Iterating global reduction 7 with 1 rules applied. Total rules applied 916 place count 376 transition count 629
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 917 place count 375 transition count 621
Iterating global reduction 7 with 1 rules applied. Total rules applied 918 place count 375 transition count 621
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 919 place count 374 transition count 613
Iterating global reduction 7 with 1 rules applied. Total rules applied 920 place count 374 transition count 613
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 921 place count 373 transition count 605
Iterating global reduction 7 with 1 rules applied. Total rules applied 922 place count 373 transition count 605
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 923 place count 372 transition count 597
Iterating global reduction 7 with 1 rules applied. Total rules applied 924 place count 372 transition count 597
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 925 place count 371 transition count 589
Iterating global reduction 7 with 1 rules applied. Total rules applied 926 place count 371 transition count 589
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 927 place count 370 transition count 581
Iterating global reduction 7 with 1 rules applied. Total rules applied 928 place count 370 transition count 581
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 929 place count 369 transition count 573
Iterating global reduction 7 with 1 rules applied. Total rules applied 930 place count 369 transition count 573
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 931 place count 368 transition count 565
Iterating global reduction 7 with 1 rules applied. Total rules applied 932 place count 368 transition count 565
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 933 place count 367 transition count 557
Iterating global reduction 7 with 1 rules applied. Total rules applied 934 place count 367 transition count 557
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 7 with 78 rules applied. Total rules applied 1012 place count 328 transition count 518
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1013 place count 327 transition count 517
Ensure Unique test removed 1 places
Iterating global reduction 7 with 2 rules applied. Total rules applied 1015 place count 326 transition count 517
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1016 place count 325 transition count 516
Iterating global reduction 7 with 1 rules applied. Total rules applied 1017 place count 325 transition count 516
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 1019 place count 325 transition count 514
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1020 place count 324 transition count 514
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1022 place count 323 transition count 523
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1024 place count 323 transition count 521
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1026 place count 321 transition count 521
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1027 place count 321 transition count 520
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1028 place count 320 transition count 520
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1029 place count 319 transition count 519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1030 place count 318 transition count 519
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 1030 place count 318 transition count 518
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1032 place count 317 transition count 518
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 12 with 1 rules applied. Total rules applied 1033 place count 316 transition count 518
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 1037 place count 314 transition count 516
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1038 place count 313 transition count 515
Iterating global reduction 13 with 1 rules applied. Total rules applied 1039 place count 313 transition count 515
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1040 place count 313 transition count 514
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 1041 place count 312 transition count 514
Applied a total of 1041 rules in 516 ms. Remains 312 /846 variables (removed 534) and now considering 514/1147 (removed 633) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 532 ms. Remains : 312/846 places, 514/1147 transitions.
// Phase 1: matrix 514 rows 312 cols
[2025-05-29 17:37:19] [INFO ] Computed 57 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (21432 resets) in 1295 ms. (771 steps per ms)
BEST_FIRST walk for 1000001 steps (9238 resets) in 681 ms. (1466 steps per ms)
FORMULA ASLink-PT-01b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
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-29 17:37:21] [INFO ] Flatten gal took : 77 ms
[2025-05-29 17:37:21] [INFO ] Flatten gal took : 36 ms
[2025-05-29 17:37:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1038309754668371064.gal : 20 ms
[2025-05-29 17:37:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11191710384844993441.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1038309754668371064.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11191710384844993441.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 9337 ms.

BK_STOP 1748540241710

--------------------
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="ASLink-PT-01b"
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 ASLink-PT-01b, 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 r013-tall-174853743000037"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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