fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r177-smll-152708747900384
Last Updated
June 26, 2018

About the Execution of ITS-Tools.L for TriangularGrid-PT-3011

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15753.170 8966.00 19515.00 359.90 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)
..................
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.8K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.9K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 70K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is TriangularGrid-PT-3011, examination is ReachabilityDeadlock
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r177-smll-152708747900384
=====================================================================


--------------------
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 TriangularGrid-PT-3011-ReachabilityDeadlock-0

=== Now, execution of the tool begins

BK_START 1527598085586

Flatten gal took : 122 ms
Applied a total of 0 rules in 15 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 108 cols
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/convert-linux64, -i, /tmp/graph7545861516242004348.txt, -o, /tmp/graph7545861516242004348.bin, -w, /tmp/graph7545861516242004348.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/louvain-linux64, /tmp/graph7545861516242004348.bin, -l, -1, -v, -w, /tmp/graph7545861516242004348.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 90 rows 108 cols
invariant :pi2_3_5 + pil2_3_5 = 1
invariant :pb1_3_3 + pb2_3_3 + pb3_3_3 + pbl_3_3 = 4
invariant :po2_2_1 + pol2_2_1 = 1
invariant :pi2_2_1 + pil2_2_1 = 1
invariant :po3_2_1 + pol3_2_1 = 1
invariant :pi3_1_1 + pil3_1_1 = 1
invariant :pi1_1_1 + pil1_1_1 = 1
invariant :pi1_3_5 + pil1_3_5 = 1
invariant :po2_1_1 + pol2_1_1 = 1
invariant :pi2_2_3 + pil2_2_3 = 1
invariant :pb1_2_1 + pb2_2_1 + pb3_2_1 + pbl_2_1 = 4
invariant :pi3_2_1 + pil3_2_1 = 1
invariant :po1_1_1 + pol1_1_1 = 1
invariant :pb1_1_1 + pb2_1_1 + pb3_1_1 + pbl_1_1 = 4
invariant :pi1_3_1 + pil1_3_1 = 1
invariant :pi1_2_1 + pil1_2_1 = 1
invariant :po2_3_3 + pol2_3_3 = 1
invariant :pi1_2_3 + pil1_2_3 = 1
invariant :po1_3_5 + pol1_3_5 = 1
invariant :pb1_2_2 + pb2_2_2 + pb3_2_2 + -1'pbl_1_1 + -1'pbl_2_1 + -1'pbl_2_3 + -1'pbl_3_1 + -1'pbl_3_2 + -1'pbl_3_3 + -1'pbl_3_4 + -1'pbl_3_5 + -1'pil1_1_1 + -1'pil1_2_1 + -1'pil1_2_3 + -1'pil1_3_1 + -1'pil1_3_3 + -1'pil1_3_5 + -1'pil2_1_1 + -1'pil2_2_1 + -1'pil2_2_3 + -1'pil2_3_1 + -1'pil2_3_3 + -1'pil2_3_5 + -1'pil3_1_1 + -1'pil3_2_1 + -1'pil3_2_3 + -1'pil3_3_1 + -1'pil3_3_3 + -1'pil3_3_5 + -1'pol1_1_1 + -1'pol1_2_1 + -1'pol1_2_3 + -1'pol1_3_1 + -1'pol1_3_3 + -1'pol1_3_5 + -1'pol2_1_1 + -1'pol2_2_1 + -1'pol2_2_3 + -1'pol2_3_1 + -1'pol2_3_3 + -1'pol2_3_5 + -1'pol3_1_1 + -1'pol3_2_1 + -1'pol3_2_3 + -1'pol3_3_1 + -1'pol3_3_3 + -1'pol3_3_5 = -41
invariant :po3_1_1 + pol3_1_1 = 1
invariant :pb1_3_5 + pb2_3_5 + pb3_3_5 + pbl_3_5 = 4
invariant :pbl_1_1 + pbl_2_1 + pbl_2_2 + pbl_2_3 + pbl_3_1 + pbl_3_2 + pbl_3_3 + pbl_3_4 + pbl_3_5 + pil1_1_1 + pil1_2_1 + pil1_2_3 + pil1_3_1 + pil1_3_3 + pil1_3_5 + pil2_1_1 + pil2_2_1 + pil2_2_3 + pil2_3_1 + pil2_3_3 + pil2_3_5 + pil3_1_1 + pil3_2_1 + pil3_2_3 + pil3_3_1 + pil3_3_3 + pil3_3_5 + pol1_1_1 + pol1_2_1 + pol1_2_3 + pol1_3_1 + pol1_3_3 + pol1_3_5 + pol2_1_1 + pol2_2_1 + pol2_2_3 + pol2_3_1 + pol2_3_3 + pol2_3_5 + pol3_1_1 + pol3_2_1 + pol3_2_3 + pol3_3_1 + pol3_3_3 + pol3_3_5 = 45
invariant :po1_2_3 + pol1_2_3 = 1
invariant :pi2_3_3 + pil2_3_3 = 1
invariant :pi3_3_5 + pil3_3_5 = 1
invariant :po1_2_1 + pol1_2_1 = 1
invariant :po3_3_3 + pol3_3_3 = 1
invariant :po2_2_3 + pol2_2_3 = 1
invariant :pi1_3_3 + pil1_3_3 = 1
invariant :pb1_2_3 + pb2_2_3 + pb3_2_3 + pbl_2_3 = 4
invariant :po2_3_5 + pol2_3_5 = 1
invariant :pi3_3_1 + pil3_3_1 = 1
invariant :po2_3_1 + pol2_3_1 = 1
invariant :po1_3_3 + pol1_3_3 = 1
invariant :po3_3_1 + pol3_3_1 = 1
invariant :pb1_3_1 + pb2_3_1 + pb3_3_1 + pbl_3_1 = 4
invariant :pi3_2_3 + pil3_2_3 = 1
invariant :pi3_3_3 + pil3_3_3 = 1
invariant :pb1_3_4 + pb2_3_4 + pb3_3_4 + pbl_3_4 = 4
invariant :po3_2_3 + pol3_2_3 = 1
invariant :po3_3_5 + pol3_3_5 = 1
invariant :pb1_3_2 + pb2_3_2 + pb3_3_2 + pbl_3_2 = 4
invariant :pi2_1_1 + pil2_1_1 = 1
invariant :po1_3_1 + pol1_3_1 = 1
invariant :pi2_3_1 + pil2_3_1 = 1
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityDeadlock.pnml.gal, -t, CGAL, -ctl, DEADLOCK], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/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.
built 18 ordering constraints for composite.
built 12 ordering constraints for composite.
built 12 ordering constraints for composite.
built 12 ordering constraints for composite.
built 12 ordering constraints for composite.
built 12 ordering constraints for composite.
built 12 ordering constraints for composite.
built 12 ordering constraints for composite.
built 12 ordering constraints for composite.
built 12 ordering constraints for composite.
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,2.84676e+20,2.77257,69572,623,51,123972,1680,162,221127,25,19379,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,2.42921e+06,3.7673,69572,4984,147,123972,1680,447,221127,114,19379,9669

System contains 2.42921e+06 deadlocks (shown below if less than --print-limit option) !
FORMULA TriangularGrid-PT-3011-ReachabilityDeadlock-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[ 2429209 states ] showing 10 first states
[ i8={[ u43={[ pol3_3_1=1 ]
} u26={[ pil3_3_1=1 ]
} u29={[ pol1_3_1=1 ]
} u23={[ pil2_3_1=1 ]
} u5={[ pbl_3_1=4 ]
} u18={[ pil1_3_1=1 ]
} ]
} i7={[ u35={[ pol3_3_3=1 ]
} u19={[ pil1_3_3=1 ]
} u14={[ pil3_3_3=1 ]
} u6={[ pbl_3_3=4 ]
} u11={[ pil2_3_3=1 ]
} ]
} i3={[ u40={[ pol2_3_3=1 ]
} u34={[ pol3_2_3=1 ]
} u7={[ pbl_3_4=4 ]
} u31={[ pol1_3_5=1 ]
} ]
} i6={[ u39={[ po2_2_3=1 ]
} u17={[ pil1_2_3=1 ]
} u13={[ pil3_2_3=1 ]
} u10={[ pi2_2_3=1 ]
} u4={[ pb2_2_3=4 ]
} ]
} i4={[ u44={[ po3_3_5=1 ]
} u41={[ po2_3_5=1 ]
} u24={[ pi2_3_5=1 ]
} u20={[ pi1_3_5=1 ]
} u15={[ pi3_3_5=1 ]
} u8={[ pb2_3_5=4 ]
[ pb3_3_5=1 pb2_3_5=3 ]
[ pb3_3_5=2 pb2_3_5=2 ]
[ pb3_3_5=3 pb2_3_5=1 ]
[ pb3_3_5=4 ]
} ]
} i1={[ u42={[ pol3_2_1=1 ]
} u32={[ pol2_3_1=1 ]
} u1={[ pbl_3_2=4 ]
} u30={[ pol1_3_3=1 ]
} ]
} i5={[ u37={[ pol2_1_1=1 ]
} u27={[ pol1_1_1=1 ]
} u25={[ pil3_1_1=1 ]
} u21={[ pil2_1_1=1 ]
} u2={[ pbl_1_1=4 ]
} u9={[ pil1_1_1=1 ]
} ]
} i0={[ u38={[ po2_2_1=1 ]
} u36={[ pol1_2_3=1 ]
} u0={[ pb2_2_2=4 ]
} u33={[ po3_1_1=1 ]
} ]
[ u38={[ po2_2_1=1 ]
} u36={[ po1_2_3=1 ]
} u0={[ pb2_2_2=4 ]
} u33={[ pol3_1_1=1 ]
} ]
} i2={[ u28={[ pol1_2_1=1 ]
} u22={[ pi2_2_1=1 ]
} u16={[ pil1_2_1=1 ]
} u3={[ pb2_2_1=4 ]
} u12={[ pi3_2_1=1 ]
} ]
[ u28={[ pol1_2_1=1 ]
} u22={[ pi2_2_1=1 ]
} u16={[ pi1_2_1=1 ]
} u3={[ pb2_2_1=4 ]
} u12={[ pil3_2_1=1 ]
} ]
} ]
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]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527598094552

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
May 29, 2018 12:48:08 PM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -louvain, -smt]
May 29, 2018 12:48:08 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 29, 2018 12:48:08 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 96 ms
May 29, 2018 12:48:08 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 108 places.
May 29, 2018 12:48:08 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 90 transitions.
May 29, 2018 12:48:08 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 19 ms
May 29, 2018 12:48:08 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 116 ms
May 29, 2018 12:48:08 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.simple.gal : 6 ms
May 29, 2018 12:48:09 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 90 transitions.
May 29, 2018 12:48:09 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
May 29, 2018 12:48:09 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 49 ms
May 29, 2018 12:48:09 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 90 transitions.
May 29, 2018 12:48:09 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 57 ms
Begin: Tue May 29 12:48:09 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Tue May 29 12:48:09 2018
network size: 108 nodes, 432 links, 180 weight
quality increased from -0.0118056 to 0.468889
end computation: Tue May 29 12:48:09 2018
level 1:
start computation: Tue May 29 12:48:09 2018
network size: 45 nodes, 171 links, 180 weight
quality increased from 0.468889 to 0.788148
end computation: Tue May 29 12:48:09 2018
level 2:
start computation: Tue May 29 12:48:09 2018
network size: 9 nodes, 27 links, 180 weight
quality increased from 0.788148 to 0.788148
end computation: Tue May 29 12:48:09 2018
End: Tue May 29 12:48:09 2018
Total duration: 0 sec
0.788148
May 29, 2018 12:48:09 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 46 place invariants in 23 ms
May 29, 2018 12:48:09 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 29, 2018 12:48:09 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 22 ms
May 29, 2018 12:48:09 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
May 29, 2018 12:48:09 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 54 redundant transitions.
May 29, 2018 12:48:09 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/ReachabilityDeadlock.pnml.gal : 4 ms
May 29, 2018 12:48:10 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 108 variables to be positive in 561 ms
May 29, 2018 12:48:10 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 90 transitions.
May 29, 2018 12:48:10 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/90 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 29, 2018 12:48:10 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 29, 2018 12:48:10 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 90 transitions.
May 29, 2018 12:48:10 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 29, 2018 12:48:10 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 90 transitions.
May 29, 2018 12:48:13 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(4/90) took 3111 ms. Total solver calls (SAT/UNSAT): 435(420/15)
Skipping mayMatrices nes/nds SMT solver raised an exception on push().
java.lang.RuntimeException: SMT solver raised an exception on push().
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:464)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
May 29, 2018 12:48:13 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 4156ms conformant to PINS in folder :/home/mcc/execution

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="TriangularGrid-PT-3011"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="itstoolsl"
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/TriangularGrid-PT-3011.tgz
mv TriangularGrid-PT-3011 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool itstoolsl"
echo " Input is TriangularGrid-PT-3011, 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 r177-smll-152708747900384"
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 ;