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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 3.4K Apr 12 08:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 12 08:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 11 09:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 11 09:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 10 14:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 10 14:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 9 21:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 9 21:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 4 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 249K 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 Railroad-PT-020-00
FORMULA_NAME Railroad-PT-020-01
FORMULA_NAME Railroad-PT-020-02
FORMULA_NAME Railroad-PT-020-03
FORMULA_NAME Railroad-PT-020-04
FORMULA_NAME Railroad-PT-020-05
FORMULA_NAME Railroad-PT-020-06
FORMULA_NAME Railroad-PT-020-07
FORMULA_NAME Railroad-PT-020-08
FORMULA_NAME Railroad-PT-020-09
FORMULA_NAME Railroad-PT-020-10
FORMULA_NAME Railroad-PT-020-11
FORMULA_NAME Railroad-PT-020-12
FORMULA_NAME Railroad-PT-020-13
FORMULA_NAME Railroad-PT-020-14
FORMULA_NAME Railroad-PT-020-15

=== Now, execution of the tool begins

BK_START 1590073026974

[2020-05-21 14:57:09] [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 14:57:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 14:57:10] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2020-05-21 14:57:10] [INFO ] Transformed 218 places.
[2020-05-21 14:57:10] [INFO ] Transformed 506 transitions.
[2020-05-21 14:57:10] [INFO ] Parsed PT model containing 218 places and 506 transitions in 226 ms.
Deduced a syphon composed of 61 places in 5 ms
Reduce places removed 61 places and 20 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 36 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 828 ms. (steps per millisecond=120 ) properties seen :[1, 0, 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, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1]
// Phase 1: matrix 486 rows 157 cols
[2020-05-21 14:57:11] [INFO ] Invariants computation overflowed in 39 ms
[2020-05-21 14:57:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 14:57:11] [INFO ] [Real]Absence check using state equation in 366 ms returned sat
[2020-05-21 14:57:11] [INFO ] Computed and/alt/rep : 466/9311/466 causal constraints in 110 ms.
[2020-05-21 14:57:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 14:57:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 14:57:12] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2020-05-21 14:57:12] [INFO ] Computed and/alt/rep : 466/9311/466 causal constraints in 119 ms.
[2020-05-21 14:57:28] [INFO ] Added : 430 causal constraints over 86 iterations in 16381 ms. Result :unknown
[2020-05-21 14:57:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 14:57:28] [INFO ] [Real]Absence check using state equation in 182 ms returned unsat
[2020-05-21 14:57:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 14:57:29] [INFO ] [Real]Absence check using state equation in 363 ms returned sat
[2020-05-21 14:57:29] [INFO ] Computed and/alt/rep : 466/9311/466 causal constraints in 74 ms.
[2020-05-21 14:57:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 14:57:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 14:57:29] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2020-05-21 14:57:29] [INFO ] Computed and/alt/rep : 466/9311/466 causal constraints in 72 ms.
[2020-05-21 14:57:39] [INFO ] Added : 466 causal constraints over 94 iterations in 10127 ms. Result :sat
[2020-05-21 14:57:39] [INFO ] Deduced a trap composed of 21 places in 54 ms
[2020-05-21 14:57:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2020-05-21 14:57:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 14:57:40] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2020-05-21 14:57:40] [INFO ] Computed and/alt/rep : 466/9311/466 causal constraints in 59 ms.
[2020-05-21 14:57:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 14:57:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 14:57:41] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2020-05-21 14:57:41] [INFO ] Computed and/alt/rep : 466/9311/466 causal constraints in 57 ms.
[2020-05-21 14:57:55] [INFO ] Added : 450 causal constraints over 90 iterations in 14489 ms. Result :unknown
[2020-05-21 14:57:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 14:57:55] [INFO ] [Real]Absence check using state equation in 334 ms returned sat
[2020-05-21 14:57:55] [INFO ] Computed and/alt/rep : 466/9311/466 causal constraints in 27 ms.
[2020-05-21 14:57:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 14:57:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 14:57:56] [INFO ] [Nat]Absence check using state equation in 372 ms returned sat
[2020-05-21 14:57:56] [INFO ] Computed and/alt/rep : 466/9311/466 causal constraints in 56 ms.
[2020-05-21 14:58:10] [INFO ] Added : 450 causal constraints over 90 iterations in 13839 ms. Result :unknown
[2020-05-21 14:58:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 14:58:10] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2020-05-21 14:58:10] [INFO ] Computed and/alt/rep : 466/9311/466 causal constraints in 48 ms.
[2020-05-21 14:58:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 14:58:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 14:58:11] [INFO ] [Nat]Absence check using state equation in 352 ms returned sat
[2020-05-21 14:58:11] [INFO ] Computed and/alt/rep : 466/9311/466 causal constraints in 58 ms.
[2020-05-21 14:58:20] [INFO ] Added : 260 causal constraints over 52 iterations in 9431 ms. Result :unknown
[2020-05-21 14:58:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 14:58:21] [INFO ] [Real]Absence check using state equation in 377 ms returned sat
[2020-05-21 14:58:21] [INFO ] Computed and/alt/rep : 466/9311/466 causal constraints in 61 ms.
[2020-05-21 14:58:21] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 14:58:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 14:58:21] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2020-05-21 14:58:21] [INFO ] Computed and/alt/rep : 466/9311/466 causal constraints in 47 ms.
[2020-05-21 14:58:31] [INFO ] Added : 425 causal constraints over 85 iterations in 10200 ms. Result :sat
[2020-05-21 14:58:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 14:58:32] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2020-05-21 14:58:32] [INFO ] Computed and/alt/rep : 466/9311/466 causal constraints in 27 ms.
[2020-05-21 14:58:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 14:58:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 14:58:32] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2020-05-21 14:58:32] [INFO ] Computed and/alt/rep : 466/9311/466 causal constraints in 57 ms.
[2020-05-21 14:58:45] [INFO ] Added : 425 causal constraints over 85 iterations in 12776 ms. Result :unknown
[2020-05-21 14:58:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 14:58:45] [INFO ] [Real]Absence check using state equation in 77 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-05-21 14:58:45] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-21 14:58:45] [INFO ] Flatten gal took : 130 ms
FORMULA Railroad-PT-020-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-020-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-020-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-020-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-21 14:58:45] [INFO ] Flatten gal took : 66 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-21 14:58:46] [INFO ] Applying decomposition
[2020-05-21 14:58:46] [INFO ] Flatten gal took : 67 ms
[2020-05-21 14:58:46] [INFO ] Input system was already deterministic with 486 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/graph12646390199153223878.txt, -o, /tmp/graph12646390199153223878.bin, -w, /tmp/graph12646390199153223878.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/graph12646390199153223878.bin, -l, -1, -v, -w, /tmp/graph12646390199153223878.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-21 14:58:46] [INFO ] Decomposing Gal with order
[2020-05-21 14:58:46] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 486 rows 157 cols
[2020-05-21 14:58:46] [INFO ] Invariants computation overflowed in 13 ms
Total of 0 invariants.
[2020-05-21 14:58:46] [INFO ] Computed 0 place invariants in 14 ms
[2020-05-21 14:58:46] [INFO ] Removed a total of 1242 redundant transitions.
[2020-05-21 14:58:46] [INFO ] Flatten gal took : 194 ms
[2020-05-21 14:58:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 32 ms.
[2020-05-21 14:58:46] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 20 ms
[2020-05-21 14:58:46] [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 12 LTL properties
Checking formula 0 : !((!((F("(((i6.i0.u10.pl_P21_5>=1)&&(i15.u17.pl_P23_12>=1))&&(i6.i0.u10.pl_P36_1>=1))"))U((!(X("(((i7.u11.pl_P21_21<1)||(i14.u18.pl_P23_13<1))||(i6.i0.u10.pl_P36_1<1))")))U("(((i7.u8.pl_P21_16>=1)&&(i18.u14.pl_P23_1>=1))&&(i6.i0.u10.pl_P36_1>=1))")))))
Formula 0 simplified : F"(((i6.i0.u10.pl_P21_5>=1)&&(i15.u17.pl_P23_12>=1))&&(i6.i0.u10.pl_P36_1>=1))" U (!X"(((i7.u11.pl_P21_21<1)||(i14.u18.pl_P23_13<1))||(i6.i0.u10.pl_P36_1<1))" U "(((i7.u8.pl_P21_16>=1)&&(i18.u14.pl_P23_1>=1))&&(i6.i0.u10.pl_P36_1>=1))")
built 90 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 17 ordering constraints for composite.
built 5 ordering constraints for composite.
built 12 ordering constraints for composite.
built 29 ordering constraints for composite.
built 21 ordering constraints for composite.
built 12 ordering constraints for composite.
built 19 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
[2020-05-21 14:58:47] [INFO ] Proved 157 variables to be positive in 659 ms
[2020-05-21 14:58:47] [INFO ] Computing symmetric may disable matrix : 486 transitions.
[2020-05-21 14:58:47] [INFO ] Computation of disable matrix completed :0/486 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 14:58:47] [INFO ] Computation of Complete disable matrix. took 96 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 14:58:47] [INFO ] Computing symmetric may enable matrix : 486 transitions.
[2020-05-21 14:58:47] [INFO ] Computation of Complete enable matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions tr_T10_1, tr_T43_1, tr_T50_10, tr_T50_11, tr_T50_12, tr_T50_14, tr_T50_16, tr_T50_17, tr_T50_19, tr_T50_20, tr_T50_3, tr_T50_6, tr_T50_8, tr_T50_9, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/332/14/346
[2020-05-21 14:58:53] [INFO ] Computing symmetric co enabling matrix : 486 transitions.
[2020-05-21 14:58:54] [INFO ] Computation of co-enabling matrix(0/486) took 40 ms. Total solver calls (SAT/UNSAT): 39(39/0)
[2020-05-21 14:58:57] [INFO ] Computation of co-enabling matrix(34/486) took 3095 ms. Total solver calls (SAT/UNSAT): 3780(3780/0)
[2020-05-21 14:59:00] [INFO ] Computation of co-enabling matrix(44/486) took 6099 ms. Total solver calls (SAT/UNSAT): 7845(7845/0)
6 unique states visited
6 strongly connected components in search stack
8 transitions explored
6 items max in DFS search stack
1541 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,15.4637,263980,1,0,430626,739,4191,918800,424,1902,754983
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Railroad-PT-020-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F(X(X((G((F("(((i5.u7.pl_P21_14>=1)&&(i10.u37.pl_P23_2>=1))&&(i6.i0.u10.pl_P36_1>=1))"))&&("(((i6.i1.u13.pl_P21_9<1)||(i17.u23.pl_P23_20<1))||(i6.i0.u10.pl_P36_1<1))")))&&(G("((((i5.u7.pl_P21_14>=1)&&(i10.u37.pl_P23_2>=1))&&(i6.i0.u10.pl_P36_1>=1))||(((i7.u11.pl_P21_21>=1)&&(i6.i0.u35.pl_P23_15>=1))&&(i6.i0.u10.pl_P36_1>=1)))"))))))))
Formula 1 simplified : !GFXX(G("(((i6.i1.u13.pl_P21_9<1)||(i17.u23.pl_P23_20<1))||(i6.i0.u10.pl_P36_1<1))" & F"(((i5.u7.pl_P21_14>=1)&&(i10.u37.pl_P23_2>=1))&&(i6.i0.u10.pl_P36_1>=1))") & G"((((i5.u7.pl_P21_14>=1)&&(i10.u37.pl_P23_2>=1))&&(i6.i0.u10.pl_P36_1>=1))||(((i7.u11.pl_P21_21>=1)&&(i6.i0.u35.pl_P23_15>=1))&&(i6.i0.u10.pl_P36_1>=1)))")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
28 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,15.7546,271052,1,0,438329,739,4277,951171,424,1902,772956
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Railroad-PT-020-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(F("((((i7.u9.pl_P21_19>=1)&&(i16.u40.pl_P23_7>=1))&&(i6.i0.u10.pl_P36_1>=1))||(((i6.i0.u10.pl_P21_4>=1)&&(i6.i0.u35.pl_P23_15>=1))&&(i6.i0.u10.pl_P36_1>=1)))"))))
Formula 2 simplified : !GF"((((i7.u9.pl_P21_19>=1)&&(i16.u40.pl_P23_7>=1))&&(i6.i0.u10.pl_P36_1>=1))||(((i6.i0.u10.pl_P21_4>=1)&&(i6.i0.u35.pl_P23_15>=1))&&(i6.i0.u10.pl_P36_1>=1)))"
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
15 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,15.9055,272896,1,0,440740,739,4335,963748,426,1902,777948
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Railroad-PT-020-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((F((G(((((X("(((i5.u6.pl_P21_11>=1)&&(i15.u17.pl_P23_12>=1))&&(i6.i0.u10.pl_P36_1>=1))"))U("(((i6.i1.u12.pl_P21_8>=1)&&(i15.u17.pl_P23_12>=1))&&(i6.i0.u10.pl_P36_1>=1))"))&&("(i6.i1.u13.pl_P21_9>=1)"))&&("(i10.u37.pl_P23_2>=1)"))&&("(i6.i0.u10.pl_P36_1>=1)")))||("(((i6.i0.u10.pl_P21_6>=1)&&(i1.u38.pl_P23_4>=1))&&(i6.i0.u10.pl_P36_1>=1))")))||(X(F(G("(((i5.u7.pl_P21_13>=1)&&(i11.u15.pl_P23_10>=1))&&(i6.i0.u10.pl_P36_1>=1))"))))))
Formula 3 simplified : !(F("(((i6.i0.u10.pl_P21_6>=1)&&(i1.u38.pl_P23_4>=1))&&(i6.i0.u10.pl_P36_1>=1))" | G("(i6.i0.u10.pl_P36_1>=1)" & "(i6.i1.u13.pl_P21_9>=1)" & "(i10.u37.pl_P23_2>=1)" & (X"(((i5.u6.pl_P21_11>=1)&&(i15.u17.pl_P23_12>=1))&&(i6.i0.u10.pl_P36_1>=1))" U "(((i6.i1.u12.pl_P21_8>=1)&&(i15.u17.pl_P23_12>=1))&&(i6.i0.u10.pl_P36_1>=1))"))) | XFG"(((i5.u7.pl_P21_13>=1)&&(i11.u15.pl_P23_10>=1))&&(i6.i0.u10.pl_P36_1>=1))")
[2020-05-21 14:59:03] [INFO ] Computation of co-enabling matrix(65/486) took 9147 ms. Total solver calls (SAT/UNSAT): 11590(11590/0)
[2020-05-21 14:59:06] [INFO ] Computation of co-enabling matrix(76/486) took 12237 ms. Total solver calls (SAT/UNSAT): 15847(15847/0)
[2020-05-21 14:59:09] [INFO ] Computation of co-enabling matrix(87/486) took 15455 ms. Total solver calls (SAT/UNSAT): 19983(19983/0)
[2020-05-21 14:59:12] [INFO ] Computation of co-enabling matrix(98/486) took 18530 ms. Total solver calls (SAT/UNSAT): 23998(23998/0)
[2020-05-21 14:59:15] [INFO ] Computation of co-enabling matrix(108/486) took 21693 ms. Total solver calls (SAT/UNSAT): 27543(27543/0)
[2020-05-21 14:59:18] [INFO ] Computation of co-enabling matrix(119/486) took 24919 ms. Total solver calls (SAT/UNSAT): 31327(31327/0)
[2020-05-21 14:59:22] [INFO ] Computation of co-enabling matrix(130/486) took 28034 ms. Total solver calls (SAT/UNSAT): 34990(34990/0)
[2020-05-21 14:59:25] [INFO ] Computation of co-enabling matrix(141/486) took 31170 ms. Total solver calls (SAT/UNSAT): 38532(38532/0)
[2020-05-21 14:59:28] [INFO ] Computation of co-enabling matrix(152/486) took 34444 ms. Total solver calls (SAT/UNSAT): 41953(41953/0)
[2020-05-21 14:59:31] [INFO ] Computation of co-enabling matrix(162/486) took 37755 ms. Total solver calls (SAT/UNSAT): 44958(44958/0)
[2020-05-21 14:59:34] [INFO ] Computation of co-enabling matrix(171/486) took 40776 ms. Total solver calls (SAT/UNSAT): 47577(47577/0)
[2020-05-21 14:59:38] [INFO ] Computation of co-enabling matrix(181/486) took 44048 ms. Total solver calls (SAT/UNSAT): 50392(50392/0)
[2020-05-21 14:59:41] [INFO ] Computation of co-enabling matrix(192/486) took 47113 ms. Total solver calls (SAT/UNSAT): 53373(53373/0)
[2020-05-21 14:59:44] [INFO ] Computation of co-enabling matrix(208/486) took 50268 ms. Total solver calls (SAT/UNSAT): 57493(57493/0)
[2020-05-21 14:59:47] [INFO ] Computation of co-enabling matrix(225/486) took 53397 ms. Total solver calls (SAT/UNSAT): 61590(61590/0)
[2020-05-21 14:59:50] [INFO ] Computation of co-enabling matrix(243/486) took 56419 ms. Total solver calls (SAT/UNSAT): 65613(65613/0)
[2020-05-21 14:59:53] [INFO ] Computation of co-enabling matrix(262/486) took 59466 ms. Total solver calls (SAT/UNSAT): 69508(69508/0)
[2020-05-21 14:59:56] [INFO ] Computation of co-enabling matrix(283/486) took 62512 ms. Total solver calls (SAT/UNSAT): 73393(73393/0)
[2020-05-21 14:59:59] [INFO ] Computation of co-enabling matrix(307/486) took 65556 ms. Total solver calls (SAT/UNSAT): 77293(77293/0)
[2020-05-21 15:00:02] [INFO ] Computation of co-enabling matrix(334/486) took 68561 ms. Total solver calls (SAT/UNSAT): 80992(80992/0)
[2020-05-21 15:00:05] [INFO ] Computation of co-enabling matrix(367/486) took 71600 ms. Total solver calls (SAT/UNSAT): 84523(84523/0)
[2020-05-21 15:00:08] [INFO ] Computation of co-enabling matrix(416/486) took 74610 ms. Total solver calls (SAT/UNSAT): 87757(87757/0)
[2020-05-21 15:00:10] [INFO ] Computation of Finished co-enabling matrix. took 76229 ms. Total solver calls (SAT/UNSAT): 88771(88771/0)
[2020-05-21 15:00:10] [INFO ] Computing Do-Not-Accords matrix : 486 transitions.
18 unique states visited
2 strongly connected components in search stack
18 transitions explored
18 items max in DFS search stack
17504 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,190.951,1723956,1,0,3.17977e+06,739,4664,3.24676e+06,431,1902,4302882
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Railroad-PT-020-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((!(G("(((i7.u8.pl_P21_15<1)||(i4.u26.pl_P23_8<1))||(i6.i0.u10.pl_P36_1<1))"))))
Formula 4 simplified : G"(((i7.u8.pl_P21_15<1)||(i4.u26.pl_P23_8<1))||(i6.i0.u10.pl_P36_1<1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
266 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,193.619,1764876,1,0,3.28176e+06,739,4724,3.31569e+06,431,1902,4449089
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Railroad-PT-020-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((F(((X("(((i7.u9.pl_P21_19>=1)&&(i11.u15.pl_P23_10>=1))&&(i6.i0.u10.pl_P36_1>=1))"))&&("(((i5.u7.pl_P21_13<1)||(i12.u39.pl_P23_5<1))||(i6.i0.u10.pl_P36_1<1))"))||(G("(((i7.u9.pl_P21_19>=1)&&(i6.i0.u41.pl_P23_9>=1))&&(i6.i0.u10.pl_P36_1>=1))"))))||(G(X("(((i5.u7.pl_P21_13>=1)&&(i12.u39.pl_P23_5>=1))&&(i6.i0.u10.pl_P36_1>=1))")))))
Formula 5 simplified : !(F(("(((i5.u7.pl_P21_13<1)||(i12.u39.pl_P23_5<1))||(i6.i0.u10.pl_P36_1<1))" & X"(((i7.u9.pl_P21_19>=1)&&(i11.u15.pl_P23_10>=1))&&(i6.i0.u10.pl_P36_1>=1))") | G"(((i7.u9.pl_P21_19>=1)&&(i6.i0.u41.pl_P23_9>=1))&&(i6.i0.u10.pl_P36_1>=1))") | GX"(((i5.u7.pl_P21_13>=1)&&(i12.u39.pl_P23_5>=1))&&(i6.i0.u10.pl_P36_1>=1))")
[2020-05-21 15:04:10] [INFO ] Computation of Completed DNA matrix. took 240324 ms. Total solver calls (SAT/UNSAT): 10109(0/10109)
[2020-05-21 15:04:10] [INFO ] Built C files in 324594ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Compilation finished in 8042 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 59 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( <>(( ( X((LTLAP15==true)) ) && ( (LTLAP16==true) )) || ( []((LTLAP17==true))) )) || ( [](X((LTLAP18==true)))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( <>(( ( X((LTLAP15==true)) ) && ( (LTLAP16==true) )) || ( []((LTLAP17==true))) )) || ( [](X((LTLAP18==true)))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( <>(( ( X((LTLAP15==true)) ) && ( (LTLAP16==true) )) || ( []((LTLAP17==true))) )) || ( [](X((LTLAP18==true)))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
28 unique states visited
4 strongly connected components in search stack
28 transitions explored
28 items max in DFS search stack
43783 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,631.45,6225888,1,0,1.08827e+07,739,4931,1.0264e+07,431,1915,14637926
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Railroad-PT-020-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(((G("(((i7.u8.pl_P21_15>=1)&&(i14.u18.pl_P23_13>=1))&&(i6.i0.u10.pl_P36_1>=1))"))||(X("(((i6.i0.u10.pl_P21_2>=1)&&(i6.i0.u41.pl_P23_9>=1))&&(i6.i0.u10.pl_P36_1>=1))")))||((!(X(!(F("(((i7.u9.pl_P21_18>=1)&&(i14.u18.pl_P23_13>=1))&&(i6.i0.u10.pl_P36_1>=1))")))))&&(G("(((i7.u9.pl_P21_18>=1)&&(i14.u18.pl_P23_13>=1))&&(i6.i0.u10.pl_P36_1>=1))"))))))
Formula 6 simplified : !X(G"(((i7.u8.pl_P21_15>=1)&&(i14.u18.pl_P23_13>=1))&&(i6.i0.u10.pl_P36_1>=1))" | X"(((i6.i0.u10.pl_P21_2>=1)&&(i6.i0.u41.pl_P23_9>=1))&&(i6.i0.u10.pl_P36_1>=1))" | (!X!F"(((i7.u9.pl_P21_18>=1)&&(i14.u18.pl_P23_13>=1))&&(i6.i0.u10.pl_P36_1>=1))" & G"(((i7.u9.pl_P21_18>=1)&&(i14.u18.pl_P23_13>=1))&&(i6.i0.u10.pl_P36_1>=1))"))
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
5337 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,684.821,6222260,1,0,1.08854e+07,739,1969,1.02723e+07,240,1915,63894
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Railroad-PT-020-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!(F(X(F("(((i3.u3.pl_P113_1>=1)&&(i6.i0.u10.pl_P21_4>=1))&&(i6.i0.u10.pl_P36_1>=1))"))))))
Formula 7 simplified : FXF"(((i3.u3.pl_P113_1>=1)&&(i6.i0.u10.pl_P21_4>=1))&&(i6.i0.u10.pl_P36_1>=1))"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
151 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,686.339,6222260,1,0,1.08854e+07,739,2513,1.02723e+07,283,1915,187981
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Railroad-PT-020-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(F(X(F(F("(((i7.u11.pl_P21_20>=1)&&(i17.u23.pl_P23_20>=1))&&(i6.i0.u10.pl_P36_1>=1))")))))))
Formula 8 simplified : !XFXF"(((i7.u11.pl_P21_20>=1)&&(i17.u23.pl_P23_20>=1))&&(i6.i0.u10.pl_P36_1>=1))"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
199 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,688.325,6222260,1,0,1.08854e+07,739,2573,1.02723e+07,283,1915,348218
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Railroad-PT-020-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((G((F("(((i6.i0.u10.pl_P21_3>=1)&&(i9.u25.pl_P23_6>=1))&&(i6.i0.u10.pl_P36_1>=1))"))||(G("(((i6.i0.u10.pl_P21_3<1)||(i9.u25.pl_P23_6<1))||(i6.i0.u10.pl_P36_1<1))"))))&&(("(((i7.u11.pl_P21_21>=1)&&(i15.u17.pl_P23_12>=1))&&(i6.i0.u10.pl_P36_1>=1))")U(X("(((i6.i1.u12.pl_P21_7>=1)&&(i10.u37.pl_P23_2>=1))&&(i6.i0.u10.pl_P36_1>=1))")))))
Formula 9 simplified : !(G(F"(((i6.i0.u10.pl_P21_3>=1)&&(i9.u25.pl_P23_6>=1))&&(i6.i0.u10.pl_P36_1>=1))" | G"(((i6.i0.u10.pl_P21_3<1)||(i9.u25.pl_P23_6<1))||(i6.i0.u10.pl_P36_1<1))") & ("(((i7.u11.pl_P21_21>=1)&&(i15.u17.pl_P23_12>=1))&&(i6.i0.u10.pl_P36_1>=1))" U X"(((i6.i1.u12.pl_P21_7>=1)&&(i10.u37.pl_P23_2>=1))&&(i6.i0.u10.pl_P36_1>=1))"))
5 unique states visited
4 strongly connected components in search stack
6 transitions explored
4 items max in DFS search stack
23 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,688.551,6222260,1,0,1.08854e+07,739,2634,1.02723e+07,289,1915,358776
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Railroad-PT-020-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(G(!(X(("(((i7.u8.pl_P21_15>=1)&&(i7.u21.pl_P23_17>=1))&&(i6.i0.u10.pl_P36_1>=1))")U("((i15.u33.pl_P52_1>=1)&&(i15.u33.pl_P65_1>=1))")))))))
Formula 10 simplified : !FG!X("(((i7.u8.pl_P21_15>=1)&&(i7.u21.pl_P23_17>=1))&&(i6.i0.u10.pl_P36_1>=1))" U "((i15.u33.pl_P52_1>=1)&&(i15.u33.pl_P65_1>=1))")
3 unique states visited
2 strongly connected components in search stack
4 transitions explored
3 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,688.627,6222260,1,0,1.08854e+07,739,2703,1.02723e+07,294,1915,368665
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Railroad-PT-020-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G(X(X(!(F(G("(((i6.i0.u10.pl_P21_4>=1)&&(i20.u20.pl_P23_16>=1))&&(i6.i0.u10.pl_P36_1>=1))"))))))))
Formula 11 simplified : !GXX!FG"(((i6.i0.u10.pl_P21_4>=1)&&(i20.u20.pl_P23_16>=1))&&(i6.i0.u10.pl_P36_1>=1))"
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
18 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,688.809,6222260,1,0,1.08854e+07,739,2765,1.02723e+07,294,1915,387190
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA Railroad-PT-020-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1590073818169

--------------------
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="Railroad-PT-020"
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 Railroad-PT-020, 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-158961510900306"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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