fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r285-csrt-152749175900206
Last Updated
June 26, 2018

About the Execution of ITS-Tools.L for DoubleExponent-PT-003

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15755.400 5639.00 14063.00 112.50 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 228K
-rw-r--r-- 1 mcc users 4.0K May 30 21:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 30 21:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 15:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 15:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 28 09:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 28 09:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 28 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.5K May 28 06:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 28 06:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K May 27 03:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 03:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 28 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 28 07:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 4 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 50K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is DoubleExponent-PT-003, examination is ReachabilityDeadlock
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-csrt-152749175900206

=====================================================================

--------------------
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 DoubleExponent-PT-003-ReachabilityDeadlock-0

=== Now, execution of the tool begins

BK_START 1527986822135

Flatten gal took : 67 ms
Constant places removed 5 places and 1 transitions.
Performed 60 Post agglomeration using F-continuation condition.
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 158 transition count 87
Constant places removed 61 places and 1 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 126 place count 97 transition count 86
Performed 4 Pre agglomeration using Quasi-Persistent + HF-interchangeable + Divergent Free condition.
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 126 place count 97 transition count 82
Constant places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 130 place count 93 transition count 82
Performed 8 Post agglomeration using F-continuation condition.
Constant places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 138 place count 85 transition count 74
Performed 4 Post agglomeration using F-continuation condition.
Constant places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 142 place count 81 transition count 74
Applied a total of 142 rules in 25 ms. Remains 81 /163 variables (removed 82) and now considering 74/148 (removed 74) transitions.
// Phase 1: matrix 74 rows 81 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/graph819808258086938043.txt, -o, /tmp/graph819808258086938043.bin, -w, /tmp/graph819808258086938043.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/graph819808258086938043.bin, -l, -1, -v, -w, /tmp/graph819808258086938043.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 74 rows 81 cols
invariant :p104 + p22 + -1'p28 + -1'p30 + -1'p31 + -1'p34 + -1'p36 + -1'p37 = 0
invariant :-1'p122 + p128 + p130 + p131 + p134 + p136 + p137 = 0
invariant :p10 + p11 = 2
invariant :-1'p56 + p57 + -1'p59 + p60 + -1'p81 + -1'p93 = 0
invariant :-1'p108 + p109 + -1'p111 + p112 = 0
invariant :p157 + p69 + -1'p75 + -1'p77 + -1'p78 + -1'p81 + -1'p83 + -1'p84 = 0
invariant :p55 + -1'p56 + p58 + -1'p59 = 0
invariant :p8 + p9 = 2
invariant :-1'p108 + p110 + -1'p111 + p113 + -1'p134 + -1'p146 = 0
invariant :p12 + p13 + -1'p34 + -1'p46 = 2
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 30 ordering constraints for composite.
built 13 ordering constraints for composite.
built 18 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 25 ordering constraints for composite.
built 16 ordering constraints for composite.
built 19 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,1.15341e+06,2.00112,48196,1280,510,73338,1815,323,71034,53,6448,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,254172,2.13189,48196,877,377,73338,5639,859,71034,308,23556,16531

System contains 254172 deadlocks (shown below if less than --print-limit option) !
FORMULA DoubleExponent-PT-003-ReachabilityDeadlock-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[ 254172 states ] showing 10 first states
[ i6={[ u24={[ p9=1 p8=1 ]
} u14={[ ]
} u10={[ p22=1 ]
} u11={[ ]
} u2={[ p11=1 p10=1 ]
} u0={[ ]
} ]
} i2={[ u16={[ ]
} u17={[ p13=2 p52=1 ]
} u15={[ ]
} u13={[ p36=1 ]
} u12={[ ]
} ]
} i5={[ u28={[ ]
} u27={[ ]
} u25={[ ]
} u23={[ p57=2 ]
} u1={[ ]
} ]
} i3={[ u26={[ ]
} u18={[ p55=2 ]
} u6={[ ]
} ]
} i4={[ u22={[ ]
} u21={[ ]
} u20={[ ]
} u19={[ p56=2 ]
} ]
} i0={[ u9={[ ]
} u8={[ ]
} u4={[ ]
} ]
} i1={[ u7={[ ]
} u5={[ ]
} u3={[ ]
} ]
} ]
[ i6={[ u24={[ p9=2 ]
} u14={[ ]
} u10={[ p22=1 ]
} u11={[ ]
} u2={[ p11=1 p10=1 ]
} u0={[ ]
} ]
} i2={[ u16={[ ]
} u17={[ p13=2 p52=1 ]
} u15={[ ]
} u13={[ p36=1 ]
} u12={[ ]
} ]
} i5={[ u28={[ ]
} u27={[ ]
} u25={[ ]
} u23={[ p57=4 ]
} u1={[ ]
} ]
} i3={[ u26={[ ]
} u18={[ p55=4 ]
} u6={[ ]
} ]
} i4={[ u22={[ ]
} u21={[ ]
} u20={[ ]
} u19={[ p56=4 ]
} ]
} i0={[ u9={[ ]
} u8={[ ]
} u4={[ ]
} ]
} i1={[ u7={[ ]
} u5={[ ]
} u3={[ ]
} ]
} ]
[ i6={[ u24={[ p9=1 p8=1 ]
} u14={[ ]
} u10={[ p22=1 ]
} u11={[ ]
} u2={[ p10=2 ]
} u0={[ ]
} ]
} i2={[ u16={[ ]
} u17={[ p13=1 p12=1 ]
} u15={[ ]
} u13={[ ]
} u12={[ p31=1 ]
} ]
[ u16={[ ]
} u17={[ p13=2 p52=1 ]
} u15={[ ]
} u13={[ p36=1 ]
} u12={[ ]
} ]
} i5={[ u28={[ ]
} u27={[ ]
} u25={[ ]
} u23={[ p57=1 ]
} u1={[ ]
} ]
} i3={[ u26={[ ]
} u18={[ p55=1 ]
} u6={[ ]
} ]
} i4={[ u22={[ ]
} u21={[ ]
} u20={[ ]
} u19={[ p56=1 ]
} ]
} i0={[ u9={[ ]
} u8={[ ]
} u4={[ ]
} ]
} i1={[ u7={[ ]
} u5={[ ]
} u3={[ ]
} ]
} ]
[ i6={[ u24={[ p9=1 p8=1 ]
} u14={[ ]
} u10={[ p22=1 ]
} u11={[ ]
} u2={[ p10=2 ]
} u0={[ ]
} ]
} i2={[ u16={[ ]
} u17={[ p12=2 ]
} u15={[ ]
} u13={[ ]
} u12={[ p31=1 ]
} ]
} i5={[ u28={[ ]
} u27={[ ]
} u25={[ ]
} u23={[ p57=2 ]
} u1={[ ]
} ]
} i3={[ u26={[ ]
} u18={[ p55=2 ]
} u6={[ ]
} ]
} i4={[ u22={[ ]
} u21={[ ]
} u20={[ ]
} u19={[ p56=2 ]
} ]
} i0={[ u9={[ ]
} u8={[ ]
} u4={[ ]
} ]
} i1={[ u7={[ ]
} u5={[ ]
} u3={[ ]
} ]
} ]
[ i6={[ u24={[ p9=2 ]
} u14={[ ]
} u10={[ p22=1 ]
} u11={[ p28=1 ]
} u2={[ p11=2 ]
} u0={[ ]
} ]
} i2={[ u16={[ ]
} u17={[ p13=2 ]
} u15={[ ]
} u13={[ ]
} u12={[ ]
} ]
} i5={[ u28={[ ]
} u27={[ ]
} u25={[ ]
} u23={[ p57=4 ]
} u1={[ ]
} ]
} i3={[ u26={[ ]
} u18={[ p55=4 ]
} u6={[ ]
} ]
} i4={[ u22={[ ]
} u21={[ ]
} u20={[ ]
} u19={[ p56=4 ]
} ]
} i0={[ u9={[ ]
} u8={[ ]
} u4={[ ]
} ]
} i1={[ u7={[ ]
} u5={[ ]
} u3={[ ]
} ]
} ]
[ i6={[ u24={[ p9=1 p8=1 ]
} u14={[ ]
} u10={[ ]
} u11={[ ]
} u2={[ p10=2 ]
} u0={[ p104=1 ]
} ]
} i2={[ u16={[ ]
} u17={[ p13=1 p12=1 ]
} u15={[ ]
} u13={[ ]
} u12={[ p31=1 ]
} ]
[ u16={[ ]
} u17={[ p13=2 p52=1 ]
} u15={[ ]
} u13={[ p36=1 ]
} u12={[ ]
} ]
} i5={[ u28={[ ]
} u27={[ ]
} u25={[ p83=1 ]
} u23={[ p57=1 p60=3 ]
} u1={[ ]
} ]
} i3={[ u26={[ ]
} u18={[ p58=2 p55=2 ]
} u6={[ ]
} ]
} i4={[ u22={[ ]
} u21={[ ]
} u20={[ p69=1 ]
} u19={[ p56=4 ]
} ]
} i0={[ u9={[ ]
} u8={[ ]
} u4={[ p110=8 ]
} ]
} i1={[ u7={[ p108=8 ]
} u5={[ ]
} u3={[ p109=8 ]
} ]
} ]
[ i6={[ u24={[ p9=1 p8=1 ]
} u14={[ ]
} u10={[ ]
} u11={[ ]
} u2={[ p10=2 ]
} u0={[ p104=1 ]
} ]
} i2={[ u16={[ ]
} u17={[ p13=1 p12=1 ]
} u15={[ ]
} u13={[ ]
} u12={[ p31=1 ]
} ]
[ u16={[ ]
} u17={[ p13=2 p52=1 ]
} u15={[ ]
} u13={[ p36=1 ]
} u12={[ ]
} ]
} i5={[ u28={[ ]
} u27={[ ]
} u25={[ p83=1 ]
} u23={[ p57=1 p60=3 ]
} u1={[ ]
} ]
} i3={[ u26={[ ]
} u18={[ p58=2 p55=2 ]
} u6={[ ]
} ]
} i4={[ u22={[ p157=1 ]
} u21={[ ]
} u20={[ ]
} u19={[ p56=4 ]
} ]
} i0={[ u9={[ ]
} u8={[ ]
} u4={[ p110=16 ]
} ]
} i1={[ u7={[ p111=16 ]
[ p108=1 p111=15 ]
} u5={[ p136=1 ]
} u3={[ p122=1 p109=8 p112=8 ]
[ p122=1 p109=9 p112=7 ]
} ]
} ]
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 1527986827774

--------------------
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
Jun 03, 2018 12:47:04 AM 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]
Jun 03, 2018 12:47:04 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 03, 2018 12:47:04 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 52 ms
Jun 03, 2018 12:47:04 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 163 places.
Jun 03, 2018 12:47:04 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 148 transitions.
Jun 03, 2018 12:47:04 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 12 ms
Jun 03, 2018 12:47:04 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 64 ms
Jun 03, 2018 12:47:04 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.simple.gal : 4 ms
Jun 03, 2018 12:47:04 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 148 transitions.
Jun 03, 2018 12:47:05 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 03, 2018 12:47:05 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 33 ms
Jun 03, 2018 12:47:05 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 74 transitions.
Jun 03, 2018 12:47:05 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 63 ms
Begin: Sun Jun 3 00:47:05 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Sun Jun 3 00:47:05 2018
network size: 81 nodes, 422 links, 146 weight
quality increased from -0.0135631 to 0.376978
end computation: Sun Jun 3 00:47:05 2018
level 1:
start computation: Sun Jun 3 00:47:05 2018
network size: 29 nodes, 239 links, 146 weight
quality increased from 0.376978 to 0.547296
end computation: Sun Jun 3 00:47:05 2018
level 2:
start computation: Sun Jun 3 00:47:05 2018
network size: 8 nodes, 46 links, 146 weight
quality increased from 0.547296 to 0.551388
end computation: Sun Jun 3 00:47:05 2018
level 3:
start computation: Sun Jun 3 00:47:05 2018
network size: 7 nodes, 37 links, 146 weight
quality increased from 0.551388 to 0.551388
end computation: Sun Jun 3 00:47:05 2018
End: Sun Jun 3 00:47:05 2018
Total duration: 0 sec
0.551388
Jun 03, 2018 12:47:05 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 03, 2018 12:47:05 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 17 ms
Jun 03, 2018 12:47:05 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 03, 2018 12:47:05 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 10 place invariants in 25 ms
Jun 03, 2018 12:47:05 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 51 redundant transitions.
Jun 03, 2018 12:47:05 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/ReachabilityDeadlock.pnml.gal : 4 ms
Jun 03, 2018 12:47:05 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 81 variables to be positive in 548 ms
Jun 03, 2018 12:47:05 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 74 transitions.
Jun 03, 2018 12:47:05 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/74 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 03, 2018 12:47:05 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 03, 2018 12:47:05 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 74 transitions.
Jun 03, 2018 12:47:05 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 03, 2018 12:47:05 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 74 transitions.
Jun 03, 2018 12:47:06 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished co-enabling matrix. took 1110 ms. Total solver calls (SAT/UNSAT): 306(306/0)
Jun 03, 2018 12:47:06 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 74 transitions.
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout :(error "Failed to check-sat")
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:297)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeDoNotAccord(NecessaryEnablingsolver.java:628)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:538)
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)
Jun 03, 2018 12:47:07 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 2447ms 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="DoubleExponent-PT-003"
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/DoubleExponent-PT-003.tgz
mv DoubleExponent-PT-003 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 DoubleExponent-PT-003, 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 r285-csrt-152749175900206"
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 ;