About the Execution of LTSMin+red for CANConstruction-PT-005
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
328.315 | 4976.00 | 13849.00 | 115.30 | TFTTFTTTTFTTFFFF | 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.r476-tall-171620504900007.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 CANConstruction-PT-005, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620504900007
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 18:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 12 18:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 18:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:31 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 167K 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 CANConstruction-PT-005-ReachabilityFireability-2024-00
FORMULA_NAME CANConstruction-PT-005-ReachabilityFireability-2024-01
FORMULA_NAME CANConstruction-PT-005-ReachabilityFireability-2024-02
FORMULA_NAME CANConstruction-PT-005-ReachabilityFireability-2024-03
FORMULA_NAME CANConstruction-PT-005-ReachabilityFireability-2024-04
FORMULA_NAME CANConstruction-PT-005-ReachabilityFireability-2024-05
FORMULA_NAME CANConstruction-PT-005-ReachabilityFireability-2024-06
FORMULA_NAME CANConstruction-PT-005-ReachabilityFireability-2024-07
FORMULA_NAME CANConstruction-PT-005-ReachabilityFireability-2024-08
FORMULA_NAME CANConstruction-PT-005-ReachabilityFireability-2024-09
FORMULA_NAME CANConstruction-PT-005-ReachabilityFireability-2024-10
FORMULA_NAME CANConstruction-PT-005-ReachabilityFireability-2024-11
FORMULA_NAME CANConstruction-PT-005-ReachabilityFireability-2024-12
FORMULA_NAME CANConstruction-PT-005-ReachabilityFireability-2024-13
FORMULA_NAME CANConstruction-PT-005-ReachabilityFireability-2024-14
FORMULA_NAME CANConstruction-PT-005-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717178158223
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-005
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 17:55:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 17:55:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 17:55:59] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-05-31 17:55:59] [INFO ] Transformed 112 places.
[2024-05-31 17:55:59] [INFO ] Transformed 140 transitions.
[2024-05-31 17:55:59] [INFO ] Parsed PT model containing 112 places and 140 transitions and 400 arcs in 177 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANConstruction-PT-005-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (513 resets) in 1785 ms. (22 steps per ms) remains 9/13 properties
FORMULA CANConstruction-PT-005-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-005-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-005-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-005-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (136 resets) in 474 ms. (84 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (8 resets) in 192 ms. (207 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (128 resets) in 250 ms. (159 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (131 resets) in 82 ms. (481 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (146 resets) in 180 ms. (221 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (134 resets) in 412 ms. (96 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (112 resets) in 428 ms. (93 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (137 resets) in 80 ms. (493 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (158 resets) in 137 ms. (289 steps per ms) remains 9/9 properties
// Phase 1: matrix 140 rows 112 cols
[2024-05-31 17:56:01] [INFO ] Computed 11 invariants in 9 ms
[2024-05-31 17:56:01] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem CANConstruction-PT-005-ReachabilityFireability-2024-00 is UNSAT
FORMULA CANConstruction-PT-005-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-005-ReachabilityFireability-2024-02 is UNSAT
FORMULA CANConstruction-PT-005-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-005-ReachabilityFireability-2024-05 is UNSAT
FORMULA CANConstruction-PT-005-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-005-ReachabilityFireability-2024-06 is UNSAT
FORMULA CANConstruction-PT-005-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-005-ReachabilityFireability-2024-07 is UNSAT
FORMULA CANConstruction-PT-005-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-005-ReachabilityFireability-2024-09 is UNSAT
FORMULA CANConstruction-PT-005-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 20/111 variables, 6/6 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 4/10 constraints. Problems are: Problem set: 6 solved, 3 unsolved
[2024-05-31 17:56:01] [INFO ] Deduced a trap composed of 6 places in 187 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 1/11 constraints. Problems are: Problem set: 6 solved, 3 unsolved
[2024-05-31 17:56:01] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-31 17:56:01] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-31 17:56:01] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
Problem CANConstruction-PT-005-ReachabilityFireability-2024-04 is UNSAT
FORMULA CANConstruction-PT-005-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 3/14 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/14 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/112 variables, 1/15 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/15 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 140/252 variables, 112/127 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 45/172 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 0/172 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/252 variables, 0/172 constraints. Problems are: Problem set: 7 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 172 constraints, problems are : Problem set: 7 solved, 2 unsolved in 715 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 112/112 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 7 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 82/108 variables, 6/6 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 1/7 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 4/11 constraints. Problems are: Problem set: 7 solved, 2 unsolved
[2024-05-31 17:56:02] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/12 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/12 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 4/112 variables, 4/16 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 140/252 variables, 112/128 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 45/173 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 2/175 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 0/175 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/252 variables, 0/175 constraints. Problems are: Problem set: 7 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 175 constraints, problems are : Problem set: 7 solved, 2 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 112/112 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 2/9 constraints, Known Traps: 5/5 constraints]
After SMT, in 1057ms problems are : Problem set: 7 solved, 2 unsolved
Parikh walk visited 0 properties in 70 ms.
Support contains 26 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 140/140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 112 transition count 129
Reduce places removed 11 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 19 rules applied. Total rules applied 30 place count 101 transition count 121
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 38 place count 93 transition count 121
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 38 place count 93 transition count 119
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 42 place count 91 transition count 119
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 52 place count 81 transition count 99
Iterating global reduction 3 with 10 rules applied. Total rules applied 62 place count 81 transition count 99
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 70 place count 77 transition count 104
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 77 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 76 transition count 103
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 75 place count 76 transition count 103
Applied a total of 75 rules in 40 ms. Remains 76 /112 variables (removed 36) and now considering 103/140 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 76/112 places, 103/140 transitions.
RANDOM walk for 40000 steps (872 resets) in 324 ms. (123 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (235 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (271 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
Probably explored full state space saw : 19115 states, properties seen :0
Probabilistic random walk after 101828 steps, saw 19115 distinct states, run finished after 290 ms. (steps per millisecond=351 ) properties seen :0
Explored full state space saw : 19115 states, properties seen :0
Exhaustive walk after 101828 steps, saw 19115 distinct states, run finished after 251 ms. (steps per millisecond=405 ) properties seen :0
FORMULA CANConstruction-PT-005-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA CANConstruction-PT-005-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.
Total runtime 3695 ms.
ITS solved all properties within timeout
BK_STOP 1717178163199
--------------------
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 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="CANConstruction-PT-005"
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 CANConstruction-PT-005, 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 r476-tall-171620504900007"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-005.tgz
mv CANConstruction-PT-005 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 '
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 ;