Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r298-tajo-171654454800062.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-COL-S02J06T06, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tajo-171654454800062
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.9K Apr 11 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 11 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 11 16:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 11 16:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.1K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 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 1717103357139

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-COL-S02J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 21:09:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-30 21:09:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 21:09:18] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-30 21:09:19] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 21:09:19] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 769 ms
[2024-05-30 21:09:19] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 536 PT places and 1096.0 transition bindings in 45 ms.
[2024-05-30 21:09:19] [INFO ] Unfolded HLPN to a Petri net with 536 places and 1064 transitions 4866 arcs in 41 ms.
[2024-05-30 21:09:19] [INFO ] Unfolded 65 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
[2024-05-30 21:09:19] [INFO ] Reduced 6 identical enabling conditions.
[2024-05-30 21:09:19] [INFO ] Reduced 24 identical enabling conditions.
[2024-05-30 21:09:19] [INFO ] Reduced 66 identical enabling conditions.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
RANDOM walk for 40000 steps (19 resets) in 1481 ms. (26 steps per ms) remains 6/64 properties
BEST_FIRST walk for 40001 steps (10 resets) in 509 ms. (78 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (11 resets) in 368 ms. (108 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (9 resets) in 527 ms. (75 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (10 resets) in 491 ms. (81 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 314 ms. (126 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (11 resets) in 194 ms. (205 steps per ms) remains 6/6 properties
[2024-05-30 21:09:21] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 536 cols
[2024-05-30 21:09:21] [INFO ] Computed 50 invariants in 42 ms
[2024-05-30 21:09:21] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 175/204 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 243/447 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 9/456 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem qltransition_35 is UNSAT
FORMULA QuasiLiveness FALSE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL INITIAL_STATE
SMT process timed out in 1063ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 536 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 534 transition count 926
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 86 place count 492 transition count 926
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 86 place count 492 transition count 866
Deduced a syphon composed of 60 places in 6 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 206 place count 432 transition count 866
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 302 place count 384 transition count 818
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 308 place count 384 transition count 812
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 314 place count 378 transition count 812
Applied a total of 314 rules in 197 ms. Remains 378 /536 variables (removed 158) and now considering 812/968 (removed 156) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-30 21:09:22] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 378 cols
[2024-05-30 21:09:22] [INFO ] Computed 48 invariants in 28 ms
[2024-05-30 21:09:22] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/376 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-30 21:09:28] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 21 ms to minimize.
[2024-05-30 21:09:28] [INFO ] Deduced a trap composed of 47 places in 94 ms of which 3 ms to minimize.
[2024-05-30 21:09:28] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-05-30 21:09:28] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 2 ms to minimize.
[2024-05-30 21:09:28] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 1 ms to minimize.
[2024-05-30 21:09:28] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2024-05-30 21:09:29] [INFO ] Deduced a trap composed of 146 places in 370 ms of which 3 ms to minimize.
[2024-05-30 21:09:29] [INFO ] Deduced a trap composed of 145 places in 310 ms of which 11 ms to minimize.
[2024-05-30 21:09:29] [INFO ] Deduced a trap composed of 144 places in 183 ms of which 5 ms to minimize.
[2024-05-30 21:09:32] [INFO ] Deduced a trap composed of 222 places in 217 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 10/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-30 21:09:37] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 1 ms to minimize.
[2024-05-30 21:09:37] [INFO ] Deduced a trap composed of 169 places in 184 ms of which 3 ms to minimize.
[2024-05-30 21:09:37] [INFO ] Deduced a trap composed of 152 places in 130 ms of which 1 ms to minimize.
[2024-05-30 21:09:37] [INFO ] Deduced a trap composed of 62 places in 125 ms of which 2 ms to minimize.
[2024-05-30 21:09:38] [INFO ] Deduced a trap composed of 173 places in 164 ms of which 2 ms to minimize.
[2024-05-30 21:09:38] [INFO ] Deduced a trap composed of 56 places in 144 ms of which 3 ms to minimize.
[2024-05-30 21:09:41] [INFO ] Deduced a trap composed of 137 places in 218 ms of which 3 ms to minimize.
[2024-05-30 21:09:42] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
[2024-05-30 21:09:42] [INFO ] Deduced a trap composed of 102 places in 145 ms of which 2 ms to minimize.
[2024-05-30 21:09:42] [INFO ] Deduced a trap composed of 124 places in 176 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 10/66 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 376/1178 variables, and 66 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/378 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/376 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-30 21:09:45] [INFO ] Deduced a trap composed of 63 places in 157 ms of which 3 ms to minimize.
[2024-05-30 21:09:47] [INFO ] Deduced a trap composed of 134 places in 228 ms of which 3 ms to minimize.
[2024-05-30 21:09:51] [INFO ] Deduced a trap composed of 3 places in 192 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-30 21:09:54] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
[2024-05-30 21:09:58] [INFO ] Deduced a trap composed of 126 places in 210 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 8)
(s1 2)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/1178 variables, and 71 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/378 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 25/25 constraints]
After SMT, in 41289ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 41320ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41541 ms. Remains : 378/536 places, 812/968 transitions.
Total runtime 45143 ms.
ITS solved all properties within timeout

BK_STOP 1717103403861

--------------------
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="PolyORBLF-COL-S02J06T06"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is PolyORBLF-COL-S02J06T06, 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 r298-tajo-171654454800062"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J06T06.tgz
mv PolyORBLF-COL-S02J06T06 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 ;