Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2019-input.r197-oct2-155272231500789.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-3954
Executing tool itstoolsm
Input is Philosophers-PT-000005, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-oct2-155272231500789
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 5.3K Feb 12 04:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 12 04:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Feb 8 03:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 24K Feb 8 03:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 109 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 347 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 3.4K Feb 5 00:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K Feb 5 00:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 4 22:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K Feb 4 22:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Feb 4 08:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 4 08:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 1 02:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Feb 1 02:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Feb 4 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 21K 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 Philosophers-PT-000005-LTLCardinality-00
FORMULA_NAME Philosophers-PT-000005-LTLCardinality-01
FORMULA_NAME Philosophers-PT-000005-LTLCardinality-02
FORMULA_NAME Philosophers-PT-000005-LTLCardinality-03
FORMULA_NAME Philosophers-PT-000005-LTLCardinality-04
FORMULA_NAME Philosophers-PT-000005-LTLCardinality-05
FORMULA_NAME Philosophers-PT-000005-LTLCardinality-06
FORMULA_NAME Philosophers-PT-000005-LTLCardinality-07
FORMULA_NAME Philosophers-PT-000005-LTLCardinality-08
FORMULA_NAME Philosophers-PT-000005-LTLCardinality-09
FORMULA_NAME Philosophers-PT-000005-LTLCardinality-10
FORMULA_NAME Philosophers-PT-000005-LTLCardinality-11
FORMULA_NAME Philosophers-PT-000005-LTLCardinality-12
FORMULA_NAME Philosophers-PT-000005-LTLCardinality-13
FORMULA_NAME Philosophers-PT-000005-LTLCardinality-14
FORMULA_NAME Philosophers-PT-000005-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1553693352080

Working with output stream class java.io.PrintStream
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord
Read 16 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((false))
Formula 0 simplified : 1
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.025623,16804,1,0,7,1808,17,4,632,1017,13
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((F(G(G(G("(((((Fork_1+Fork_2)+Fork_3)+Fork_4)+Fork_5)>=1)"))))))
Formula 1 simplified : !FG"(((((Fork_1+Fork_2)+Fork_3)+Fork_4)+Fork_5)>=1)"
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.042062,17524,1,0,22,3951,30,25,661,5313,74
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((X(X(G(X("(((((Eat_1+Eat_3)+Eat_2)+Eat_5)+Eat_4)>=3)"))))))
Formula 2 simplified : !XXGX"(((((Eat_1+Eat_3)+Eat_2)+Eat_5)+Eat_4)>=3)"
Computing Next relation with stutter on 2 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.047815,17932,1,0,24,4158,36,28,683,5565,90
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((false))
Formula 3 simplified : 1
Computing Next relation with stutter on 2 deadlock states
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.048123,17932,1,0,24,4158,36,28,683,5565,90
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((("(((((Catch1_1+Catch1_2)+Catch1_3)+Catch1_5)+Catch1_4)<=((((Think_1+Think_2)+Think_3)+Think_4)+Think_5))")U(F(X("(((((Catch2_2+Catch2_1)+Catch2_4)+Catch2_3)+Catch2_5)<=((((Think_1+Think_2)+Think_3)+Think_4)+Think_5))")))))
Formula 4 simplified : !("(((((Catch1_1+Catch1_2)+Catch1_3)+Catch1_5)+Catch1_4)<=((((Think_1+Think_2)+Think_3)+Think_4)+Think_5))" U FX"(((((Catch2_2+Catch2_1)+Catch2_4)+Catch2_3)+Catch2_5)<=((((Think_1+Think_2)+Think_3)+Think_4)+Think_5))")
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.050467,18176,1,0,24,4158,45,28,713,5565,94
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA Philosophers-PT-000005-LTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !(((G("(((((Catch2_2+Catch2_1)+Catch2_4)+Catch2_3)+Catch2_5)<=((((Catch1_1+Catch1_2)+Catch1_3)+Catch1_5)+Catch1_4))"))U(("(((((Catch1_1+Catch1_2)+Catch1_3)+Catch1_5)+Catch1_4)<=((((Eat_1+Eat_3)+Eat_2)+Eat_5)+Eat_4))")U("(((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)<=((((Eat_1+Eat_3)+Eat_2)+Eat_5)+Eat_4))"))))
Formula 5 simplified : !(G"(((((Catch2_2+Catch2_1)+Catch2_4)+Catch2_3)+Catch2_5)<=((((Catch1_1+Catch1_2)+Catch1_3)+Catch1_5)+Catch1_4))" U ("(((((Catch1_1+Catch1_2)+Catch1_3)+Catch1_5)+Catch1_4)<=((((Eat_1+Eat_3)+Eat_2)+Eat_5)+Eat_4))" U "(((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)<=((((Eat_1+Eat_3)+Eat_2)+Eat_5)+Eat_4))"))
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.066233,19312,1,0,36,5637,69,37,1002,7564,131
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((false))
Formula 6 simplified : 1
Computing Next relation with stutter on 2 deadlock states
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.06644,19312,1,0,36,5637,69,37,1002,7564,131
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Checking formula 7 : !((X(X(("(((((Catch1_1+Catch1_2)+Catch1_3)+Catch1_5)+Catch1_4)>=2)")U("(((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)>=2)")))))
Formula 7 simplified : !XX("(((((Catch1_1+Catch1_2)+Catch1_3)+Catch1_5)+Catch1_4)>=2)" U "(((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)>=2)")
Computing Next relation with stutter on 2 deadlock states
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.0682,19312,1,0,36,5673,79,37,1049,7564,135
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA Philosophers-PT-000005-LTLCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((true))
Formula 8 simplified : 0
Computing Next relation with stutter on 2 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.068345,19312,1,0,36,5673,79,37,1049,7564,135
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA Philosophers-PT-000005-LTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((true))
Formula 9 simplified : 0
Computing Next relation with stutter on 2 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.068418,19312,1,0,36,5673,79,37,1049,7564,135
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA Philosophers-PT-000005-LTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !(((("(Catch2_3<=Fork_2)")U("(Fork_3<=Catch1_3)"))U(X(G("(Catch1_3<=Think_2)")))))
Formula 10 simplified : !(("(Catch2_3<=Fork_2)" U "(Fork_3<=Catch1_3)") U XG"(Catch1_3<=Think_2)")
// Phase 1: matrix 25 rows 25 cols
Computing Next relation with stutter on 2 deadlock states
invariant :Fork_4 + Catch1_5 + Catch2_4 + Eat_5 + Eat_4 = 1
invariant :Fork_1 + Catch1_2 + Catch2_1 + Eat_1 + Eat_2 = 1
invariant :Think_5 + Catch1_5 + Catch2_5 + Eat_5 = 1
invariant :Fork_2 + Catch1_3 + Catch2_2 + Eat_3 + Eat_2 = 1
invariant :Think_3 + Catch1_3 + Catch2_3 + Eat_3 = 1
invariant :Fork_3 + Catch1_4 + Catch2_3 + Eat_3 + Eat_4 = 1
invariant :Fork_5 + Catch1_1 + Eat_1 + Catch2_5 + Eat_5 = 1
invariant :Think_4 + Catch1_4 + Catch2_4 + Eat_4 = 1
invariant :Think_1 + Catch1_1 + Catch2_1 + Eat_1 = 1
invariant :Think_2 + Catch1_2 + Catch2_2 + Eat_2 = 1
4 unique states visited
2 strongly connected components in search stack
5 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.076026,20064,1,0,52,6411,117,65,1083,9197,216
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((true))
Formula 11 simplified : 0
Computing Next relation with stutter on 2 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.076179,20064,1,0,52,6411,117,65,1083,9197,216
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA Philosophers-PT-000005-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((F(F(("(Eat_4<=Fork_3)")U("(Think_2<=Think_1)")))))
Formula 12 simplified : !F("(Eat_4<=Fork_3)" U "(Think_2<=Think_1)")
Computing Next relation with stutter on 2 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.076524,20280,1,0,52,6411,126,65,1086,9197,220
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA Philosophers-PT-000005-LTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((F(X(G(G("(Fork_5<=Think_1)"))))))
Formula 13 simplified : !FXG"(Fork_5<=Think_1)"
Computing Next relation with stutter on 2 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,0.085462,20280,1,0,65,8040,139,82,1090,11735,276
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((G("(Catch2_5<=Fork_1)")))
Formula 14 simplified : !G"(Catch2_5<=Fork_1)"
Computing Next relation with stutter on 2 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.088651,20544,1,0,71,8657,145,88,1095,12445,309
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((true))
Formula 15 simplified : 0
Computing Next relation with stutter on 2 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.088783,20544,1,0,71,8657,145,88,1095,12445,309
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA Philosophers-PT-000005-LTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
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 1553693354224

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -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 LTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -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 27, 2019 1:29:13 PM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt]
Mar 27, 2019 1:29:13 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 27, 2019 1:29:13 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 23 ms
Mar 27, 2019 1:29:13 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 25 places.
Mar 27, 2019 1:29:13 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 25 transitions.
Mar 27, 2019 1:29:13 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 12 ms
Mar 27, 2019 1:29:13 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 32 ms
Mar 27, 2019 1:29:13 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 9 ms
Mar 27, 2019 1:29:13 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 25 transitions.
Mar 27, 2019 1:29:13 PM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 25 places.
Mar 27, 2019 1:29:13 PM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 25 transitions.
Mar 27, 2019 1:29:13 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 1 ms
Mar 27, 2019 1:29:13 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Mar 27, 2019 1:29:13 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 25 transitions.
Mar 27, 2019 1:29:14 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 10 place invariants in 5 ms
Mar 27, 2019 1:29:14 PM fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver checkSat
WARNING: SMT solver unexpectedly returned 'unknown' answer, retrying.
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:318)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:305)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:116)
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 27, 2019 1:29:14 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 167ms 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="Philosophers-PT-000005"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstoolsm"
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 itstoolsm"
echo " Input is Philosophers-PT-000005, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r197-oct2-155272231500789"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000005.tgz
mv Philosophers-PT-000005 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;