fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r063-ebro-155234659400376
Last Updated
Apr 15, 2019

About the Execution of ITS-Tools for DiscoveryGPU-PT-12a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
371.570 6760.00 14841.00 224.60 FFFFFFFFFFFFFFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2019-input.r063-ebro-155234659400376.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-3954
Executing tool itstools
Input is DiscoveryGPU-PT-12a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r063-ebro-155234659400376
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.3K Feb 10 22:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 10 22:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 6 19:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 6 19:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 106 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 344 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.4K Feb 4 23:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 4 23:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.9K Feb 4 22:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 3 07:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 3 07:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jan 30 23:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Jan 30 23:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 4 22:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:19 UpperBounds.xml

-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 43K Mar 10 17:31 model.pnml

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

=== Now, execution of the tool begins

BK_START 1552824404072

Working with output stream class java.io.PrintStream
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.201903111103/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.201903111103/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(("(u2.p18>=1)")U(F("((u9.p85>=1)&&(u13.p121>=1))"))))))
Formula 0 simplified : !FX("(u2.p18>=1)" U F"((u9.p85>=1)&&(u13.p121>=1))")
built 25 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions u1.t157, u1.t158, u2.t155, u2.t156, u3.t159, u3.t160, u4.t153, u4.t154, u5.t161, u5.t162, u6.t151, u6.t152, u7.t163, u7.t164, u8.t149, u8.t150, u9.t165, u9.t166, u10.t147, u10.t148, u11.t167, u11.t168, u12.t145, u12.t146, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/145/24/169
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.196552,19736,1,0,7833,812,1316,6899,299,4266,12218
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(("((u1.p8>=1)&&(u14.p122>=1))"))
Formula 1 simplified : !"((u1.p8>=1)&&(u14.p122>=1))"
Computing Next relation with stutter on 1 deadlock states
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.219148,20620,1,0,9418,915,1378,8363,299,5909,14089
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((G(G(F("(u15.p0>=1)"))))U(F("((u6.p57>=1)&&(u13.p121>=1))"))))
Formula 2 simplified : !(GF"(u15.p0>=1)" U F"((u6.p57>=1)&&(u13.p121>=1))")
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.311691,22792,1,0,14037,932,1423,12775,299,6233,19281
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(("(u8.p71>=1)"))
Formula 3 simplified : !"(u8.p71>=1)"
Computing Next relation with stutter on 1 deadlock states
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.312368,22792,1,0,14037,932,1427,12775,300,6233,19289
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(F(("((u5.p46>=1)&&(u13.p121>=1))")U(G("((u9.p87>=1)&&(u13.p121>=1))"))))))
Formula 4 simplified : !F("((u5.p46>=1)&&(u13.p121>=1))" U G"((u9.p87>=1)&&(u13.p121>=1))")
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
75 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.07381,33280,1,0,41235,1416,1450,29034,300,10858,39008
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(("(u5.p44>=1)"))
Formula 5 simplified : !"(u5.p44>=1)"
Computing Next relation with stutter on 1 deadlock states
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,1.07724,33280,1,0,41235,1416,1455,29034,301,10858,39020
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(X(G(G(X("((u4.p39>=1)&&(u13.p121>=1))")))))))
Formula 6 simplified : !GXGX"((u4.p39>=1)&&(u13.p121>=1))"
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
19 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.26356,36420,1,0,49373,1559,1508,36684,301,12871,49269
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((("(u9.p83>=1)")U((X("((u2.p17>=1)&&(u13.p121>=1))"))U(X("((u1.p4>=1)&&(u14.p122>=1))")))))
Formula 7 simplified : !("(u9.p83>=1)" U (X"((u2.p17>=1)&&(u13.p121>=1))" U X"((u1.p4>=1)&&(u14.p122>=1))"))
Computing Next relation with stutter on 1 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 157
// Phase 1: matrix 157 rows 123 cols
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,1.29168,36892,1,0,49849,1559,1533,37305,302,12882,50529
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((F(G(F("(u7.p68>=1)"))))U(G("(u2.p14>=1)"))))
Formula 8 simplified : !(FGF"(u7.p68>=1)" U G"(u2.p14>=1)")
Computing Next relation with stutter on 1 deadlock states
invariant :u13:p121 + u15:p0 = 1
invariant :u14:p122 + u15:p0 = 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,1.32155,37732,1,0,50350,1631,1587,37946,302,13642,51487
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(G((X("(u3.p21>=1)"))U(X("((u7.p62>=1)&&(u13.p121>=1))"))))))
Formula 9 simplified : !XG(X"(u3.p21>=1)" U X"((u7.p62>=1)&&(u13.p121>=1))")
Computing Next relation with stutter on 1 deadlock states
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,1.33085,37956,1,0,50513,1649,1598,38160,302,13949,51849
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G("(u1.p3>=1)")))
Formula 10 simplified : !G"(u1.p3>=1)"
Computing Next relation with stutter on 1 deadlock states
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,1.33367,38216,1,0,50513,1649,1614,38160,302,13949,51885
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((F(("((u12.p120>=1)&&(u13.p121>=1))")U("(u11.p108>=1)")))U(G(F(F("((u1.p9>=1)&&(u13.p121>=1))"))))))
Formula 11 simplified : !(F("((u12.p120>=1)&&(u13.p121>=1))" U "(u11.p108>=1)") U GF"((u1.p9>=1)&&(u13.p121>=1))")
Computing Next relation with stutter on 1 deadlock states
5 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,1.37206,38216,1,0,51214,1668,1674,39147,302,14398,53259
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G("((u2.p20>=1)&&(u13.p121>=1))")))
Formula 12 simplified : !G"((u2.p20>=1)&&(u13.p121>=1))"
Computing Next relation with stutter on 1 deadlock states
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,1.37619,38692,1,0,51214,1668,1696,39147,302,14398,53287
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(((F(G(F("(u11.p108>=1)"))))U(X(X(X("((u12.p114>=1)&&(u14.p122>=1))"))))))
Formula 13 simplified : !(FGF"(u11.p108>=1)" U XXX"((u12.p114>=1)&&(u14.p122>=1))")
Computing Next relation with stutter on 1 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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,1.39757,39508,1,0,51834,1674,1723,39853,303,14527,54347
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((F(X("(u1.p6>=1)"))))
Formula 14 simplified : !FX"(u1.p6>=1)"
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
6 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.45744,39980,1,0,53496,1678,1763,41179,304,14547,56561
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((X(X("(u5.p43>=1)"))))
Formula 15 simplified : !XX"(u5.p43>=1)"
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,1.4591,39980,1,0,53510,1678,1766,41190,304,14547,56622
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-12a-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, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1552824410832

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /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 -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
Mar 17, 2019 12:06:47 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]
Mar 17, 2019 12:06:47 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 17, 2019 12:06:47 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 105 ms
Mar 17, 2019 12:06:47 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 123 places.
Mar 17, 2019 12:06:47 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 169 transitions.
Mar 17, 2019 12:06:47 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Found NUPN structural information;
Mar 17, 2019 12:06:47 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 54 ms
Mar 17, 2019 12:06:47 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Mar 17, 2019 12:06:47 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 123 ms
Mar 17, 2019 12:06:47 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 50 ms
Mar 17, 2019 12:06:48 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Mar 17, 2019 12:06:48 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Mar 17, 2019 12:06:48 PM fr.lip6.move.gal.instantiate.Instantiator dropEvents
INFO: Dropping 35 events :t37,t37,t37,t37,t37,t37,t37,t37,t37,t37,t37,t37,t37,t37,t37,t37,t37,t37,t37,t37,t37,t37,t37,t37,t37,t37,t37,t37,t37,t37,t37,t37,t37,t37,t37,
Mar 17, 2019 12:06:48 PM fr.lip6.move.gal.instantiate.Instantiator dropEvents
INFO: Dropping 71 events :t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,t73,
Mar 17, 2019 12:06:48 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 106 redundant transitions.
Mar 17, 2019 12:06:48 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 139 ms
Mar 17, 2019 12:06:48 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 9 ms
Mar 17, 2019 12:06:48 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Mar 17, 2019 12:06:48 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 169 transitions.
Mar 17, 2019 12:06:49 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 2 place invariants in 35 ms
Mar 17, 2019 12:06:50 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 123 variables to be positive in 281 ms
Mar 17, 2019 12:06:50 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 169 transitions.
Mar 17, 2019 12:06:50 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/169 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 17, 2019 12:06:50 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 17, 2019 12:06:50 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 169 transitions.
Mar 17, 2019 12:06:50 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 17, 2019 12:06:50 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
Mar 17, 2019 12:06:50 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s1 () (Array Int Int)) with error (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Mar 17, 2019 12:06:50 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (and (>= (select s0 17) 1) (>= (select s0 121) 1)) (= (store (store s0 16 (+ (select s0 16) 1)) 17 (- (select s0 17) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Broken pipe (and (and (>= (select s0 17) 1) (>= (select s0 121) 1)) (= (store (store s0 16 (+ (select s0 16) 1)) 17 (- (select s0 17) 1)) s1))")
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:755)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
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)
Mar 17, 2019 12:06:50 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 1771ms 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="DiscoveryGPU-PT-12a"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-12a, 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 r063-ebro-155234659400376"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-12a.tgz
mv DiscoveryGPU-PT-12a execution
cd execution
if [ "LTLFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLFireability" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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 ;