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.r081-smll-158922977700274.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 FlexibleBarrier-PT-06a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r081-smll-158922977700274
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 3.7K Apr 4 18:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 4 18:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 4 06:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 4 06:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 3 20:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 3 20:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 3 13:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 3 13:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 4 01:37 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 41K 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 FlexibleBarrier-PT-06a-00
FORMULA_NAME FlexibleBarrier-PT-06a-01
FORMULA_NAME FlexibleBarrier-PT-06a-02
FORMULA_NAME FlexibleBarrier-PT-06a-03
FORMULA_NAME FlexibleBarrier-PT-06a-04
FORMULA_NAME FlexibleBarrier-PT-06a-05
FORMULA_NAME FlexibleBarrier-PT-06a-06
FORMULA_NAME FlexibleBarrier-PT-06a-07
FORMULA_NAME FlexibleBarrier-PT-06a-08
FORMULA_NAME FlexibleBarrier-PT-06a-09
FORMULA_NAME FlexibleBarrier-PT-06a-10
FORMULA_NAME FlexibleBarrier-PT-06a-11
FORMULA_NAME FlexibleBarrier-PT-06a-12
FORMULA_NAME FlexibleBarrier-PT-06a-13
FORMULA_NAME FlexibleBarrier-PT-06a-14
FORMULA_NAME FlexibleBarrier-PT-06a-15

=== Now, execution of the tool begins

BK_START 1589644553532

[2020-05-16 15:55:56] [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 15:55:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-16 15:55:56] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2020-05-16 15:55:56] [INFO ] Transformed 75 places.
[2020-05-16 15:55:56] [INFO ] Transformed 154 transitions.
[2020-05-16 15:55:56] [INFO ] Found NUPN structural information;
[2020-05-16 15:55:56] [INFO ] Parsed PT model containing 75 places and 154 transitions in 133 ms.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 248 steps, including 0 resets, run visited all 42 properties in 11 ms. (steps per millisecond=22 )
[2020-05-16 15:55:56] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-16 15:55:56] [INFO ] Flatten gal took : 69 ms
FORMULA FlexibleBarrier-PT-06a-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06a-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06a-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06a-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-16 15:55:56] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-16 15:55:56] [INFO ] Applying decomposition
[2020-05-16 15:55:56] [INFO ] Flatten gal took : 19 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/graph486572282785391511.txt, -o, /tmp/graph486572282785391511.bin, -w, /tmp/graph486572282785391511.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/graph486572282785391511.bin, -l, -1, -v, -w, /tmp/graph486572282785391511.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-16 15:55:57] [INFO ] Input system was already deterministic with 128 transitions.
[2020-05-16 15:55:57] [INFO ] Decomposing Gal with order
[2020-05-16 15:55:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-16 15:55:57] [INFO ] Removed a total of 95 redundant transitions.
[2020-05-16 15:55:57] [INFO ] Flatten gal took : 131 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 122 out of 128 initially.
// Phase 1: matrix 122 rows 75 cols
[2020-05-16 15:55:57] [INFO ] Computed 8 place invariants in 18 ms
inv : p0 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 = 1
inv : p0 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 = 1
inv : p0 + p74 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 = 1
inv : p0 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 = 1
inv : p0 + p73 = 1
inv : p0 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 = 1
inv : p0 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 = 1
Total of 8 invariants.
[2020-05-16 15:55:57] [INFO ] Computed 8 place invariants in 19 ms
[2020-05-16 15:55:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 22 ms.
[2020-05-16 15:55:57] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 15 ms
[2020-05-16 15:55:57] [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 12 LTL properties
Checking formula 0 : !(((F("((i6.u16.p67==1)&&(i0.u0.p74==1))"))&&((X(((X("(i1.u5.p24==1)"))&&("(i6.u16.p67==1)"))&&("(i0.u0.p74==1)")))||(!((G(X("((i3.u6.p26==1)&&(i0.u0.p74==1))")))U("(((i1.u5.p24==1)&&(i4.u11.p47==1))&&(i1.u5.p73==1))"))))))
Formula 0 simplified : !(F"((i6.u16.p67==1)&&(i0.u0.p74==1))" & (X("(i0.u0.p74==1)" & "(i6.u16.p67==1)" & X"(i1.u5.p24==1)") | !(GX"((i3.u6.p26==1)&&(i0.u0.p74==1))" U "(((i1.u5.p24==1)&&(i4.u11.p47==1))&&(i1.u5.p73==1))")))
built 19 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 13 ordering constraints for composite.
built 12 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,0.072646,19192,1,0,2152,296,819,2983,220,718,4518
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-06a-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F((G(((X("(((i1.u2.p12==1)&&(i4.u11.p47==1))&&(i1.u5.p73==1))"))&&("(i5.u14.p58==1)"))U("((i5.u14.p58==1)||(i4.u10.p44==1))")))||(F("(((i1.u2.p11==1)&&(i1.u5.p24==1))&&(i1.u5.p73==1))")))))
Formula 1 simplified : !F(G(("(i5.u14.p58==1)" & X"(((i1.u2.p12==1)&&(i4.u11.p47==1))&&(i1.u5.p73==1))") U "((i5.u14.p58==1)||(i4.u10.p44==1))") | F"(((i1.u2.p11==1)&&(i1.u5.p24==1))&&(i1.u5.p73==1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.098344,20360,1,0,4047,319,943,6496,232,1007,8742
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-06a-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!(G(F(((F("(((i1.u2.p12==1)&&(i5.u14.p59==1))&&(i1.u5.p73==1))"))||(G("(((i1.u5.p23!=1)||(i5.u14.p60!=1))||(i1.u5.p73!=1))")))||("(i6.u17.p72==1)"))))))
Formula 2 simplified : GF("(i6.u17.p72==1)" | F"(((i1.u2.p12==1)&&(i5.u14.p59==1))&&(i1.u5.p73==1))" | G"(((i1.u5.p23!=1)||(i5.u14.p60!=1))||(i1.u5.p73!=1))")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 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.109086,20888,1,0,4470,367,1033,7174,239,1123,9966
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-06a-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((("(i5.u12.p51==1)")U(G("(i2.u4.p20==1)")))U(G(F(X("(i2.u4.p20==1)"))))))
Formula 3 simplified : !(("(i5.u12.p51==1)" U G"(i2.u4.p20==1)") U GFX"(i2.u4.p20==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.112997,20888,1,0,4610,375,1069,7336,239,1134,10477
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-06a-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(F((("(((i1.u5.p23==1)&&(i4.u11.p48==1))&&(i1.u5.p73==1))")U(X((G("((i5.u13.p54==1)&&(i1.u5.p73==1))"))||("(((i4.u11.p48==1)&&(i5.u14.p59==1))&&(i1.u5.p73==1))"))))&&(!(X("(((i1.u2.p11==1)&&(i5.u14.p60==1))&&(i1.u5.p73==1))")))))))
Formula 4 simplified : !XF(("(((i1.u5.p23==1)&&(i4.u11.p48==1))&&(i1.u5.p73==1))" U X("(((i4.u11.p48==1)&&(i5.u14.p59==1))&&(i1.u5.p73==1))" | G"((i5.u13.p54==1)&&(i1.u5.p73==1))")) & !X"(((i1.u2.p11==1)&&(i5.u14.p60==1))&&(i1.u5.p73==1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,0.162728,22204,1,0,8053,378,1159,13083,241,1206,16897
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-06a-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((!(F("(((i3.u8.p35==1)&&(i4.u11.p48==1))&&(i1.u5.p73==1))")))&&(!(X((F("((i6.u16.p66==1)&&(i1.u5.p73==1))"))&&((X("((i6.u16.p66==1)&&(i1.u5.p73==1))"))||("(i3.u8.p34==1)")))))))
Formula 5 simplified : !(!F"(((i3.u8.p35==1)&&(i4.u11.p48==1))&&(i1.u5.p73==1))" & !X(F"((i6.u16.p66==1)&&(i1.u5.p73==1))" & ("(i3.u8.p34==1)" | X"((i6.u16.p66==1)&&(i1.u5.p73==1))")))
[2020-05-16 15:55:57] [INFO ] Proved 75 variables to be positive in 296 ms
[2020-05-16 15:55:57] [INFO ] Computing symmetric may disable matrix : 128 transitions.
[2020-05-16 15:55:57] [INFO ] Computation of disable matrix completed :0/128 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 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,0.212675,24052,1,0,11526,379,1228,17525,241,1223,22273
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-06a-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!(X(!(("(((i3.u8.p36==1)&&(i6.u17.p71==1))&&(i1.u5.p73==1))")U(F("((i6.u16.p66==1)&&(i1.u5.p73==1))")))))))
Formula 6 simplified : X!("(((i3.u8.p36==1)&&(i6.u17.p71==1))&&(i1.u5.p73==1))" U F"((i6.u16.p66==1)&&(i1.u5.p73==1))")
3 unique states visited
3 strongly connected components in search stack
3 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.223254,24052,1,0,12355,379,1240,18419,241,1225,24159
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-06a-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((((F("(i6.u16.p65==1)"))&&("(i6.u16.p65==1)"))U("((i1.u2.p9==1)&&(i0.u0.p74==1))"))||(X("(i5.u13.p56!=1)"))))
Formula 7 simplified : !((("(i6.u16.p65==1)" & F"(i6.u16.p65==1)") U "((i1.u2.p9==1)&&(i0.u0.p74==1))") | X"(i5.u13.p56!=1)")
2 unique states visited
0 strongly connected components in search stack
1 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.224513,24316,1,0,12355,379,1261,18419,243,1225,24183
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA FlexibleBarrier-PT-06a-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((((F(!(G("(((i4.u11.p47==1)&&(i5.u14.p60==1))&&(i1.u5.p73==1))"))))||("(((i4.u11.p47==1)&&(i5.u14.p60==1))&&(i1.u5.p73==1))"))U(("((i0.u1.p7==1)&&(i0.u0.p74==1))")U(G("((i0.u1.p7==1)&&(i0.u0.p74==1))")))))
[2020-05-16 15:55:57] [INFO ] Computation of Complete disable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Formula 8 simplified : !(("(((i4.u11.p47==1)&&(i5.u14.p60==1))&&(i1.u5.p73==1))" | F!G"(((i4.u11.p47==1)&&(i5.u14.p60==1))&&(i1.u5.p73==1))") U ("((i0.u1.p7==1)&&(i0.u0.p74==1))" U G"((i0.u1.p7==1)&&(i0.u0.p74==1))"))
[2020-05-16 15:55:57] [INFO ] Computing symmetric may enable matrix : 128 transitions.
[2020-05-16 15:55:57] [INFO ] Computation of Complete enable matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.31929,26956,1,0,19996,385,1287,24636,243,1335,31666
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-06a-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((F(X("(((i1.u5.p24==1)&&(i4.u11.p47==1))&&(i1.u5.p73==1))")))&&(X(!(F(G((F("(((i3.u8.p36==1)&&(i4.u11.p47==1))&&(i1.u5.p73==1))"))||("(i3.u6.p25==1)"))))))))
Formula 9 simplified : !(FX"(((i1.u5.p24==1)&&(i4.u11.p47==1))&&(i1.u5.p73==1))" & X!FG("(i3.u6.p25==1)" | F"(((i3.u8.p36==1)&&(i4.u11.p47==1))&&(i1.u5.p73==1))"))
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 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.345799,27484,1,0,21724,385,1323,26728,243,1340,34751
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-06a-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((X(!(("((((i1.u5.p23!=1)||(i4.u11.p48!=1))||(i1.u5.p73!=1))&&(i5.u13.p56!=1))")U(F("(i2.u3.p13==1)")))))U(("(((i1.u5.p23==1)&&(i4.u11.p48==1))&&(i1.u5.p73==1))")U(("(i4.u9.p37==1)")U("(i5.u13.p56==1)")))))
Formula 10 simplified : !(X!("((((i1.u5.p23!=1)||(i4.u11.p48!=1))||(i1.u5.p73!=1))&&(i5.u13.p56!=1))" U F"(i2.u3.p13==1)") U ("(((i1.u5.p23==1)&&(i4.u11.p48==1))&&(i1.u5.p73==1))" U ("(i4.u9.p37==1)" U "(i5.u13.p56==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.358034,27748,1,0,22085,385,1361,27099,243,1340,35892
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-06a-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F("(i3.u6.p25==1)")))
Formula 11 simplified : !F"(i3.u6.p25==1)"
2 unique states visited
2 strongly connected components in search stack
2 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.364555,28012,1,0,22678,385,1419,27679,243,1340,37348
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-06a-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-16 15:55:57] [WARNING] Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
[2020-05-16 15:55:57] [WARNING] Script execution failed on command (declare-fun s1 () (Array Int Int)) with error (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
[2020-05-16 15:55:57] [WARNING] Script execution failed on command (assert (and (>= (select s0 68) 1) (= (store (store s0 68 (- (select s0 68) 1)) 67 (+ (select s0 67) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Broken pipe (and (>= (select s0 68) 1) (= (store (store s0 68 (- (select s0 68) 1)) 67 (+ (select s0 67) 1)) s1))")
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:757)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
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 15:55:57] [INFO ] Built C files in 838ms 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 1589644558869

--------------------
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="FlexibleBarrier-PT-06a"
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 FlexibleBarrier-PT-06a, 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 r081-smll-158922977700274"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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