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-155234659400358.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-11a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r063-ebro-155234659400358
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 2.8K Feb 10 22:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Feb 10 22:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 6 18:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 6 18:50 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:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 4 23:34 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 2.9K Feb 3 07:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Feb 3 07:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Jan 30 23:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Jan 30 23:53 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 39K 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-11a-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1552823861932

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 : !((X(X(("((u2.p19>=1)&&(u12.p111>=1))")U(G("(u9.p84>=1)"))))))
Formula 0 simplified : !XX("((u2.p19>=1)&&(u12.p111>=1))" U G"(u9.p84>=1)")
built 23 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions u1.t143, u1.t144, u2.t145, u2.t146, u3.t141, u3.t142, u4.t147, u4.t148, u5.t139, u5.t140, u6.t149, u6.t150, u7.t137, u7.t138, u8.t151, u8.t152, u9.t135, u9.t136, u10.t153, u10.t154, u11.t133, u11.t134, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/133/22/155
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
16 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.211241,21372,1,0,9615,883,1261,8621,291,4750,15356
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(F((F("((u1.p3>=1)&&(u13.p112>=1))"))U("((u10.p100>=1)&&(u12.p111>=1))")))))
Formula 1 simplified : !F(F"((u1.p3>=1)&&(u13.p112>=1))" U "((u10.p100>=1)&&(u12.p111>=1))")
Computing Next relation with stutter on 1 deadlock states
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.214184,21372,1,0,9616,883,1307,8624,291,4750,15434
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((((X("((u7.p68>=1)&&(u13.p112>=1))"))U(F("((u4.p37>=1)&&(u12.p111>=1))")))U((F("((u5.p44>=1)&&(u13.p112>=1))"))U(G("((u10.p95>=1)&&(u12.p111>=1))")))))
Formula 2 simplified : !((X"((u7.p68>=1)&&(u13.p112>=1))" U F"((u4.p37>=1)&&(u12.p111>=1))") U (F"((u5.p44>=1)&&(u13.p112>=1))" U G"((u10.p95>=1)&&(u12.p111>=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.24959,23740,1,0,11545,1048,1386,10457,291,7033,17778
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((("((u8.p74>=1)&&(u13.p112>=1))")U(("(u3.p21>=1)")U("(u11.p104>=1)"))))
Formula 3 simplified : !("((u8.p74>=1)&&(u13.p112>=1))" U ("(u3.p21>=1)" U "(u11.p104>=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.251959,23996,1,0,11554,1048,1421,10470,292,7084,17868
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(X((F("(u10.p94>=1)"))U(G("((u9.p86>=1)&&(u12.p111>=1))"))))))
Formula 4 simplified : !FX(F"(u10.p94>=1)" U G"((u9.p86>=1)&&(u12.p111>=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 144
// Phase 1: matrix 144 rows 113 cols
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
26 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.51976,30852,1,0,31315,1377,1450,23383,292,11069,30471
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F("((u1.p10>=1)&&(u12.p111>=1))")))
Formula 5 simplified : !F"((u1.p10>=1)&&(u12.p111>=1))"
Computing Next relation with stutter on 1 deadlock states
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.523825,31116,1,0,31315,1377,1502,23383,292,11069,30557
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(F(X(F("((u7.p67>=1)&&(u12.p111>=1))"))))))
Formula 6 simplified : !XFXF"((u7.p67>=1)&&(u12.p111>=1))"
Computing Next relation with stutter on 1 deadlock states
invariant :u12:p111 + u14:p0 = 1
invariant :u13:p112 + u14:p0 = 1
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
7 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.602526,33756,1,0,38616,1381,1539,29425,292,11092,39659
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(("((u11.p104>=1)&&(u13.p112>=1))"))
Formula 7 simplified : !"((u11.p104>=1)&&(u13.p112>=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.603324,34020,1,0,38616,1381,1543,29425,292,11092,39663
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(("((u3.p29>=1)&&(u12.p111>=1))"))
Formula 8 simplified : !"((u3.p29>=1)&&(u12.p111>=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.603759,34020,1,0,38616,1381,1548,29425,292,11092,39675
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G((("((u7.p70>=1)&&(u12.p111>=1))")U("((u2.p13>=1)&&(u13.p112>=1))"))U("((u8.p77>=1)&&(u12.p111>=1))"))))
Formula 9 simplified : !G(("((u7.p70>=1)&&(u12.p111>=1))" U "((u2.p13>=1)&&(u13.p112>=1))") U "((u8.p77>=1)&&(u12.p111>=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.608686,34020,1,0,38616,1381,1609,29425,292,11092,39725
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(F(F("((u2.p16>=1)&&(u12.p111>=1))")))))
Formula 10 simplified : !XF"((u2.p16>=1)&&(u12.p111>=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
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.652992,35548,1,0,43656,1381,1625,34207,292,11112,45337
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((((X("((u11.p103>=1)&&(u13.p112>=1))"))U("((u4.p36>=1)&&(u12.p111>=1))"))U(G("((u1.p10>=1)&&(u12.p111>=1))"))))
Formula 11 simplified : !((X"((u11.p103>=1)&&(u13.p112>=1))" U "((u4.p36>=1)&&(u12.p111>=1))") U G"((u1.p10>=1)&&(u12.p111>=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
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.663569,35744,1,0,44047,1416,1648,34644,292,11352,46171
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(("(u11.p103>=1)"))
Formula 12 simplified : !"(u11.p103>=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.665239,36008,1,0,44047,1416,1652,34644,293,11352,46174
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(("((u3.p30>=1)&&(u12.p111>=1))"))
Formula 13 simplified : !"((u3.p30>=1)&&(u12.p111>=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.666736,36008,1,0,44047,1416,1657,34644,293,11352,46186
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((G(X(G(F(F("((u5.p46>=1)&&(u12.p111>=1))")))))))
Formula 14 simplified : !GXGF"((u5.p46>=1)&&(u12.p111>=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
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.673188,36008,1,0,44210,1419,1702,34867,293,11437,46533
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(("(u1.p4>=1)"))
Formula 15 simplified : !"(u1.p4>=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.674614,36008,1,0,44210,1419,1705,34867,293,11437,46548
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-11a-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, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1552823867102

--------------------
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 11:57:44 AM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -smt]
Mar 17, 2019 11:57:44 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 17, 2019 11:57:44 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 90 ms
Mar 17, 2019 11:57:44 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 113 places.
Mar 17, 2019 11:57:45 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 155 transitions.
Mar 17, 2019 11:57:45 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Found NUPN structural information;
Mar 17, 2019 11:57:45 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 27 ms
Mar 17, 2019 11:57:45 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Mar 17, 2019 11:57:45 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 136 ms
Mar 17, 2019 11:57:45 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 52 ms
Mar 17, 2019 11:57:45 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Mar 17, 2019 11:57:45 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Mar 17, 2019 11:57:45 AM fr.lip6.move.gal.instantiate.Instantiator dropEvents
INFO: Dropping 32 events :t34,t34,t34,t34,t34,t34,t34,t34,t34,t34,t34,t34,t34,t34,t34,t34,t34,t34,t34,t34,t34,t34,t34,t34,t34,t34,t34,t34,t34,t34,t34,t34,
Mar 17, 2019 11:57:45 AM fr.lip6.move.gal.instantiate.Instantiator dropEvents
INFO: Dropping 65 events :t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,t67,
Mar 17, 2019 11:57:45 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 97 redundant transitions.
Mar 17, 2019 11:57:45 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 112 ms
Mar 17, 2019 11:57:45 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 16 ms
Mar 17, 2019 11:57:45 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 4 ms
Mar 17, 2019 11:57:46 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 155 transitions.
Mar 17, 2019 11:57:46 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 2 place invariants in 24 ms
Skipping mayMatrices nes/nds SMT push produced unexpected response (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
java.lang.RuntimeException: SMT push produced unexpected response (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:87)
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)
Mar 17, 2019 11:57:46 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 744ms 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-11a"
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-11a, 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-155234659400358"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-11a.tgz
mv DiscoveryGPU-PT-11a 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 ;