About the Execution of ITS-Tools for S_BridgeAndVehicles-COL-V04P05N02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
303.690 | 4076.00 | 7797.00 | 104.00 | T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
.......
=====================================================================
Generated by BenchKit 2-3254
Executing tool itstools
Input is S_BridgeAndVehicles-COL-V04P05N02, examination is ReachabilityDeadlock
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r090-csrt-149441076600296
=====================================================================
--------------------
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 BridgeAndVehicles-COL-V04P05N02-ReachabilityDeadlock-0
=== Now, execution of the tool begins
BK_START 1496391027930
Using solver YICES2 to compute partial order matrices.
Built C files in :
/home/mcc/execution
its-ctl command run as :
/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityDeadlock.pnml.gal -t CGAL -ctl DEADLOCK
No direction supplied, using forward translation only.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 52 rows 28 cols
invariant : 1'compteur0:COMPTEUR_0 + 1'compteur1:COMPTEUR_1 + 1'compteur2:COMPTEUR_2= 1
invariant : 1'CAPACITE:CAPACITE[0] + -1'SORTI_A:SORTI_A[0] + -1'ROUTE_A:ROUTE_A[0] + -1'ATTENTE_A:ATTENTE_A[0] + 1'SUR_PONT_B:SUR_PONT_B[0]= 1
invariant : 1'SORTI_A:SORTI_A[0] + 1'ROUTE_A:ROUTE_A[0] + 1'ATTENTE_A:ATTENTE_A[0] + 1'SUR_PONT_A:SUR_PONT_A[0]= 4
invariant : 1'voitureA0:NB_ATTENTE_A_0 + 1'voitureA1:NB_ATTENTE_A_1 + 1'voitureA2:NB_ATTENTE_A_2 + 1'voitureA3:NB_ATTENTE_A_3 + 1'voitureA4:NB_ATTENTE_A_4= 1
invariant : -1'CAPACITE:CAPACITE[0] + 1'SORTI_A:SORTI_A[0] + 1'ROUTE_A:ROUTE_A[0] + 1'ATTENTE_A:ATTENTE_A[0] + 1'ATTENTE_B:ATTENTE_B[0] + 1'ROUTE_B:ROUTE_B[0] + 1'SORTI_B:SORTI_B[0]= 3
invariant : 1'voitureB0:NB_ATTENTE_B_0 + 1'voitureB1:NB_ATTENTE_B_1 + 1'voitureB2:NB_ATTENTE_B_2 + 1'voitureB3:NB_ATTENTE_B_3 + 1'voitureB4:NB_ATTENTE_B_4= 1
invariant : 1'sens0:CONTROLEUR_0 + 1'sens0:CHOIX_0 + 1'sens0:VIDANGE_0 + 1'sens1:CONTROLEUR_1 + 1'sens1:CHOIX_1 + 1'sens1:VIDANGE_1= 1
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2874,0.090127,7448,901,15,8013,90,124,5634,17,102,0
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
dead,4,0.165094,8808,38,9,11009,93,480,12056,81,311,32264
System contains 4 deadlocks (shown below if less than --print-limit option) !
FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityDeadlock-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[ voitureB3={[ ]
} voitureB4={[ ]
} voitureB2={[ ]
} ROUTE_B={[ ]
} ATTENTE_B={[ ]
} SORTI_B={[ SORTI_B[0]=4 ]
} SUR_PONT_B={[ ]
} voitureB1={[ ]
} voitureB0={[ NB_ATTENTE_B_0=1 ]
} SORTI_A={[ SORTI_A[0]=4 ]
} CAPACITE={[ CAPACITE[0]=5 ]
} SUR_PONT_A={[ ]
} sens1={[ CONTROLEUR_1=1 ]
} voitureA3={[ ]
} voitureA2={[ ]
} ATTENTE_A={[ ]
} voitureA4={[ ]
} voitureA1={[ ]
} sens0={[ ]
} ROUTE_A={[ ]
} voitureA0={[ NB_ATTENTE_A_0=1 ]
} compteur2={[ COMPTEUR_2=1 ]
} compteur1={[ ]
} compteur0={[ ]
} ]
[ voitureB3={[ ]
} voitureB4={[ ]
} voitureB2={[ ]
} ROUTE_B={[ ]
} ATTENTE_B={[ ]
} SORTI_B={[ SORTI_B[0]=4 ]
} SUR_PONT_B={[ ]
} voitureB1={[ ]
} voitureB0={[ NB_ATTENTE_B_0=1 ]
} SORTI_A={[ SORTI_A[0]=4 ]
} CAPACITE={[ CAPACITE[0]=5 ]
} SUR_PONT_A={[ ]
} sens1={[ CONTROLEUR_1=1 ]
} voitureA3={[ ]
} voitureA2={[ ]
} ATTENTE_A={[ ]
} voitureA4={[ ]
} voitureA1={[ ]
} sens0={[ ]
} ROUTE_A={[ ]
} voitureA0={[ NB_ATTENTE_A_0=1 ]
} compteur2={[ ]
} compteur1={[ COMPTEUR_1=1 ]
} compteur0={[ ]
} ]
[ voitureB3={[ ]
} voitureB4={[ ]
} voitureB2={[ ]
} ROUTE_B={[ ]
} ATTENTE_B={[ ]
} SORTI_B={[ SORTI_B[0]=4 ]
} SUR_PONT_B={[ ]
} voitureB1={[ ]
} voitureB0={[ NB_ATTENTE_B_0=1 ]
} SORTI_A={[ SORTI_A[0]=4 ]
} CAPACITE={[ CAPACITE[0]=5 ]
} SUR_PONT_A={[ ]
} sens1={[ ]
} voitureA3={[ ]
} voitureA2={[ ]
} ATTENTE_A={[ ]
} voitureA4={[ ]
} voitureA1={[ ]
} sens0={[ CONTROLEUR_0=1 ]
} ROUTE_A={[ ]
} voitureA0={[ NB_ATTENTE_A_0=1 ]
} compteur2={[ COMPTEUR_2=1 ]
} compteur1={[ ]
} compteur0={[ ]
} ]
[ voitureB3={[ ]
} voitureB4={[ ]
} voitureB2={[ ]
} ROUTE_B={[ ]
} ATTENTE_B={[ ]
} SORTI_B={[ SORTI_B[0]=4 ]
} SUR_PONT_B={[ ]
} voitureB1={[ ]
} voitureB0={[ NB_ATTENTE_B_0=1 ]
} SORTI_A={[ SORTI_A[0]=4 ]
} CAPACITE={[ CAPACITE[0]=5 ]
} SUR_PONT_A={[ ]
} sens1={[ ]
} voitureA3={[ ]
} voitureA2={[ ]
} ATTENTE_A={[ ]
} voitureA4={[ ]
} voitureA1={[ ]
} sens0={[ CONTROLEUR_0=1 ]
} ROUTE_A={[ ]
} voitureA0={[ NB_ATTENTE_A_0=1 ]
} compteur2={[ ]
} compteur1={[ COMPTEUR_1=1 ]
} compteur0={[ ]
} ]
Exit code :0
BK_STOP 1496391032006
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.201.v20161025-1711.jar org.eclipse.equinox.launcher.Main -application fr.lip6.move.gal.application.pnmcc -data /home/mcc/BenchKit//workspace -os linux -ws gtk -arch x86_64 -nl en_US -consoleLog -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
Jun 02, 2017 8:10:29 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2017 8:10:29 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
Jun 02, 2017 8:10:30 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 1446 ms
Jun 02, 2017 8:10:30 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 15 places.
Jun 02, 2017 8:10:30 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
Jun 02, 2017 8:10:30 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :sens->CONTROLEUR,CHOIX,VIDANGE,
compteur->COMPTEUR,
Dot->CAPACITE,SORTI_A,ROUTE_A,ATTENTE_A,SUR_PONT_A,SUR_PONT_B,ATTENTE_B,ROUTE_B,SORTI_B,
voitureA->NB_ATTENTE_A,
voitureB->NB_ATTENTE_B,
Jun 02, 2017 8:10:31 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 11 transitions.
Jun 02, 2017 8:10:31 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
Jun 02, 2017 8:10:31 AM fr.lip6.move.gal.logic.togal.ToGalTransformer toGal
WARNING: Unknown predicate type in boolean expression fr.lip6.move.gal.logic.impl.DeadlockImpl
Jun 02, 2017 8:10:31 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 02, 2017 8:10:31 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 02, 2017 8:10:31 AM fr.lip6.move.gal.instantiate.Instantiator instantiateParameters
INFO: On-the-fly reduction of False transitions avoided exploring 19 instantiations of transitions. Total transitions/syncs built is 58
Jun 02, 2017 8:10:31 AM fr.lip6.move.gal.instantiate.PropertySimplifier rewriteWithInitialState
INFO: Reachable property BridgeAndVehicles-COL-V04P05N02-ReachabilityDeadlock-0 is trivially true : it is verified in initial state.
Jun 02, 2017 8:10:31 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 47 ms
Jun 02, 2017 8:10:31 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays NB_ATTENTE_A, NB_ATTENTE_B, CONTROLEUR, CHOIX, COMPTEUR, VIDANGE to variables to allow decomposition.
Jun 02, 2017 8:10:31 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 29 redundant transitions.
Jun 02, 2017 8:10:31 AM fr.lip6.move.gal.instantiate.PropertySimplifier rewriteWithInitialState
INFO: Reachable property BridgeAndVehicles-COL-V04P05N02-ReachabilityDeadlock-0 is trivially true : it is verified in initial state.
Jun 02, 2017 8:10:31 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/ReachabilityDeadlock.pnml.gal : 23 ms
Jun 02, 2017 8:10:31 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 7 place invariants in 13 ms
Jun 02, 2017 8:10:31 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 28 variables to be positive in 66 ms
Jun 02, 2017 8:10:31 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 52 transitions.
Jun 02, 2017 8:10:31 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/52 took 5 ms. Total solver calls (SAT/UNSAT): 29(2/27)
Jun 02, 2017 8:10:31 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityDeadlock.pnml.gal, -t, CGAL, -ctl, DEADLOCK], workingDir=/home/mcc/execution]
built 47 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions enregistrement_A, liberation_A, basculement, liberation_B, enregistrement_B, altern_cpt, timeout_A, timeout_B, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/3/8/11
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="S_BridgeAndVehicles-COL-V04P05N02"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# 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
tar xzf /home/mcc/BenchKit/INPUTS/S_BridgeAndVehicles-COL-V04P05N02.tgz
mv S_BridgeAndVehicles-COL-V04P05N02 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool itstools"
echo " Input is S_BridgeAndVehicles-COL-V04P05N02, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r090-csrt-149441076600296"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityDeadlock" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityDeadlock" != "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 "ReachabilityDeadlock.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityDeadlock.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityDeadlock.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
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 ;