fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r225-ebro-152732379700140
Last Updated
June 26, 2018

About the Execution of ITS-Tools.L for CircadianClock-PT-000010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15746.270 6333.00 13650.00 174.50 FTFFFFFFTFFFFFFF 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 184K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K 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:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:49 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 2.1K 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.7K 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 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.5K 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.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 7 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 11K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is CircadianClock-PT-000010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r225-ebro-152732379700140
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527625741917

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/graph6812000218811618203.txt, -o, /tmp/graph6812000218811618203.bin, -w, /tmp/graph6812000218811618203.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/graph6812000218811618203.bin, -l, -1, -v, -w, /tmp/graph6812000218811618203.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(F((X("((i1.u2.dr_a>=1)&&(u0.a_cap>=1))"))U(X("((i1.u4.mr>=1)&&(i3.u5.r_cap>=1))"))))))
Formula 0 simplified : !F(X"((i1.u2.dr_a>=1)&&(u0.a_cap>=1))" U X"((i1.u4.mr>=1)&&(i3.u5.r_cap>=1))")
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 3 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
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.049738,16984,1,0,848,143,164,901,73,421,634
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CircadianClock-PT-000010-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(("((i1.u2.dr>=1)&&(i1.u4.mr_cap>=1))"))
Formula 1 simplified : !"((i1.u2.dr>=1)&&(i1.u4.mr_cap>=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.05031,16984,1,0,848,143,174,901,73,421,644
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA CircadianClock-PT-000010-LTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X((G(F("((i2.u3.ma>=1)&&(u0.a_cap>=1))")))U(G(G("(u0.a>=1)"))))))
Formula 2 simplified : !X(GF"((i2.u3.ma>=1)&&(u0.a_cap>=1))" U G"(u0.a>=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.064696,18188,1,0,1092,144,226,1255,74,433,2147
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA CircadianClock-PT-000010-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(("((i1.u4.mr>=1)&&(i3.u5.r_cap>=1))")U("((i1.u4.mr>=1)&&(i3.u5.r_cap>=1))"))))
Formula 3 simplified : !X"((i1.u4.mr>=1)&&(i3.u5.r_cap>=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.067019,18448,1,0,1102,144,228,1262,74,433,2211
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA CircadianClock-PT-000010-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(F(G(X("((i2.u1.da>=1)&&(u0.a>=1))"))))))
Formula 4 simplified : !XFGX"((i2.u1.da>=1)&&(u0.a>=1))"
3 unique states visited
2 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.070147,18448,1,0,1123,144,244,1308,74,437,2275
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA CircadianClock-PT-000010-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(("((i1.u2.dr_a>=1)&&(u0.a_cap>=1))"))
Formula 5 simplified : !"((i1.u2.dr_a>=1)&&(u0.a_cap>=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.07071,18448,1,0,1123,144,249,1308,74,437,2284
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA CircadianClock-PT-000010-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X((("((i2.u1.da>=1)&&(u0.a>=1))")U("(u0.a>=1)"))U(F(X("((i1.u4.mr>=1)&&(i3.u5.r_cap>=1))"))))))
Formula 6 simplified : !X(("((i2.u1.da>=1)&&(u0.a>=1))" U "(u0.a>=1)") U FX"((i1.u4.mr>=1)&&(i3.u5.r_cap>=1))")
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.07297,18640,1,0,1163,145,249,1402,74,446,2347
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA CircadianClock-PT-000010-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((F(("(i1.u4.mr>=1)")U("((i2.u3.ma>=1)&&(u0.a_cap>=1))")))U(X(("(i1.u4.mr>=1)")U("((i1.u2.dr_a>=1)&&(i1.u4.mr_cap>=1))")))))
Formula 7 simplified : !(F("(i1.u4.mr>=1)" U "((i2.u3.ma>=1)&&(u0.a_cap>=1))") U X("(i1.u4.mr>=1)" U "((i1.u2.dr_a>=1)&&(i1.u4.mr_cap>=1))"))
6 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 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.104658,18776,1,0,2373,249,287,4297,74,1228,4311
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA CircadianClock-PT-000010-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(("((i2.u1.da>=1)&&(i2.u3.ma_cap>=1))"))
Formula 8 simplified : !"((i2.u1.da>=1)&&(i2.u3.ma_cap>=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.105636,19040,1,0,2373,249,292,4297,74,1228,4314
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA CircadianClock-PT-000010-LTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((F("((i2.u1.da>=1)&&(i2.u3.ma_cap>=1))"))U(G(G("((i1.u2.dr_a>=1)&&(u0.a_cap>=1))")))))
Formula 9 simplified : !(F"((i2.u1.da>=1)&&(i2.u3.ma_cap>=1))" U G"((i1.u2.dr_a>=1)&&(u0.a_cap>=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.109026,19240,1,0,2414,249,312,4340,74,1228,4415
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA CircadianClock-PT-000010-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G("((i1.u2.dr_a>=1)&&(i1.u4.mr_cap>=1))")))
Formula 10 simplified : !G"((i1.u2.dr_a>=1)&&(i1.u4.mr_cap>=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.109864,19240,1,0,2414,249,320,4340,74,1228,4426
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA CircadianClock-PT-000010-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G(G((G("(((u0.a>=1)&&(i3.u5.r>=1))&&(i3.u6.c_cap>=1))"))U(G("(((u0.a>=1)&&(i3.u5.r>=1))&&(i3.u6.c_cap>=1))"))))))
Formula 11 simplified : !G"(((u0.a>=1)&&(i3.u5.r>=1))&&(i3.u6.c_cap>=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.110893,19240,1,0,2414,249,340,4340,74,1228,4438
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA CircadianClock-PT-000010-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(X((G("(i2.u3.ma>=1)"))U("((i2.u1.da_a>=1)&&(u0.a_cap>=1))")))))
Formula 12 simplified : !XX(G"(i2.u3.ma>=1)" U "((i2.u1.da_a>=1)&&(u0.a_cap>=1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.144077,19880,1,0,4356,297,361,6650,74,1543,6475
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA CircadianClock-PT-000010-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((X((G(X("((i2.u1.da_a>=1)&&(u0.a_cap>=1))")))U(G(G("(((u0.a>=1)&&(i3.u5.r>=1))&&(i3.u6.c_cap>=1))"))))))
Formula 13 simplified : !X(GX"((i2.u1.da_a>=1)&&(u0.a_cap>=1))" U G"(((u0.a>=1)&&(i3.u5.r>=1))&&(i3.u6.c_cap>=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.149436,20580,1,0,4408,297,384,6759,76,1545,6563
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA CircadianClock-PT-000010-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(("(i1.u4.mr>=1)"))
Formula 14 simplified : !"(i1.u4.mr>=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.149835,20580,1,0,4408,297,385,6759,76,1545,6567
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA CircadianClock-PT-000010-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((F(G("((i2.u3.ma>=1)&&(u0.a_cap>=1))"))))
Formula 15 simplified : !FG"((i2.u3.ma>=1)&&(u0.a_cap>=1))"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 14
// Phase 1: matrix 14 rows 14 cols
invariant :i1:u2:dr + i1:u2:dr_a = 1
invariant :i2:u1:da + i2:u1:da_a = 1
invariant :i1:u4:mr + i1:u4:mr_cap = 10
invariant :i3:u5:r + i3:u5:r_cap = 10
invariant :i3:u6:c + i3:u6:c_cap = 10
invariant :u0:a + u0:a_cap = 10
invariant :i2:u3:ma + i2:u3:ma_cap = 10
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
88 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,1.03815,36944,1,0,36999,479,403,77184,76,3447,19747
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA CircadianClock-PT-000010-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
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 1527625748250

--------------------
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 29, 2018 8:29:05 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]
May 29, 2018 8:29:05 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 29, 2018 8:29:05 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 54 ms
May 29, 2018 8:29:05 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 14 places.
May 29, 2018 8:29:06 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 16 transitions.
May 29, 2018 8:29:06 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 12 ms
May 29, 2018 8:29:06 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
May 29, 2018 8:29:06 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 51 ms
May 29, 2018 8:29:06 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 16 ms
Begin: Tue May 29 20:29:06 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Tue May 29 20:29:06 2018
network size: 14 nodes, 46 links, 32 weight
quality increased from -0.0877279 to 0.44401
end computation: Tue May 29 20:29:06 2018
level 1:
start computation: Tue May 29 20:29:06 2018
network size: 7 nodes, 25 links, 32 weight
quality increased from 0.44401 to 0.532878
end computation: Tue May 29 20:29:06 2018
level 2:
start computation: Tue May 29 20:29:06 2018
network size: 4 nodes, 12 links, 32 weight
quality increased from 0.532878 to 0.532878
end computation: Tue May 29 20:29:06 2018
End: Tue May 29 20:29:06 2018
Total duration: 0 sec
0.532878
May 29, 2018 8:29:06 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 29, 2018 8:29:06 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 12 ms
May 29, 2018 8:29:06 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
May 29, 2018 8:29:06 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 7 redundant transitions.
May 29, 2018 8:29:06 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
May 29, 2018 8:29:06 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 3 ms
May 29, 2018 8:29:06 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 16 transitions.
May 29, 2018 8:29:07 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 7 place invariants in 15 ms
May 29, 2018 8:29:07 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 14 variables to be positive in 99 ms
May 29, 2018 8:29:07 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 16 transitions.
May 29, 2018 8:29:07 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/16 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 29, 2018 8:29:07 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 29, 2018 8:29:07 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 16 transitions.
May 29, 2018 8:29:07 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)
May 29, 2018 8:29:07 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 16 transitions.
May 29, 2018 8:29:07 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
May 29, 2018 8:29:07 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (= 1 (+ (select s0 2) (select s0 3)))) with error (error "Failed to assert expression: java.io.IOException: Broken pipe (= 1 (+ (select s0 2) (select s0 3)))")
[(declare-fun s0 () (Array Int Int)), (assert (= 1 (+ (select s0 2) (select s0 3)))), (assert (= 10 (+ (select s0 4) (select s0 5)))), (assert (and (>= (select s0 2) 1) (>= (select s0 5) 1))), (assert (>= (select s0 2) 0)), (assert (>= (select s0 3) 0)), (assert (>= (select s0 4) 0)), (assert (>= (select s0 5) 0))]
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout when executing script :
org.smtlib.impl.Script@6b3db545
java.lang.RuntimeException: SMT solver raised an exception or timeout when executing script :
org.smtlib.impl.Script@6b3db545
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:448)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
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 29, 2018 8:29:07 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 1139ms 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="CircadianClock-PT-000010"
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/CircadianClock-PT-000010.tgz
mv CircadianClock-PT-000010 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 CircadianClock-PT-000010, 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 r225-ebro-152732379700140"
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 ;