fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r193-csrt-159033388900538
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for TriangularGrid-PT-1500

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15747.290 53162.00 68646.00 212.60 FFFFFFFTFFFTFFFF normal

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-159033388900538.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 TriangularGrid-PT-1500, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193-csrt-159033388900538
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 3.8K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 27 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 27 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 27 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 14:36 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 14:36 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 27 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 27 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 27 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 27 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 27 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 27 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 equiv_col
-rw-r--r-- 1 mcc users 5 Apr 27 14:36 instance
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 iscolored
-rwxr-xr-x 1 mcc users 9.7K Apr 27 14:36 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 TriangularGrid-PT-1500-00
FORMULA_NAME TriangularGrid-PT-1500-01
FORMULA_NAME TriangularGrid-PT-1500-02
FORMULA_NAME TriangularGrid-PT-1500-03
FORMULA_NAME TriangularGrid-PT-1500-04
FORMULA_NAME TriangularGrid-PT-1500-05
FORMULA_NAME TriangularGrid-PT-1500-06
FORMULA_NAME TriangularGrid-PT-1500-07
FORMULA_NAME TriangularGrid-PT-1500-08
FORMULA_NAME TriangularGrid-PT-1500-09
FORMULA_NAME TriangularGrid-PT-1500-10
FORMULA_NAME TriangularGrid-PT-1500-11
FORMULA_NAME TriangularGrid-PT-1500-12
FORMULA_NAME TriangularGrid-PT-1500-13
FORMULA_NAME TriangularGrid-PT-1500-14
FORMULA_NAME TriangularGrid-PT-1500-15

=== Now, execution of the tool begins

BK_START 1590534565758

[2020-05-26 23:09:28] [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-26 23:09:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-26 23:09:28] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2020-05-26 23:09:28] [INFO ] Transformed 16 places.
[2020-05-26 23:09:28] [INFO ] Transformed 12 transitions.
[2020-05-26 23:09:28] [INFO ] Parsed PT model containing 16 places and 12 transitions in 85 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 36 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 6691 steps, including 0 resets, run visited all 30 properties in 51 ms. (steps per millisecond=131 )
[2020-05-26 23:09:28] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-05-26 23:09:28] [INFO ] Flatten gal took : 37 ms
FORMULA TriangularGrid-PT-1500-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-1500-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-1500-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-1500-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-1500-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-1500-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-1500-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-26 23:09:28] [INFO ] Flatten gal took : 6 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-26 23:09:28] [INFO ] Applying decomposition
[2020-05-26 23:09:28] [INFO ] Flatten gal took : 5 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/graph8192701219353723228.txt, -o, /tmp/graph8192701219353723228.bin, -w, /tmp/graph8192701219353723228.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/graph8192701219353723228.bin, -l, -1, -v, -w, /tmp/graph8192701219353723228.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-26 23:09:28] [INFO ] Input system was already deterministic with 12 transitions.
[2020-05-26 23:09:28] [INFO ] Decomposing Gal with order
[2020-05-26 23:09:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-26 23:09:29] [INFO ] Removed a total of 6 redundant transitions.
[2020-05-26 23:09:29] [INFO ] Flatten gal took : 96 ms
[2020-05-26 23:09:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 18 ms.
[2020-05-26 23:09:29] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
[2020-05-26 23:09:29] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 12 rows 16 cols
[2020-05-26 23:09:29] [INFO ] Computed 8 place invariants in 4 ms
inv : po3_1_1 + pol3_1_1 = 1
inv : pi1_1_1 + pil1_1_1 = 1
inv : pi3_1_1 + pil3_1_1 = 1
inv : pbl_1_1 + pil1_1_1 + pil2_1_1 + pil3_1_1 + pol1_1_1 + pol2_1_1 + pol3_1_1 = 6
inv : po2_1_1 + pol2_1_1 = 1
inv : po1_1_1 + pol1_1_1 = 1
inv : pi2_1_1 + pil2_1_1 = 1
inv : pb1_1_1 + pb2_1_1 + pb3_1_1 - pil1_1_1 - pil2_1_1 - pil3_1_1 - pol1_1_1 - pol2_1_1 - pol3_1_1 = 144
Total of 8 invariants.
[2020-05-26 23:09:29] [INFO ] Computed 8 place invariants in 8 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 9 LTL properties
Checking formula 0 : !((G(X(G((((G("((u0.pbl_1_1<1)||(i1.u3.pi2_1_1<1))"))||(F(!(("((u0.pbl_1_1>=1)&&(i1.u3.pi2_1_1>=1))")U("((u0.pbl_1_1>=1)&&(i3.u1.pi3_1_1>=1))")))))||("(u0.pbl_1_1<1)"))||("(i1.u3.pi2_1_1<1)"))))))
Formula 0 simplified : !GXG("(i1.u3.pi2_1_1<1)" | "(u0.pbl_1_1<1)" | G"((u0.pbl_1_1<1)||(i1.u3.pi2_1_1<1))" | F!("((u0.pbl_1_1>=1)&&(i1.u3.pi2_1_1>=1))" U "((u0.pbl_1_1>=1)&&(i3.u1.pi3_1_1>=1))"))
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
[2020-05-26 23:09:29] [INFO ] Proved 16 variables to be positive in 116 ms
[2020-05-26 23:09:29] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2020-05-26 23:09:29] [INFO ] Computation of disable matrix completed :0/12 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 23:09:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 23:09:29] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2020-05-26 23:09:29] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
[2020-05-26 23:09:32] [INFO ] Computing symmetric co enabling matrix : 12 transitions.
[2020-05-26 23:09:32] [INFO ] Computation of co-enabling matrix(1/12) took 326 ms. Total solver calls (SAT/UNSAT): 21(15/6)
[2020-05-26 23:09:33] [INFO ] Computation of Finished co-enabling matrix. took 1125 ms. Total solver calls (SAT/UNSAT): 66(57/9)
[2020-05-26 23:09:33] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2020-05-26 23:09:33] [INFO ] Computation of Completed DNA matrix. took 298 ms. Total solver calls (SAT/UNSAT): 21(0/21)
[2020-05-26 23:09:33] [INFO ] Built C files in 4501ms 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 523 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 61 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, [](X([](( ( ( []((LTLAP0==true))) || ( <>(!( ((LTLAP1==true))U((LTLAP2==true))) )) ) || ( (LTLAP3==true)) ) || ( (LTLAP4==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))) || ( <>(!( ((LTLAP1==true))U((LTLAP2==true))) )) ) || ( (LTLAP3==true)) ) || ( (LTLAP4==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))) || ( <>(!( ((LTLAP1==true))U((LTLAP2==true))) )) ) || ( (LTLAP3==true)) ) || ( (LTLAP4==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)
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
486 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.89084,78532,1,0,19732,159867,242,26390,562,512875,15160
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA TriangularGrid-PT-1500-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((!((F(G(X("((u0.pb2_1_1>=1)&&(i1.u5.pol2_1_1>=1))"))))U(((G("(((i3.u1.pil3_1_1>=1)&&(i3.u6.po3_1_1>=1))||((u0.pb2_1_1>=1)&&(i1.u5.pol2_1_1>=1)))"))&&("(i1.u3.pil2_1_1>=1)"))&&("(i1.u5.po2_1_1>=1)")))))
Formula 1 simplified : FGX"((u0.pb2_1_1>=1)&&(i1.u5.pol2_1_1>=1))" U ("(i1.u3.pil2_1_1>=1)" & "(i1.u5.po2_1_1>=1)" & G"(((i3.u1.pil3_1_1>=1)&&(i3.u6.po3_1_1>=1))||((u0.pb2_1_1>=1)&&(i1.u5.pol2_1_1>=1)))")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
9 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.98427,80684,1,0,20428,162063,317,27472,563,521702,16516
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA TriangularGrid-PT-1500-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(G(("((u0.pbl_1_1<1)||(i2.u2.pi1_1_1<1))")U(("((u0.pbl_1_1>=1)&&(i2.u2.pi1_1_1>=1))")U("((u0.pbl_1_1>=1)&&(i2.u2.pi1_1_1>=1))"))))))
Formula 2 simplified : !XG("((u0.pbl_1_1<1)||(i2.u2.pi1_1_1<1))" U "((u0.pbl_1_1>=1)&&(i2.u2.pi1_1_1>=1))")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1270 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.6982,261064,1,0,115082,451990,356,187791,563,2.02777e+06,109006
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA TriangularGrid-PT-1500-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(X((!(X((X("((i3.u1.pil3_1_1>=1)&&(i3.u6.po3_1_1>=1))"))||(X("((u0.pb1_1_1>=1)&&(i2.u4.pol1_1_1>=1))")))))U(X("((u0.pbl_1_1<1)||(i3.u1.pi3_1_1<1))"))))))
Formula 3 simplified : X(!X(X"((i3.u1.pil3_1_1>=1)&&(i3.u6.po3_1_1>=1))" | X"((u0.pb1_1_1>=1)&&(i2.u4.pol1_1_1>=1))") U X"((u0.pbl_1_1<1)||(i3.u1.pi3_1_1<1))")
158 unique states visited
157 strongly connected components in search stack
158 transitions explored
157 items max in DFS search stack
230 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,19.9993,302764,1,0,148276,496703,397,232400,563,2.35373e+06,156042
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA TriangularGrid-PT-1500-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(!(F((X("((u0.pbl_1_1>=1)&&(i3.u1.pi3_1_1>=1))"))U("((u0.pb3_1_1>=1)&&(i3.u6.pol3_1_1>=1))"))))))
Formula 4 simplified : !X!F(X"((u0.pbl_1_1>=1)&&(i3.u1.pi3_1_1>=1))" U "((u0.pb3_1_1>=1)&&(i3.u6.pol3_1_1>=1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
422 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,24.2208,378552,1,0,167654,639760,417,269172,563,3.28294e+06,174723
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA TriangularGrid-PT-1500-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((F("((u0.pbl_1_1<1)||(i3.u1.pi3_1_1<1))"))U(F("((u0.pbl_1_1>=1)&&(i3.u1.pi3_1_1>=1))"))))
Formula 5 simplified : !(F"((u0.pbl_1_1<1)||(i3.u1.pi3_1_1<1))" U F"((u0.pbl_1_1>=1)&&(i3.u1.pi3_1_1>=1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
269 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,26.9054,410164,1,0,184516,666228,428,298761,563,3.57555e+06,194182
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA TriangularGrid-PT-1500-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(((F((F(G((G("((u0.pbl_1_1>=1)&&(i1.u3.pi2_1_1>=1))"))U("((u0.pb2_1_1>=1)&&(i1.u5.pol2_1_1>=1))"))))U(((X("((u0.pb2_1_1>=1)&&(i1.u5.pol2_1_1>=1))"))&&("(u0.pbl_1_1>=1)"))&&("(i1.u3.pi2_1_1>=1)"))))&&("(u0.pbl_1_1>=1)"))&&("(i1.u3.pi2_1_1>=1)"))))
Formula 6 simplified : !F("(i1.u3.pi2_1_1>=1)" & "(u0.pbl_1_1>=1)" & F(FG(G"((u0.pbl_1_1>=1)&&(i1.u3.pi2_1_1>=1))" U "((u0.pb2_1_1>=1)&&(i1.u5.pol2_1_1>=1))") U ("(i1.u3.pi2_1_1>=1)" & "(u0.pbl_1_1>=1)" & X"((u0.pb2_1_1>=1)&&(i1.u5.pol2_1_1>=1))")))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,29.7547,459748,1,0,225828,743412,465,356727,563,3.8725e+06,240496
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA TriangularGrid-PT-1500-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(G((F(((F(G("((u0.pb1_1_1>=1)&&(i2.u4.pol1_1_1>=1))")))&&("(i2.u2.pil1_1_1>=1)"))&&("(i2.u4.po1_1_1>=1)")))&&((G("((i3.u1.pil3_1_1>=1)&&(i3.u6.po3_1_1>=1))"))U("((u0.pb1_1_1>=1)&&(i2.u4.pol1_1_1>=1))"))))))
Formula 7 simplified : !FG(F("(i2.u2.pil1_1_1>=1)" & "(i2.u4.po1_1_1>=1)" & FG"((u0.pb1_1_1>=1)&&(i2.u4.pol1_1_1>=1))") & (G"((i3.u1.pil3_1_1>=1)&&(i3.u6.po3_1_1>=1))" U "((u0.pb1_1_1>=1)&&(i2.u4.pol1_1_1>=1))"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1358 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,43.3264,662644,1,0,295679,1.09141e+06,527,456168,565,5.95084e+06,316809
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA TriangularGrid-PT-1500-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((("((i2.u2.pil1_1_1>=1)&&(i2.u4.po1_1_1>=1))")U(X("((i2.u2.pil1_1_1<1)||(i2.u4.po1_1_1<1))")))&&(X(X(!(G((F("((u0.pbl_1_1<1)||(i1.u3.pi2_1_1<1))"))||("((i2.u2.pil1_1_1>=1)&&(i2.u4.po1_1_1>=1))"))))))))
Formula 8 simplified : !(("((i2.u2.pil1_1_1>=1)&&(i2.u4.po1_1_1>=1))" U X"((i2.u2.pil1_1_1<1)||(i2.u4.po1_1_1<1))") & XX!G("((i2.u2.pil1_1_1>=1)&&(i2.u4.po1_1_1>=1))" | F"((u0.pbl_1_1<1)||(i1.u3.pi2_1_1<1))"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,43.3484,663168,1,0,296161,1.09158e+06,536,456823,565,5.95206e+06,317353
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA TriangularGrid-PT-1500-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1590534618920

--------------------
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="TriangularGrid-PT-1500"
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 TriangularGrid-PT-1500, 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 r193-csrt-159033388900538"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/TriangularGrid-PT-1500.tgz
mv TriangularGrid-PT-1500 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;