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

About the Execution of ITS-Tools for ErlangenMainframeV0-PT-1008

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

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339700342.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 ErlangenMainframeV0-PT-1008, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339700342
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 90M
-rw-r--r-- 1 mcc users 5.7K Jun 6 09:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Jun 6 09:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 6 09:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 6 09:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 6 12:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 12:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 12:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 12:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 7.8K Jun 6 09:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Jun 6 09:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Jun 6 09:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Jun 6 09:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 12:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 12:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 90M Jun 5 20:08 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 ErlangenMainframeV0-PT-1008-ReachabilityCardinality-2025-00
FORMULA_NAME ErlangenMainframeV0-PT-1008-ReachabilityCardinality-2025-01
FORMULA_NAME ErlangenMainframeV0-PT-1008-ReachabilityCardinality-2025-02
FORMULA_NAME ErlangenMainframeV0-PT-1008-ReachabilityCardinality-2025-03
FORMULA_NAME ErlangenMainframeV0-PT-1008-ReachabilityCardinality-2025-04
FORMULA_NAME ErlangenMainframeV0-PT-1008-ReachabilityCardinality-2025-05
FORMULA_NAME ErlangenMainframeV0-PT-1008-ReachabilityCardinality-2025-06
FORMULA_NAME ErlangenMainframeV0-PT-1008-ReachabilityCardinality-2025-07
FORMULA_NAME ErlangenMainframeV0-PT-1008-ReachabilityCardinality-2025-08
FORMULA_NAME ErlangenMainframeV0-PT-1008-ReachabilityCardinality-2025-09
FORMULA_NAME ErlangenMainframeV0-PT-1008-ReachabilityCardinality-2025-10
FORMULA_NAME ErlangenMainframeV0-PT-1008-ReachabilityCardinality-2025-11
FORMULA_NAME ErlangenMainframeV0-PT-1008-ReachabilityCardinality-2025-12
FORMULA_NAME ErlangenMainframeV0-PT-1008-ReachabilityCardinality-2025-13
FORMULA_NAME ErlangenMainframeV0-PT-1008-ReachabilityCardinality-2025-14
FORMULA_NAME ErlangenMainframeV0-PT-1008-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749365663472

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV0-PT-1008
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-08 06:54:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-08 06:54:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 06:54:27] [INFO ] Load time of PNML (sax parser for PT used): 3119 ms
[2025-06-08 06:54:27] [INFO ] Transformed 291 places.
[2025-06-08 06:54:28] [INFO ] Transformed 79030 transitions.
[2025-06-08 06:54:28] [INFO ] Found NUPN structural information;
[2025-06-08 06:54:28] [INFO ] Parsed PT model containing 291 places and 79030 transitions and 1837903 arcs in 3672 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
FORMULA ErlangenMainframeV0-PT-1008-ReachabilityCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1008-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1008-ReachabilityCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1008-ReachabilityCardinality-2025-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 29644 ms. (1 steps per ms) remains 3/12 properties
FORMULA ErlangenMainframeV0-PT-1008-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1008-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1008-ReachabilityCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1008-ReachabilityCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1008-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1008-ReachabilityCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1008-ReachabilityCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1008-ReachabilityCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1008-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 38172 steps (8 resets) in 19909 ms. (1 steps per ms) remains 3/3 properties
[2025-06-08 06:54:44] [INFO ] Flatten gal took : 13731 ms
BEST_FIRST walk for 40001 steps (8 resets) in 13051 ms. (3 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2699 ms. (14 steps per ms) remains 3/3 properties
// Phase 1: matrix 79030 rows 291 cols
[2025-06-08 06:54:48] [INFO ] Computed 26 invariants in 1424 ms
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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/25 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 201/226 variables, 13/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 201/239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 40/266 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 40/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 25/291 variables, 10/292 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 25/317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 7214ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25 out of 291 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 291/291 places, 79030/79030 transitions.
Graph (trivial) has 196 edges and 291 vertex of which 6 / 291 are part of one of the 3 SCC in 17 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 77 place count 288 transition count 78948
[2025-06-08 06:54:55] [INFO ] Flatten gal took : 10448 ms
Reduce places removed 76 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 85 rules applied. Total rules applied 162 place count 212 transition count 78939
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 171 place count 203 transition count 78939
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 171 place count 203 transition count 78938
[2025-06-08 06:54:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3981020666648896480.gal : 1616 ms
[2025-06-08 06:54:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3469637907631486805.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3981020666648896480.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3469637907631486805.prop' '--nowitness' '--gen-order' 'FOLLOW'

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
Deduced a syphon composed of 1 places in 91 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 173 place count 202 transition count 78938
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 211 place count 164 transition count 78900
Iterating global reduction 3 with 38 rules applied. Total rules applied 249 place count 164 transition count 78900
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 249 place count 164 transition count 78898
Deduced a syphon composed of 2 places in 86 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 253 place count 162 transition count 78898
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 265 place count 150 transition count 52702
Ensure Unique test removed 5 places
Iterating global reduction 3 with 17 rules applied. Total rules applied 282 place count 145 transition count 52702
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 293 place count 134 transition count 358
Iterating global reduction 3 with 11 rules applied. Total rules applied 304 place count 134 transition count 358
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 305 place count 133 transition count 356
Iterating global reduction 3 with 1 rules applied. Total rules applied 306 place count 133 transition count 356
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 388 place count 92 transition count 315
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 389 place count 91 transition count 234
Iterating global reduction 3 with 1 rules applied. Total rules applied 390 place count 91 transition count 234
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 391 place count 91 transition count 233
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 395 place count 89 transition count 235
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 396 place count 89 transition count 234
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 403 place count 89 transition count 227
Free-agglomeration rule applied 12 times.
Iterating global reduction 5 with 12 rules applied. Total rules applied 415 place count 89 transition count 215
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 429 place count 77 transition count 213
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 431 place count 77 transition count 353
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 433 place count 75 transition count 353
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 435 place count 75 transition count 353
Applied a total of 435 rules in 20155 ms. Remains 75 /291 variables (removed 216) and now considering 353/79030 (removed 78677) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20163 ms. Remains : 75/291 places, 353/79030 transitions.
RANDOM walk for 40000 steps (8 resets) in 1282 ms. (31 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 135 ms. (294 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 97 ms. (408 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 559914 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :0 out of 3
Probabilistic random walk after 559914 steps, saw 283680 distinct states, run finished after 3005 ms. (steps per millisecond=186 ) properties seen :0
[2025-06-08 06:55:17] [INFO ] Flow matrix only has 344 transitions (discarded 9 similar events)
// Phase 1: matrix 344 rows 75 cols
[2025-06-08 06:55:17] [INFO ] Computed 21 invariants in 3 ms
[2025-06-08 06:55:17] [INFO ] State equation strengthened by 241 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 39/64 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3/67 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8/75 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 344/419 variables, 75/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 241/337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/419 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 419/419 variables, and 337 constraints, problems are : Problem set: 0 solved, 3 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 75/75 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 39/64 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:55:18] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 6 ms to minimize.
Problem ErlangenMainframeV0-PT-1008-ReachabilityCardinality-2025-05 is UNSAT
FORMULA ErlangenMainframeV0-PT-1008-ReachabilityCardinality-2025-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/14 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 3/67 variables, 3/17 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem ErlangenMainframeV0-PT-1008-ReachabilityCardinality-2025-03 is UNSAT
FORMULA ErlangenMainframeV0-PT-1008-ReachabilityCardinality-2025-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem ErlangenMainframeV0-PT-1008-ReachabilityCardinality-2025-09 is UNSAT
FORMULA ErlangenMainframeV0-PT-1008-ReachabilityCardinality-2025-09 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 75/419 variables, and 22 constraints, problems are : Problem set: 3 solved, 0 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/75 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 539ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
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 53959 ms.

BK_STOP 1749365718606

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="ErlangenMainframeV0-PT-1008"
export BK_EXAMINATION="ReachabilityCardinality"
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 ErlangenMainframeV0-PT-1008, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r254-tall-174931339700342"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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