About the Execution of LTSMin+red for BlocksWorld-PT-06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1509.115 | 16299.00 | 37311.00 | 57.60 | TFTFTTTFTTFTFTFF | 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.r605-tall-171774426800206.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 BlocksWorld-PT-06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r605-tall-171774426800206
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 253K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 378K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.1M Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 23K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 149K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 627K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 689K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 3.2M Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 817K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.5M Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 35K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 86K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 1.1M Jun 7 06:26 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 BlocksWorld-PT-06-ReachabilityCardinality-2024-00
FORMULA_NAME BlocksWorld-PT-06-ReachabilityCardinality-2024-01
FORMULA_NAME BlocksWorld-PT-06-ReachabilityCardinality-2024-02
FORMULA_NAME BlocksWorld-PT-06-ReachabilityCardinality-2024-03
FORMULA_NAME BlocksWorld-PT-06-ReachabilityCardinality-2024-04
FORMULA_NAME BlocksWorld-PT-06-ReachabilityCardinality-2024-05
FORMULA_NAME BlocksWorld-PT-06-ReachabilityCardinality-2024-06
FORMULA_NAME BlocksWorld-PT-06-ReachabilityCardinality-2024-07
FORMULA_NAME BlocksWorld-PT-06-ReachabilityCardinality-2024-08
FORMULA_NAME BlocksWorld-PT-06-ReachabilityCardinality-2024-09
FORMULA_NAME BlocksWorld-PT-06-ReachabilityCardinality-2024-10
FORMULA_NAME BlocksWorld-PT-06-ReachabilityCardinality-2024-11
FORMULA_NAME BlocksWorld-PT-06-ReachabilityCardinality-2024-12
FORMULA_NAME BlocksWorld-PT-06-ReachabilityCardinality-2024-13
FORMULA_NAME BlocksWorld-PT-06-ReachabilityCardinality-2024-14
FORMULA_NAME BlocksWorld-PT-06-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717747271181
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-07 08:01:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-07 08:01:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 08:01:12] [INFO ] Load time of PNML (sax parser for PT used): 180 ms
[2024-06-07 08:01:12] [INFO ] Transformed 1189 places.
[2024-06-07 08:01:12] [INFO ] Transformed 2245 transitions.
[2024-06-07 08:01:12] [INFO ] Found NUPN structural information;
[2024-06-07 08:01:12] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8, pred_on_table_9, pred_on_table_10, pred_on_table_11, pred_on_table_12, pred_on_table_13, pred_on_table_14, pred_on_table_15, pred_on_table_16, pred_on_table_17, pred_on_table_18, pred_on_table_19, pred_on_table_20, pred_on_table_21, pred_on_table_22, pred_on_table_23, pred_on_table_24, pred_on_table_25, pred_on_table_26, pred_on_table_27, pred_on_table_28, pred_on_table_29, pred_on_table_30, pred_on_table_31, pred_on_table_32]
[2024-06-07 08:01:12] [INFO ] Parsed PT model containing 1189 places and 2245 transitions and 11210 arcs in 305 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 143 ms.
Working with output stream class java.io.PrintStream
FORMULA BlocksWorld-PT-06-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 6275 ms. (6 steps per ms) remains 9/15 properties
FORMULA BlocksWorld-PT-06-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-06-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-06-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-06-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-06-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-06-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 8/9 properties
FORMULA BlocksWorld-PT-06-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 748 ms. (53 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1983 ms. (20 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 706 ms. (56 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2039 ms. (19 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 342 ms. (116 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 350 ms. (113 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 343 ms. (116 steps per ms) remains 8/8 properties
// Phase 1: matrix 2245 rows 1189 cols
[2024-06-07 08:01:16] [INFO ] Computed 67 invariants in 57 ms
[2024-06-07 08:01:16] [INFO ] State equation strengthened by 59 read => feed constraints.
Problem BlocksWorld-PT-06-ReachabilityCardinality-2024-01 is UNSAT
FORMULA BlocksWorld-PT-06-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-06-ReachabilityCardinality-2024-02 is UNSAT
FORMULA BlocksWorld-PT-06-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-06-ReachabilityCardinality-2024-03 is UNSAT
FORMULA BlocksWorld-PT-06-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-06-ReachabilityCardinality-2024-04 is UNSAT
FORMULA BlocksWorld-PT-06-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-06-ReachabilityCardinality-2024-06 is UNSAT
FORMULA BlocksWorld-PT-06-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-06-ReachabilityCardinality-2024-08 is UNSAT
FORMULA BlocksWorld-PT-06-ReachabilityCardinality-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-06-ReachabilityCardinality-2024-13 is UNSAT
FORMULA BlocksWorld-PT-06-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1189 variables, 67/67 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1189 variables, 0/67 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2244/3433 variables, 1189/1256 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3433 variables, 58/1314 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3433 variables, 0/1314 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/3434 variables, 1/1315 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3434 variables, 0/1315 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3434 variables, 0/1315 constraints. Problems are: Problem set: 7 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3434/3434 variables, and 1315 constraints, problems are : Problem set: 7 solved, 1 unsolved in 1306 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, State Equation: 1189/1189 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 938/965 variables, 39/39 constraints. Problems are: Problem set: 7 solved, 1 unsolved
[2024-06-07 08:01:19] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 30 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/965 variables, 1/40 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/965 variables, 0/40 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 224/1189 variables, 28/68 constraints. Problems are: Problem set: 7 solved, 1 unsolved
[2024-06-07 08:01:19] [INFO ] Deduced a trap composed of 96 places in 224 ms of which 5 ms to minimize.
[2024-06-07 08:01:19] [INFO ] Deduced a trap composed of 124 places in 180 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1189 variables, 2/70 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1189 variables, 0/70 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2244/3433 variables, 1189/1259 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3433 variables, 58/1317 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3433 variables, 1/1318 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3433 variables, 0/1318 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/3434 variables, 1/1319 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3434 variables, 0/1319 constraints. Problems are: Problem set: 7 solved, 1 unsolved
[2024-06-07 08:01:21] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/3434 variables, 1/1320 constraints. Problems are: Problem set: 7 solved, 1 unsolved
[2024-06-07 08:01:21] [INFO ] Deduced a trap composed of 216 places in 457 ms of which 10 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/3434 variables, 1/1321 constraints. Problems are: Problem set: 7 solved, 1 unsolved
[2024-06-07 08:01:22] [INFO ] Deduced a trap composed of 150 places in 166 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/3434 variables, 1/1322 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3434 variables, 0/1322 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/3434 variables, 0/1322 constraints. Problems are: Problem set: 7 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3434/3434 variables, and 1322 constraints, problems are : Problem set: 7 solved, 1 unsolved in 3352 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, State Equation: 1189/1189 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 6/6 constraints]
After SMT, in 5673ms problems are : Problem set: 7 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 27 out of 1189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1189/1189 places, 2245/2245 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1189 transition count 2244
Applied a total of 1 rules in 4546 ms. Remains 1189 /1189 variables (removed 0) and now considering 2244/2245 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4557 ms. Remains : 1189/1189 places, 2244/2245 transitions.
RANDOM walk for 34810 steps (7 resets) in 1228 ms. (28 steps per ms) remains 0/1 properties
FORMULA BlocksWorld-PT-06-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 15062 ms.
ITS solved all properties within timeout
BK_STOP 1717747287480
--------------------
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="BlocksWorld-PT-06"
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 BlocksWorld-PT-06, 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 r605-tall-171774426800206"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BlocksWorld-PT-06.tgz
mv BlocksWorld-PT-06 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 '
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 ;