Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r036-smll-158901930600121.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ClientsAndServers-PT-N0002P1, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r036-smll-158901930600121
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.6K Mar 30 01:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 30 01:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 15:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 08:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 08:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 26 07:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 26 07:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 9.2K Mar 24 05:37 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 ClientsAndServers-PT-N0002P1-00
FORMULA_NAME ClientsAndServers-PT-N0002P1-01
FORMULA_NAME ClientsAndServers-PT-N0002P1-02
FORMULA_NAME ClientsAndServers-PT-N0002P1-03
FORMULA_NAME ClientsAndServers-PT-N0002P1-04
FORMULA_NAME ClientsAndServers-PT-N0002P1-05
FORMULA_NAME ClientsAndServers-PT-N0002P1-06
FORMULA_NAME ClientsAndServers-PT-N0002P1-07
FORMULA_NAME ClientsAndServers-PT-N0002P1-08
FORMULA_NAME ClientsAndServers-PT-N0002P1-09
FORMULA_NAME ClientsAndServers-PT-N0002P1-10
FORMULA_NAME ClientsAndServers-PT-N0002P1-11
FORMULA_NAME ClientsAndServers-PT-N0002P1-12
FORMULA_NAME ClientsAndServers-PT-N0002P1-13
FORMULA_NAME ClientsAndServers-PT-N0002P1-14
FORMULA_NAME ClientsAndServers-PT-N0002P1-15

=== Now, execution of the tool begins

BK_START 1589698787390

[2020-05-17 06:59: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-17 06:59:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-17 06:59:50] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2020-05-17 06:59:50] [INFO ] Transformed 25 places.
[2020-05-17 06:59:50] [INFO ] Transformed 18 transitions.
[2020-05-17 06:59:50] [INFO ] Parsed PT model containing 25 places and 18 transitions in 129 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 34 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100002 steps, including 0 resets, run finished after 351 ms. (steps per millisecond=284 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1]
// Phase 1: matrix 18 rows 25 cols
[2020-05-17 06:59:50] [INFO ] Computed 8 place invariants in 7 ms
[2020-05-17 06:59:50] [INFO ] [Real]Absence check using 5 positive place invariants in 23 ms returned unsat
[2020-05-17 06:59:50] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned unsat
[2020-05-17 06:59:50] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned unsat
[2020-05-17 06:59:50] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2020-05-17 06:59:50] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 3 ms returned unsat
[2020-05-17 06:59:50] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned unsat
[2020-05-17 06:59:50] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 8 simplifications.
[2020-05-17 06:59:51] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-17 06:59:51] [INFO ] Flatten gal took : 53 ms
FORMULA ClientsAndServers-PT-N0002P1-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0002P1-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0002P1-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0002P1-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0002P1-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-17 06:59:51] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-17 06:59:51] [INFO ] Applying decomposition
[2020-05-17 06:59:51] [INFO ] Flatten gal took : 10 ms
[2020-05-17 06:59:51] [INFO ] Input system was already deterministic with 18 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 18 rows 25 cols
[2020-05-17 06:59:51] [INFO ] Computed 8 place invariants in 2 ms
inv : CG + CR + StR + SwG + SpG - CwG = 0
inv : SR + SG + MpG + MwU - SwG = 0
inv : StF + Si + StR + SwG + SpG + SwA + SpA = 4
inv : SA + SF + MpA + MtF - SwA = 0
inv : CA + CF + StF + SwA + SpA + Cb + CwG + Ci = 16
inv : MpA + MtF + MpG + MwU + Mi = 3
inv : CwA + Cb + CwG + Ci = 16
inv : Uf + SF + CF + StF + CG + MtF + SG + MpG + SpG + Cb = 16
Total of 8 invariants.
[2020-05-17 06:59:51] [INFO ] Computed 8 place invariants in 3 ms
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/graph1583684909774114637.txt, -o, /tmp/graph1583684909774114637.bin, -w, /tmp/graph1583684909774114637.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph1583684909774114637.bin, -l, -1, -v, -w, /tmp/graph1583684909774114637.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-17 06:59:51] [INFO ] Decomposing Gal with order
[2020-05-17 06:59:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-17 06:59:51] [INFO ] Removed a total of 3 redundant transitions.
[2020-05-17 06:59:51] [INFO ] Proved 25 variables to be positive in 120 ms
[2020-05-17 06:59:51] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2020-05-17 06:59:51] [INFO ] Computation of disable matrix completed :0/18 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-17 06:59:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-17 06:59:51] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2020-05-17 06:59:51] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-17 06:59:51] [INFO ] Flatten gal took : 58 ms
[2020-05-17 06:59:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-17 06:59:51] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 5 ms
[2020-05-17 06:59:51] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 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]

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(X("(gi4.gu4.StR>=3)"))))))
Formula 0 simplified : !FGXX"(gi4.gu4.StR>=3)"
[2020-05-17 06:59:52] [INFO ] Computing symmetric co enabling matrix : 18 transitions.
[2020-05-17 06:59:53] [INFO ] Computation of Finished co-enabling matrix. took 580 ms. Total solver calls (SAT/UNSAT): 99(99/0)
[2020-05-17 06:59:53] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2020-05-17 06:59:53] [INFO ] Computation of Completed DNA matrix. took 248 ms. Total solver calls (SAT/UNSAT): 33(0/33)
[2020-05-17 06:59:53] [INFO ] Built C files in 2250ms 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 584 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 46 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, <>([](X(X((LTLAP0==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(X((LTLAP0==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(X((LTLAP0==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.
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
409 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,4.10869,69480,1,0,7,283566,20,1,750,285339,19
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0002P1-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(!((G("(gu0.CA<=gu1.Ci)"))U(((X(G("(gi2.gu8.MpA>=3)")))U("(gu3.SG>=2)"))&&(G("(gi4.gu7.SA<=gi5.gu6.SpG)")))))))
Formula 1 simplified : !X!(G"(gu0.CA<=gu1.Ci)" U ((XG"(gi2.gu8.MpA>=3)" U "(gu3.SG>=2)") & G"(gi4.gu7.SA<=gi5.gu6.SpG)"))
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
1591 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,20.0142,434176,1,0,503,2.52578e+06,54,209,789,2.83336e+06,1256
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0002P1-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(!(G(F((((F("(gu0.SR<=gu0.CA)"))U(G(F("(gu0.SR>=3)"))))U("(gu0.SR<=gu0.CA)"))||("(gi2.gu2.CwA>=2)")))))))
Formula 2 simplified : !G!GF("(gi2.gu2.CwA>=2)" | ((F"(gu0.SR<=gu0.CA)" U GF"(gu0.SR>=3)") U "(gu0.SR<=gu0.CA)"))
22 unique states visited
2 strongly connected components in search stack
23 transitions explored
22 items max in DFS search stack
61 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,20.6276,447728,1,0,585,2.60141e+06,67,228,806,2.92092e+06,1531
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0002P1-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(G(("((gi4.gu4.CR>=1)&&(gi5.gu6.SpG>=3))")U(X("((gi5.gu5.SwG>gi5.gu5.MtF)||((gi5.gu6.SpG<=gu1.StF)&&(gu3.CF>=2)))"))))))
Formula 3 simplified : !FG("((gi4.gu4.CR>=1)&&(gi5.gu6.SpG>=3))" U X"((gi5.gu5.SwG>gi5.gu5.MtF)||((gi5.gu6.SpG<=gu1.StF)&&(gu3.CF>=2)))")
2 unique states visited
1 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
48 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,21.1118,458284,1,0,597,2.65537e+06,84,231,843,2.99453e+06,1566
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0002P1-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((G("(gi4.gu4.CR>=2)"))U(X(G("(gi5.gu6.SpG>gi5.gu6.MwU)")))))
Formula 4 simplified : !(G"(gi4.gu4.CR>=2)" U XG"(gi5.gu6.SpG>gi5.gu6.MwU)")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
3027 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,51.3801,1054644,1,0,1368,6.26711e+06,107,493,860,7.08483e+06,2889
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0002P1-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F((F((X("(gu3.CF<=gu3.MpG)"))||("(gi5.gu5.MtF>=1)")))&&("((gi4.gu4.StR<=gi4.gu4.SpA)||(gu3.CF<=gu3.MpG))"))))
Formula 5 simplified : !F("((gi4.gu4.StR<=gi4.gu4.SpA)||(gu3.CF<=gu3.MpG))" & F("(gi5.gu5.MtF>=1)" | X"(gu3.CF<=gu3.MpG)"))
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,51.3818,1054908,1,0,1368,6.26711e+06,126,493,875,7.08484e+06,2897
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA ClientsAndServers-PT-N0002P1-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((!(G("(gu3.CF<3)")))&&(F("(gu3.CF>=3)"))))
Formula 6 simplified : !(!G"(gu3.CF<3)" & F"(gu3.CF>=3)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1871 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.0894,1431380,1,0,1855,8.59587e+06,138,738,881,9.66379e+06,4218
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0002P1-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X((F("((((gi2.gu8.MpA<=gi2.gu8.CwG)&&(gi4.gu4.SwA>=0))||(gi4.gu7.Si<=gi4.gu4.SpA))||(gu1.Ci<=gu1.StF))"))&&(G("(gu1.Ci>gu1.StF)")))))
Formula 7 simplified : !X(F"((((gi2.gu8.MpA<=gi2.gu8.CwG)&&(gi4.gu4.SwA>=0))||(gi4.gu7.Si<=gi4.gu4.SpA))||(gu1.Ci<=gu1.StF))" & G"(gu1.Ci>gu1.StF)")
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
2233 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,92.4207,1871172,1,0,2314,1.11373e+07,152,962,916,1.2692e+07,5428
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0002P1-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(!(F(X(F(G(("(gi5.gu6.SpG<=gi5.gu5.MtF)")U("(gi4.gu7.Si<=gi4.gu7.SA)")))))))))
Formula 8 simplified : !X!FXFG("(gi5.gu6.SpG<=gi5.gu5.MtF)" U "(gi4.gu7.Si<=gi4.gu7.SA)")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
142 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,93.8531,1900936,1,0,2381,1.13111e+07,169,1007,938,1.29443e+07,5594
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0002P1-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G(F(((!(X(X("(gi2.gu8.MpA<2)"))))&&("(gu3.SG>=1)"))&&("(gi2.gu8.MpA>=2)")))))
Formula 9 simplified : !GF("(gi2.gu8.MpA>=2)" & "(gu3.SG>=1)" & !XX"(gi2.gu8.MpA<2)")
2 unique states visited
2 strongly connected components in search stack
3 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,93.8653,1901460,1,0,2387,1.1312e+07,182,1007,946,1.2946e+07,5612
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0002P1-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((!(F("(gu1.Uf<=gu1.StF)"))))
Formula 10 simplified : F"(gu1.Uf<=gu1.StF)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1349 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,107.352,2082548,1,0,2796,1.22373e+07,188,1250,977,1.3995e+07,6941
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0002P1-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1589698921956

--------------------
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="ClientsAndServers-PT-N0002P1"
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 ClientsAndServers-PT-N0002P1, 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 r036-smll-158901930600121"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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