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.r141-smll-158961510800242.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 Raft-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r141-smll-158961510800242
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 3.6K Apr 12 08:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 12 08:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 11 09:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 11 09:01 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.5K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 10 14:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 10 14:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 9 21:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 9 21:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 10 22:28 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 62K 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 Raft-PT-05-00
FORMULA_NAME Raft-PT-05-01
FORMULA_NAME Raft-PT-05-02
FORMULA_NAME Raft-PT-05-03
FORMULA_NAME Raft-PT-05-04
FORMULA_NAME Raft-PT-05-05
FORMULA_NAME Raft-PT-05-06
FORMULA_NAME Raft-PT-05-07
FORMULA_NAME Raft-PT-05-08
FORMULA_NAME Raft-PT-05-09
FORMULA_NAME Raft-PT-05-10
FORMULA_NAME Raft-PT-05-11
FORMULA_NAME Raft-PT-05-12
FORMULA_NAME Raft-PT-05-13
FORMULA_NAME Raft-PT-05-14
FORMULA_NAME Raft-PT-05-15

=== Now, execution of the tool begins

BK_START 1590053887962

[2020-05-21 09:38:11] [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-21 09:38:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 09:38:11] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2020-05-21 09:38:11] [INFO ] Transformed 133 places.
[2020-05-21 09:38:11] [INFO ] Transformed 238 transitions.
[2020-05-21 09:38:11] [INFO ] Found NUPN structural information;
[2020-05-21 09:38:11] [INFO ] Parsed PT model containing 133 places and 238 transitions in 174 ms.
Ensure Unique test removed 22 transitions
Reduce redundant transitions removed 22 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 531 ms. (steps per millisecond=188 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-05-21 09:38:11] [INFO ] Flow matrix only has 195 transitions (discarded 21 similar events)
// Phase 1: matrix 195 rows 133 cols
[2020-05-21 09:38:11] [INFO ] Computed 25 place invariants in 24 ms
[2020-05-21 09:38:12] [INFO ] [Real]Absence check using 25 positive place invariants in 39 ms returned sat
[2020-05-21 09:38:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 09:38:12] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2020-05-21 09:38:12] [INFO ] State equation strengthened by 104 read => feed constraints.
[2020-05-21 09:38:12] [INFO ] [Real]Added 104 Read/Feed constraints in 19 ms returned sat
[2020-05-21 09:38:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 09:38:12] [INFO ] [Nat]Absence check using 25 positive place invariants in 28 ms returned sat
[2020-05-21 09:38:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 09:38:12] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2020-05-21 09:38:12] [INFO ] [Nat]Added 104 Read/Feed constraints in 27 ms returned sat
[2020-05-21 09:38:12] [INFO ] Computed and/alt/rep : 215/1522/194 causal constraints in 31 ms.
[2020-05-21 09:38:13] [INFO ] Added : 176 causal constraints over 36 iterations in 1081 ms. Result :sat
[2020-05-21 09:38:13] [INFO ] [Real]Absence check using 25 positive place invariants in 15 ms returned sat
[2020-05-21 09:38:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 09:38:13] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2020-05-21 09:38:14] [INFO ] [Real]Added 104 Read/Feed constraints in 23 ms returned sat
[2020-05-21 09:38:14] [INFO ] Computed and/alt/rep : 215/1522/194 causal constraints in 36 ms.
[2020-05-21 09:38:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 09:38:14] [INFO ] [Nat]Absence check using 25 positive place invariants in 18 ms returned sat
[2020-05-21 09:38:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 09:38:14] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2020-05-21 09:38:14] [INFO ] [Nat]Added 104 Read/Feed constraints in 20 ms returned sat
[2020-05-21 09:38:14] [INFO ] Computed and/alt/rep : 215/1522/194 causal constraints in 34 ms.
[2020-05-21 09:38:16] [INFO ] Added : 191 causal constraints over 40 iterations in 1757 ms. Result :sat
[2020-05-21 09:38:16] [INFO ] [Real]Absence check using 25 positive place invariants in 22 ms returned sat
[2020-05-21 09:38:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 09:38:16] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2020-05-21 09:38:16] [INFO ] [Real]Added 104 Read/Feed constraints in 19 ms returned sat
[2020-05-21 09:38:16] [INFO ] Computed and/alt/rep : 215/1522/194 causal constraints in 33 ms.
[2020-05-21 09:38:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 09:38:16] [INFO ] [Nat]Absence check using 25 positive place invariants in 23 ms returned sat
[2020-05-21 09:38:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 09:38:16] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2020-05-21 09:38:16] [INFO ] [Nat]Added 104 Read/Feed constraints in 14 ms returned sat
[2020-05-21 09:38:16] [INFO ] Computed and/alt/rep : 215/1522/194 causal constraints in 21 ms.
[2020-05-21 09:38:17] [INFO ] Added : 191 causal constraints over 39 iterations in 1226 ms. Result :sat
[2020-05-21 09:38:18] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-21 09:38:18] [INFO ] Flatten gal took : 119 ms
FORMULA Raft-PT-05-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-05-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-05-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-21 09:38:18] [INFO ] Flatten gal took : 41 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-21 09:38:18] [INFO ] Applying decomposition
[2020-05-21 09:38:18] [INFO ] Flatten gal took : 40 ms
[2020-05-21 09:38:18] [INFO ] Input system was already deterministic with 216 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 195 out of 216 initially.
// Phase 1: matrix 195 rows 133 cols
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/graph5966278934623805370.txt, -o, /tmp/graph5966278934623805370.bin, -w, /tmp/graph5966278934623805370.weights], workingDir=null]
[2020-05-21 09:38:18] [INFO ] Computed 25 place invariants in 14 ms
inv : p0 + p56 + p57 + p58 + p59 + p60 = 1
inv : p0 + p121 + p122 + p123 + p124 + p125 = 1
inv : p0 + p81 + p82 + p83 + p84 + p85 = 1
inv : p0 + p31 + p32 + p33 + p34 + p35 = 1
inv : p0 + p96 + p97 + p98 + p99 + p100 = 1
inv : p0 + p21 + p22 + p23 + p24 + p25 = 1
inv : p0 + p106 + p107 + p108 + p109 + p110 = 1
inv : p0 + p111 + p112 + p113 + p114 + p115 = 1
inv : p0 + p16 + p17 + p18 + p19 + p20 = 1
inv : p0 + p6 + p7 + p8 + p9 + p10 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 = 1
inv : p0 + p76 + p77 + p78 + p79 + p80 = 1
inv : p0 + p11 + p12 + p13 + p14 + p15 = 1
inv : p0 + p51 + p52 + p53 + p54 + p55 = 1
inv : p0 + p116 + p117 + p118 + p119 + p120 = 1
inv : p0 + p26 + p27 + p28 + p29 + p30 = 1
inv : p0 + p36 + p37 + p38 + p39 + p40 = 1
inv : p0 + p91 + p92 + p93 + p94 + p95 = 1
inv : p0 + p101 + p102 + p103 + p104 + p105 = 1
inv : p0 + p86 + p87 + p88 + p89 + p90 = 1
inv : p0 + p41 + p42 + p43 + p44 + p45 = 1
inv : p0 + p46 + p47 + p48 + p49 + p50 = 1
inv : p0 + p71 + p72 + p73 + p74 + p75 = 1
inv : p0 + p61 + p62 + p63 + p64 + p65 = 1
inv : p0 + p66 + p67 + p68 + p69 + p70 = 1
Total of 25 invariants.
[2020-05-21 09:38:18] [INFO ] Computed 25 place invariants in 22 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/graph5966278934623805370.bin, -l, -1, -v, -w, /tmp/graph5966278934623805370.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-21 09:38:18] [INFO ] Decomposing Gal with order
[2020-05-21 09:38:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-21 09:38:19] [INFO ] Removed a total of 156 redundant transitions.
[2020-05-21 09:38:19] [INFO ] Flatten gal took : 143 ms
[2020-05-21 09:38:19] [INFO ] Proved 133 variables to be positive in 408 ms
[2020-05-21 09:38:19] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2020-05-21 09:38:19] [INFO ] Computation of disable matrix completed :0/216 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 09:38:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 142 labels/synchronizations in 40 ms.
[2020-05-21 09:38:19] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 13 ms
[2020-05-21 09:38:19] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 4 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]
[2020-05-21 09:38:19] [INFO ] Computation of Complete disable matrix. took 50 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 09:38:19] [INFO ] Computing symmetric may enable matrix : 216 transitions.

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 13 LTL properties
[2020-05-21 09:38:19] [INFO ] Computation of Complete enable matrix. took 60 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Checking formula 0 : !(((X(!(G("((i2.u6.p45==1)&&(i2.u19.p115==1))"))))||(G(!(F("((i2.u11.p74==1)&&(i2.u19.p115==1))"))))))
Formula 0 simplified : !(X!G"((i2.u6.p45==1)&&(i2.u19.p115==1))" | G!F"((i2.u11.p74==1)&&(i2.u19.p115==1))")
built 16 ordering constraints for composite.
built 25 ordering constraints for composite.
built 22 ordering constraints for composite.
built 24 ordering constraints for composite.
built 22 ordering constraints for composite.
built 24 ordering constraints for composite.
built 7 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions i0.u17.t30, i0.u17.t31, i0.u17.t32, i0.u17.t34, i1.u18.t24, i1.u18.t25, i1.u18.t26, i1.u18.t28, i2.u19.t18, i2.u19.t19, i2.u19.t20, i2.u19.t22, i3.u20.t12, i3.u20.t13, i3.u20.t14, i3.u20.t16, i4.u21.t6, i4.u21.t7, i4.u21.t8, i4.u21.t10, i5.t237, i5.u24.t235, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/123/22/145
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,0.353482,21712,1,0,8678,745,1752,22995,483,3928,15026
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Raft-PT-05-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G((G((X("(i3.u20.p117==1)"))U((X(G("(i2.u19.p112==1)")))||("((i1.u18.p68==1)&&(i1.u18.p110==1))"))))U((X("((i0.u0.p5==1)&&(i0.u17.p105==1))"))&&("(i3.u20.p117==1)")))))
Formula 1 simplified : !G(G(X"(i3.u20.p117==1)" U ("((i1.u18.p68==1)&&(i1.u18.p110==1))" | XG"(i2.u19.p112==1)")) U ("(i3.u20.p117==1)" & X"((i0.u0.p5==1)&&(i0.u17.p105==1))"))
6 unique states visited
6 strongly connected components in search stack
8 transitions explored
6 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,0.550197,28188,1,0,18065,1512,1913,43895,494,12045,31143
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Raft-PT-05-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(!(F(G(((("((i2.u11.p75==1)&&(i3.u20.p120==1))")U(("((i2.u8.p55==1)&&(i2.u19.p115==1))")U("(i4.u21.p121==1)")))||("((i2.u6.p45==1)&&(i2.u19.p115==1))"))||("((i2.u8.p55==1)&&(i2.u19.p115==1))")))))))
Formula 2 simplified : !F!FG("((i2.u6.p45==1)&&(i2.u19.p115==1))" | "((i2.u8.p55==1)&&(i2.u19.p115==1))" | ("((i2.u11.p75==1)&&(i3.u20.p120==1))" U ("((i2.u8.p55==1)&&(i2.u19.p115==1))" U "(i4.u21.p121==1)")))
5 unique states visited
4 strongly connected components in search stack
7 transitions explored
5 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,0.640209,31084,1,0,24098,1516,2043,58546,496,12288,37508
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Raft-PT-05-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(F((G("((i2.u19.p115==1)&&(i5.u23.p128==1))"))&&("((i0.u17.p103==1)||((i1.u3.p30==1)&&(i1.u18.p110==1)))")))))
Formula 3 simplified : !XF("((i0.u17.p103==1)||((i1.u3.p30==1)&&(i1.u18.p110==1)))" & G"((i2.u19.p115==1)&&(i5.u23.p128==1))")
[2020-05-21 09:38:22] [INFO ] Computing symmetric co enabling matrix : 216 transitions.
[2020-05-21 09:38:22] [INFO ] Computation of co-enabling matrix(0/216) took 236 ms. Total solver calls (SAT/UNSAT): 210(0/210)
[2020-05-21 09:38:25] [INFO ] Computation of co-enabling matrix(79/216) took 3254 ms. Total solver calls (SAT/UNSAT): 2692(1035/1657)
[2020-05-21 09:38:28] [INFO ] Computation of co-enabling matrix(172/216) took 6267 ms. Total solver calls (SAT/UNSAT): 4366(2437/1929)
[2020-05-21 09:38:29] [INFO ] Computation of Finished co-enabling matrix. took 7425 ms. Total solver calls (SAT/UNSAT): 4899(2934/1965)
[2020-05-21 09:38:29] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2020-05-21 09:38:31] [INFO ] Computation of Completed DNA matrix. took 1558 ms. Total solver calls (SAT/UNSAT): 71(0/71)
[2020-05-21 09:38:31] [INFO ] Built C files in 12886ms 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 3860 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 326 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, X(<>(( []((LTLAP9==true)) ) && ( (LTLAP10==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(<>(( []((LTLAP9==true)) ) && ( (LTLAP10==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(<>(( []((LTLAP9==true)) ) && ( (LTLAP10==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)
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
3973 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,40.3713,746056,1,0,821052,2291,2117,2.16092e+06,497,47720,306055
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Raft-PT-05-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F((("(i0.u17.p102==1)")U("((i3.u20.p15==1)&&(i0.u17.p105==1))"))U(G("(i3.u20.p116==1)")))))
Formula 4 simplified : !F(("(i0.u17.p102==1)" U "((i3.u20.p15==1)&&(i0.u17.p105==1))") U G"(i3.u20.p116==1)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
218 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,42.5474,786976,1,0,878415,2291,2152,2.2791e+06,499,48245,320928
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Raft-PT-05-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((X(F("((i0.u17.p22!=1)||(i0.u17.p105!=1))")))&&(X(G("((i4.u9.p58!=1)||(i4.u21.p125!=1))")))))
Formula 5 simplified : !(XF"((i0.u17.p22!=1)||(i0.u17.p105!=1))" & XG"((i4.u9.p58!=1)||(i4.u21.p125!=1))")
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
15 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,42.7046,791992,1,0,887246,2292,2202,2.31238e+06,502,48368,332213
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Raft-PT-05-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X((G(!(F("((i4.u5.p40==1)&&(i1.u18.p110==1))"))))||(((G("((i1.u3.p30==1)&&(i1.u18.p110==1))"))&&("(i1.u3.p30==1)"))&&("(i1.u18.p110==1)")))))
Formula 6 simplified : !X(G!F"((i4.u5.p40==1)&&(i1.u18.p110==1))" | ("(i1.u3.p30==1)" & "(i1.u18.p110==1)" & G"((i1.u3.p30==1)&&(i1.u18.p110==1))"))
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 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,42.7823,794364,1,0,891961,2293,2302,2.32294e+06,502,48550,340052
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Raft-PT-05-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((G((X("((i2.u8.p51==1)&&(i3.u20.p120==1))"))||("((i3.u20.p120==1)&&(i5.u23.p128==1))")))||((X("((i4.u21.p123!=1)||(i5.u24.p132!=1))"))&&(G((G("((i3.u20.p120==1)&&(i5.u23.p128==1))"))||("((i3.u12.p80==1)&&(i3.u20.p120==1))"))))))
Formula 7 simplified : !(G("((i3.u20.p120==1)&&(i5.u23.p128==1))" | X"((i2.u8.p51==1)&&(i3.u20.p120==1))") | (X"((i4.u21.p123!=1)||(i5.u24.p132!=1))" & G("((i3.u12.p80==1)&&(i3.u20.p120==1))" | G"((i3.u20.p120==1)&&(i5.u23.p128==1))")))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,42.7988,794628,1,0,892409,2293,2368,2.32399e+06,502,48550,340839
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Raft-PT-05-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(X((F((F("((i0.u2.p17!=1)||(i4.u21.p125!=1))"))&&(F("((i0.u2.p17==1)&&(i4.u21.p125==1))"))))||(("((i0.u17.p24==1)&&(i0.u17.p105==1))")U("((i0.u2.p17==1)&&(i4.u21.p125==1))"))))))
Formula 8 simplified : !FX(F(F"((i0.u2.p17!=1)||(i4.u21.p125!=1))" & F"((i0.u2.p17==1)&&(i4.u21.p125==1))") | ("((i0.u17.p24==1)&&(i0.u17.p105==1))" U "((i0.u2.p17==1)&&(i4.u21.p125==1))"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
105 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.8441,822348,1,0,942254,2296,2423,2.4445e+06,502,48822,371629
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Raft-PT-05-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F("((i0.u2.p17==1)&&(i4.u21.p125==1))")))
Formula 9 simplified : !F"((i0.u2.p17==1)&&(i4.u21.p125==1))"
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,44.1555,832380,1,0,963087,2296,2423,2.48783e+06,502,49152,384562
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Raft-PT-05-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((!(F(G((F(X(G(F(G("((i4.u14.p90==1)&&(i4.u21.p125==1))"))))))U(F("((i4.u14.p90!=1)||(i4.u21.p125!=1))")))))))
Formula 10 simplified : FG(FXGFG"((i4.u14.p90==1)&&(i4.u21.p125==1))" U F"((i4.u14.p90!=1)||(i4.u21.p125!=1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
163 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,45.7897,863268,1,0,1.00636e+06,2297,2445,2.58835e+06,502,49565,402833
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Raft-PT-05-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X((((((("((i1.u3.p30!=1)||(i1.u18.p110!=1))")U(F(G(F("((i1.u3.p30==1)&&(i1.u18.p110==1))")))))&&(G("((i2.u8.p55==1)&&(i2.u19.p115==1))")))&&("(i3.u20.p120==1)"))&&("(i5.u22.p126==1)"))&&("(i2.u8.p55==1)"))&&("(i2.u19.p115==1)"))))
Formula 11 simplified : !X("(i2.u8.p55==1)" & "(i2.u19.p115==1)" & "(i3.u20.p120==1)" & "(i5.u22.p126==1)" & ("((i1.u3.p30!=1)||(i1.u18.p110!=1))" U FGF"((i1.u3.p30==1)&&(i1.u18.p110==1))") & G"((i2.u8.p55==1)&&(i2.u19.p115==1))")
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
4 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,45.8284,864324,1,0,1.00862e+06,2297,2505,2.59246e+06,502,49648,406185
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Raft-PT-05-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((X(X(!(F("((i4.u9.p57==1)&&(i4.u21.p125==1))")))))||(("((i4.u9.p57==1)&&(i4.u21.p125==1))")U("((i1.u7.p48==1)&&(i1.u18.p110==1))"))))
Formula 12 simplified : !(XX!F"((i4.u9.p57==1)&&(i4.u21.p125==1))" | ("((i4.u9.p57==1)&&(i4.u21.p125==1))" U "((i1.u7.p48==1)&&(i1.u18.p110==1))"))
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
10 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,45.9286,867492,1,0,1.01412e+06,2297,2536,2.61628e+06,502,49651,411846
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Raft-PT-05-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1590053951434

--------------------
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="Raft-PT-05"
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 Raft-PT-05, 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 r141-smll-158961510800242"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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