fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r333-tall-171679078600486
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for SatelliteMemory-PT-X65535Y2048

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
815.647 40641.00 53105.00 173.60 FFFTTTTFFTTFTFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r333-tall-171679078600486.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
Input is SatelliteMemory-PT-X65535Y2048, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r333-tall-171679078600486
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.2K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 13 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 12 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rwxr-xr-x 1 mcc users 5.5K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2024-00
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2024-01
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2024-02
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2024-03
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2024-04
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2024-05
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2024-06
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2024-07
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2024-08
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2024-09
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2024-10
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2024-11
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2023-12
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2024-13
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2024-14
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716872236148

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SatelliteMemory-PT-X65535Y2048
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 04:57:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 04:57:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 04:57:17] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2024-05-28 04:57:17] [INFO ] Transformed 13 places.
[2024-05-28 04:57:17] [INFO ] Transformed 10 transitions.
[2024-05-28 04:57:17] [INFO ] Parsed PT model containing 13 places and 10 transitions and 40 arcs in 116 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 1 places and 0 transitions.
RANDOM walk for 40000 steps (8 resets) in 1831 ms. (21 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 74 ms. (53 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 293285 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :5 out of 16
Probabilistic random walk after 293285 steps, saw 140944 distinct states, run finished after 3008 ms. (steps per millisecond=97 ) properties seen :5
FORMULA SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 10 rows 12 cols
[2024-05-28 04:57:21] [INFO ] Computed 6 invariants in 10 ms
[2024-05-28 04:57:21] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2024-01 is UNSAT
FORMULA SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2024-02 is UNSAT
FORMULA SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2024-06 is UNSAT
FORMULA SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2024-09 is UNSAT
FORMULA SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2024-10 is UNSAT
FORMULA SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2024-14 is UNSAT
FORMULA SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 6/6 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 10/22 variables, 12/18 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 1/19 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/19 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/22 variables, 0/19 constraints. Problems are: Problem set: 6 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 19 constraints, problems are : Problem set: 6 solved, 5 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 3/3 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 2/12 variables, 3/6 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 10/22 variables, 12/18 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 1/19 constraints. Problems are: Problem set: 6 solved, 5 unsolved
Problem SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2023-12 is UNSAT
FORMULA SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2023-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 5/24 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 0/24 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/22 variables, 0/24 constraints. Problems are: Problem set: 7 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 24 constraints, problems are : Problem set: 7 solved, 4 unsolved in 1352 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 1641ms problems are : Problem set: 7 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
FORMULA SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2024-15 FALSE TECHNIQUES PARIKH_WALK
FORMULA SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2024-11 FALSE TECHNIQUES PARIKH_WALK
FORMULA SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2024-07 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 30002 ms.
Support contains 10 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 8 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Running 8 sub problems to find dead transitions.
[2024-05-28 04:57:53] [INFO ] Invariant cache hit.
[2024-05-28 04:57:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2/12 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 10/22 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/22 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 19 constraints, problems are : Problem set: 0 solved, 8 unsolved in 89 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2/12 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 10/22 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/22 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 27 constraints, problems are : Problem set: 0 solved, 8 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 321ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 322ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 344 ms. Remains : 12/12 places, 10/10 transitions.
RANDOM walk for 40000 steps (8 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 464 ms. (86 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3724361 steps, run timeout after 3001 ms. (steps per millisecond=1241 ) properties seen :0 out of 1
Probabilistic random walk after 3724361 steps, saw 1747622 distinct states, run finished after 3001 ms. (steps per millisecond=1241 ) properties seen :0
[2024-05-28 04:57:56] [INFO ] Invariant cache hit.
[2024-05-28 04:57:56] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/12 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 10/22 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/22 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 19 constraints, problems are : Problem set: 0 solved, 1 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/12 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 10/22 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/22 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 20 constraints, problems are : Problem set: 0 solved, 1 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 113ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 131076 steps, including 0 resets, run visited all 1 properties in 112 ms. (steps per millisecond=1170 )
FORMULA SatelliteMemory-PT-X65535Y2048-ReachabilityCardinality-2024-13 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 116 ms.
All properties solved without resorting to model-checking.
Total runtime 39448 ms.
ITS solved all properties within timeout

BK_STOP 1716872276789

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

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="SatelliteMemory-PT-X65535Y2048"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is SatelliteMemory-PT-X65535Y2048, 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 r333-tall-171679078600486"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SatelliteMemory-PT-X65535Y2048.tgz
mv SatelliteMemory-PT-X65535Y2048 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;