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 192K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K 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.9K 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 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.6K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 102 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 340 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 25K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is MAPK-PT-008, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-csrt-152732585800046
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527499843280

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/graph3052219843093921919.txt, -o, /tmp/graph3052219843093921919.bin, -w, /tmp/graph3052219843093921919.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/graph3052219843093921919.bin, -l, -1, -v, -w, /tmp/graph3052219843093921919.weights, -q, 0, -e, 0.001], workingDir=null]
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.201805241334/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.201805241334/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 : !((((G("((u4.Raf>=1)&&(u4.RasGTP>=1))"))U("((u1.MEKP>=1)&&(i3.u3.RafP>=1))"))U(G(X(X("(i3.u3.MEK_RafP>=1)"))))))
Formula 0 simplified : !((G"((u4.Raf>=1)&&(u4.RasGTP>=1))" U "((u1.MEKP>=1)&&(i3.u3.RafP>=1))") U GXX"(i3.u3.MEK_RafP>=1)")
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 30 rows 22 cols
invariant :u1:Phase2 + u1:MEKP_Phase2 + u1:MEKPP_Phase2 = 4
invariant :u4:RasGTP + -1'u4:Raf + -1'i3:u3:MEKP_RafP + -1'i3:u3:RafP + -1'i3:u3:MEK_RafP + -1'i3:u5:RafP_Phase1 = -6
invariant :i3:u5:Phase1 + i3:u5:RafP_Phase1 = 6
invariant :u2:ERKPP_Phase3 + u2:ERKP_Phase3 + u2:Phase3 = 6
invariant :u0:MEKPP + -1'u0:ERK + u1:MEKP + u1:MEKP_Phase2 + u1:MEKPP_Phase2 + -1'u2:ERKP + u2:Phase3 + -1'u2:ERKPP + i3:u3:MEK + i3:u3:MEKP_RafP + i3:u3:MEK_RafP = 4
invariant :u0:ERK_MEKPP + u0:ERKP_MEKPP + u0:ERK + u2:ERKP + -1'u2:Phase3 + u2:ERKPP = 0
invariant :u4:Raf_RasGTP + u4:Raf + i3:u3:MEKP_RafP + i3:u3:RafP + i3:u3:MEK_RafP + i3:u5:RafP_Phase1 = 8
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
6 unique states visited
6 strongly connected components in search stack
8 transitions explored
6 items max in DFS search stack
27 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.311373,26836,1,0,11476,3864,385,44823,269,19322,14493
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA MAPK-PT-008-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((("(i3.u3.MEK_RafP>=1)")U("(i3.u5.RafP_Phase1>=1)")))
Formula 1 simplified : !("(i3.u3.MEK_RafP>=1)" U "(i3.u5.RafP_Phase1>=1)")
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.312195,27216,1,0,11480,3864,399,44823,269,19323,14553
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA MAPK-PT-008-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((F(G(X("((u1.Phase2>=1)&&(u1.MEKP>=1))"))))U(G("((u4.Raf>=1)&&(u4.RasGTP>=1))"))))
Formula 2 simplified : !(FGX"((u1.Phase2>=1)&&(u1.MEKP>=1))" U G"((u4.Raf>=1)&&(u4.RasGTP>=1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
4 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.346585,28272,1,0,13620,3971,409,49500,269,20634,19463
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA MAPK-PT-008-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(("((u1.MEKP>=1)&&(i3.u3.RafP>=1))")U(("(u0.ERK_MEKPP>=1)")U("((u2.ERKP>=1)&&(u2.Phase3>=1))")))))
Formula 3 simplified : !X("((u1.MEKP>=1)&&(i3.u3.RafP>=1))" U ("(u0.ERK_MEKPP>=1)" U "((u2.ERKP>=1)&&(u2.Phase3>=1))"))
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.348025,28536,1,0,13624,3971,439,49501,272,20634,19504
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA MAPK-PT-008-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X("((u1.Phase2>=1)&&(u1.MEKP>=1))")))
Formula 4 simplified : !X"((u1.Phase2>=1)&&(u1.MEKP>=1))"
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.348328,28536,1,0,13624,3971,447,49501,276,20634,19509
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA MAPK-PT-008-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((F(F(X("(i3.u3.MEK_RafP>=1)"))))U("(u1.MEKP_Phase2>=1)")))
Formula 5 simplified : !(FX"(i3.u3.MEK_RafP>=1)" U "(u1.MEKP_Phase2>=1)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
7 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.418273,30384,1,0,17364,4225,483,60673,277,24433,24357
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA MAPK-PT-008-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(F(F("(i3.u3.MEK_RafP>=1)")))))
Formula 6 simplified : !XF"(i3.u3.MEK_RafP>=1)"
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.418936,30384,1,0,17364,4225,487,60674,277,24433,24381
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA MAPK-PT-008-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F("((u0.MEKPP>=1)&&(u1.Phase2>=1))")))
Formula 7 simplified : !F"((u0.MEKPP>=1)&&(u1.Phase2>=1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
4 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.457818,31704,1,0,19044,4360,511,67496,277,26515,26318
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA MAPK-PT-008-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(("(u0.ERK_MEKPP>=1)"))
Formula 8 simplified : !"(u0.ERK_MEKPP>=1)"
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.458243,31704,1,0,19044,4360,512,67496,277,26515,26322
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA MAPK-PT-008-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(F((F("(u0.ERK_MEKPP>=1)"))U(X("(i3.u3.MEK_RafP>=1)"))))))
Formula 9 simplified : !XF(F"(u0.ERK_MEKPP>=1)" U X"(i3.u3.MEK_RafP>=1)")
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.460006,31968,1,0,19168,4361,512,67650,277,26541,26616
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA MAPK-PT-008-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((X("((i3.u3.MEK>=1)&&(i3.u3.RafP>=1))"))U(G(G("(u1.MEKPP_Phase2>=1)")))))
Formula 10 simplified : !(X"((i3.u3.MEK>=1)&&(i3.u3.RafP>=1))" U G"(u1.MEKPP_Phase2>=1)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.469048,31968,1,0,19964,4423,524,68572,277,27076,27317
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA MAPK-PT-008-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(("((u2.ERKP>=1)&&(u2.Phase3>=1))"))
Formula 11 simplified : !"((u2.ERKP>=1)&&(u2.Phase3>=1))"
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.469444,32232,1,0,19964,4423,524,68572,277,27076,27321
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA MAPK-PT-008-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X("((i3.u5.Phase1>=1)&&(i3.u3.RafP>=1))")))
Formula 12 simplified : !X"((i3.u5.Phase1>=1)&&(i3.u3.RafP>=1))"
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.46987,32496,1,0,19964,4423,533,68572,277,27076,27328
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA MAPK-PT-008-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(((F(F("((u2.Phase3>=1)&&(u2.ERKPP>=1))")))U(X(("(u1.MEKP_Phase2>=1)")U("(u0.ERKP_MEKPP>=1)")))))
Formula 13 simplified : !(F"((u2.Phase3>=1)&&(u2.ERKPP>=1))" U X("(u1.MEKP_Phase2>=1)" U "(u0.ERKP_MEKPP>=1)"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
12 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.588934,36720,1,0,29554,5025,592,81768,281,34029,38812
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA MAPK-PT-008-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(("(u2.ERKPP_Phase3>=1)"))
Formula 14 simplified : !"(u2.ERKPP_Phase3>=1)"
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.589335,36720,1,0,29554,5025,595,81768,281,34029,38819
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA MAPK-PT-008-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((G(("((u0.ERK>=1)&&(u0.MEKPP>=1))")U(X("((u0.ERK>=1)&&(u0.MEKPP>=1))")))))
Formula 15 simplified : !G("((u0.ERK>=1)&&(u0.MEKPP>=1))" U X"((u0.ERK>=1)&&(u0.MEKPP>=1))")
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.59026,36984,1,0,29554,5025,607,81768,281,34029,38839
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA MAPK-PT-008-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
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 1527499846831

--------------------
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/ -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 LTLFireability -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 28, 2018 9:30:45 AM 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/, -louvain, -smt]
May 28, 2018 9:30:45 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 28, 2018 9:30:45 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 31 ms
May 28, 2018 9:30:45 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 22 places.
May 28, 2018 9:30:45 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 30 transitions.
May 28, 2018 9:30:45 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 7 ms
May 28, 2018 9:30:45 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
May 28, 2018 9:30:45 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 24 ms
May 28, 2018 9:30:45 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 10 ms
Begin: Mon May 28 09:30:45 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Mon May 28 09:30:45 2018
network size: 22 nodes, 60 links, 60 weight
quality increased from -0.05 to 0.547083
end computation: Mon May 28 09:30:45 2018
level 1:
start computation: Mon May 28 09:30:45 2018
network size: 6 nodes, 20 links, 60 weight
quality increased from 0.547083 to 0.550417
end computation: Mon May 28 09:30:45 2018
level 2:
start computation: Mon May 28 09:30:45 2018
network size: 5 nodes, 15 links, 60 weight
quality increased from 0.550417 to 0.550417
end computation: Mon May 28 09:30:45 2018
End: Mon May 28 09:30:45 2018
Total duration: 0 sec
0.550417
May 28, 2018 9:30:45 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 28, 2018 9:30:45 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 11 ms
May 28, 2018 9:30:45 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
May 28, 2018 9:30:45 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 7 redundant transitions.
May 28, 2018 9:30:45 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 9 ms
May 28, 2018 9:30:45 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
May 28, 2018 9:30:46 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 30 transitions.
May 28, 2018 9:30:46 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 7 place invariants in 8 ms
May 28, 2018 9:30:46 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 22 variables to be positive in 62 ms
May 28, 2018 9:30:46 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 30 transitions.
May 28, 2018 9:30:46 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/30 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 9:30:46 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 9:30:46 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 30 transitions.
May 28, 2018 9:30:46 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:766)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:512)
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 28, 2018 9:30:46 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 675ms 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="MAPK-PT-008"
export BK_EXAMINATION="LTLFireability"
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/MAPK-PT-008.tgz
mv MAPK-PT-008 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 MAPK-PT-008, 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 r261-csrt-152732585800046"
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 ;