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 196K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 5.7K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.4K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K 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.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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
-rw-r--r-- 1 mcc users 18K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is JoinFreeModules-PT-0003, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-smll-152732263100328
=====================================================================

--------------------
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 JoinFreeModules-PT-0003-LTLFireability-00
FORMULA_NAME JoinFreeModules-PT-0003-LTLFireability-01
FORMULA_NAME JoinFreeModules-PT-0003-LTLFireability-02
FORMULA_NAME JoinFreeModules-PT-0003-LTLFireability-03
FORMULA_NAME JoinFreeModules-PT-0003-LTLFireability-04
FORMULA_NAME JoinFreeModules-PT-0003-LTLFireability-05
FORMULA_NAME JoinFreeModules-PT-0003-LTLFireability-06
FORMULA_NAME JoinFreeModules-PT-0003-LTLFireability-07
FORMULA_NAME JoinFreeModules-PT-0003-LTLFireability-08
FORMULA_NAME JoinFreeModules-PT-0003-LTLFireability-09
FORMULA_NAME JoinFreeModules-PT-0003-LTLFireability-10
FORMULA_NAME JoinFreeModules-PT-0003-LTLFireability-11
FORMULA_NAME JoinFreeModules-PT-0003-LTLFireability-12
FORMULA_NAME JoinFreeModules-PT-0003-LTLFireability-13
FORMULA_NAME JoinFreeModules-PT-0003-LTLFireability-14
FORMULA_NAME JoinFreeModules-PT-0003-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1527963969399

Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805151631/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805151631/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !(((X(X(F("(p11>=3)"))))U("(p9>=4)")))
Formula 0 simplified : !(XXF"(p11>=3)" U "(p9>=4)")
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t10, t11, t18, t19, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/19/6/25
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
9 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.100563,17892,1,0,131,8735,81,65,721,10727,271
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0003-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G("(((p3>=3)&&(p8>=3))&&(p13>=3))")))
Formula 1 simplified : !G"(((p3>=3)&&(p8>=3))&&(p13>=3))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.104893,18312,1,0,133,8917,92,66,751,10994,292
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0003-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !(((("(p13>=2)")U("(p6>=5)"))U(X(("(p3>=1)")U("(p14>=3)")))))
Formula 2 simplified : !(("(p13>=2)" U "(p6>=5)") U X("(p3>=1)" U "(p14>=3)"))
5 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
6 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.168862,20756,1,0,219,15318,144,105,788,19669,525
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0003-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((("(p14>=4)")U("(p11>=5)")))
Formula 3 simplified : !("(p14>=4)" U "(p11>=5)")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.170068,21016,1,0,219,15318,154,105,794,19672,531
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0003-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((X(G(F(("(p1>=3)")U("(p5>=5)"))))))
Formula 4 simplified : !XGF("(p1>=3)" U "(p5>=5)")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.172961,21016,1,0,220,15570,163,105,795,19925,540
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0003-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((X(G(X(F(G("(p14>=3)")))))))
Formula 5 simplified : !XGXFG"(p14>=3)"
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.17432,21368,1,0,222,15579,174,106,795,19945,556
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0003-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((G(F(F("(p1>=3)")))))
Formula 6 simplified : !GF"(p1>=3)"
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.176981,21368,1,0,223,15893,183,106,796,20244,567
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0003-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(((G(("(p13>=2)")U("(p1>=5)")))U((F("(p15>=5)"))U(X("(p7>=2)")))))
Formula 7 simplified : !(G("(p13>=2)" U "(p1>=5)") U (F"(p15>=5)" U X"(p7>=2)"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.192593,22028,1,0,277,16595,226,130,826,21563,712
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0003-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !(((G(G("(p13>=2)")))U(F(G(F("(p11>=3)"))))))
Formula 8 simplified : !(G"(p13>=2)" U FGF"(p11>=3)")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.193797,22028,1,0,277,16595,226,130,826,21563,712
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0003-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !(("(p13>=2)"))
Formula 9 simplified : !"(p13>=2)"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.194252,22288,1,0,277,16595,227,130,826,21563,714
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA JoinFreeModules-PT-0003-LTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((X("(p8>=1)")))
Formula 10 simplified : !X"(p8>=1)"
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.194692,22288,1,0,277,16595,230,130,827,21563,716
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA JoinFreeModules-PT-0003-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((X(X(X(("(p11>=5)")U("(p5>=5)"))))))
Formula 11 simplified : !XXX("(p11>=5)" U "(p5>=5)")
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.196199,22288,1,0,277,16605,236,130,831,21576,722
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0003-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !(((X("(p1>=5)"))U(X("(p5>=5)"))))
Formula 12 simplified : !(X"(p1>=5)" U X"(p5>=5)")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.197419,22288,1,0,277,16605,242,130,835,21576,728
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0003-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((X(G("(p13>=2)"))))
Formula 13 simplified : !XG"(p13>=2)"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.203373,22288,1,0,323,17106,245,152,835,22252,853
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0003-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !(("(p11>=5)"))
Formula 14 simplified : !"(p11>=5)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.203782,22288,1,0,323,17106,246,152,835,22252,855
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0003-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((F(F((G("(p8>=1)"))U(F("(p1>=3)"))))))
Formula 15 simplified : !F(G"(p8>=1)" U F"(p1>=3)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.228244,22552,1,0,367,20133,246,174,835,26213,976
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0003-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 25 rows 15 cols
invariant :p11 + p12 + p13 + p14 + p15 = 6
invariant :p1 + p2 + p3 + p4 + p5 = 6
invariant :p6 + p7 + p8 + p9 + p10 = 6
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 1527963973450

--------------------
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 LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -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 LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -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 02, 2018 6:26:11 PM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -smt]
Jun 02, 2018 6:26:11 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2018 6:26:11 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 46 ms
Jun 02, 2018 6:26:11 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 16 places.
Jun 02, 2018 6:26:11 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 25 transitions.
Jun 02, 2018 6:26:11 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 8 ms
Jun 02, 2018 6:26:11 PM fr.lip6.move.gal.instantiate.DomainAnalyzer computeVariableDomains
INFO: Found a total of 1 fixed domain variables (out of 16 variables) in GAL type JoinFreeModules_PT_0003
Jun 02, 2018 6:26:11 PM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: Found a total of 1 constant array cells/variables (out of 16 variables) in type JoinFreeModules_PT_0003
Jun 02, 2018 6:26:11 PM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: p,
Jun 02, 2018 6:26:11 PM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Removed 1 constant variables :p=1
Jun 02, 2018 6:26:11 PM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Simplified 2 expressions due to constant valuations.
Jun 02, 2018 6:26:11 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 36 ms
Jun 02, 2018 6:26:11 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 1 ms
Jun 02, 2018 6:26:11 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 3 ms
Jun 02, 2018 6:26:12 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 25 transitions.
Jun 02, 2018 6:26:12 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 3 place invariants in 12 ms
Skipping mayMatrices nes/nds SMT solver raised an error :(error "Error writing to Z3 solver: java.io.IOException: Stream closed")
java.lang.RuntimeException: SMT solver raised an error :(error "Error writing to Z3 solver: java.io.IOException: Stream closed")
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.computeAndDeclareInvariants(KInductionSolver.java:293)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:71)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
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 02, 2018 6:26:12 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 186ms 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="JoinFreeModules-PT-0003"
export BK_EXAMINATION="LTLFireability"
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/JoinFreeModules-PT-0003.tgz
mv JoinFreeModules-PT-0003 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 itstools"
echo " Input is JoinFreeModules-PT-0003, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r212-smll-152732263100328"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.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 ;