Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r193-csrt-159033388500249.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SwimmingPool-PT-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193-csrt-159033388500249
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 172K
-rw-r--r-- 1 mcc users 3.2K Apr 12 18:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 12 18:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 11 20:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 11 20:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Apr 14 12:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 14 12:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 10 21:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 10 21:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 10 05:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 10 05:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 10 22:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 10 22:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 3.9K Mar 24 05:38 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 SwimmingPool-PT-02-00
FORMULA_NAME SwimmingPool-PT-02-01
FORMULA_NAME SwimmingPool-PT-02-02
FORMULA_NAME SwimmingPool-PT-02-03
FORMULA_NAME SwimmingPool-PT-02-04
FORMULA_NAME SwimmingPool-PT-02-05
FORMULA_NAME SwimmingPool-PT-02-06
FORMULA_NAME SwimmingPool-PT-02-07
FORMULA_NAME SwimmingPool-PT-02-08
FORMULA_NAME SwimmingPool-PT-02-09
FORMULA_NAME SwimmingPool-PT-02-10
FORMULA_NAME SwimmingPool-PT-02-11
FORMULA_NAME SwimmingPool-PT-02-12
FORMULA_NAME SwimmingPool-PT-02-13
FORMULA_NAME SwimmingPool-PT-02-14
FORMULA_NAME SwimmingPool-PT-02-15

=== Now, execution of the tool begins

BK_START 1590498046150

[2020-05-26 13:00:49] [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, -timeout, 3600]
[2020-05-26 13:00:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-26 13:00:49] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2020-05-26 13:00:49] [INFO ] Transformed 9 places.
[2020-05-26 13:00:49] [INFO ] Transformed 7 transitions.
[2020-05-26 13:00:49] [INFO ] Parsed PT model containing 9 places and 7 transitions in 72 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100015 steps, including 0 resets, run finished after 140 ms. (steps per millisecond=714 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 7 rows 9 cols
[2020-05-26 13:00:49] [INFO ] Computed 3 place invariants in 3 ms
[2020-05-26 13:00:49] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned unsat
[2020-05-26 13:00:49] [INFO ] [Real]Absence check using 3 positive place invariants in 23 ms returned unsat
[2020-05-26 13:00:49] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned unsat
[2020-05-26 13:00:49] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 7 simplifications.
[2020-05-26 13:00:50] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-26 13:00:50] [INFO ] Flatten gal took : 26 ms
FORMULA SwimmingPool-PT-02-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-02-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-02-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-02-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-26 13:00:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-26 13:00:50] [INFO ] Flatten gal took : 4 ms
[2020-05-26 13:00:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SwimmingPool-PT-02-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-26 13:00:50] [INFO ] Applying decomposition
[2020-05-26 13:00:50] [INFO ] Flatten gal took : 3 ms
[2020-05-26 13:00:50] [INFO ] Input system was already deterministic with 7 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph15365855712880053809.txt, -o, /tmp/graph15365855712880053809.bin, -w, /tmp/graph15365855712880053809.weights], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 7 rows 9 cols
[2020-05-26 13:00:50] [INFO ] Computed 3 place invariants in 1 ms
inv : Undress + InBath + Dress + Bags = 30
inv : WaitBag + Undress + Dress + Dressed + Cabins = 20
inv : Entered + WaitBag + Undress + InBath + Dress + Dressed + Out = 40
Total of 3 invariants.
[2020-05-26 13:00:50] [INFO ] Computed 3 place invariants in 2 ms
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph15365855712880053809.bin, -l, -1, -v, -w, /tmp/graph15365855712880053809.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-26 13:00:50] [INFO ] Decomposing Gal with order
[2020-05-26 13:00:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-26 13:00:50] [INFO ] Flatten gal took : 95 ms
[2020-05-26 13:00:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-26 13:00:50] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 1 ms
[2020-05-26 13:00:50] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/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, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
[2020-05-26 13:00:50] [INFO ] Proved 9 variables to be positive in 187 ms
[2020-05-26 13:00:50] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2020-05-26 13:00:50] [INFO ] Computation of disable matrix completed :0/7 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 13:00:50] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 13:00:50] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2020-05-26 13:00:50] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/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 --gen-order FOLLOW
Read 11 LTL properties
Checking formula 0 : !((F(G((X(G("(gu0.Out<=gu0.Entered)")))U("(gu0.Dressed<=gu1.Cabins)")))))
Formula 0 simplified : !FG(XG"(gu0.Out<=gu0.Entered)" U "(gu0.Dressed<=gu1.Cabins)")
[2020-05-26 13:00:51] [INFO ] Computing symmetric co enabling matrix : 7 transitions.
[2020-05-26 13:00:52] [INFO ] Computation of Finished co-enabling matrix. took 675 ms. Total solver calls (SAT/UNSAT): 21(21/0)
[2020-05-26 13:00:52] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2020-05-26 13:00:52] [INFO ] Computation of Completed DNA matrix. took 173 ms. Total solver calls (SAT/UNSAT): 12(0/12)
[2020-05-26 13:00:52] [INFO ] Built C files in 2187ms conformant to PINS in folder :/home/mcc/execution
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]
Compilation finished in 502 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 70 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, <>([]((X([]((LTLAP0==true))))U((LTLAP1==true)))), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, <>([]((X([]((LTLAP0==true))))U((LTLAP1==true)))), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, <>([]((X([]((LTLAP0==true))))U((LTLAP1==true)))), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
2 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1753 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,17.5868,294432,1,0,185,1.70266e+06,33,60,571,1.80453e+06,335
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA SwimmingPool-PT-02-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((!(X((X(F("(gu0.InBath<=gu0.Dressed)")))||(G("(gu0.InBath>=1)"))))))
Formula 1 simplified : X(XF"(gu0.InBath<=gu0.Dressed)" | G"(gu0.InBath>=1)")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,17.5979,295204,1,0,187,1.7031e+06,45,60,575,1.80488e+06,354
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA SwimmingPool-PT-02-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(X(X(X(G((G("(gu0.InBath<=gu2.Bags)"))||("(gu0.Dressed<=gu1.Cabins)"))))))))
Formula 2 simplified : !GXXXG("(gu0.Dressed<=gu1.Cabins)" | G"(gu0.InBath<=gu2.Bags)")
7 unique states visited
7 strongly connected components in search stack
9 transitions explored
7 items max in DFS search stack
2007 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,37.6699,606120,1,0,601,3.64915e+06,60,280,642,3.9262e+06,1482
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA SwimmingPool-PT-02-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((F(X("((gu0.Entered>=1)&&(gu2.Bags>=1))")))&&(X("(gu0.Entered>=1)"))))
Formula 3 simplified : !(FX"((gu0.Entered>=1)&&(gu2.Bags>=1))" & X"(gu0.Entered>=1)")
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,37.6711,606376,1,0,601,3.64915e+06,68,280,648,3.9262e+06,1486
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA SwimmingPool-PT-02-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((F(!(X("(gu0.Out<2)"))))&&(X("(gu0.Dressed<=gu0.Out)"))))
Formula 4 simplified : !(F!X"(gu0.Out<2)" & X"(gu0.Dressed<=gu0.Out)")
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,37.6719,606636,1,0,601,3.64915e+06,76,280,655,3.9262e+06,1490
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA SwimmingPool-PT-02-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(F(!(X(!(X("(gu2.Dress>=3)"))))))))
Formula 5 simplified : !XF!X!X"(gu2.Dress>=3)"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
914 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,46.8174,760252,1,0,968,4.51276e+06,85,461,657,4.88177e+06,2449
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA SwimmingPool-PT-02-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((("(gu1.Cabins>=1)")U(!(F(G(F("(gu2.Bags<=gu1.Undress)")))))))
Formula 6 simplified : !("(gu1.Cabins>=1)" U !FGF"(gu2.Bags<=gu1.Undress)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
2092 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,67.7475,1064624,1,0,1590,6.12015e+06,98,822,719,6.83761e+06,4057
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA SwimmingPool-PT-02-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(F(("(gu0.Dressed<=gu0.Entered)")U(X(G((!(G(X(X("(gu0.Dressed<=gu0.Entered)")))))&&("(gu0.Dressed>gu0.InBath)"))))))))
Formula 7 simplified : !XF("(gu0.Dressed<=gu0.Entered)" U XG("(gu0.Dressed>gu0.InBath)" & !GXX"(gu0.Dressed<=gu0.Entered)"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
31 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,68.0579,1072124,1,0,1596,6.14924e+06,104,823,783,6.87334e+06,4080
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA SwimmingPool-PT-02-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(X((("(gu1.Undress<=gu1.Cabins)")U((X(G("(gu0.Out>=3)")))U(F(!(G("(gu1.Undress<=gu1.Cabins)"))))))U("(gu1.Undress<=gu1.Cabins)")))))
Formula 8 simplified : !GX(("(gu1.Undress<=gu1.Cabins)" U (XG"(gu0.Out>=3)" U F!G"(gu1.Undress<=gu1.Cabins)")) U "(gu1.Undress<=gu1.Cabins)")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
237 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,70.423,1121812,1,0,1678,6.44359e+06,113,824,825,7.19376e+06,4295
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA SwimmingPool-PT-02-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(F(G("(gu2.Bags<=gu2.Dress)")))))
Formula 9 simplified : !XFG"(gu2.Bags<=gu2.Dress)"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1834 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,88.7718,1388356,1,0,2410,7.77314e+06,126,1114,886,8.98071e+06,5925
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA SwimmingPool-PT-02-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((!(G(!(X(!(F("(gu0.InBath>=2)"))))))))
Formula 10 simplified : G!X!F"(gu0.InBath>=2)"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
669 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,95.4668,1506980,1,0,2900,8.42522e+06,139,1395,888,9.79978e+06,7151
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA SwimmingPool-PT-02-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1590498162073

--------------------
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 -timeout 3600
+ 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 -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="SwimmingPool-PT-02"
export BK_EXAMINATION="LTLCardinality"
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-4028"
echo " Executing tool itstools"
echo " Input is SwimmingPool-PT-02, 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 r193-csrt-159033388500249"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SwimmingPool-PT-02.tgz
mv SwimmingPool-PT-02 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; 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
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;