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-171649612600350.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-S16C3, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r504-tall-171649612600350
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 14K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 12 13:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 12 13:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 12 13:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 12 13:50 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 905K 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-S16C3-ReachabilityCardinality-2024-00
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-01
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-02
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-03
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-04
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-05
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-06
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-07
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-08
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-09
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-10
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-11
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-12
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-13
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-14
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717228462004

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S16C3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:54:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:54:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:54:23] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2024-06-01 07:54:23] [INFO ] Transformed 1542 places.
[2024-06-01 07:54:23] [INFO ] Transformed 1449 transitions.
[2024-06-01 07:54:23] [INFO ] Parsed PT model containing 1542 places and 1449 transitions and 4668 arcs in 241 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1529 resets) in 1922 ms. (20 steps per ms) remains 10/16 properties
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (172 resets) in 280 ms. (142 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (173 resets) in 159 ms. (250 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (176 resets) in 783 ms. (51 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (169 resets) in 102 ms. (388 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (170 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (174 resets) in 133 ms. (298 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (171 resets) in 130 ms. (305 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (174 resets) in 119 ms. (333 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (169 resets) in 220 ms. (181 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (182 resets) in 72 ms. (548 steps per ms) remains 10/10 properties
// Phase 1: matrix 1449 rows 1542 cols
[2024-06-01 07:54:25] [INFO ] Computed 93 invariants in 87 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-12 is UNSAT
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 1329/1475 variables, 58/58 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1475 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-00 is UNSAT
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-02 is UNSAT
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-04 is UNSAT
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-05 is UNSAT
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-08 is UNSAT
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-09 is UNSAT
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-11 is UNSAT
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-15 is UNSAT
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 19/1494 variables, 19/77 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1494 variables, 0/77 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 48/1542 variables, 16/93 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1542 variables, 0/93 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1449/2991 variables, 1542/1635 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2991 variables, 0/1635 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/2991 variables, 0/1635 constraints. Problems are: Problem set: 9 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2991/2991 variables, and 1635 constraints, problems are : Problem set: 9 solved, 1 unsolved in 1572 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 74/74 constraints, State Equation: 1542/1542 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1356/1397 variables, 34/34 constraints. Problems are: Problem set: 9 solved, 1 unsolved
[2024-06-01 07:54:27] [INFO ] Deduced a trap composed of 77 places in 733 ms of which 76 ms to minimize.
[2024-06-01 07:54:28] [INFO ] Deduced a trap composed of 113 places in 668 ms of which 11 ms to minimize.
[2024-06-01 07:54:29] [INFO ] Deduced a trap composed of 130 places in 616 ms of which 10 ms to minimize.
[2024-06-01 07:54:29] [INFO ] Deduced a trap composed of 95 places in 635 ms of which 10 ms to minimize.
[2024-06-01 07:54:30] [INFO ] Deduced a trap composed of 104 places in 613 ms of which 9 ms to minimize.
[2024-06-01 07:54:31] [INFO ] Deduced a trap composed of 95 places in 621 ms of which 21 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1397 variables, 6/40 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1397 variables, 0/40 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 19/1416 variables, 19/59 constraints. Problems are: Problem set: 9 solved, 1 unsolved
[2024-06-01 07:54:31] [INFO ] Deduced a trap composed of 79 places in 604 ms of which 9 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1416/2991 variables, and 60 constraints, problems are : Problem set: 9 solved, 1 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 34/74 constraints, State Equation: 0/1542 constraints, PredecessorRefiner: 0/10 constraints, Known Traps: 7/7 constraints]
After SMT, in 6797ms problems are : Problem set: 9 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 41 out of 1542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1542/1542 places, 1449/1449 transitions.
Graph (complete) has 2953 edges and 1542 vertex of which 485 are kept as prefixes of interest. Removing 1057 places using SCC suffix rule.4 ms
Discarding 1057 places :
Also discarding 531 output transitions
Drop transitions (Output transitions of discarded places.) removed 531 transitions
Drop transitions (Empty/Sink Transition effects.) removed 224 transitions
Reduce isomorphic transitions removed 224 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 337 rules applied. Total rules applied 338 place count 485 transition count 581
Reduce places removed 115 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 128 rules applied. Total rules applied 466 place count 370 transition count 568
Reduce places removed 13 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 2 with 32 rules applied. Total rules applied 498 place count 357 transition count 549
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 517 place count 338 transition count 549
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 517 place count 338 transition count 530
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 555 place count 319 transition count 530
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 584 place count 290 transition count 501
Iterating global reduction 4 with 29 rules applied. Total rules applied 613 place count 290 transition count 501
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 619 place count 290 transition count 495
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 625 place count 284 transition count 495
Partial Free-agglomeration rule applied 66 times.
Drop transitions (Partial Free agglomeration) removed 66 transitions
Iterating global reduction 5 with 66 rules applied. Total rules applied 691 place count 284 transition count 495
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 692 place count 283 transition count 495
Applied a total of 692 rules in 142 ms. Remains 283 /1542 variables (removed 1259) and now considering 495/1449 (removed 954) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 283/1542 places, 495/1449 transitions.
RANDOM walk for 37694 steps (3578 resets) in 982 ms. (38 steps per ms) remains 0/1 properties
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 8885 ms.
ITS solved all properties within timeout

BK_STOP 1717228472236

--------------------
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="LeafsetExtension-PT-S16C3"
export BK_EXAMINATION="ReachabilityCardinality"
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-S16C3, 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 r504-tall-171649612600350"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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