fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r128-smll-174876524100165
Last Updated
June 24, 2025

About the Execution of ITS-Tools for MedleyA-PT-09

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 17947.00 0.00 0.00 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524100165.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 itstools
Input is MedleyA-PT-09, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524100165
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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 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 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K 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 99K 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-09-UpperBounds-00
FORMULA_NAME MedleyA-PT-09-UpperBounds-01
FORMULA_NAME MedleyA-PT-09-UpperBounds-02
FORMULA_NAME MedleyA-PT-09-UpperBounds-03
FORMULA_NAME MedleyA-PT-09-UpperBounds-04
FORMULA_NAME MedleyA-PT-09-UpperBounds-05
FORMULA_NAME MedleyA-PT-09-UpperBounds-06
FORMULA_NAME MedleyA-PT-09-UpperBounds-07
FORMULA_NAME MedleyA-PT-09-UpperBounds-08
FORMULA_NAME MedleyA-PT-09-UpperBounds-09
FORMULA_NAME MedleyA-PT-09-UpperBounds-10
FORMULA_NAME MedleyA-PT-09-UpperBounds-11
FORMULA_NAME MedleyA-PT-09-UpperBounds-12
FORMULA_NAME MedleyA-PT-09-UpperBounds-13
FORMULA_NAME MedleyA-PT-09-UpperBounds-14
FORMULA_NAME MedleyA-PT-09-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748855723031

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-02 09:15:25] [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 09:15:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 09:15:26] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2025-06-02 09:15:26] [INFO ] Transformed 147 places.
[2025-06-02 09:15:26] [INFO ] Transformed 315 transitions.
[2025-06-02 09:15:26] [INFO ] Found NUPN structural information;
[2025-06-02 09:15:26] [INFO ] Parsed PT model containing 147 places and 315 transitions and 1583 arcs in 586 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 2 transitions.
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 313 rows 145 cols
[2025-06-02 09:15:26] [INFO ] Computed 12 invariants in 28 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 (323 resets) in 97 ms. (102 steps per ms)
FORMULA MedleyA-PT-09-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-09-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-09-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-09-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-09-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-09-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-09-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-09-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-09-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-09-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-09-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-09-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-09-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30003 steps (226 resets) in 91 ms. (326 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-06-02 09:15:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 09:15:27] [INFO ] [Real]Absence check using 7 positive place invariants in 18 ms returned sat
[2025-06-02 09:15:27] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 6 ms returned sat
[2025-06-02 09:15:27] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2025-06-02 09:15:27] [INFO ] Computed and/alt/rep : 104/256/104 causal constraints (skipped 208 transitions) in 116 ms.
[2025-06-02 09:15:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 09:15:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 13 ms returned sat
[2025-06-02 09:15:28] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 6 ms returned sat
[2025-06-02 09:15:28] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2025-06-02 09:15:28] [INFO ] Computed and/alt/rep : 104/256/104 causal constraints (skipped 208 transitions) in 62 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:15:29] [INFO ] Deduced a trap composed of 21 places in 241 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:15:29] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:15:29] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 4 ms to minimize.
[2025-06-02 09:15:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 588 ms
[2025-06-02 09:15:29] [INFO ] Added : 73 causal constraints over 16 iterations in 1229 ms. Result :sat
Minimization took 247 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 09:15:29] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2025-06-02 09:15:29] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 6 ms returned sat
[2025-06-02 09:15:30] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2025-06-02 09:15:30] [INFO ] Computed and/alt/rep : 104/256/104 causal constraints (skipped 208 transitions) in 50 ms.
[2025-06-02 09:15:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 09:15:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2025-06-02 09:15:30] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 5 ms returned sat
[2025-06-02 09:15:30] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2025-06-02 09:15:30] [INFO ] Computed and/alt/rep : 104/256/104 causal constraints (skipped 208 transitions) in 57 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:15:31] [INFO ] Deduced a trap composed of 22 places in 246 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:15:31] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:15:31] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 6 ms to minimize.
[2025-06-02 09:15:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 626 ms
[2025-06-02 09:15:31] [INFO ] Added : 70 causal constraints over 14 iterations in 1249 ms. Result :sat
Minimization took 280 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 09:15:32] [INFO ] [Real]Absence check using 7 positive place invariants in 15 ms returned sat
[2025-06-02 09:15:32] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 18 ms returned sat
[2025-06-02 09:15:32] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2025-06-02 09:15:32] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 09:15:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2025-06-02 09:15:32] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 5 ms returned sat
[2025-06-02 09:15:32] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2025-06-02 09:15:32] [INFO ] Computed and/alt/rep : 104/256/104 causal constraints (skipped 208 transitions) in 47 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:15:33] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 23 ms to minimize.
[2025-06-02 09:15:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2025-06-02 09:15:33] [INFO ] Added : 69 causal constraints over 14 iterations in 845 ms. Result :sat
Minimization took 161 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
FORMULA MedleyA-PT-09-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0] Max Struct:[1, 1]
Support contains 2 out of 145 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 145/145 places, 313/313 transitions.
Graph (complete) has 480 edges and 145 vertex of which 140 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 140 transition count 284
Reduce places removed 25 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 1 with 29 rules applied. Total rules applied 56 place count 115 transition count 280
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 61 place count 113 transition count 277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 62 place count 112 transition count 277
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 62 place count 112 transition count 272
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 72 place count 107 transition count 272
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 101 place count 78 transition count 237
Iterating global reduction 4 with 29 rules applied. Total rules applied 130 place count 78 transition count 237
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 130 place count 78 transition count 235
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 134 place count 76 transition count 235
Performed 22 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 178 place count 54 transition count 211
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 180 place count 54 transition count 209
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 194 place count 47 transition count 238
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 208 place count 47 transition count 224
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 214 place count 47 transition count 218
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 220 place count 41 transition count 218
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 224 place count 41 transition count 214
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 226 place count 41 transition count 212
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 228 place count 39 transition count 212
Applied a total of 228 rules in 280 ms. Remains 39 /145 variables (removed 106) and now considering 212/313 (removed 101) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 298 ms. Remains : 39/145 places, 212/313 transitions.
[2025-06-02 09:15:34] [INFO ] Flow matrix only has 166 transitions (discarded 46 similar events)
// Phase 1: matrix 166 rows 39 cols
[2025-06-02 09:15:34] [INFO ] Computed 11 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0] Max Struct:[1, 1]
FORMULA MedleyA-PT-09-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (223023 resets) in 4765 ms. (209 steps per ms)
FORMULA MedleyA-PT-09-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (41571 resets) in 1061 ms. (941 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 09:15:40] [INFO ] Flatten gal took : 139 ms
[2025-06-02 09:15:40] [INFO ] Flatten gal took : 55 ms
[2025-06-02 09:15:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5437468059724464024.gal : 40 ms
[2025-06-02 09:15:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2929994470506960703.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5437468059724464024.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2929994470506960703.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
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 15265 ms.

BK_STOP 1748855740978

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-09"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is MedleyA-PT-09, 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 r128-smll-174876524100165"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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