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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.0K Apr 12 07:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 12 07:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 11 08:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 11 08:54 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.1K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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.1K Apr 10 14:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 10 14:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 9 21:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 9 21:19 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 13K 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-02-00
FORMULA_NAME Raft-PT-02-01
FORMULA_NAME Raft-PT-02-02
FORMULA_NAME Raft-PT-02-03
FORMULA_NAME Raft-PT-02-04
FORMULA_NAME Raft-PT-02-05
FORMULA_NAME Raft-PT-02-06
FORMULA_NAME Raft-PT-02-07
FORMULA_NAME Raft-PT-02-08
FORMULA_NAME Raft-PT-02-09
FORMULA_NAME Raft-PT-02-10
FORMULA_NAME Raft-PT-02-11
FORMULA_NAME Raft-PT-02-12
FORMULA_NAME Raft-PT-02-13
FORMULA_NAME Raft-PT-02-14
FORMULA_NAME Raft-PT-02-15

=== Now, execution of the tool begins

BK_START 1590053337661

[2020-05-21 09:29:00] [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:29:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 09:29:00] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2020-05-21 09:29:00] [INFO ] Transformed 28 places.
[2020-05-21 09:29:00] [INFO ] Transformed 52 transitions.
[2020-05-21 09:29:00] [INFO ] Found NUPN structural information;
[2020-05-21 09:29:00] [INFO ] Parsed PT model containing 28 places and 52 transitions in 112 ms.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 268 ms. (steps per millisecond=373 ) properties seen :[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]
[2020-05-21 09:29:00] [INFO ] Flow matrix only has 36 transitions (discarded 6 similar events)
// Phase 1: matrix 36 rows 28 cols
[2020-05-21 09:29:00] [INFO ] Computed 4 place invariants in 5 ms
[2020-05-21 09:29:00] [INFO ] [Real]Absence check using 4 positive place invariants in 15 ms returned sat
[2020-05-21 09:29:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 09:29:01] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2020-05-21 09:29:01] [INFO ] State equation strengthened by 14 read => feed constraints.
[2020-05-21 09:29:01] [INFO ] [Real]Added 14 Read/Feed constraints in 8 ms returned sat
[2020-05-21 09:29:01] [INFO ] Computed and/alt/rep : 41/199/35 causal constraints in 10 ms.
[2020-05-21 09:29:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 09:29:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 13 ms returned sat
[2020-05-21 09:29:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 09:29:01] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2020-05-21 09:29:01] [INFO ] [Nat]Added 14 Read/Feed constraints in 7 ms returned sat
[2020-05-21 09:29:01] [INFO ] Computed and/alt/rep : 41/199/35 causal constraints in 8 ms.
[2020-05-21 09:29:01] [INFO ] Added : 34 causal constraints over 7 iterations in 81 ms. Result :sat
[2020-05-21 09:29:01] [INFO ] Deduced a trap composed of 5 places in 60 ms
[2020-05-21 09:29:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2020-05-21 09:29:01] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-21 09:29:01] [INFO ] Flatten gal took : 55 ms
FORMULA Raft-PT-02-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-02-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-02-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-02-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-02-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-21 09:29:01] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-21 09:29:01] [INFO ] Applying decomposition
[2020-05-21 09:29:01] [INFO ] Flatten gal took : 15 ms
[2020-05-21 09:29:01] [INFO ] Input system was already deterministic with 42 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/graph8220938790215802327.txt, -o, /tmp/graph8220938790215802327.bin, -w, /tmp/graph8220938790215802327.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/graph8220938790215802327.bin, -l, -1, -v, -w, /tmp/graph8220938790215802327.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 36 out of 42 initially.
// Phase 1: matrix 36 rows 28 cols
[2020-05-21 09:29:01] [INFO ] Decomposing Gal with order
[2020-05-21 09:29:01] [INFO ] Computed 4 place invariants in 9 ms
inv : p0 + p11 + p12 + p13 + p14 + p15 = 1
[2020-05-21 09:29:01] [INFO ] Rewriting arrays to variables to allow decomposition.
inv : p0 + p6 + p7 + p8 + p9 + p10 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 = 1
inv : p0 + p16 + p17 + p18 + p19 + p20 = 1
Total of 4 invariants.
[2020-05-21 09:29:01] [INFO ] Computed 4 place invariants in 17 ms
[2020-05-21 09:29:02] [INFO ] Removed a total of 22 redundant transitions.
[2020-05-21 09:29:02] [INFO ] Proved 28 variables to be positive in 121 ms
[2020-05-21 09:29:02] [INFO ] Computing symmetric may disable matrix : 42 transitions.
[2020-05-21 09:29:02] [INFO ] Computation of disable matrix completed :0/42 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 09:29:02] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 09:29:02] [INFO ] Computing symmetric may enable matrix : 42 transitions.
[2020-05-21 09:29:02] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 09:29:02] [INFO ] Flatten gal took : 91 ms
[2020-05-21 09:29:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 5 ms.
[2020-05-21 09:29:02] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
[2020-05-21 09:29:02] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 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 11 LTL properties
Checking formula 0 : !(((("(i1.u3.p15==1)")U((X(!(G("(i2.u5.p20==1)"))))U(X(G("(i1.u3.p15==1)")))))&&(!(X("(i2.u5.p20!=1)")))))
Formula 0 simplified : !(("(i1.u3.p15==1)" U (X!G"(i2.u5.p20==1)" U XG"(i1.u3.p15==1)")) & !X"(i2.u5.p20!=1)")
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions i1.t16, i1.u3.t12, i1.u3.t13, i2.t8, i2.u5.t6, i2.u5.t7, i4.t51, i4.u8.t49, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/24/8/32
7 unique states visited
5 strongly connected components in search stack
7 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.056666,18228,1,0,922,157,493,1277,160,316,2537
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Raft-PT-02-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((!(G(F((G(X(((("(u7.p0==1)")U("(i1.u3.p15==1)"))||("(i2.u5.p19==1)"))||("(u7.p0==1)"))))U(X("(u7.p0==1)")))))))
Formula 1 simplified : GF(GX("(i2.u5.p19==1)" | "(u7.p0==1)" | ("(u7.p0==1)" U "(i1.u3.p15==1)")) U X"(u7.p0==1)")
3 unique states visited
0 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.061616,18524,1,0,1026,157,506,1439,162,316,2928
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Raft-PT-02-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(X(F((!(F((!(G("(i4.u8.p26==1)")))&&("((u0.p4!=1)||(i2.u5.p20!=1))"))))||("((u0.p4==1)&&(i2.u5.p20==1))"))))))
Formula 2 simplified : !GXF("((u0.p4==1)&&(i2.u5.p20==1))" | !F("((u0.p4!=1)||(i2.u5.p20!=1))" & !G"(i4.u8.p26==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.070306,18816,1,0,1246,157,567,1725,164,336,3599
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Raft-PT-02-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(!(F(G((F(!(F("((i4.u8.p26==1)||(i1.u3.p15==1))"))))&&("((i1.u3.p15!=1)||(u7.p21!=1))")))))))
Formula 3 simplified : !F!FG("((i1.u3.p15!=1)||(u7.p21!=1))" & F!F"((i4.u8.p26==1)||(i1.u3.p15==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.076759,18984,1,0,1490,157,592,1983,164,337,4222
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Raft-PT-02-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((!(("(i4.u8.p25==1)")U(F(((X("((i1.u3.p15==1)&&(i4.u6.p23==1))"))||("((i2.u4.p16==1)&&(i4.u8.p27==1))"))||("((u1.p9==1)&&(i1.u3.p15==1))")))))&&(F("((i1.u2.p11==1)&&(i4.u8.p27==1))"))))
Formula 4 simplified : !(!("(i4.u8.p25==1)" U F("((i2.u4.p16==1)&&(i4.u8.p27==1))" | "((u1.p9==1)&&(i1.u3.p15==1))" | X"((i1.u3.p15==1)&&(i4.u6.p23==1))")) & F"((i1.u2.p11==1)&&(i4.u8.p27==1))")
5 unique states visited
5 strongly connected components in search stack
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.101627,19808,1,0,2735,157,659,3507,165,352,7350
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Raft-PT-02-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(X("((i1.u3.p13==1)&&(i4.u8.p27==1))"))))
Formula 5 simplified : !FX"((i1.u3.p13==1)&&(i4.u8.p27==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.112936,20072,1,0,3308,157,679,4360,165,356,8791
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Raft-PT-02-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(X("((u1.p9==1)&&(i1.u3.p15==1))"))))
Formula 6 simplified : !GX"((u1.p9==1)&&(i1.u3.p15==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.115701,20332,1,0,3314,157,696,4366,165,356,8827
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Raft-PT-02-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((!(X(!(F(X(X("(i4.u8.p26!=1)")))))))||(!(X("(i4.u8.p26==1)")))))
Formula 7 simplified : !(!X!FXX"(i4.u8.p26!=1)" | !X"(i4.u8.p26==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.116967,20332,1,0,3314,157,697,4366,165,356,8830
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA Raft-PT-02-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(G(F("((i2.u5.p20==1)&&(u7.p21==1))")))))
Formula 8 simplified : !FGF"((i2.u5.p20==1)&&(u7.p21==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.119961,20332,1,0,3383,157,714,4461,165,356,9048
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Raft-PT-02-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F((F(G(F((G(((F("((u0.p5==1)&&(i1.u3.p15==1))"))&&("(u0.p5==1)"))&&("(i1.u3.p15==1)")))||(G(F("(i1.u2.p12==1)")))))))||("(i1.u2.p12==1)"))))
Formula 9 simplified : !F("(i1.u2.p12==1)" | FGF(G("(i1.u3.p15==1)" & "(u0.p5==1)" & F"((u0.p5==1)&&(i1.u3.p15==1))") | GF"(i1.u2.p12==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.129241,20512,1,0,3746,157,776,4959,166,358,10205
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Raft-PT-02-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(F(X(F(X("(i2.u4.p17==1)")))))))
Formula 10 simplified : !XFXFX"(i2.u4.p17==1)"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.13495,20512,1,0,4103,157,790,5350,166,359,11090
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Raft-PT-02-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-21 09:29:02] [WARNING] Script execution failed on command (assert (and (and (>= (select s0 13) 1) (>= (select s0 27) 1)) (= (store (store s0 26 (+ (select s0 26) 1)) 27 (- (select s0 27) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Broken pipe (and (and (>= (select s0 13) 1) (>= (select s0 27) 1)) (= (store (store s0 26 (+ (select s0 26) 1)) 27 (- (select s0 27) 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-21 09:29:02] [INFO ] Built C files in 501ms 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 1590053343539

--------------------
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-02"
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-02, 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-158961510700218"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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