About the Execution of ITS-Tools for ClientsAndServers-PT-N0001P0
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15743.110 | 16921.00 | 27516.00 | 439.70 | FFFFFFTFFFFTFTFF | normal |
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-158901930600106.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-N0001P0, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r036-smll-158901930600106
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 2.9K Mar 30 01:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 30 01:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 28 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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.7K Mar 27 08:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 08:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 26 07:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Mar 26 07:37 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-N0001P0-00
FORMULA_NAME ClientsAndServers-PT-N0001P0-01
FORMULA_NAME ClientsAndServers-PT-N0001P0-02
FORMULA_NAME ClientsAndServers-PT-N0001P0-03
FORMULA_NAME ClientsAndServers-PT-N0001P0-04
FORMULA_NAME ClientsAndServers-PT-N0001P0-05
FORMULA_NAME ClientsAndServers-PT-N0001P0-06
FORMULA_NAME ClientsAndServers-PT-N0001P0-07
FORMULA_NAME ClientsAndServers-PT-N0001P0-08
FORMULA_NAME ClientsAndServers-PT-N0001P0-09
FORMULA_NAME ClientsAndServers-PT-N0001P0-10
FORMULA_NAME ClientsAndServers-PT-N0001P0-11
FORMULA_NAME ClientsAndServers-PT-N0001P0-12
FORMULA_NAME ClientsAndServers-PT-N0001P0-13
FORMULA_NAME ClientsAndServers-PT-N0001P0-14
FORMULA_NAME ClientsAndServers-PT-N0001P0-15
=== Now, execution of the tool begins
BK_START 1589696780375
[2020-05-17 06:26:22] [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/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-17 06:26:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-17 06:26:23] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2020-05-17 06:26:23] [INFO ] Transformed 25 places.
[2020-05-17 06:26:23] [INFO ] Transformed 18 transitions.
[2020-05-17 06:26:23] [INFO ] Parsed PT model containing 25 places and 18 transitions in 119 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 616 resets, run finished after 252 ms. (steps per millisecond=396 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1]
// Phase 1: matrix 18 rows 25 cols
[2020-05-17 06:26:23] [INFO ] Computed 8 place invariants in 9 ms
[2020-05-17 06:26:23] [INFO ] [Real]Absence check using 5 positive place invariants in 25 ms returned sat
[2020-05-17 06:26:23] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 3 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-17 06:26:23] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-17 06:26:23] [INFO ] Flatten gal took : 54 ms
FORMULA ClientsAndServers-PT-N0001P0-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0001P0-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0001P0-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0001P0-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0001P0-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-17 06:26:24] [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:26:24] [INFO ] Applying decomposition
[2020-05-17 06:26:24] [INFO ] Flatten gal took : 9 ms
[2020-05-17 06:26:24] [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:26:24] [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 = 2
inv : SA + SF + MpA + MtF - SwA = 0
inv : CA + CF + StF + SwA + SpA + Cb + CwG + Ci = 8
inv : MpA + MtF + MpG + MwU + Mi = 3
inv : CwA + Cb + CwG + Ci = 8
inv : Uf + SF + CF + StF + CG + MtF + SG + MpG + SpG + Cb = 4
Total of 8 invariants.
[2020-05-17 06:26:24] [INFO ] Computed 8 place invariants in 4 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/graph13706712963227786472.txt, -o, /tmp/graph13706712963227786472.bin, -w, /tmp/graph13706712963227786472.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/graph13706712963227786472.bin, -l, -1, -v, -w, /tmp/graph13706712963227786472.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-17 06:26:24] [INFO ] Proved 25 variables to be positive in 86 ms
[2020-05-17 06:26:24] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2020-05-17 06:26:24] [INFO ] Computation of disable matrix completed :0/18 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-17 06:26:24] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-17 06:26:24] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2020-05-17 06:26:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-17 06:26:24] [INFO ] Decomposing Gal with order
[2020-05-17 06:26:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-17 06:26:24] [INFO ] Flatten gal took : 50 ms
[2020-05-17 06:26:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-17 06:26:24] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
[2020-05-17 06:26:24] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 3 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/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.202005100927/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 11 LTL properties
Checking formula 0 : !(((X("(i1.u2.MpA>=1)"))U((!(F(X("((u6.CR>=1)&&(u4.Si>=1))"))))&&(G("(i1.u2.MpA>=1)")))))
Formula 0 simplified : !(X"(i1.u2.MpA>=1)" U (!FX"((u6.CR>=1)&&(u4.Si>=1))" & G"(i1.u2.MpA>=1)"))
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
[2020-05-17 06:26:25] [INFO ] Computing symmetric co enabling matrix : 18 transitions.
Reverse transition relation is NOT exact ! Due to transitions ssA, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/17/1/18
Computing Next relation with stutter on 1 deadlock states
[2020-05-17 06:26:25] [INFO ] Computation of Finished co-enabling matrix. took 452 ms. Total solver calls (SAT/UNSAT): 99(99/0)
[2020-05-17 06:26:25] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2020-05-17 06:26:25] [INFO ] Computation of Completed DNA matrix. took 181 ms. Total solver calls (SAT/UNSAT): 33(0/33)
[2020-05-17 06:26:25] [INFO ] Built C files in 1709ms 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 541 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 49 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, (X((LTLAP0==true)))U(( !( <>(X((LTLAP1==true)))) ) && ( []((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((LTLAP0==true)))U(( !( <>(X((LTLAP1==true)))) ) && ( []((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((LTLAP0==true)))U(( !( <>(X((LTLAP1==true)))) ) && ( []((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)
53 unique states visited
53 strongly connected components in search stack
53 transitions explored
53 items max in DFS search stack
284 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,2.86838,68980,1,0,59177,16984,423,247327,228,274134,77821
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0001P0-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(!(F("((u1.CF>=1)&&(u4.Si>=1))")))))
Formula 1 simplified : !G!F"((u1.CF>=1)&&(u4.Si>=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
19 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.05316,72412,1,0,63905,17052,475,253828,228,276322,94252
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0001P0-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((!(F(!(G("(u6.Ci>=1)")))))&&((X((X("(u4.StR>=1)"))||(G("(i1.u0.MpG>=1)"))))||(G("(i1.u0.MpG>=1)")))))
Formula 2 simplified : !(!F!G"(u6.Ci>=1)" & (G"(i1.u0.MpG>=1)" | X(X"(u4.StR>=1)" | G"(i1.u0.MpG>=1)")))
Computing Next relation with stutter on 1 deadlock states
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
52 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,3.57728,81848,1,0,66922,17181,515,316427,230,337743,98752
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0001P0-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(X(F(((G("(i1.u2.MtF>=1)"))U(X("(u1.StF<1)")))||("(u6.Ci>=1)"))))))
Formula 3 simplified : !FXF("(u6.Ci>=1)" | (G"(i1.u2.MtF>=1)" U X"(u1.StF<1)"))
Computing Next relation with stutter on 1 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,3.57795,81848,1,0,66922,17181,515,316427,230,337743,98752
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA ClientsAndServers-PT-N0001P0-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((G(X(F(X(G(("(i1.u0.MpG>=1)")U(!(X(("(u6.Ci>=1)")U(X("(i1.u0.MpG>=1)")))))))))))U("((u6.CR>=1)&&(u4.Si>=1))")))
Formula 4 simplified : !(GXFXG("(i1.u0.MpG>=1)" U !X("(u6.Ci>=1)" U X"(i1.u0.MpG>=1)")) U "((u6.CR>=1)&&(u4.Si>=1))")
Computing Next relation with stutter on 1 deadlock states
22 unique states visited
5 strongly connected components in search stack
41 transitions explored
21 items max in DFS search stack
227 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,5.84834,102584,1,0,94887,17262,554,376276,230,379940,132880
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0001P0-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X((X((X(F("((i1.u3.SR>=1)&&(i1.u2.Mi>=1))")))&&("(i1.u3.SR>=1)")))&&(!(F("(u5.SpA>=1)"))))))
Formula 5 simplified : !X(X("(i1.u3.SR>=1)" & XF"((i1.u3.SR>=1)&&(i1.u2.Mi>=1))") & !F"(u5.SpA>=1)")
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.85098,102844,1,0,94903,17262,568,376296,230,379945,132951
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0001P0-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((!(X(!(G((F("(i1.u2.MpA>=1)"))&&("(i1.u2.MpA>=1)"))))))||(!(X(!(F("((i1.u0.SG>=1)&&(u4.SwG>=1))")))))))
Formula 6 simplified : !(!X!G("(i1.u2.MpA>=1)" & F"(i1.u2.MpA>=1)") | !X!F"((i1.u0.SG>=1)&&(u4.SwG>=1))")
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 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,5.85704,102844,1,0,95394,17262,606,376626,230,379952,134019
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA ClientsAndServers-PT-N0001P0-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((("(u1.StF>=1)")U(F("(u1.StF>=1)"))))
Formula 7 simplified : !("(u1.StF>=1)" U F"(u1.StF>=1)")
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
30 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,6.16083,106012,1,0,100219,17262,627,378200,230,380258,141687
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0001P0-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((!(X(G("((((((((u1.CF>=1)&&(u4.Si>=1))&&(u4.CG>=1))&&(u6.CwG>=1))||(u1.CF<1))||(u4.Si<1))||((u1.CF>=1)&&(u4.Si>=1)))&&(u4.StR<1))")))))
Formula 8 simplified : XG"((((((((u1.CF>=1)&&(u4.Si>=1))&&(u4.CG>=1))&&(u6.CwG>=1))||(u1.CF<1))||(u4.Si<1))||((u1.CF>=1)&&(u4.Si>=1)))&&(u4.StR<1))"
Computing Next relation with stutter on 1 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,6.16384,106276,1,0,100263,17270,666,378300,233,380338,142110
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA ClientsAndServers-PT-N0001P0-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(!(X(G(X(("((u6.CR>=1)&&(u4.Si>=1))")U(X(F(!(X("(u6.Cb>=1)"))))))))))))
Formula 9 simplified : !F!XGX("((u6.CR>=1)&&(u4.Si>=1))" U XF!X"(u6.Cb>=1)")
Computing Next relation with stutter on 1 deadlock states
20 unique states visited
4 strongly connected components in search stack
22 transitions explored
20 items max in DFS search stack
351 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,9.67359,134788,1,0,130403,17313,695,460912,235,442680,183816
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0001P0-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G(F(G((G("((u1.CF<1)||(u4.Si<1))"))U((!(F("((i1.u0.Uf>=1)&&(i1.u3.MwU>=1))")))&&(F("(u6.Cb>=1)"))))))))
Formula 10 simplified : !GFG(G"((u1.CF<1)||(u4.Si<1))" U (!F"((i1.u0.Uf>=1)&&(i1.u3.MwU>=1))" & F"(u6.Cb>=1)"))
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
119 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,10.8724,155896,1,0,163894,17421,730,484244,235,443644,246145
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0001P0-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
BK_STOP 1589696797296
--------------------
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/ -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 LTLFireability -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-N0001P0"
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-4028"
echo " Executing tool itstools"
echo " Input is ClientsAndServers-PT-N0001P0, 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 r036-smll-158901930600106"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0001P0.tgz
mv ClientsAndServers-PT-N0001P0 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;