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 188K
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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.8K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.2K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 10K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 101 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 339 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 24K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is Raft-PT-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r188-qhx2-152732140200072
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528287706250

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 : !((F("(u11.p50>=1)")))
Formula 0 simplified : !F"(u11.p50>=1)"
built 20 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t97, u7.t17, u7.t18, u7.t19, u7.t20, u7.t22, u8.t11, u8.t12, u8.t13, u8.t14, u8.t16, u9.t5, u9.t6, u9.t7, u9.t8, u9.t10, u11.t95, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :14/70/14/98
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
5 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.151583,16992,1,0,1780,184,829,1977,190,651,4398
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Raft-PT-03-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(("((u9.p45>=1)&&(u6.p30>=1))"))
Formula 1 simplified : !"((u9.p45>=1)&&(u6.p30>=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.15537,17424,1,0,1806,185,851,2021,193,680,4497
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Raft-PT-03-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(("((u9.p45>=1)&&(u2.p8>=1))"))
Formula 2 simplified : !"((u9.p45>=1)&&(u2.p8>=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.158395,17424,1,0,1806,185,856,2021,193,680,4503
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Raft-PT-03-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((X(G(G("((u8.p40>=1)&&(u1.p1>=1))"))))U("((u7.p35>=1)&&(u3.p14>=1))")))
Formula 3 simplified : !(XG"((u8.p40>=1)&&(u1.p1>=1))" U "((u7.p35>=1)&&(u3.p14>=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.178979,18136,1,0,2883,187,953,3399,193,730,6851
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Raft-PT-03-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G((X(G("(u8.p37>=1)")))U("((u7.p35>=1)&&(u10.p46>=1))"))))
Formula 4 simplified : !G(XG"(u8.p37>=1)" U "((u7.p35>=1)&&(u10.p46>=1))")
9 unique states visited
9 strongly connected components in search stack
11 transitions explored
9 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.190635,18776,1,0,3372,191,983,4053,194,816,8060
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Raft-PT-03-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G((("(u9.p45>=1)")U("((u8.p40>=1)&&(u1.p2>=1))"))U(("((u7.p35>=1)&&(u5.p23>=1))")U("(u9.p41>=1)")))))
Formula 5 simplified : !G(("(u9.p45>=1)" U "((u8.p40>=1)&&(u1.p2>=1))") U ("((u7.p35>=1)&&(u5.p23>=1))" U "(u9.p41>=1)"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.211844,20032,1,0,3372,191,1064,4053,199,816,8117
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Raft-PT-03-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((("(u7.p35>=1)")U("((u7.p35>=1)&&(u2.p10>=1))")))
Formula 6 simplified : !("(u7.p35>=1)" U "((u7.p35>=1)&&(u2.p10>=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.212527,20032,1,0,3372,191,1076,4053,199,816,8135
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Raft-PT-03-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F("((u8.p40>=1)&&(u1.p2>=1))")))
Formula 7 simplified : !F"((u8.p40>=1)&&(u1.p2>=1))"
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.230048,20292,1,0,4483,192,1090,5664,199,848,10557
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Raft-PT-03-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((X(("((u7.p35>=1)&&(u10.p48>=1))")U("((u9.p45>=1)&&(u4.p17>=1))")))U(("((u7.p35>=1)&&(u5.p24>=1))")U("(u7.p35>=1)"))))
Formula 8 simplified : !(X("((u7.p35>=1)&&(u10.p48>=1))" U "((u9.p45>=1)&&(u4.p17>=1))") U ("((u7.p35>=1)&&(u5.p24>=1))" U "(u7.p35>=1)"))
5 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 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.244741,20696,1,0,4654,192,1156,5892,201,848,11026
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Raft-PT-03-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X((G(X("((u8.p40>=1)&&(u3.p15>=1))")))U(("(u9.p41>=1)")U("((u7.p35>=1)&&(u3.p13>=1))")))))
Formula 9 simplified : !X(GX"((u8.p40>=1)&&(u3.p15>=1))" U ("(u9.p41>=1)" U "((u7.p35>=1)&&(u3.p13>=1))"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
3 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.281007,21320,1,0,6208,193,1213,8075,201,899,14480
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Raft-PT-03-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G(X(("((u9.p45>=1)&&(u6.p30>=1))")U(X("((u7.p33>=1)&&(u11.p52>=1))"))))))
Formula 10 simplified : !GX("((u9.p45>=1)&&(u6.p30>=1))" U X"((u7.p33>=1)&&(u11.p52>=1))")
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 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.287672,21832,1,0,6330,193,1218,8195,201,904,14720
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Raft-PT-03-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X(F(G(("((u7.p35>=1)&&(u2.p10>=1))")U("((u7.p35>=1)&&(u3.p14>=1))"))))))
Formula 11 simplified : !XFG("((u7.p35>=1)&&(u2.p10>=1))" U "((u7.p35>=1)&&(u3.p14>=1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.310208,22080,1,0,7137,193,1256,9425,201,920,16812
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Raft-PT-03-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X((G("(u8.p40>=1)"))U(("((u8.p40>=1)&&(u1.p1>=1))")U("(u7.p35>=1)")))))
Formula 12 simplified : !X(G"(u8.p40>=1)" U ("((u8.p40>=1)&&(u1.p1>=1))" U "(u7.p35>=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.317072,22308,1,0,7137,193,1285,9425,203,920,16841
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA Raft-PT-03-LTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((X(X(X(("(u11.p51>=1)")U("((u9.p45>=1)&&(u4.p19>=1))"))))))
Formula 13 simplified : !XXX("(u11.p51>=1)" U "((u9.p45>=1)&&(u4.p19>=1))")
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.328824,22308,1,0,7606,193,1298,10045,203,925,17974
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Raft-PT-03-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((X("((u7.p35>=1)&&(u5.p21>=1))")))
Formula 14 simplified : !X"((u7.p35>=1)&&(u5.p21>=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.33103,22308,1,0,7606,193,1303,10045,203,925,17985
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Raft-PT-03-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((F((("((u7.p33>=1)&&(u11.p52>=1))")U("((u9.p45>=1)&&(u5.p25>=1))"))U(X(X("((u8.p40>=1)&&(u6.p28>=1))"))))))
Formula 15 simplified : !F(("((u7.p33>=1)&&(u11.p52>=1))" U "((u9.p45>=1)&&(u5.p25>=1))") U XX"((u8.p40>=1)&&(u6.p28>=1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.345793,22572,1,0,8506,193,1337,11234,203,928,19809
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Raft-PT-03-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 73
// Phase 1: matrix 73 rows 53 cols
invariant :u3:p11 + u3:p12 + u3:p13 + u3:p14 + u3:p15 + u12:p0 = 1
invariant :u9:p41 + u9:p42 + u9:p43 + u9:p44 + u9:p45 + u12:p0 = 1
invariant :u5:p21 + u5:p22 + u5:p23 + u5:p24 + u5:p25 + u12:p0 = 1
invariant :u1:p1 + u1:p2 + u1:p3 + u1:p4 + u1:p5 + u12:p0 = 1
invariant :u4:p16 + u4:p17 + u4:p18 + u4:p19 + u4:p20 + u12:p0 = 1
invariant :u6:p26 + u6:p27 + u6:p28 + u6:p29 + u6:p30 + u12:p0 = 1
invariant :u7:p31 + u7:p32 + u7:p33 + u7:p34 + u7:p35 + u12:p0 = 1
invariant :u2:p6 + u2:p7 + u2:p8 + u2:p9 + u2:p10 + u12:p0 = 1
invariant :u8:p36 + u8:p37 + u8:p38 + u8:p39 + u8:p40 + u12:p0 = 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 1528287730403

--------------------
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 06, 2018 12:22:07 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 06, 2018 12:22:07 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 06, 2018 12:22:07 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 68 ms
Jun 06, 2018 12:22:07 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 53 places.
Jun 06, 2018 12:22:08 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 98 transitions.
Jun 06, 2018 12:22:08 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Found NUPN structural information;
Jun 06, 2018 12:22:08 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 16 ms
Jun 06, 2018 12:22:08 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 06, 2018 12:22:08 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 06, 2018 12:22:08 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 63 ms
Jun 06, 2018 12:22:08 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 06, 2018 12:22:08 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 52 redundant transitions.
Jun 06, 2018 12:22:08 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 8 ms
Jun 06, 2018 12:22:08 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 3 ms
Jun 06, 2018 12:22:08 PM fr.lip6.move.gal.semantics.CompositeNextBuilder getNextForLabel
INFO: Semantic construction discarded 14 identical transitions.
Jun 06, 2018 12:22:08 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 84 transitions.
Jun 06, 2018 12:22:09 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 9 place invariants in 27 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 06, 2018 12:22:09 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 510ms 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="Raft-PT-03"
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/Raft-PT-03.tgz
mv Raft-PT-03 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 Raft-PT-03, 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 r188-qhx2-152732140200072"
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 ;