Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r227-oct2-159033546100018.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SmartHome-PT-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-oct2-159033546100018
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 4.0K May 14 03:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 14 03:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 13 21:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 21:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 14 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 14 10:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.7K May 13 15:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 13 15:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 13 10:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 13 10:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 31K May 12 20:42 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 SmartHome-PT-03-00
FORMULA_NAME SmartHome-PT-03-01
FORMULA_NAME SmartHome-PT-03-02
FORMULA_NAME SmartHome-PT-03-03
FORMULA_NAME SmartHome-PT-03-04
FORMULA_NAME SmartHome-PT-03-05
FORMULA_NAME SmartHome-PT-03-06
FORMULA_NAME SmartHome-PT-03-07
FORMULA_NAME SmartHome-PT-03-08
FORMULA_NAME SmartHome-PT-03-09
FORMULA_NAME SmartHome-PT-03-10
FORMULA_NAME SmartHome-PT-03-11
FORMULA_NAME SmartHome-PT-03-12
FORMULA_NAME SmartHome-PT-03-13
FORMULA_NAME SmartHome-PT-03-14
FORMULA_NAME SmartHome-PT-03-15

=== Now, execution of the tool begins

BK_START 1590483637418

[2020-05-26 09:00:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-26 09:00:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-26 09:00:39] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2020-05-26 09:00:39] [INFO ] Transformed 45 places.
[2020-05-26 09:00:39] [INFO ] Transformed 145 transitions.
[2020-05-26 09:00:39] [INFO ] Found NUPN structural information;
[2020-05-26 09:00:39] [INFO ] Parsed PT model containing 45 places and 145 transitions in 112 ms.
Ensure Unique test removed 77 transitions
Reduce redundant transitions removed 77 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 102 steps, including 0 resets, run visited all 38 properties in 4 ms. (steps per millisecond=25 )
[2020-05-26 09:00:39] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-26 09:00:39] [INFO ] Flatten gal took : 32 ms
FORMULA SmartHome-PT-03-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-03-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-03-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-26 09:00:39] [INFO ] Flatten gal took : 6 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-26 09:00:39] [INFO ] Applying decomposition
[2020-05-26 09:00:39] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph16350592457412471100.txt, -o, /tmp/graph16350592457412471100.bin, -w, /tmp/graph16350592457412471100.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/graph16350592457412471100.bin, -l, -1, -v, -w, /tmp/graph16350592457412471100.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-26 09:00:39] [INFO ] Input system was already deterministic with 68 transitions.
[2020-05-26 09:00:39] [INFO ] Decomposing Gal with order
[2020-05-26 09:00:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-26 09:00:39] [INFO ] Removed a total of 26 redundant transitions.
[2020-05-26 09:00:39] [INFO ] Flatten gal took : 47 ms
[2020-05-26 09:00:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2020-05-26 09:00:39] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
[2020-05-26 09:00:39] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 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 13 LTL properties
Checking formula 0 : !((X((((F("(i8.u5.p17==1)"))&&(G("((i4.u8.p22==1)||(i2.u2.p8!=1))")))&&("(i2.u2.p8==1)"))&&("(i8.u5.p17==1)"))))
Formula 0 simplified : !X("(i2.u2.p8==1)" & "(i8.u5.p17==1)" & F"(i8.u5.p17==1)" & G"((i4.u8.p22==1)||(i2.u2.p8!=1))")
built 22 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t101, t105, i9.u6.t99, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/64/3/67
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 40 out of 68 initially.
// Phase 1: matrix 40 rows 45 cols
[2020-05-26 09:00:39] [INFO ] Computed 19 place invariants in 4 ms
inv : p0 + p31 = 1
inv : p0 + p26 + p27 + p28 = 1
inv : p0 + p5 = 1
inv : p0 + p1 = 1
inv : p0 + p13 + p14 = 1
inv : p0 + p15 = 1
inv : p0 + p9 = 1
inv : p0 + p7 + p8 = 1
inv : p0 + p10 + p11 = 1
inv : p0 + p2 + p3 + p4 = 1
inv : p0 + p19 + p20 = 1
5 unique states visited
inv : p0 + p18 = 1
inv : p0 + p23 + p24 + p25 = 1
inv : p0 + p6 = 1
inv : p0 + p29 + p30 = 1
inv : p0 + p21 + p22 = 1
inv : p0 + p12 = 1
inv : p0 + p16 + p17 = 1
inv : p41 + p42 - p43 - p44 = 0
5 strongly connected components in search stack
Total of 19 invariants.
5 transitions explored
5 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.042597,17640,1,0,2383,123,763,2627,194,230,6366
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA SmartHome-PT-03-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((X("((i7.u11.p29==1)||((i2.u2.p1==1)&&(u1.p4==1)))"))||(!(("(u9.p25==1)")U((!(F("(i2.u2.p7==1)")))U("((i2.u2.p1==1)&&(u1.p4==1))"))))))
Formula 1 simplified : !(X"((i7.u11.p29==1)||((i2.u2.p1==1)&&(u1.p4==1)))" | !("(u9.p25==1)" U (!F"(i2.u2.p7==1)" U "((i2.u2.p1==1)&&(u1.p4==1))")))
[2020-05-26 09:00:39] [INFO ] Computed 19 place invariants in 11 ms
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.046828,18804,1,0,2383,123,813,2627,199,230,6431
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA SmartHome-PT-03-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!(F(G("((i8.u5.p17!=1)||(i8.u13.p35!=1))")))))
Formula 2 simplified : FG"((i8.u5.p17!=1)||(i8.u13.p35!=1))"
4 unique states visited
4 strongly connected components in search stack
5 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.050004,18804,1,0,2497,123,836,2830,200,231,7011
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA SmartHome-PT-03-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(X(F(X(!(F(G("(u1.p3==1)")))))))))
Formula 3 simplified : !GXFX!FG"(u1.p3==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.051873,19020,1,0,2618,123,880,2946,200,231,7427
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA SmartHome-PT-03-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((F((X("(i6.u10.p28!=1)"))U(G(X("(i6.u10.p28==1)")))))&&(G(F(X("(i9.u7.p19!=1)"))))))
Formula 4 simplified : !(F(X"(i6.u10.p28!=1)" U GX"(i6.u10.p28==1)") & GFX"(i9.u7.p19!=1)")
3 unique states visited
2 strongly connected components in search stack
4 transitions explored
3 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.055172,19284,1,0,2897,123,907,3218,200,231,8354
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA SmartHome-PT-03-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F((F("(((i6.u10.p28==1)&&(i4.u15.p42==1))&&(i6.u16.p44==1))"))||(F(G("((i2.u2.p1==1)&&(i2.u4.p14==1))"))))))
Formula 5 simplified : !F(F"(((i6.u10.p28==1)&&(i4.u15.p42==1))&&(i6.u16.p44==1))" | FG"((i2.u2.p1==1)&&(i2.u4.p14==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.078859,20488,1,0,6730,123,955,6677,200,241,13334
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA SmartHome-PT-03-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(X((F(G((((X("((i9.u7.p20==1)&&(u0.p31==1))"))&&("(i9.u7.p20==1)"))&&("(u0.p31==1)"))&&("(u0.p12==1)"))))&&("(u0.p12==1)")))))
Formula 6 simplified : !GX("(u0.p12==1)" & FG("(i9.u7.p20==1)" & "(u0.p12==1)" & "(u0.p31==1)" & X"((i9.u7.p20==1)&&(u0.p31==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.081591,21024,1,0,6753,123,1017,6701,207,241,13518
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA SmartHome-PT-03-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((("(u3.p11==1)")U((!(F("(i6.u10.p26!=1)")))U(X("(u3.p11==1)")))))
Formula 7 simplified : !("(u3.p11==1)" U (!F"(i6.u10.p26!=1)" U X"(u3.p11==1)"))
3 unique states visited
0 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.082869,21264,1,0,6753,123,1029,6701,207,241,13567
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA SmartHome-PT-03-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((!(X((X("((i2.u2.p1==1)&&(i7.u11.p30==1))"))U(("(((i2.u2.p1==1)&&(i2.u2.p8==1))||(i6.u10.p27==1))")U("((i6.u10.p28==1)&&(u0.p31==1))"))))))
Formula 8 simplified : X(X"((i2.u2.p1==1)&&(i7.u11.p30==1))" U ("(((i2.u2.p1==1)&&(i2.u2.p8==1))||(i6.u10.p27==1))" U "((i6.u10.p28==1)&&(u0.p31==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.084145,21264,1,0,6756,123,1046,6707,209,241,13617
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA SmartHome-PT-03-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((X(F(!(G("((u1.p4==1)&&(u0.p31==1))")))))&&((("((i2.u2.p1==1)&&(u9.p25==1))")U("((i2.u2.p1!=1)||(u9.p25!=1))"))||((F("((i6.u10.p28==1)&&(u0.p31==1))"))U("((u0.p15==1)&&(u0.p31==1))")))))
Formula 9 simplified : !(XF!G"((u1.p4==1)&&(u0.p31==1))" & (("((i2.u2.p1==1)&&(u9.p25==1))" U "((i2.u2.p1!=1)||(u9.p25!=1))") | (F"((i6.u10.p28==1)&&(u0.p31==1))" U "((u0.p15==1)&&(u0.p31==1))")))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.088325,21400,1,0,6923,123,1132,6881,214,241,14265
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA SmartHome-PT-03-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((((F("((i2.u2.p1==1)&&(u1.p4==1))"))U("((u3.p11==1)&&(u0.p31==1))"))&&((G(X("((u3.p11==1)&&(u0.p31==1))")))U(F("(u1.p4==1)")))))
Formula 10 simplified : !((F"((i2.u2.p1==1)&&(u1.p4==1))" U "((u3.p11==1)&&(u0.p31==1))") & (GX"((u3.p11==1)&&(u0.p31==1))" U F"(u1.p4==1)"))
4 unique states visited
0 strongly connected components in search stack
3 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.089656,21584,1,0,6923,123,1167,6881,214,241,14342
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA SmartHome-PT-03-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X((G("(i7.u11.p30!=1)"))U(!(X(X("(u9.p25==1)")))))))
Formula 11 simplified : !X(G"(i7.u11.p30!=1)" U !XX"(u9.p25==1)")
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.09224,21584,1,0,7073,124,1172,7048,214,250,14765
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA SmartHome-PT-03-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((F("(i6.u10.p28==1)")))
Formula 12 simplified : !F"(i6.u10.p28==1)"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.09261,21584,1,0,7073,124,1176,7049,214,250,14801
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA SmartHome-PT-03-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-26 09:00:39] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout :(error "Failed to check-sat")
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:116)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
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-26 09:00:39] [INFO ] Built C files in 255ms 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 1590483640254

--------------------
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="SmartHome-PT-03"
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 SmartHome-PT-03, 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 r227-oct2-159033546100018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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