Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r051-ebro-158902546200450.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 DLCround-PT-03a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r051-ebro-158902546200450
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 324K
-rw-r--r-- 1 mcc users 3.7K Mar 30 18:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 30 18:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 29 08:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 29 08:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 04:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 28 04:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 26 22:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 26 22:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 148K 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 DLCround-PT-03a-00
FORMULA_NAME DLCround-PT-03a-01
FORMULA_NAME DLCround-PT-03a-02
FORMULA_NAME DLCround-PT-03a-03
FORMULA_NAME DLCround-PT-03a-04
FORMULA_NAME DLCround-PT-03a-05
FORMULA_NAME DLCround-PT-03a-06
FORMULA_NAME DLCround-PT-03a-07
FORMULA_NAME DLCround-PT-03a-08
FORMULA_NAME DLCround-PT-03a-09
FORMULA_NAME DLCround-PT-03a-10
FORMULA_NAME DLCround-PT-03a-11
FORMULA_NAME DLCround-PT-03a-12
FORMULA_NAME DLCround-PT-03a-13
FORMULA_NAME DLCround-PT-03a-14
FORMULA_NAME DLCround-PT-03a-15

=== Now, execution of the tool begins

BK_START 1589594385484

[2020-05-16 01:59:49] [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-16 01:59:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-16 01:59:49] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2020-05-16 01:59:49] [INFO ] Transformed 113 places.
[2020-05-16 01:59:49] [INFO ] Transformed 617 transitions.
[2020-05-16 01:59:49] [INFO ] Found NUPN structural information;
[2020-05-16 01:59:49] [INFO ] Parsed PT model containing 113 places and 617 transitions in 239 ms.
Ensure Unique test removed 72 transitions
Reduce redundant transitions removed 72 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 56 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 492 ms. (steps per millisecond=203 ) properties seen :[1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-05-16 01:59:50] [INFO ] Flow matrix only has 106 transitions (discarded 439 similar events)
// Phase 1: matrix 106 rows 113 cols
[2020-05-16 01:59:50] [INFO ] Computed 52 place invariants in 13 ms
[2020-05-16 01:59:50] [INFO ] [Real]Absence check using 52 positive place invariants in 61 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-16 01:59:50] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-16 01:59:51] [INFO ] Flatten gal took : 135 ms
FORMULA DLCround-PT-03a-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03a-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-16 01:59:51] [INFO ] Flatten gal took : 52 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-16 01:59:51] [INFO ] Applying decomposition
[2020-05-16 01:59:51] [INFO ] Flatten gal took : 58 ms
[2020-05-16 01:59:51] [INFO ] Input system was already deterministic with 545 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph2420276594313398133.txt, -o, /tmp/graph2420276594313398133.bin, -w, /tmp/graph2420276594313398133.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/graph2420276594313398133.bin, -l, -1, -v, -w, /tmp/graph2420276594313398133.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-16 01:59:51] [INFO ] Decomposing Gal with order
[2020-05-16 01:59:51] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 106 out of 545 initially.
// Phase 1: matrix 106 rows 113 cols
[2020-05-16 01:59:51] [INFO ] Removed a total of 524 redundant transitions.
[2020-05-16 01:59:51] [INFO ] Computed 52 place invariants in 17 ms
inv : p0 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 = 1
inv : p0 + p86 = 1
inv : p0 + p82 = 1
inv : p0 + p94 = 1
inv : p0 + p90 = 1
inv : p0 + p70 = 1
inv : p0 + p78 = 1
inv : p0 + p74 = 1
inv : p0 + p103 = 1
inv : p0 + p99 = 1
inv : p0 + p111 = 1
inv : p0 + p107 = 1
inv : p0 + p85 = 1
inv : p0 + p8 + p9 + p10 + p11 + p12 + p13 + p14 = 1
inv : p0 + p81 = 1
inv : p0 + p93 = 1
inv : p0 + p89 = 1
inv : p0 + p69 = 1
inv : p0 + p77 = 1
inv : p0 + p73 = 1
inv : p0 + p102 = 1
inv : p0 + p98 = 1
inv : p0 + p110 = 1
inv : p0 + p106 = 1
inv : p0 + p84 = 1
inv : p0 + p80 = 1
inv : p0 + p92 = 1
inv : p0 + p88 = 1
inv : p0 + p15 + p16 + p17 + p18 + p19 + p20 + p21 = 1
inv : p0 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 = 1
inv : p0 + p76 = 1
inv : p0 + p72 = 1
inv : p0 + p101 = 1
inv : p0 + p97 = 1
inv : p0 + p109 = 1
inv : p0 + p22 + p23 + p24 + p25 + p26 + p27 + p28 = 1
inv : p0 + p105 = 1
inv : p0 + p87 = 1
inv : p0 + p83 = 1
inv : p0 + p95 = 1
inv : p0 + p91 = 1
inv : p0 + p71 = 1
inv : p0 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 = 1
inv : p0 + p79 = 1
inv : p0 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 = 1
inv : p0 + p75 = 1
inv : p0 + p112 = 1
inv : p0 + p100 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 = 1
inv : p0 + p96 = 1
inv : p0 + p108 = 1
inv : p0 + p104 = 1
Total of 52 invariants.
[2020-05-16 01:59:51] [INFO ] Computed 52 place invariants in 23 ms
[2020-05-16 01:59:52] [INFO ] Flatten gal took : 263 ms
[2020-05-16 01:59:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 28 ms.
[2020-05-16 01:59:52] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 23 ms
[2020-05-16 01:59:52] [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]

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 14 LTL properties
Checking formula 0 : !((!(F((!(G(X(G("((i4.u4.p32==1)&&(i4.u6.p74==1))")))))&&(X(!(G("(u0.p7==1)"))))))))
Formula 0 simplified : F(!GXG"((i4.u4.p32==1)&&(i4.u6.p74==1))" & X!G"(u0.p7==1)")
[2020-05-16 01:59:52] [INFO ] Proved 113 variables to be positive in 363 ms
[2020-05-16 01:59:52] [INFO ] Computing symmetric may disable matrix : 545 transitions.
[2020-05-16 01:59:52] [INFO ] Computation of disable matrix completed :0/545 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
built 23 ordering constraints for composite.
built 19 ordering constraints for composite.
built 19 ordering constraints for composite.
built 19 ordering constraints for composite.
built 19 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
[2020-05-16 01:59:52] [INFO ] Computation of Complete disable matrix. took 101 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-16 01:59:52] [INFO ] Computing symmetric may enable matrix : 545 transitions.
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
7 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.127458,18916,1,0,819,1428,1067,850,631,2898,2970
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DLCround-PT-03a-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(((G("((i7.u15.p68==1)&&(i7.u15.p98==1))"))U((X("(u1.p14==1)"))&&(G("((i4.u4.p32==1)&&(i4.u6.p102==1))"))))||(F(X("((i5.u9.p47==1)&&(i5.u7.p77==1))"))))))
Formula 1 simplified : !G((G"((i7.u15.p68==1)&&(i7.u15.p98==1))" U (X"(u1.p14==1)" & G"((i4.u4.p32==1)&&(i4.u6.p102==1))")) | FX"((i5.u9.p47==1)&&(i5.u7.p77==1))")
[2020-05-16 01:59:52] [INFO ] Computation of Complete enable matrix. took 37 ms. Total solver calls (SAT/UNSAT): 0(0/0)
4 unique states visited
4 strongly connected components in search stack
5 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,0.146737,20896,1,0,1139,1521,1186,1279,640,3244,4436
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DLCround-PT-03a-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!(X(F(!(G((F(X("((u1.p14==1)&&(i6.u10.p87==1))")))||(G((("((i4.u4.p32==1)&&(i4.u6.p101==1))")U("((u1.p14==1)&&(i6.u10.p87==1))"))||("((i4.u4.p32==1)&&(i4.u6.p101==1))"))))))))))
Formula 2 simplified : XF!G(FX"((u1.p14==1)&&(i6.u10.p87==1))" | G("((i4.u4.p32==1)&&(i4.u6.p101==1))" | ("((i4.u4.p32==1)&&(i4.u6.p101==1))" U "((u1.p14==1)&&(i6.u10.p87==1))")))
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 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,0.154569,20896,1,0,1283,1526,1253,1473,641,3354,5012
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DLCround-PT-03a-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(G(("(u1.p10==1)")&&((G(F("((u3.p28==1)&&(i7.u15.p100==1))")))||("((u3.p28==1)&&(i7.u15.p100==1))"))))))
Formula 3 simplified : !FG("(u1.p10==1)" & ("((u3.p28==1)&&(i7.u15.p100==1))" | GF"((u3.p28==1)&&(i7.u15.p100==1))"))
2 unique states visited
2 strongly connected components in search stack
2 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,0.160469,20896,1,0,1446,1542,1285,1654,644,3412,5602
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DLCround-PT-03a-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F((X(X(("((u3.p28==1)&&(i4.u6.p76==1))")U(((F("((u0.p7==1)&&(i5.u9.p78==1))"))&&("(u0.p7==1)"))&&("(i5.u9.p78==1)")))))U(F(G("((u3.p28==1)&&(i4.u6.p76==1))"))))))
Formula 4 simplified : !F(XX("((u3.p28==1)&&(i4.u6.p76==1))" U ("(i5.u9.p78==1)" & "(u0.p7==1)" & F"((u0.p7==1)&&(i5.u9.p78==1))")) U FG"((u3.p28==1)&&(i4.u6.p76==1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
7 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.22841,21920,1,0,5406,1651,1313,7056,644,4324,11597
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DLCround-PT-03a-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(((((G("((u3.p28==1)&&(i5.u7.p83==1))"))&&(G("((i4.u6.p37==1)&&(i7.u15.p110==1))")))&&("(i4.u6.p31==1)"))&&("(i4.u6.p101==1)"))&&((G("((i4.u4.p32==1)&&(i4.u6.p72==1))"))||("((i4.u6.p37==1)&&(i7.u15.p110==1))")))))
Formula 5 simplified : !F("(i4.u6.p31==1)" & "(i4.u6.p101==1)" & G"((u3.p28==1)&&(i5.u7.p83==1))" & G"((i4.u6.p37==1)&&(i7.u15.p110==1))" & ("((i4.u6.p37==1)&&(i7.u15.p110==1))" | G"((i4.u4.p32==1)&&(i4.u6.p72==1))"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
3 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.259585,22712,1,0,6964,1655,1397,9003,657,4345,14574
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DLCround-PT-03a-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!((X(G("((u0.p7==1)&&(i5.u7.p77==1))")))U("((i7.u15.p67==1)&&(i7.u15.p96==1))"))))
Formula 6 simplified : XG"((u0.p7==1)&&(i5.u7.p77==1))" U "((i7.u15.p67==1)&&(i7.u15.p96==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,0.270082,22976,1,0,7312,1688,1469,9443,663,4487,15786
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DLCround-PT-03a-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(!(X(((X((F("(i6.u12.p51==1)"))U("((i5.u9.p46==1)&&(i5.u9.p78==1))")))&&("(i5.u9.p47==1)"))&&("(i5.u9.p82==1)"))))))
Formula 7 simplified : !X!X("(i5.u9.p47==1)" & "(i5.u9.p82==1)" & X(F"(i6.u12.p51==1)" U "((i5.u9.p46==1)&&(i5.u9.p78==1))"))
8 unique states visited
8 strongly connected components in search stack
10 transitions explored
8 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,0.299185,23768,1,0,8338,1943,1573,10858,669,5736,18882
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DLCround-PT-03a-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F("((i4.u4.p33==1)&&(i4.u6.p70==1))")))
Formula 8 simplified : !F"((i4.u4.p33==1)&&(i4.u6.p70==1))"
2 unique states visited
2 strongly connected components in search stack
2 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,0.307628,23768,1,0,8695,1947,1624,11329,669,5752,20410
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DLCround-PT-03a-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((F("((u1.p14==1)&&(i6.u12.p88==1))"))&&((("((i6.u12.p57==1)&&(i4.u6.p102==1))")U("((((i6.u12.p57==1)&&(i4.u6.p102==1))&&(i4.u6.p37==1))&&(i6.u12.p107==1))"))||(F("((i6.u12.p49==1)&&(i6.u12.p108==1))")))))
Formula 9 simplified : !(F"((u1.p14==1)&&(i6.u12.p88==1))" & (("((i6.u12.p57==1)&&(i4.u6.p102==1))" U "((((i6.u12.p57==1)&&(i4.u6.p102==1))&&(i4.u6.p37==1))&&(i6.u12.p107==1))") | F"((i6.u12.p49==1)&&(i6.u12.p108==1))"))
4 unique states visited
3 strongly connected components in search stack
4 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,0.31809,24032,1,0,8975,1969,1698,11619,679,5853,21401
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DLCround-PT-03a-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(G(F(!(X(!(G(F(X((G("((u0.p7==1)&&(i7.u15.p94==1))"))&&(G(X("((u0.p7==1)&&(i7.u15.p94==1))"))))))))))))))
Formula 10 simplified : !FGF!X!GFX(G"((u0.p7==1)&&(i7.u15.p94==1))" & GX"((u0.p7==1)&&(i7.u15.p94==1))")
3 unique states visited
3 strongly connected components in search stack
4 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,0.32298,24032,1,0,9092,1969,1721,11776,679,5853,21752
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DLCround-PT-03a-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G(("((u3.p28!=1)||(i7.u15.p100!=1))")U("(u0.p5==1)"))))
Formula 11 simplified : !G("((u3.p28!=1)||(i7.u15.p100!=1))" U "(u0.p5==1)")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,0.32652,24032,1,0,9094,1969,1748,11779,680,5853,21850
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA DLCround-PT-03a-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((((X("((u3.p28==1)&&(i4.u6.p76==1))"))||(G("((u3.p25==1)&&(i5.u7.p83==1))")))U(X("((i6.u12.p57==1)&&(i7.u15.p112==1))"))))
Formula 12 simplified : !((X"((u3.p28==1)&&(i4.u6.p76==1))" | G"((u3.p25==1)&&(i5.u7.p83==1))") U X"((i6.u12.p57==1)&&(i7.u15.p112==1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
3 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.359845,24824,1,0,10760,1971,1805,13867,683,5874,24930
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA DLCround-PT-03a-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((X((F((G("((u0.p1==1)&&(i4.u4.p69==1))"))U(F("((i7.u15.p68==1)&&(i7.u15.p111==1))"))))&&("(((u0.p1!=1)||(i4.u4.p69!=1))||((i6.u12.p57==1)&&(i6.u10.p91==1)))"))))
Formula 13 simplified : !X("(((u0.p1!=1)||(i4.u4.p69!=1))||((i6.u12.p57==1)&&(i6.u10.p91==1)))" & F(G"((u0.p1==1)&&(i4.u4.p69==1))" U F"((i7.u15.p68==1)&&(i7.u15.p111==1))"))
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.362077,24824,1,0,10760,1971,1833,13867,687,5874,24955
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA DLCround-PT-03a-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-16 01:59:56] [INFO ] Computing symmetric co enabling matrix : 545 transitions.
[2020-05-16 01:59:56] [INFO ] Computation of co-enabling matrix(0/545) took 363 ms. Total solver calls (SAT/UNSAT): 544(0/544)
[2020-05-16 01:59:59] [INFO ] Computation of co-enabling matrix(34/545) took 3402 ms. Total solver calls (SAT/UNSAT): 3692(304/3388)
[2020-05-16 02:00:02] [INFO ] Computation of co-enabling matrix(78/545) took 6468 ms. Total solver calls (SAT/UNSAT): 6521(547/5974)
[2020-05-16 02:00:05] [INFO ] Computation of co-enabling matrix(109/545) took 9537 ms. Total solver calls (SAT/UNSAT): 9009(1044/7965)
[2020-05-16 02:00:08] [INFO ] Computation of co-enabling matrix(144/545) took 12627 ms. Total solver calls (SAT/UNSAT): 11660(1542/10118)
[2020-05-16 02:00:11] [INFO ] Computation of co-enabling matrix(190/545) took 15660 ms. Total solver calls (SAT/UNSAT): 13743(1981/11762)
[2020-05-16 02:00:14] [INFO ] Computation of co-enabling matrix(244/545) took 18662 ms. Total solver calls (SAT/UNSAT): 16386(2498/13888)
[2020-05-16 02:00:17] [INFO ] Computation of co-enabling matrix(292/545) took 21733 ms. Total solver calls (SAT/UNSAT): 18480(2916/15564)
[2020-05-16 02:00:21] [INFO ] Computation of co-enabling matrix(347/545) took 24752 ms. Total solver calls (SAT/UNSAT): 20746(3382/17364)
[2020-05-16 02:00:24] [INFO ] Computation of co-enabling matrix(409/545) took 27754 ms. Total solver calls (SAT/UNSAT): 22030(3911/18119)
[2020-05-16 02:00:27] [INFO ] Computation of co-enabling matrix(481/545) took 30766 ms. Total solver calls (SAT/UNSAT): 23136(4323/18813)
[2020-05-16 02:00:29] [INFO ] Computation of Finished co-enabling matrix. took 33280 ms. Total solver calls (SAT/UNSAT): 23560(4452/19108)
Skipping mayMatrices nes/nds SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
java.lang.RuntimeException: SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.addKnownInvariants(KInductionSolver.java:460)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeDoNotAccord(NecessaryEnablingsolver.java:574)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:538)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-16 02:00:29] [INFO ] Built C files in 38476ms 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]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1589594430107

--------------------
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="DLCround-PT-03a"
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 DLCround-PT-03a, 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 r051-ebro-158902546200450"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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