fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r110-blw3-149441614700593
Last Updated
June 27, 2017

About the Execution of ITS-Tools for S_GPPP-PT-C1000N0000001000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15739.050 2361811.00 3006760.00 1040.20 [undef] Cannot compute

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_GPPP-PT-C1000N0000001000, examination is ReachabilityDeadlock
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r110-blw3-149441614700593
=====================================================================


--------------------
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 GPPP-PT-C1000N0000001000-ReachabilityDeadlock-0

=== Now, execution of the tool begins

BK_START 1496466538138


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 22 rows 33 cols
invariant : = 0
invariant : -1'Pi + 1'ATP + 1'NADplus + 1'ADP + -1'Lac= 6000
invariant : 1'NADplus + 1'NADH= 2000
invariant : 1'Pi + 1'Ru5P + 1'Xu5P + 1'R5P + 1'S7P + 1'GAP + 1'E4P + 1'F6P + 1'G6P + 2'FBP + 1'DHAP + 2'_1_3_BPG + -1'ADP + 1'_3PG + 1'_2PG + 1'PEP= 0
invariant : -71'ATP + -71'ADP + -104'start= -284104
invariant : -1'Pi + 1'NADplus + -1'Ru5P + -1'Xu5P + -1'R5P + -1'S7P + -1'GAP + -1'E4P + -1'F6P + -1'G6P + -2'FBP + -1'DHAP + -1'_1_3_BPG + 1'ADP + 1'Pyr= 2000
invariant : 2'GSSG + 1'GSH= 2000
invariant : 1'NADPplus + 1'NADPH= 2000
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
Exit code :0
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Exit code :0
Exit code :134
Exit code :255

BK_STOP 1496468899949

--------------------
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 03, 2017 5:08:59 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 03, 2017 5:08:59 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 42 ms
Jun 03, 2017 5:08:59 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 33 places.
Jun 03, 2017 5:08:59 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 22 transitions.
Jun 03, 2017 5:08:59 AM fr.lip6.move.gal.logic.togal.ToGalTransformer toGal
WARNING: Unknown predicate type in boolean expression fr.lip6.move.gal.logic.impl.DeadlockImpl
Jun 03, 2017 5:09:00 AM fr.lip6.move.gal.instantiate.PropertySimplifier rewriteWithInitialState
INFO: Reachable property GPPP-PT-C1000N0000001000-ReachabilityDeadlock-0 is trivially true : it is verified in initial state.
Jun 03, 2017 5:09:00 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 40 ms
Jun 03, 2017 5:09:00 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/ReachabilityDeadlock.pnml.gal : 8 ms
Jun 03, 2017 5:09:00 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 8 place invariants in 18 ms
Jun 03, 2017 5:09:00 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 33 variables to be positive in 84 ms
Jun 03, 2017 5:09:00 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 22 transitions.
Jun 03, 2017 5:09:00 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/22 took 4 ms. Total solver calls (SAT/UNSAT): 4(2/2)
Jun 03, 2017 5:09:00 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 62 ms. Total solver calls (SAT/UNSAT): 95(25/70)
Jun 03, 2017 5:09:00 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 22 transitions.
Jun 03, 2017 5:09:00 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 60 ms. Total solver calls (SAT/UNSAT): 95(32/63)
Jun 03, 2017 5:09:00 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 22 transitions.
Jun 03, 2017 5:09:00 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished enabling matrix. took 109 ms. Total solver calls (SAT/UNSAT): 253(119/134)
Jun 03, 2017 5:09:00 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 22 transitions.
Jun 03, 2017 5:09:00 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 273 ms. Total solver calls (SAT/UNSAT): 30(0/30)
Jun 03, 2017 5:09:00 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 779ms conformant to PINS in folder :/home/mcc/execution
Jun 03, 2017 5:19:36 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]
terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc

Jun 03, 2017 5:48:19 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, -d], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.001: library has no initializer
pins2lts-seq, 0.001: loading model GAL
pins2lts-seq, 0.001: completed loading model GAL
pins2lts-seq, 0.001: Initializing POR dependencies: labels 23, guards 22
pins2lts-seq, 0.001: There are 23 state labels and 1 edge labels
pins2lts-seq, 0.001: State length is 33, there are 22 groups
pins2lts-seq, 0.001: Running dfs search strategy
pins2lts-seq, 0.001: Using a tree for state storage
pins2lts-seq, 0.001: Visible groups: 0 / 22, labels: 0 / 23
pins2lts-seq, 0.001: POR cycle proviso: none
pins2lts-seq, 0.042: explored 10000 levels ~10000 states ~13999 transitions
pins2lts-seq, 0.082: explored 20000 levels ~20000 states ~23999 transitions
pins2lts-seq, 0.169: explored 27998 levels ~40000 states ~44002 transitions
pins2lts-seq, 0.355: explored 27998 levels ~80000 states ~84012 transitions
pins2lts-seq, 0.731: explored 27998 levels ~160000 states ~164179 transitions
pins2lts-seq, 1.521: explored 27998 levels ~320000 states ~324819 transitions
pins2lts-seq, 3.170: explored 27998 levels ~640000 states ~646091 transitions
pins2lts-seq, 6.614: explored 27998 levels ~1280000 states ~1288643 transitions
pins2lts-seq, 13.153: explored 27998 levels ~2560000 states ~2573731 transitions
pins2lts-seq, 26.322: explored 27998 levels ~5120000 states ~5146547 transitions
pins2lts-seq, 52.767: explored 27998 levels ~10240000 states ~10410873 transitions
pins2lts-seq, 108.388: explored 27998 levels ~20480000 states ~20897927 transitions
pins2lts-seq, 220.657: explored 27998 levels ~40960000 states ~41750622 transitions
pins2lts-seq, 457.408: explored 27998 levels ~81920000 states ~83291078 transitions
pins2lts-seq, 936.167: explored 27998 levels ~163840000 states ~166122686 transitions
pins2lts-seq, 1900.417: explored 27998 levels ~327680000 states ~331405234 transitions
pins2lts-seq, 2357.226, ** error **: out of memory trying to resize to 4294967296

LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, -d], workingDir=/home/mcc/execution]
Status WARNING: fr.lip6.move.gal code=255 pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.001: library has no initializer
pins2lts-seq, 0.001: loading model GAL
pins2lts-seq, 0.001: completed loading model GAL
pins2lts-seq, 0.001: Initializing POR dependencies: labels 23, guards 22
pins2lts-seq, 0.001: There are 23 state labels and 1 edge labels
pins2lts-seq, 0.001: State length is 33, there are 22 groups
pins2lts-seq, 0.001: Running dfs search strategy
pins2lts-seq, 0.001: Using a tree for state storage
pins2lts-seq, 0.001: Visible groups: 0 / 22, labels: 0 / 23
pins2lts-seq, 0.001: POR cycle proviso: none
pins2lts-seq, 0.042: explored 10000 levels ~10000 states ~13999 transitions
pins2lts-seq, 0.082: explored 20000 levels ~20000 states ~23999 transitions
pins2lts-seq, 0.169: explored 27998 levels ~40000 states ~44002 transitions
pins2lts-seq, 0.355: explored 27998 levels ~80000 states ~84012 transitions
pins2lts-seq, 0.731: explored 27998 levels ~160000 states ~164179 transitions
pins2lts-seq, 1.521: explored 27998 levels ~320000 states ~324819 transitions
pins2lts-seq, 3.170: explored 27998 levels ~640000 states ~646091 transitions
pins2lts-seq, 6.614: explored 27998 levels ~1280000 states ~1288643 transitions
pins2lts-seq, 13.153: explored 27998 levels ~2560000 states ~2573731 transitions
pins2lts-seq, 26.322: explored 27998 levels ~5120000 states ~5146547 transitions
pins2lts-seq, 52.767: explored 27998 levels ~10240000 states ~10410873 transitions
pins2lts-seq, 108.388: explored 27998 levels ~20480000 states ~20897927 transitions
pins2lts-seq, 220.657: explored 27998 levels ~40960000 states ~41750622 transitions
pins2lts-seq, 457.408: explored 27998 levels ~81920000 states ~83291078 transitions
pins2lts-seq, 936.167: explored 27998 levels ~163840000 states ~166122686 transitions
pins2lts-seq, 1900.417: explored 27998 levels ~327680000 states ~331405234 transitions
pins2lts-seq, 2357.226, ** error **: out of memory trying to resize to 4294967296
null
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, -d], workingDir=/home/mcc/execution]
Status WARNING: fr.lip6.move.gal code=255 pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.001: library has no initializer
pins2lts-seq, 0.001: loading model GAL
pins2lts-seq, 0.001: completed loading model GAL
pins2lts-seq, 0.001: Initializing POR dependencies: labels 23, guards 22
pins2lts-seq, 0.001: There are 23 state labels and 1 edge labels
pins2lts-seq, 0.001: State length is 33, there are 22 groups
pins2lts-seq, 0.001: Running dfs search strategy
pins2lts-seq, 0.001: Using a tree for state storage
pins2lts-seq, 0.001: Visible groups: 0 / 22, labels: 0 / 23
pins2lts-seq, 0.001: POR cycle proviso: none
pins2lts-seq, 0.042: explored 10000 levels ~10000 states ~13999 transitions
pins2lts-seq, 0.082: explored 20000 levels ~20000 states ~23999 transitions
pins2lts-seq, 0.169: explored 27998 levels ~40000 states ~44002 transitions
pins2lts-seq, 0.355: explored 27998 levels ~80000 states ~84012 transitions
pins2lts-seq, 0.731: explored 27998 levels ~160000 states ~164179 transitions
pins2lts-seq, 1.521: explored 27998 levels ~320000 states ~324819 transitions
pins2lts-seq, 3.170: explored 27998 levels ~640000 states ~646091 transitions
pins2lts-seq, 6.614: explored 27998 levels ~1280000 states ~1288643 transitions
pins2lts-seq, 13.153: explored 27998 levels ~2560000 states ~2573731 transitions
pins2lts-seq, 26.322: explored 27998 levels ~5120000 states ~5146547 transitions
pins2lts-seq, 52.767: explored 27998 levels ~10240000 states ~10410873 transitions
pins2lts-seq, 108.388: explored 27998 levels ~20480000 states ~20897927 transitions
pins2lts-seq, 220.657: explored 27998 levels ~40960000 states ~41750622 transitions
pins2lts-seq, 457.408: explored 27998 levels ~81920000 states ~83291078 transitions
pins2lts-seq, 936.167: explored 27998 levels ~163840000 states ~166122686 transitions
pins2lts-seq, 1900.417: explored 27998 levels ~327680000 states ~331405234 transitions
pins2lts-seq, 2357.226, ** error **: out of memory trying to resize to 4294967296
null
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:130)
at java.lang.Thread.run(Thread.java:748)

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_GPPP-PT-C1000N0000001000"
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_GPPP-PT-C1000N0000001000.tgz
mv S_GPPP-PT-C1000N0000001000 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_GPPP-PT-C1000N0000001000, 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 r110-blw3-149441614700593"
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 '' ReachabilityDeadlock.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;