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

About the Execution of 2024-gold for Philosophers-COL-000200

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15680.040 79504.00 91514.00 381.10 200 200 200 200 200 200 200 200 200 100 200 100 200 100 200 200 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.r167-tall-174881266000006.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 Philosophers-COL-000200, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-174881266000006
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 18K 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 Philosophers-COL-000200-UpperBounds-00
FORMULA_NAME Philosophers-COL-000200-UpperBounds-01
FORMULA_NAME Philosophers-COL-000200-UpperBounds-02
FORMULA_NAME Philosophers-COL-000200-UpperBounds-03
FORMULA_NAME Philosophers-COL-000200-UpperBounds-04
FORMULA_NAME Philosophers-COL-000200-UpperBounds-05
FORMULA_NAME Philosophers-COL-000200-UpperBounds-06
FORMULA_NAME Philosophers-COL-000200-UpperBounds-07
FORMULA_NAME Philosophers-COL-000200-UpperBounds-08
FORMULA_NAME Philosophers-COL-000200-UpperBounds-09
FORMULA_NAME Philosophers-COL-000200-UpperBounds-10
FORMULA_NAME Philosophers-COL-000200-UpperBounds-11
FORMULA_NAME Philosophers-COL-000200-UpperBounds-12
FORMULA_NAME Philosophers-COL-000200-UpperBounds-13
FORMULA_NAME Philosophers-COL-000200-UpperBounds-14
FORMULA_NAME Philosophers-COL-000200-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748889070239

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-000200
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-02 18:31:11] [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 18:31:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 18:31:11] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-02 18:31:11] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 18:31:12] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 562 ms
[2025-06-02 18:31:12] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 1000 PT places and 1000.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Reduction of identical properties reduced properties to check from 16 to 5
[2025-06-02 18:31:12] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 4 ms.
[2025-06-02 18:31:12] [INFO ] Skeletonized 5 HLPN properties in 0 ms.
// Phase 1: matrix 5 rows 5 cols
[2025-06-02 18:31:12] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 200, 200, 0, 0] Max Struct:[200, 200, 200, 100, 200]
FORMULA Philosophers-COL-000200-UpperBounds-10 200 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000200-UpperBounds-14 200 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000200-UpperBounds-02 200 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000200-UpperBounds-03 200 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000200-UpperBounds-04 200 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000200-UpperBounds-06 200 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000200-UpperBounds-07 200 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000200-UpperBounds-08 200 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000200-UpperBounds-01 200 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-02 18:31:12] [INFO ] Invariant cache hit.
[2025-06-02 18:31:12] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-02 18:31:12] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-02 18:31:12] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 18:31:12] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Minimization took 8 ms.
[2025-06-02 18:31:12] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 18:31:12] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-02 18:31:12] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 18:31:12] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2025-06-02 18:31:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 18:31:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 18:31:12] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-02 18:31:12] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 18:31:12] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 2 ms.
[2025-06-02 18:31:12] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 18:31:12] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-02 18:31:12] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 18:31:12] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0] Max Struct:[200, 100, 200]
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 200) 200) 200)]] contains successor/predecessor on variables of sort Philo
[2025-06-02 18:31:12] [INFO ] Unfolded HLPN to a Petri net with 1000 places and 1000 transitions 3200 arcs in 47 ms.
[2025-06-02 18:31:12] [INFO ] Unfolded 3 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0] Max Struct:[200, 100, 200]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[200, 100, 200]
// Phase 1: matrix 1000 rows 1000 cols
[2025-06-02 18:31:12] [INFO ] Computed 400 invariants in 24 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[200, 100, 200]
RANDOM walk for 10000 steps (2 resets) in 328 ms. (30 steps per ms)
BEST_FIRST walk for 30003 steps (6 resets) in 354 ms. (84 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[144, 35, 126] Max Struct:[200, 100, 200]
[2025-06-02 18:31:13] [INFO ] Invariant cache hit.
[2025-06-02 18:31:13] [INFO ] [Real]Absence check using 400 positive place invariants in 122 ms returned sat
[2025-06-02 18:31:13] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2025-06-02 18:31:14] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 61 ms.
[2025-06-02 18:31:14] [INFO ] Added : 10 causal constraints over 2 iterations in 279 ms. Result :sat
Minimization took 158 ms.
[2025-06-02 18:31:14] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 18:31:14] [INFO ] [Nat]Absence check using 400 positive place invariants in 79 ms returned sat
[2025-06-02 18:31:15] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2025-06-02 18:31:15] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 51 ms.
[2025-06-02 18:31:15] [INFO ] Added : 10 causal constraints over 2 iterations in 249 ms. Result :sat
Minimization took 165 ms.
[2025-06-02 18:31:15] [INFO ] [Real]Absence check using 400 positive place invariants in 63 ms returned sat
[2025-06-02 18:31:16] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2025-06-02 18:31:16] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 51 ms.
[2025-06-02 18:31:16] [INFO ] Added : 36 causal constraints over 8 iterations in 559 ms. Result :sat
Minimization took 155 ms.
[2025-06-02 18:31:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 18:31:17] [INFO ] [Nat]Absence check using 400 positive place invariants in 66 ms returned sat
[2025-06-02 18:31:17] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2025-06-02 18:31:17] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 47 ms.
[2025-06-02 18:31:17] [INFO ] Added : 36 causal constraints over 8 iterations in 488 ms. Result :sat
Minimization took 124 ms.
[2025-06-02 18:31:18] [INFO ] [Real]Absence check using 400 positive place invariants in 77 ms returned sat
[2025-06-02 18:31:18] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
[2025-06-02 18:31:18] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 54 ms.
[2025-06-02 18:31:18] [INFO ] Added : 14 causal constraints over 3 iterations in 282 ms. Result :sat
Minimization took 130 ms.
[2025-06-02 18:31:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 18:31:19] [INFO ] [Nat]Absence check using 400 positive place invariants in 86 ms returned sat
[2025-06-02 18:31:19] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2025-06-02 18:31:19] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 61 ms.
[2025-06-02 18:31:19] [INFO ] Added : 14 causal constraints over 3 iterations in 270 ms. Result :sat
Minimization took 124 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[144, 35, 126] Max Struct:[200, 100, 200]
FORMULA Philosophers-COL-000200-UpperBounds-15 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[200, 95] Max Struct:[200, 100]
Support contains 400 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Free-agglomeration rule (complex) applied 200 times.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 1000 transition count 800
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 0 with 200 rules applied. Total rules applied 400 place count 800 transition count 800
Applied a total of 400 rules in 187 ms. Remains 800 /1000 variables (removed 200) and now considering 800/1000 (removed 200) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 800/1000 places, 800/1000 transitions.
// Phase 1: matrix 800 rows 800 cols
[2025-06-02 18:31:22] [INFO ] Computed 400 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[200, 95] Max Struct:[200, 100]
FORMULA Philosophers-COL-000200-UpperBounds-05 200 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000200-UpperBounds-12 200 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000200-UpperBounds-00 200 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (1138 resets) in 19338 ms. (51 steps per ms)
BEST_FIRST walk for 645567 steps (1 resets) in 5001 ms. (129 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[95] Max Struct:[100]
[2025-06-02 18:31:46] [INFO ] Invariant cache hit.
[2025-06-02 18:31:47] [INFO ] [Real]Absence check using 400 positive place invariants in 79 ms returned sat
[2025-06-02 18:31:47] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2025-06-02 18:31:47] [INFO ] Computed and/alt/rep : 400/600/400 causal constraints (skipped 0 transitions) in 38 ms.
[2025-06-02 18:31:48] [INFO ] Added : 55 causal constraints over 11 iterations in 550 ms. Result :sat
Minimization took 114 ms.
[2025-06-02 18:31:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 18:31:48] [INFO ] [Nat]Absence check using 400 positive place invariants in 76 ms returned sat
[2025-06-02 18:31:48] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2025-06-02 18:31:48] [INFO ] Computed and/alt/rep : 400/600/400 causal constraints (skipped 0 transitions) in 48 ms.
[2025-06-02 18:31:49] [INFO ] Added : 55 causal constraints over 11 iterations in 509 ms. Result :sat
Minimization took 112 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[95] Max Struct:[100]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[96] Max Struct:[100]
Support contains 200 out of 800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 800/800 places, 800/800 transitions.
Free-agglomeration rule (complex) applied 200 times.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 800 transition count 600
Reduce places removed 200 places and 0 transitions.
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 0 with 400 rules applied. Total rules applied 600 place count 600 transition count 400
Applied a total of 600 rules in 54 ms. Remains 600 /800 variables (removed 200) and now considering 400/800 (removed 400) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 600/800 places, 400/800 transitions.
// Phase 1: matrix 400 rows 600 cols
[2025-06-02 18:31:49] [INFO ] Computed 400 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[96] Max Struct:[100]
RANDOM walk for 1000000 steps (2 resets) in 22452 ms. (44 steps per ms)
BEST_FIRST walk for 677151 steps (2 resets) in 5001 ms. (135 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[98] Max Struct:[100]
[2025-06-02 18:32:17] [INFO ] Invariant cache hit.
[2025-06-02 18:32:17] [INFO ] [Real]Absence check using 400 positive place invariants in 64 ms returned sat
[2025-06-02 18:32:17] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2025-06-02 18:32:17] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 19 ms.
[2025-06-02 18:32:17] [INFO ] Added : 0 causal constraints over 0 iterations in 51 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[98] Max Struct:[100]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[100] Max Struct:[100]
Support contains 200 out of 600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 600/600 places, 400/400 transitions.
Applied a total of 0 rules in 9 ms. Remains 600 /600 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 600/600 places, 400/400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 600/600 places, 400/400 transitions.
Applied a total of 0 rules in 8 ms. Remains 600 /600 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2025-06-02 18:32:17] [INFO ] Invariant cache hit.
[2025-06-02 18:32:18] [INFO ] Implicit Places using invariants in 363 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199]
Discarding 200 places :
Implicit Place search using SMT only with invariants took 368 ms to find 200 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 400/600 places, 400/400 transitions.
Applied a total of 0 rules in 6 ms. Remains 400 /400 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 385 ms. Remains : 400/600 places, 400/400 transitions.
// Phase 1: matrix 400 rows 400 cols
[2025-06-02 18:32:18] [INFO ] Computed 200 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[100] Max Struct:[100]
FORMULA Philosophers-COL-000200-UpperBounds-11 100 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000200-UpperBounds-13 100 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000200-UpperBounds-09 100 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 11052 ms. (90 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 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 18:32:29] [INFO ] Flatten gal took : 56 ms
[2025-06-02 18:32:29] [INFO ] Flatten gal took : 31 ms
[2025-06-02 18:32:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11568412084462296399.gal : 14 ms
[2025-06-02 18:32:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11009626390828302000.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/ReachabilityCardinality11568412084462296399.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11009626390828302000.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 78269 ms.

BK_STOP 1748889149743

--------------------
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="Philosophers-COL-000200"
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 Philosophers-COL-000200, 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 r167-tall-174881266000006"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000200.tgz
mv Philosophers-COL-000200 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 ;