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

About the Execution of LTSMin+red for LeafsetExtension-PT-S32C4

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
676.487 18957.00 36582.00 138.10 FFTFFFTFTTFTTFTT 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.r504-tall-171649612700383.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 ltsminxred
Input is LeafsetExtension-PT-S32C4, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r504-tall-171649612700383
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 17K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 12 13:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 13:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 13:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 13:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.4M May 18 16:42 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 LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-00
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-01
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-02
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-03
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-04
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-05
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-06
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-07
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-08
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-09
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-10
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-11
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-12
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-13
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-14
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717228724180

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S32C4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:58:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:58:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:58:45] [INFO ] Load time of PNML (sax parser for PT used): 280 ms
[2024-06-01 07:58:45] [INFO ] Transformed 5622 places.
[2024-06-01 07:58:45] [INFO ] Transformed 5449 transitions.
[2024-06-01 07:58:45] [INFO ] Parsed PT model containing 5622 places and 5449 transitions and 17500 arcs in 420 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1197 resets) in 2896 ms. (13 steps per ms) remains 5/16 properties
FORMULA LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (32 resets) in 589 ms. (67 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (32 resets) in 777 ms. (51 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (27 resets) in 377 ms. (105 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (65 resets) in 333 ms. (119 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (41 resets) in 161 ms. (246 steps per ms) remains 5/5 properties
// Phase 1: matrix 5449 rows 5622 cols
[2024-06-01 07:58:47] [INFO ] Computed 173 invariants in 381 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 26/242 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/243 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-03 is UNSAT
FORMULA LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-10 is UNSAT
FORMULA LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 5268/5511 variables, 99/126 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5511 variables, 0/126 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 8/5519 variables, 8/134 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5519 variables, 0/134 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 103/5622 variables, 39/173 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5622 variables, 0/173 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 11071/11071 variables, and 5795 constraints, problems are : Problem set: 2 solved, 3 unsolved in 5076 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 138/138 constraints, State Equation: 5622/5622 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 14/152 variables, 14/14 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/153 variables, 1/15 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 5137/5290 variables, 81/96 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5290 variables, 0/96 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 20/5310 variables, 20/116 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5310 variables, 0/116 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 312/5622 variables, 57/173 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5622 variables, 0/173 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 5449/11071 variables, 5622/5795 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/11071 variables, 3/5798 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 11071/11071 variables, and 5798 constraints, problems are : Problem set: 2 solved, 3 unsolved in 5024 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 138/138 constraints, State Equation: 5622/5622 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 11012ms problems are : Problem set: 2 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 138 out of 5622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5622/5622 places, 5449/5449 transitions.
Graph (complete) has 11001 edges and 5622 vertex of which 2926 are kept as prefixes of interest. Removing 2696 places using SCC suffix rule.13 ms
Discarding 2696 places :
Also discarding 1306 output transitions
Drop transitions (Output transitions of discarded places.) removed 1306 transitions
Drop transitions (Empty/Sink Transition effects.) removed 273 transitions
Reduce isomorphic transitions removed 273 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 685 transitions
Trivial Post-agglo rules discarded 685 transitions
Performed 685 trivial Post agglomeration. Transition count delta: 685
Iterating post reduction 0 with 958 rules applied. Total rules applied 959 place count 2926 transition count 3185
Reduce places removed 686 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 688 rules applied. Total rules applied 1647 place count 2240 transition count 3183
Reduce places removed 2 places and 0 transitions.
Performed 459 Post agglomeration using F-continuation condition.Transition count delta: 459
Iterating post reduction 2 with 461 rules applied. Total rules applied 2108 place count 2238 transition count 2724
Reduce places removed 459 places and 0 transitions.
Iterating post reduction 3 with 459 rules applied. Total rules applied 2567 place count 1779 transition count 2724
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 30 Pre rules applied. Total rules applied 2567 place count 1779 transition count 2694
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 2627 place count 1749 transition count 2694
Discarding 704 places :
Symmetric choice reduction at 4 with 704 rule applications. Total rules 3331 place count 1045 transition count 1990
Iterating global reduction 4 with 704 rules applied. Total rules applied 4035 place count 1045 transition count 1990
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 4050 place count 1030 transition count 1975
Iterating global reduction 4 with 15 rules applied. Total rules applied 4065 place count 1030 transition count 1975
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 4066 place count 1029 transition count 1975
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4068 place count 1028 transition count 1974
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 5 with 12 rules applied. Total rules applied 4080 place count 1028 transition count 1962
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 4092 place count 1016 transition count 1962
Partial Free-agglomeration rule applied 52 times.
Drop transitions (Partial Free agglomeration) removed 52 transitions
Iterating global reduction 6 with 52 rules applied. Total rules applied 4144 place count 1016 transition count 1962
Applied a total of 4144 rules in 777 ms. Remains 1016 /5622 variables (removed 4606) and now considering 1962/5449 (removed 3487) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 790 ms. Remains : 1016/5622 places, 1962/5449 transitions.
RANDOM walk for 40000 steps (2106 resets) in 908 ms. (44 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (52 resets) in 177 ms. (224 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (65 resets) in 153 ms. (259 steps per ms) remains 2/3 properties
FORMULA LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (91 resets) in 250 ms. (159 steps per ms) remains 2/2 properties
[2024-06-01 07:58:59] [INFO ] Flow matrix only has 1618 transitions (discarded 344 similar events)
// Phase 1: matrix 1618 rows 1016 cols
[2024-06-01 07:58:59] [INFO ] Computed 64 invariants in 23 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 495/621 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/622 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1215/1837 variables, 622/659 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1837 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 672/2509 variables, 269/928 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2509 variables, 20/948 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2509 variables, 0/948 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 120/2629 variables, 7/955 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2629 variables, 120/1075 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2629 variables, 0/1075 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 5/2634 variables, 5/1080 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2634 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/2634 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2634/2634 variables, and 1080 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1044 ms.
Refiners :[Generalized P Invariants (flows): 64/64 constraints, State Equation: 1016/1016 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 495/621 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/622 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1215/1837 variables, 622/659 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1837 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 672/2509 variables, 269/928 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2509 variables, 20/948 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2509 variables, 2/950 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2509 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 120/2629 variables, 7/957 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2629 variables, 120/1077 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2629 variables, 0/1077 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 5/2634 variables, 5/1082 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2634 variables, 0/1082 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/2634 variables, 0/1082 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2634/2634 variables, and 1082 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2148 ms.
Refiners :[Generalized P Invariants (flows): 64/64 constraints, State Equation: 1016/1016 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 3313ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-00 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
FORMULA LeafsetExtension-PT-S32C4-ReachabilityFireability-2024-05 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 15 ms.
All properties solved without resorting to model-checking.
Total runtime 17738 ms.
ITS solved all properties within timeout

BK_STOP 1717228743137

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -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="LeafsetExtension-PT-S32C4"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is LeafsetExtension-PT-S32C4, 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 r504-tall-171649612700383"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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