fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r249-blw7-152732550400016
Last Updated
June 26, 2018

About the Execution of ITS-Tools.L for FMS-PT-005

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15751.230 3352.00 6620.00 146.90 FFFFFFFFFFFTFFTF 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 180K
-rw-r--r-- 1 mcc users 3.2K 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.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.1K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.1K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.6K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K 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.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 17K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is FMS-PT-005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r249-blw7-152732550400016
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527981014088

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/graph3983201568518328575.txt, -o, /tmp/graph3983201568518328575.bin, -w, /tmp/graph3983201568518328575.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/graph3983201568518328575.bin, -l, -1, -v, -w, /tmp/graph3983201568518328575.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 : !((F(X((X("(i3.u8.P2d>=1)"))U("((i3.u8.P2wP1>=1)&&(i0.u0.P1wP2>=1))")))))
Formula 0 simplified : !FX(X"(i3.u8.P2d>=1)" U "((i3.u8.P2wP1>=1)&&(i0.u0.P1wP2>=1))")
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 20 rows 22 cols
invariant :i1:u1:P12 + i1:u1:P12wM3 + i1:u6:P12s + -1'i1:u6:M3 + i3:u4:P2wM2 + i3:u4:P2 + i3:u4:P2s + i3:u5:P2M2 + i3:u8:P2wP1 + i3:u8:P2d = 3
invariant :u7:P3s + u7:P3M2 + u7:P3 = 5
invariant :i0:u3:P1M1 + i0:u3:M1 = 3
invariant :i1:u6:P12M3 + i1:u6:M3 = 2
invariant :i3:u5:M2 + i3:u5:P2M2 = 1
invariant :i0:u0:P1d + i0:u0:P1s + i0:u0:P1wP2 + i0:u2:P1 + i0:u2:P1wM1 + -1'i0:u3:M1 + i1:u1:P12 + i1:u1:P12wM3 + i1:u6:P12s + -1'i1:u6:M3 = 0
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
20 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.228596,22008,1,0,10483,1465,244,31311,137,7127,6802
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA FMS-PT-005-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(F((X("(i0.u0.P1d>=1)"))U("(i3.u4.P2s>=1)")))))
Formula 1 simplified : !XF(X"(i0.u0.P1d>=1)" U "(i3.u4.P2s>=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.247682,23168,1,0,12348,1639,285,35457,141,8284,9658
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA FMS-PT-005-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(F(G(G("(i0.u0.P1d>=1)"))))))
Formula 2 simplified : !XFG"(i0.u0.P1d>=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]
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
47 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.72052,36508,1,0,35175,2953,312,112650,142,20059,17996
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA FMS-PT-005-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(("(i1.u6.P12M3>=1)")U(("((i0.u3.M1>=1)&&(i0.u2.P1wM1>=1))")U("(i3.u8.P2d>=1)")))))
Formula 3 simplified : !F("(i1.u6.P12M3>=1)" U ("((i0.u3.M1>=1)&&(i0.u2.P1wM1>=1))" U "(i3.u8.P2d>=1)"))
2 unique states visited
2 strongly connected components in search stack
2 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.722012,36508,1,0,35329,2953,328,112869,142,20086,18245
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA FMS-PT-005-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(X((X("(u7.P3>=1)"))U(G("((i0.u3.M1>=1)&&(i0.u2.P1wM1>=1))"))))))
Formula 4 simplified : !GX(X"(u7.P3>=1)" U G"((i0.u3.M1>=1)&&(i0.u2.P1wM1>=1))")
2 unique states visited
2 strongly connected components in search stack
3 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.729395,37872,1,0,35884,2993,382,113497,145,20257,19388
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA FMS-PT-005-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(G(F("((i0.u3.M1>=1)&&(i0.u2.P1wM1>=1))")))))
Formula 5 simplified : !FGF"((i0.u3.M1>=1)&&(i0.u2.P1wM1>=1))"
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.730365,37872,1,0,35915,2994,393,113595,145,20271,19456
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA FMS-PT-005-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(X((G("(i0.u3.P1M1>=1)"))U(G("((u7.P3M2>=1)&&(i3.u5.M2>=1))"))))))
Formula 6 simplified : !FX(G"(i0.u3.P1M1>=1)" U G"((u7.P3M2>=1)&&(i3.u5.M2>=1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.824666,41996,1,0,42672,3646,417,139596,145,24151,23901
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA FMS-PT-005-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(("(i0.u0.P1d>=1)"))
Formula 7 simplified : !"(i0.u0.P1d>=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.825173,41996,1,0,42673,3646,419,139596,145,24151,23921
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA FMS-PT-005-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(G(X(G(G("(i1.u1.P12>=1)")))))))
Formula 8 simplified : !GXG"(i1.u1.P12>=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.826523,42256,1,0,42708,3646,435,139624,145,24157,24035
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA FMS-PT-005-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((((X("(u7.P3>=1)"))U(F("(i3.u4.P2>=1)")))U((F("(i0.u0.P1s>=1)"))U(X("(i0.u0.P1d>=1)")))))
Formula 9 simplified : !((X"(u7.P3>=1)" U F"(i3.u4.P2>=1)") U (F"(i0.u0.P1s>=1)" U X"(i0.u0.P1d>=1)"))
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.846237,43324,1,0,44861,3681,470,143376,147,24563,26589
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA FMS-PT-005-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((F(X(F("(i0.u0.P1s>=1)"))))U((G("(i3.u5.P2M2>=1)"))U("(i0.u0.P1d>=1)"))))
Formula 10 simplified : !(FXF"(i0.u0.P1s>=1)" U (G"(i3.u5.P2M2>=1)" U "(i0.u0.P1d>=1)"))
2 unique states visited
2 strongly connected components in search stack
2 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.847454,43908,1,0,44870,3681,476,143384,147,24563,26625
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA FMS-PT-005-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F("(u7.P3>=1)")))
Formula 11 simplified : !F"(u7.P3>=1)"
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.847775,44172,1,0,44870,3681,491,143384,147,24563,26632
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA FMS-PT-005-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(G(F("((i1.u1.P12wM3>=1)&&(i1.u6.M3>=1))")))))
Formula 12 simplified : !XGF"((i1.u1.P12wM3>=1)&&(i1.u6.M3>=1))"
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.849957,44172,1,0,45048,3710,512,143653,147,24660,26842
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA FMS-PT-005-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((G(X((X("(i3.u4.P2>=1)"))U("(i3.u4.P2s>=1)")))))
Formula 13 simplified : !GX(X"(i3.u4.P2>=1)" U "(i3.u4.P2s>=1)")
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.850467,44172,1,0,45048,3710,512,143653,147,24660,26861
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA FMS-PT-005-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((X(X(F(F(F("(u7.P3>=1)")))))))
Formula 14 simplified : !XXF"(u7.P3>=1)"
3 unique states visited
0 strongly connected components in search stack
2 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.850733,44172,1,0,45048,3710,512,143653,147,24660,26870
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA FMS-PT-005-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(("(i3.u8.P2d>=1)"))
Formula 15 simplified : !"(i3.u8.P2d>=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.850948,44172,1,0,45048,3710,512,143653,147,24660,26871
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA FMS-PT-005-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527981017440

--------------------
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
Jun 02, 2018 11:10:15 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/, -louvain, -smt]
Jun 02, 2018 11:10:15 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2018 11:10:15 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 24 ms
Jun 02, 2018 11:10:15 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 22 places.
Jun 02, 2018 11:10:15 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 20 transitions.
Jun 02, 2018 11:10:15 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 4 ms
Jun 02, 2018 11:10:15 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 02, 2018 11:10:16 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 18 ms
Jun 02, 2018 11:10:16 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 7 ms
Begin: Sat Jun 2 23:10:16 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Sat Jun 2 23:10:16 2018
network size: 22 nodes, 52 links, 40 weight
quality increased from -0.048125 to 0.5325
end computation: Sat Jun 2 23:10:16 2018
level 1:
start computation: Sat Jun 2 23:10:16 2018
network size: 9 nodes, 33 links, 40 weight
quality increased from 0.5325 to 0.596563
end computation: Sat Jun 2 23:10:16 2018
level 2:
start computation: Sat Jun 2 23:10:16 2018
network size: 4 nodes, 10 links, 40 weight
quality increased from 0.596563 to 0.596563
end computation: Sat Jun 2 23:10:16 2018
End: Sat Jun 2 23:10:16 2018
Total duration: 0 sec
0.596563
Jun 02, 2018 11:10:16 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 02, 2018 11:10:16 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 5 ms
Jun 02, 2018 11:10:16 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 02, 2018 11:10:16 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 1 redundant transitions.
Jun 02, 2018 11:10:16 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 1 ms
Jun 02, 2018 11:10:16 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Jun 02, 2018 11:10:16 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 20 transitions.
Jun 02, 2018 11:10:16 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 6 place invariants in 6 ms
Jun 02, 2018 11:10:16 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 22 variables to be positive in 58 ms
Jun 02, 2018 11:10:16 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 20 transitions.
Jun 02, 2018 11:10:16 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/20 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 11:10:16 PM 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)
Jun 02, 2018 11:10:16 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 20 transitions.
Jun 02, 2018 11:10:16 PM 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)
Jun 02, 2018 11:10:16 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 20 transitions.
Jun 02, 2018 11:10:16 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished co-enabling matrix. took 240 ms. Total solver calls (SAT/UNSAT): 82(80/2)
Jun 02, 2018 11:10:16 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 20 transitions.
Jun 02, 2018 11:10:17 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 66 ms. Total solver calls (SAT/UNSAT): 24(0/24)
Jun 02, 2018 11:10:17 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 726ms 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="FMS-PT-005"
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/FMS-PT-005.tgz
mv FMS-PT-005 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 FMS-PT-005, 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 r249-blw7-152732550400016"
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 ;