About the Execution of LoLa+red for ClientsAndServers-PT-N0100P0
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r071-smll-167814397800317.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ClientsAndServers-PT-N0100P0, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-smll-167814397800317
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.6K Feb 26 13:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 13:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 13:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 13:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 13:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Feb 26 13:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 13:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 26 13:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.2K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ClientsAndServers-PT-N0100P0-UpperBounds-00
FORMULA_NAME ClientsAndServers-PT-N0100P0-UpperBounds-01
FORMULA_NAME ClientsAndServers-PT-N0100P0-UpperBounds-02
FORMULA_NAME ClientsAndServers-PT-N0100P0-UpperBounds-03
FORMULA_NAME ClientsAndServers-PT-N0100P0-UpperBounds-04
FORMULA_NAME ClientsAndServers-PT-N0100P0-UpperBounds-05
FORMULA_NAME ClientsAndServers-PT-N0100P0-UpperBounds-06
FORMULA_NAME ClientsAndServers-PT-N0100P0-UpperBounds-07
FORMULA_NAME ClientsAndServers-PT-N0100P0-UpperBounds-08
FORMULA_NAME ClientsAndServers-PT-N0100P0-UpperBounds-09
FORMULA_NAME ClientsAndServers-PT-N0100P0-UpperBounds-10
FORMULA_NAME ClientsAndServers-PT-N0100P0-UpperBounds-11
FORMULA_NAME ClientsAndServers-PT-N0100P0-UpperBounds-12
FORMULA_NAME ClientsAndServers-PT-N0100P0-UpperBounds-13
FORMULA_NAME ClientsAndServers-PT-N0100P0-UpperBounds-14
FORMULA_NAME ClientsAndServers-PT-N0100P0-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678270098028
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N0100P0
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 10:08:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 10:08:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 10:08:21] [INFO ] Load time of PNML (sax parser for PT used): 134 ms
[2023-03-08 10:08:21] [INFO ] Transformed 25 places.
[2023-03-08 10:08:21] [INFO ] Transformed 18 transitions.
[2023-03-08 10:08:21] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 285 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
// Phase 1: matrix 18 rows 25 cols
[2023-03-08 10:08:21] [INFO ] Computed 8 place invariants in 7 ms
FORMULA ClientsAndServers-PT-N0100P0-UpperBounds-09 800 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0100P0-UpperBounds-06 400 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0100P0-UpperBounds-00 300 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10043 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=590 ) properties (out of 13) seen :2800
FORMULA ClientsAndServers-PT-N0100P0-UpperBounds-14 800 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0100P0-UpperBounds-12 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0100P0-UpperBounds-10 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0100P0-UpperBounds-08 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0100P0-UpperBounds-07 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0100P0-UpperBounds-05 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0100P0-UpperBounds-04 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0100P0-UpperBounds-01 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :38
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :48
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :37
[2023-03-08 10:08:21] [INFO ] Invariant cache hit.
[2023-03-08 10:08:21] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2023-03-08 10:08:21] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-08 10:08:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:08:21] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-08 10:08:21] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-08 10:08:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:08:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-08 10:08:21] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-08 10:08:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:08:21] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-08 10:08:21] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-08 10:08:21] [INFO ] Added : 9 causal constraints over 2 iterations in 29 ms. Result :sat
Minimization took 10 ms.
[2023-03-08 10:08:21] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-08 10:08:21] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-08 10:08:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:08:22] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-08 10:08:22] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-08 10:08:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:08:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 10:08:22] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-08 10:08:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:08:22] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-08 10:08:22] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 10:08:22] [INFO ] Added : 16 causal constraints over 4 iterations in 23 ms. Result :sat
Minimization took 8 ms.
[2023-03-08 10:08:22] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 10:08:22] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-08 10:08:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:08:22] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-08 10:08:22] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 10:08:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:08:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 10:08:22] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-08 10:08:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:08:22] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-08 10:08:22] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-08 10:08:22] [INFO ] Added : 14 causal constraints over 3 iterations in 25 ms. Result :sat
Minimization took 13 ms.
[2023-03-08 10:08:22] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-08 10:08:22] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-08 10:08:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:08:22] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-08 10:08:22] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 10:08:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:08:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-08 10:08:22] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-08 10:08:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:08:22] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-08 10:08:22] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-08 10:08:22] [INFO ] Added : 7 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 6 ms.
[2023-03-08 10:08:22] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-08 10:08:22] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-08 10:08:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:08:22] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-08 10:08:22] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-08 10:08:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:08:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-08 10:08:22] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-08 10:08:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:08:22] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-08 10:08:22] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 10:08:22] [INFO ] Added : 8 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [400, 200, 200, 400, 400] Max seen :[200, 17, 13, 200, 200]
FORMULA ClientsAndServers-PT-N0100P0-UpperBounds-15 400 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N0100P0-UpperBounds-13 400 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N0100P0-UpperBounds-11 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N0100P0-UpperBounds-03 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N0100P0-UpperBounds-02 400 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 3488 ms.
ITS solved all properties within timeout
BK_STOP 1678270105465
--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -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="ClientsAndServers-PT-N0100P0"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is ClientsAndServers-PT-N0100P0, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r071-smll-167814397800317"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0100P0.tgz
mv ClientsAndServers-PT-N0100P0 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;