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.r470-smll-171620175500082.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 AutoFlight-PT-05b, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r470-smll-171620175500082
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 22:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Apr 12 22:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 22:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 12 22:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 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 113K 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717191453201

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=AutoFlight-PT-05b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:37:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-31 21:37:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:37:35] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2024-05-31 21:37:35] [INFO ] Transformed 482 places.
[2024-05-31 21:37:35] [INFO ] Transformed 480 transitions.
[2024-05-31 21:37:35] [INFO ] Found NUPN structural information;
[2024-05-31 21:37:35] [INFO ] Parsed PT model containing 482 places and 480 transitions and 1120 arcs in 320 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 482/482 places, 480/480 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 189 transitions
Trivial Post-agglo rules discarded 189 transitions
Performed 189 trivial Post agglomeration. Transition count delta: 189
Iterating post reduction 0 with 189 rules applied. Total rules applied 189 place count 482 transition count 291
Reduce places removed 189 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 224 rules applied. Total rules applied 413 place count 293 transition count 256
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 423 place count 283 transition count 256
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 423 place count 283 transition count 189
Deduced a syphon composed of 67 places in 4 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 557 place count 216 transition count 189
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 0 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 184 rules applied. Total rules applied 741 place count 124 transition count 97
Applied a total of 741 rules in 127 ms. Remains 124 /482 variables (removed 358) and now considering 97/480 (removed 383) transitions.
// Phase 1: matrix 97 rows 124 cols
[2024-05-31 21:37:36] [INFO ] Computed 34 invariants in 19 ms
[2024-05-31 21:37:36] [INFO ] Implicit Places using invariants in 480 ms returned [38, 41, 44, 47, 50, 123]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 660 ms to find 6 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 118/482 places, 97/480 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 118 transition count 92
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 113 transition count 92
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 24 place count 106 transition count 85
Applied a total of 24 rules in 9 ms. Remains 106 /118 variables (removed 12) and now considering 85/97 (removed 12) transitions.
// Phase 1: matrix 85 rows 106 cols
[2024-05-31 21:37:36] [INFO ] Computed 28 invariants in 2 ms
[2024-05-31 21:37:36] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-05-31 21:37:36] [INFO ] Invariant cache hit.
[2024-05-31 21:37:36] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-31 21:37:36] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 106/482 places, 85/480 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1330 ms. Remains : 106/482 places, 85/480 transitions.
Discarding 20 transitions out of 85. Remains 65
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (1780 resets) in 1714 ms. (23 steps per ms) remains 13/64 properties
BEST_FIRST walk for 40004 steps (135 resets) in 252 ms. (158 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (133 resets) in 179 ms. (222 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (158 resets) in 149 ms. (266 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (156 resets) in 115 ms. (344 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (155 resets) in 138 ms. (287 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (157 resets) in 116 ms. (341 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (156 resets) in 92 ms. (430 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (156 resets) in 74 ms. (533 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (157 resets) in 59 ms. (666 steps per ms) remains 10/12 properties
BEST_FIRST walk for 40003 steps (157 resets) in 85 ms. (465 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (157 resets) in 72 ms. (548 steps per ms) remains 10/10 properties
[2024-05-31 21:37:38] [INFO ] Invariant cache hit.
[2024-05-31 21:37:38] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 48/63 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 48/70 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 43/106 variables, 21/91 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 43/134 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-31 21:37:38] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 6 ms to minimize.
[2024-05-31 21:37:38] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 85/191 variables, 106/242 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 25/267 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/191 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 267 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1125 ms.
Refiners :[Domain max(s): 106/106 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 106/106 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 48/63 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 48/70 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 43/106 variables, 21/91 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 43/134 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 85/191 variables, 106/242 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 25/267 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 10/277 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-31 21:37:39] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/191 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 0/191 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 278 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1059 ms.
Refiners :[Domain max(s): 106/106 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 106/106 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 3/3 constraints]
After SMT, in 2229ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Finished Parikh walk after 85 steps, including 1 resets, run visited all 10 properties in 7 ms. (steps per millisecond=12 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 10 properties in 21 ms.
Able to resolve query QuasiLiveness after proving 65 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 5094 ms.
ITS solved all properties within timeout

BK_STOP 1717191460446

--------------------
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 QuasiLiveness -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="AutoFlight-PT-05b"
export BK_EXAMINATION="QuasiLiveness"
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 AutoFlight-PT-05b, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r470-smll-171620175500082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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