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

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

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

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524200279.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-23, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524200279
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 150K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2025-00
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2025-01
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2025-02
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2025-03
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2025-04
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2025-05
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2025-06
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2025-07
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2025-08
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2025-09
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2025-10
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2025-11
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2025-12
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2025-13
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2025-14
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748902907049

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-23
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-02 22:21:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 22:21:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 22:21:50] [INFO ] Load time of PNML (sax parser for PT used): 253 ms
[2025-06-02 22:21:50] [INFO ] Transformed 378 places.
[2025-06-02 22:21:50] [INFO ] Transformed 614 transitions.
[2025-06-02 22:21:50] [INFO ] Found NUPN structural information;
[2025-06-02 22:21:50] [INFO ] Parsed PT model containing 378 places and 614 transitions and 1969 arcs in 497 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 35 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (17 resets) in 2614 ms. (15 steps per ms) remains 11/16 properties
FORMULA MedleyA-PT-23-ReachabilityFireability-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-23-ReachabilityFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-23-ReachabilityFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-23-ReachabilityFireability-2025-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-23-ReachabilityFireability-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-02 22:21:51] [INFO ] Flatten gal took : 342 ms
BEST_FIRST walk for 40001 steps (25 resets) in 1291 ms. (30 steps per ms) remains 11/11 properties
[2025-06-02 22:21:51] [INFO ] Flatten gal took : 215 ms
BEST_FIRST walk for 40003 steps (41 resets) in 717 ms. (55 steps per ms) remains 8/11 properties
FORMULA MedleyA-PT-23-ReachabilityFireability-2025-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-23-ReachabilityFireability-2025-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-23-ReachabilityFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2025-06-02 22:21:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8210207665885127703.gal : 112 ms
[2025-06-02 22:21:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5211432278924400031.prop : 22 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/ReachabilityCardinality8210207665885127703.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5211432278924400031.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (9 resets) in 1278 ms. (31 steps per ms) remains 8/8 properties

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
Loading property file /tmp/ReachabilityCardinality5211432278924400031.prop.
BEST_FIRST walk for 40003 steps (36 resets) in 943 ms. (42 steps per ms) remains 7/8 properties
FORMULA MedleyA-PT-23-ReachabilityFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (23 resets) in 347 ms. (114 steps per ms) remains 6/7 properties
FORMULA MedleyA-PT-23-ReachabilityFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :7 after 36
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :36 after 42
BEST_FIRST walk for 40004 steps (100 resets) in 170 ms. (233 steps per ms) remains 5/6 properties
FORMULA MedleyA-PT-23-ReachabilityFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :42 after 63
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :63 after 97
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :97 after 143
BEST_FIRST walk for 40002 steps (22 resets) in 398 ms. (100 steps per ms) remains 5/5 properties
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :143 after 2593
// Phase 1: matrix 614 rows 378 cols
[2025-06-02 22:21:52] [INFO ] Computed 11 invariants in 57 ms
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :2593 after 5498
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem MedleyA-PT-23-ReachabilityFireability-2025-06 is UNSAT
FORMULA MedleyA-PT-23-ReachabilityFireability-2025-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 167/301 variables, 9/143 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 167/310 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 0/310 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 77/378 variables, 2/312 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 77/389 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 0/389 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 614/992 variables, 378/767 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/992 variables, 0/767 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/992 variables, 0/767 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 992/992 variables, and 767 constraints, problems are : Problem set: 1 solved, 4 unsolved in 2449 ms.
Refiners :[Domain max(s): 378/378 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 111/111 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/111 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 187/298 variables, 9/120 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 187/307 constraints. Problems are: Problem set: 1 solved, 4 unsolved
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :5498 after 168242
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 0/307 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem MedleyA-PT-23-ReachabilityFireability-2025-05 is UNSAT
FORMULA MedleyA-PT-23-ReachabilityFireability-2025-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 80/378 variables, 2/309 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 80/389 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 0/389 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 614/992 variables, 378/767 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:21:57] [INFO ] Deduced a trap composed of 18 places in 217 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:21:57] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:21:57] [INFO ] Deduced a trap composed of 84 places in 131 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/992 variables, 3/770 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:21:58] [INFO ] Deduced a trap along path composed of 3 places in 60 ms of which 19 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/992 variables, 1/771 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/992 variables, 0/771 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/992 variables, 0/771 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 992/992 variables, and 771 constraints, problems are : Problem set: 2 solved, 3 unsolved in 4157 ms.
Refiners :[Domain max(s): 378/378 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 6844ms problems are : Problem set: 2 solved, 3 unsolved
FORMULA MedleyA-PT-23-ReachabilityFireability-2025-00 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-23-ReachabilityFireability-2025-01 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 245 ms.
Support contains 39 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 614/614 transitions.
Graph (trivial) has 242 edges and 378 vertex of which 17 / 378 are part of one of the 2 SCC in 5 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 1063 edges and 363 vertex of which 360 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 92 rules applied. Total rules applied 94 place count 360 transition count 502
Reduce places removed 89 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 98 rules applied. Total rules applied 192 place count 271 transition count 493
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 199 place count 264 transition count 493
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 199 place count 264 transition count 478
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 229 place count 249 transition count 478
Discarding 77 places :
Symmetric choice reduction at 3 with 77 rule applications. Total rules 306 place count 172 transition count 401
Iterating global reduction 3 with 77 rules applied. Total rules applied 383 place count 172 transition count 401
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 385 place count 172 transition count 399
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 385 place count 172 transition count 395
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 393 place count 168 transition count 395
Discarding 28 places :
Symmetric choice reduction at 4 with 28 rule applications. Total rules 421 place count 140 transition count 311
Iterating global reduction 4 with 28 rules applied. Total rules applied 449 place count 140 transition count 311
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 4 with 8 rules applied. Total rules applied 457 place count 140 transition count 303
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 462 place count 137 transition count 301
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 464 place count 135 transition count 297
Iterating global reduction 6 with 2 rules applied. Total rules applied 466 place count 135 transition count 297
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 468 place count 135 transition count 295
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 496 place count 121 transition count 281
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 506 place count 116 transition count 288
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 516 place count 116 transition count 278
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 517 place count 115 transition count 275
Iterating global reduction 7 with 1 rules applied. Total rules applied 518 place count 115 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 519 place count 115 transition count 274
Free-agglomeration rule applied 14 times.
Iterating global reduction 8 with 14 rules applied. Total rules applied 533 place count 115 transition count 260
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 547 place count 101 transition count 260
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 550 place count 101 transition count 257
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 551 place count 101 transition count 257
Applied a total of 551 rules in 216 ms. Remains 101 /378 variables (removed 277) and now considering 257/614 (removed 357) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 226 ms. Remains : 101/378 places, 257/614 transitions.
RANDOM walk for 40000 steps (13 resets) in 432 ms. (92 steps per ms) remains 1/1 properties
BEST_FIRST walk for 11446 steps (3 resets) in 62 ms. (181 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-23-ReachabilityFireability-2025-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 10673 ms.

BK_STOP 1748902920421

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-23"
export BK_EXAMINATION="ReachabilityFireability"
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-23, examination is ReachabilityFireability"
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-174876524200279"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-23.tgz
mv MedleyA-PT-23 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;