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.r478-tall-171620515700068.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 CANInsertWithFailure-PT-020, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r478-tall-171620515700068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 172K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 08:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 08:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.6M 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1717178472122

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=CANInsertWithFailure-PT-020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:01:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-31 18:01:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:01:13] [INFO ] Load time of PNML (sax parser for PT used): 203 ms
[2024-05-31 18:01:13] [INFO ] Transformed 1044 places.
[2024-05-31 18:01:13] [INFO ] Transformed 2520 transitions.
[2024-05-31 18:01:13] [INFO ] Parsed PT model containing 1044 places and 2520 transitions and 6800 arcs in 329 ms.
RANDOM walk for 40000 steps (86 resets) in 2862 ms. (13 steps per ms) remains 1/1044 properties
BEST_FIRST walk for 40003 steps (8 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
// Phase 1: matrix 2520 rows 1044 cols
[2024-05-31 18:01:14] [INFO ] Computed 23 invariants in 76 ms
[2024-05-31 18:01:15] [INFO ] State equation strengthened by 780 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1000/1001 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/1039 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1039 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/1041 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1041 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2520/3561 variables, 1041/1063 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3561 variables, 780/1843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3561 variables, 0/1843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/3564 variables, 3/1846 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3564 variables, 1/1847 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3564 variables, 0/1847 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/3564 variables, 0/1847 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3564/3564 variables, and 1847 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1259 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1044/1044 constraints, ReadFeed: 780/780 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1000/1001 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:01:16] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 14 ms to minimize.
[2024-05-31 18:01:16] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-31 18:01:16] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2024-05-31 18:01:16] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 2 ms to minimize.
[2024-05-31 18:01:16] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-05-31 18:01:16] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2024-05-31 18:01:16] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-05-31 18:01:17] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-05-31 18:01:17] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 0 ms to minimize.
[2024-05-31 18:01:17] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-05-31 18:01:17] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2024-05-31 18:01:17] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-05-31 18:01:17] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-31 18:01:17] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2024-05-31 18:01:17] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-31 18:01:17] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2024-05-31 18:01:17] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-31 18:01:17] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-05-31 18:01:17] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-05-31 18:01:17] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/1039 variables, 19/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1039 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1041 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:01:18] [INFO ] Deduced a trap composed of 40 places in 451 ms of which 6 ms to minimize.
[2024-05-31 18:01:18] [INFO ] Deduced a trap composed of 49 places in 456 ms of which 6 ms to minimize.
[2024-05-31 18:01:19] [INFO ] Deduced a trap composed of 55 places in 469 ms of which 7 ms to minimize.
[2024-05-31 18:01:19] [INFO ] Deduced a trap composed of 43 places in 487 ms of which 6 ms to minimize.
[2024-05-31 18:01:20] [INFO ] Deduced a trap composed of 45 places in 481 ms of which 6 ms to minimize.
[2024-05-31 18:01:20] [INFO ] Deduced a trap composed of 43 places in 501 ms of which 6 ms to minimize.
[2024-05-31 18:01:21] [INFO ] Deduced a trap composed of 61 places in 481 ms of which 8 ms to minimize.
SMT process timed out in 6482ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1044 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1044/1044 places, 2520/2520 transitions.
Graph (complete) has 3501 edges and 1044 vertex of which 1043 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 141 place count 1043 transition count 2380
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 281 place count 903 transition count 2380
Performed 380 Post agglomeration using F-continuation condition.Transition count delta: 380
Deduced a syphon composed of 380 places in 1 ms
Reduce places removed 380 places and 0 transitions.
Iterating global reduction 2 with 760 rules applied. Total rules applied 1041 place count 523 transition count 2000
Drop transitions (Redundant composition of simpler transitions.) removed 342 transitions
Redundant transition composition rules discarded 342 transitions
Iterating global reduction 2 with 342 rules applied. Total rules applied 1383 place count 523 transition count 1658
Partial Free-agglomeration rule applied 437 times.
Drop transitions (Partial Free agglomeration) removed 437 transitions
Iterating global reduction 2 with 437 rules applied. Total rules applied 1820 place count 523 transition count 1658
Applied a total of 1820 rules in 399 ms. Remains 523 /1044 variables (removed 521) and now considering 1658/2520 (removed 862) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 410 ms. Remains : 523/1044 places, 1658/2520 transitions.
RANDOM walk for 6027 steps (63 resets) in 82 ms. (72 steps per ms) remains 0/1 properties
Able to resolve query StableMarking after proving 1044 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK TOPOLOGICAL
Total runtime 8489 ms.
ITS solved all properties within timeout

BK_STOP 1717178481903

--------------------
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 StableMarking -timeout 180 -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="CANInsertWithFailure-PT-020"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 CANInsertWithFailure-PT-020, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r478-tall-171620515700068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-020.tgz
mv CANInsertWithFailure-PT-020 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;