Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
..................
/home/mcc/execution
total 312K
-rw-r--r-- 1 mcc users 6.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 31K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 68K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is DrinkVendingMachine-PT-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r237-blw3-152732477700106
=====================================================================

--------------------
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 DrinkVendingMachine-PT-02-LTLFireability-00
FORMULA_NAME DrinkVendingMachine-PT-02-LTLFireability-01
FORMULA_NAME DrinkVendingMachine-PT-02-LTLFireability-02
FORMULA_NAME DrinkVendingMachine-PT-02-LTLFireability-03
FORMULA_NAME DrinkVendingMachine-PT-02-LTLFireability-04
FORMULA_NAME DrinkVendingMachine-PT-02-LTLFireability-05
FORMULA_NAME DrinkVendingMachine-PT-02-LTLFireability-06
FORMULA_NAME DrinkVendingMachine-PT-02-LTLFireability-07
FORMULA_NAME DrinkVendingMachine-PT-02-LTLFireability-08
FORMULA_NAME DrinkVendingMachine-PT-02-LTLFireability-09
FORMULA_NAME DrinkVendingMachine-PT-02-LTLFireability-10
FORMULA_NAME DrinkVendingMachine-PT-02-LTLFireability-11
FORMULA_NAME DrinkVendingMachine-PT-02-LTLFireability-12
FORMULA_NAME DrinkVendingMachine-PT-02-LTLFireability-13
FORMULA_NAME DrinkVendingMachine-PT-02-LTLFireability-14
FORMULA_NAME DrinkVendingMachine-PT-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1528012536846

Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/convert-linux64, -i, /tmp/graph5943388846319061350.txt, -o, /tmp/graph5943388846319061350.bin, -w, /tmp/graph5943388846319061350.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/louvain-linux64, /tmp/graph5943388846319061350.bin, -l, -1, -v, -w, /tmp/graph5943388846319061350.weights, -q, 0, -e, 0.001], workingDir=null]
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/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.201805241334/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 16 LTL properties
Checking formula 0 : !(("((((((((((((((((((u3.wait_5>=1)&&(u6.theProducts_1>=1))&&(i7.u8.theOptions_1>=2))||(((u6.theProducts_1>=1)&&(i7.u8.theOptions_1>=2))&&(u11.wait_6>=1)))||(((u3.wait_5>=1)&&(u6.theProducts_1>=1))&&(i4.u9.theOptions_2>=2)))||((((i4.u9.theOptions_2>=1)&&(u3.wait_5>=1))&&(i7.u8.theOptions_1>=1))&&(u6.theProducts_1>=1)))||((((i7.u8.theOptions_1>=1)&&(u3.wait_5>=1))&&(i4.u9.theOptions_2>=1))&&(u6.theProducts_1>=1)))||((((i7.u8.theOptions_1>=1)&&(u7.theProducts_2>=1))&&(i4.u9.theOptions_2>=1))&&(u3.wait_5>=1)))||((((u7.theProducts_2>=1)&&(i7.u8.theOptions_1>=1))&&(u3.wait_5>=1))&&(i4.u9.theOptions_2>=1)))||(((u7.theProducts_2>=1)&&(i4.u9.theOptions_2>=2))&&(u3.wait_5>=1)))||(((i7.u8.theOptions_1>=2)&&(u7.theProducts_2>=1))&&(u11.wait_6>=1)))||((((u11.wait_6>=1)&&(u6.theProducts_1>=1))&&(i4.u9.theOptions_2>=1))&&(i7.u8.theOptions_1>=1)))||((((i4.u9.theOptions_2>=1)&&(i7.u8.theOptions_1>=1))&&(u6.theProducts_1>=1))&&(u11.wait_6>=1)))||(((i4.u9.theOptions_2>=2)&&(u6.theProducts_1>=1))&&(u11.wait_6>=1)))||(((u7.theProducts_2>=1)&&(i7.u8.theOptions_1>=2))&&(u3.wait_5>=1)))||((((i4.u9.theOptions_2>=1)&&(u7.theProducts_2>=1))&&(u11.wait_6>=1))&&(i7.u8.theOptions_1>=1)))||((((i7.u8.theOptions_1>=1)&&(u7.theProducts_2>=1))&&(u11.wait_6>=1))&&(i4.u9.theOptions_2>=1)))||(((u11.wait_6>=1)&&(u7.theProducts_2>=1))&&(i4.u9.theOptions_2>=2)))"))
Formula 0 simplified : !"((((((((((((((((((u3.wait_5>=1)&&(u6.theProducts_1>=1))&&(i7.u8.theOptions_1>=2))||(((u6.theProducts_1>=1)&&(i7.u8.theOptions_1>=2))&&(u11.wait_6>=1)))||(((u3.wait_5>=1)&&(u6.theProducts_1>=1))&&(i4.u9.theOptions_2>=2)))||((((i4.u9.theOptions_2>=1)&&(u3.wait_5>=1))&&(i7.u8.theOptions_1>=1))&&(u6.theProducts_1>=1)))||((((i7.u8.theOptions_1>=1)&&(u3.wait_5>=1))&&(i4.u9.theOptions_2>=1))&&(u6.theProducts_1>=1)))||((((i7.u8.theOptions_1>=1)&&(u7.theProducts_2>=1))&&(i4.u9.theOptions_2>=1))&&(u3.wait_5>=1)))||((((u7.theProducts_2>=1)&&(i7.u8.theOptions_1>=1))&&(u3.wait_5>=1))&&(i4.u9.theOptions_2>=1)))||(((u7.theProducts_2>=1)&&(i4.u9.theOptions_2>=2))&&(u3.wait_5>=1)))||(((i7.u8.theOptions_1>=2)&&(u7.theProducts_2>=1))&&(u11.wait_6>=1)))||((((u11.wait_6>=1)&&(u6.theProducts_1>=1))&&(i4.u9.theOptions_2>=1))&&(i7.u8.theOptions_1>=1)))||((((i4.u9.theOptions_2>=1)&&(i7.u8.theOptions_1>=1))&&(u6.theProducts_1>=1))&&(u11.wait_6>=1)))||(((i4.u9.theOptions_2>=2)&&(u6.theProducts_1>=1))&&(u11.wait_6>=1)))||(((u7.theProducts_2>=1)&&(i7.u8.theOptions_1>=2))&&(u3.wait_5>=1)))||((((i4.u9.theOptions_2>=1)&&(u7.theProducts_2>=1))&&(u11.wait_6>=1))&&(i7.u8.theOptions_1>=1)))||((((i7.u8.theOptions_1>=1)&&(u7.theProducts_2>=1))&&(u11.wait_6>=1))&&(i4.u9.theOptions_2>=1)))||(((u11.wait_6>=1)&&(u7.theProducts_2>=1))&&(i4.u9.theOptions_2>=2)))"
built 30 ordering constraints for composite.
built 46 ordering constraints for composite.
built 46 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.026732,16648,1,0,153,59,385,123,54,50,219
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(("((((((((u1.ready_3>=1)||(u0.ready_2>=1))||(u3.ready_5>=1))||(u2.ready_4>=1))||(u10.ready_1>=1))||(i4.u4.ready_7>=1))||(u11.ready_6>=1))||(i7.u5.ready_8>=1))"))
Formula 1 simplified : !"((((((((u1.ready_3>=1)||(u0.ready_2>=1))||(u3.ready_5>=1))||(u2.ready_4>=1))||(u10.ready_1>=1))||(i4.u4.ready_7>=1))||(u11.ready_6>=1))||(i7.u5.ready_8>=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.030712,16648,1,0,319,59,577,243,55,50,1035
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((G(F(G("((((((((((((((((((u3.wait_5>=1)&&(u6.theProducts_1>=1))&&(i7.u8.theOptions_1>=2))||(((u6.theProducts_1>=1)&&(i7.u8.theOptions_1>=2))&&(u11.wait_6>=1)))||(((u3.wait_5>=1)&&(u6.theProducts_1>=1))&&(i4.u9.theOptions_2>=2)))||((((i4.u9.theOptions_2>=1)&&(u3.wait_5>=1))&&(i7.u8.theOptions_1>=1))&&(u6.theProducts_1>=1)))||((((i7.u8.theOptions_1>=1)&&(u3.wait_5>=1))&&(i4.u9.theOptions_2>=1))&&(u6.theProducts_1>=1)))||((((i7.u8.theOptions_1>=1)&&(u7.theProducts_2>=1))&&(i4.u9.theOptions_2>=1))&&(u3.wait_5>=1)))||((((u7.theProducts_2>=1)&&(i7.u8.theOptions_1>=1))&&(u3.wait_5>=1))&&(i4.u9.theOptions_2>=1)))||(((u7.theProducts_2>=1)&&(i4.u9.theOptions_2>=2))&&(u3.wait_5>=1)))||(((i7.u8.theOptions_1>=2)&&(u7.theProducts_2>=1))&&(u11.wait_6>=1)))||((((u11.wait_6>=1)&&(u6.theProducts_1>=1))&&(i4.u9.theOptions_2>=1))&&(i7.u8.theOptions_1>=1)))||((((i4.u9.theOptions_2>=1)&&(i7.u8.theOptions_1>=1))&&(u6.theProducts_1>=1))&&(u11.wait_6>=1)))||(((i4.u9.theOptions_2>=2)&&(u6.theProducts_1>=1))&&(u11.wait_6>=1)))||(((u7.theProducts_2>=1)&&(i7.u8.theOptions_1>=2))&&(u3.wait_5>=1)))||((((i4.u9.theOptions_2>=1)&&(u7.theProducts_2>=1))&&(u11.wait_6>=1))&&(i7.u8.theOptions_1>=1)))||((((i7.u8.theOptions_1>=1)&&(u7.theProducts_2>=1))&&(u11.wait_6>=1))&&(i4.u9.theOptions_2>=1)))||(((u11.wait_6>=1)&&(u7.theProducts_2>=1))&&(i4.u9.theOptions_2>=2)))"))))U(F("((((((((u1.ready_3>=1)||(u0.ready_2>=1))||(u3.ready_5>=1))||(u2.ready_4>=1))||(u10.ready_1>=1))||(i4.u4.ready_7>=1))||(u11.ready_6>=1))||(i7.u5.ready_8>=1))"))))
Formula 2 simplified : !(GFG"((((((((((((((((((u3.wait_5>=1)&&(u6.theProducts_1>=1))&&(i7.u8.theOptions_1>=2))||(((u6.theProducts_1>=1)&&(i7.u8.theOptions_1>=2))&&(u11.wait_6>=1)))||(((u3.wait_5>=1)&&(u6.theProducts_1>=1))&&(i4.u9.theOptions_2>=2)))||((((i4.u9.theOptions_2>=1)&&(u3.wait_5>=1))&&(i7.u8.theOptions_1>=1))&&(u6.theProducts_1>=1)))||((((i7.u8.theOptions_1>=1)&&(u3.wait_5>=1))&&(i4.u9.theOptions_2>=1))&&(u6.theProducts_1>=1)))||((((i7.u8.theOptions_1>=1)&&(u7.theProducts_2>=1))&&(i4.u9.theOptions_2>=1))&&(u3.wait_5>=1)))||((((u7.theProducts_2>=1)&&(i7.u8.theOptions_1>=1))&&(u3.wait_5>=1))&&(i4.u9.theOptions_2>=1)))||(((u7.theProducts_2>=1)&&(i4.u9.theOptions_2>=2))&&(u3.wait_5>=1)))||(((i7.u8.theOptions_1>=2)&&(u7.theProducts_2>=1))&&(u11.wait_6>=1)))||((((u11.wait_6>=1)&&(u6.theProducts_1>=1))&&(i4.u9.theOptions_2>=1))&&(i7.u8.theOptions_1>=1)))||((((i4.u9.theOptions_2>=1)&&(i7.u8.theOptions_1>=1))&&(u6.theProducts_1>=1))&&(u11.wait_6>=1)))||(((i4.u9.theOptions_2>=2)&&(u6.theProducts_1>=1))&&(u11.wait_6>=1)))||(((u7.theProducts_2>=1)&&(i7.u8.theOptions_1>=2))&&(u3.wait_5>=1)))||((((i4.u9.theOptions_2>=1)&&(u7.theProducts_2>=1))&&(u11.wait_6>=1))&&(i7.u8.theOptions_1>=1)))||((((i7.u8.theOptions_1>=1)&&(u7.theProducts_2>=1))&&(u11.wait_6>=1))&&(i4.u9.theOptions_2>=1)))||(((u11.wait_6>=1)&&(u7.theProducts_2>=1))&&(i4.u9.theOptions_2>=2)))" U F"((((((((u1.ready_3>=1)||(u0.ready_2>=1))||(u3.ready_5>=1))||(u2.ready_4>=1))||(u10.ready_1>=1))||(i4.u4.ready_7>=1))||(u11.ready_6>=1))||(i7.u5.ready_8>=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.033495,17560,1,0,325,59,598,267,55,50,1157
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F("((u6.productSlots_1>=1)||(u7.productSlots_2>=1))")))
Formula 3 simplified : !F"((u6.productSlots_1>=1)||(u7.productSlots_2>=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.034701,17560,1,0,325,59,628,267,55,50,1243
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(F(X(("((i4.u9.optionSlots_2>=1)||(i7.u8.optionSlots_1>=1))")U("((((((((((u1.wait_3>=1)&&(u6.theProducts_1>=1))&&(i4.u9.theOptions_2>=1))||(((u6.theProducts_1>=1)&&(i7.u8.theOptions_1>=1))&&(u2.wait_4>=1)))||(((u2.wait_4>=1)&&(u6.theProducts_1>=1))&&(i4.u9.theOptions_2>=1)))||(((u1.wait_3>=1)&&(i7.u8.theOptions_1>=1))&&(u7.theProducts_2>=1)))||(((u1.wait_3>=1)&&(i7.u8.theOptions_1>=1))&&(u6.theProducts_1>=1)))||(((u2.wait_4>=1)&&(u7.theProducts_2>=1))&&(i7.u8.theOptions_1>=1)))||(((i4.u9.theOptions_2>=1)&&(u7.theProducts_2>=1))&&(u1.wait_3>=1)))||(((u7.theProducts_2>=1)&&(i4.u9.theOptions_2>=1))&&(u2.wait_4>=1)))"))))))
Formula 4 simplified : !FX("((i4.u9.optionSlots_2>=1)||(i7.u8.optionSlots_1>=1))" U "((((((((((u1.wait_3>=1)&&(u6.theProducts_1>=1))&&(i4.u9.theOptions_2>=1))||(((u6.theProducts_1>=1)&&(i7.u8.theOptions_1>=1))&&(u2.wait_4>=1)))||(((u2.wait_4>=1)&&(u6.theProducts_1>=1))&&(i4.u9.theOptions_2>=1)))||(((u1.wait_3>=1)&&(i7.u8.theOptions_1>=1))&&(u7.theProducts_2>=1)))||(((u1.wait_3>=1)&&(i7.u8.theOptions_1>=1))&&(u6.theProducts_1>=1)))||(((u2.wait_4>=1)&&(u7.theProducts_2>=1))&&(i7.u8.theOptions_1>=1)))||(((i4.u9.theOptions_2>=1)&&(u7.theProducts_2>=1))&&(u1.wait_3>=1)))||(((u7.theProducts_2>=1)&&(i4.u9.theOptions_2>=1))&&(u2.wait_4>=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.042814,17560,1,0,1090,59,713,1142,55,50,3860
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(X((G("((u6.productSlots_1>=1)||(u7.productSlots_2>=1))"))U(X("((((((((u1.ready_3>=1)||(u0.ready_2>=1))||(u3.ready_5>=1))||(u2.ready_4>=1))||(u10.ready_1>=1))||(i4.u4.ready_7>=1))||(u11.ready_6>=1))||(i7.u5.ready_8>=1))"))))))
Formula 5 simplified : !FX(G"((u6.productSlots_1>=1)||(u7.productSlots_2>=1))" U X"((((((((u1.ready_3>=1)||(u0.ready_2>=1))||(u3.ready_5>=1))||(u2.ready_4>=1))||(u10.ready_1>=1))||(i4.u4.ready_7>=1))||(u11.ready_6>=1))||(i7.u5.ready_8>=1))")
3 unique states visited
0 strongly connected components in search stack
2 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.046372,17796,1,0,1472,59,713,1660,55,50,5051
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(X((G("((((((((((u1.wait_3>=1)&&(u6.theProducts_1>=1))&&(i4.u9.theOptions_2>=1))||(((u6.theProducts_1>=1)&&(i7.u8.theOptions_1>=1))&&(u2.wait_4>=1)))||(((u2.wait_4>=1)&&(u6.theProducts_1>=1))&&(i4.u9.theOptions_2>=1)))||(((u1.wait_3>=1)&&(i7.u8.theOptions_1>=1))&&(u7.theProducts_2>=1)))||(((u1.wait_3>=1)&&(i7.u8.theOptions_1>=1))&&(u6.theProducts_1>=1)))||(((u2.wait_4>=1)&&(u7.theProducts_2>=1))&&(i7.u8.theOptions_1>=1)))||(((i4.u9.theOptions_2>=1)&&(u7.theProducts_2>=1))&&(u1.wait_3>=1)))||(((u7.theProducts_2>=1)&&(i4.u9.theOptions_2>=1))&&(u2.wait_4>=1)))"))U("(((((u7.theProducts_2>=1)&&(u10.wait_1>=1))||((u0.wait_2>=1)&&(u6.theProducts_1>=1)))||((u0.wait_2>=1)&&(u7.theProducts_2>=1)))||((u6.theProducts_1>=1)&&(u10.wait_1>=1)))")))))
Formula 6 simplified : !FX(G"((((((((((u1.wait_3>=1)&&(u6.theProducts_1>=1))&&(i4.u9.theOptions_2>=1))||(((u6.theProducts_1>=1)&&(i7.u8.theOptions_1>=1))&&(u2.wait_4>=1)))||(((u2.wait_4>=1)&&(u6.theProducts_1>=1))&&(i4.u9.theOptions_2>=1)))||(((u1.wait_3>=1)&&(i7.u8.theOptions_1>=1))&&(u7.theProducts_2>=1)))||(((u1.wait_3>=1)&&(i7.u8.theOptions_1>=1))&&(u6.theProducts_1>=1)))||(((u2.wait_4>=1)&&(u7.theProducts_2>=1))&&(i7.u8.theOptions_1>=1)))||(((i4.u9.theOptions_2>=1)&&(u7.theProducts_2>=1))&&(u1.wait_3>=1)))||(((u7.theProducts_2>=1)&&(i4.u9.theOptions_2>=1))&&(u2.wait_4>=1)))" U "(((((u7.theProducts_2>=1)&&(u10.wait_1>=1))||((u0.wait_2>=1)&&(u6.theProducts_1>=1)))||((u0.wait_2>=1)&&(u7.theProducts_2>=1)))||((u6.theProducts_1>=1)&&(u10.wait_1>=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.047613,18048,1,0,1479,59,749,1668,55,50,5143
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(X((X("((((((((u1.ready_3>=1)||(u0.ready_2>=1))||(u3.ready_5>=1))||(u2.ready_4>=1))||(u10.ready_1>=1))||(i4.u4.ready_7>=1))||(u11.ready_6>=1))||(i7.u5.ready_8>=1))"))U(F("((((((((((u1.wait_3>=1)&&(u6.theProducts_1>=1))&&(i4.u9.theOptions_2>=1))||(((u6.theProducts_1>=1)&&(i7.u8.theOptions_1>=1))&&(u2.wait_4>=1)))||(((u2.wait_4>=1)&&(u6.theProducts_1>=1))&&(i4.u9.theOptions_2>=1)))||(((u1.wait_3>=1)&&(i7.u8.theOptions_1>=1))&&(u7.theProducts_2>=1)))||(((u1.wait_3>=1)&&(i7.u8.theOptions_1>=1))&&(u6.theProducts_1>=1)))||(((u2.wait_4>=1)&&(u7.theProducts_2>=1))&&(i7.u8.theOptions_1>=1)))||(((i4.u9.theOptions_2>=1)&&(u7.theProducts_2>=1))&&(u1.wait_3>=1)))||(((u7.theProducts_2>=1)&&(i4.u9.theOptions_2>=1))&&(u2.wait_4>=1)))"))))))
Formula 7 simplified : !FX(X"((((((((u1.ready_3>=1)||(u0.ready_2>=1))||(u3.ready_5>=1))||(u2.ready_4>=1))||(u10.ready_1>=1))||(i4.u4.ready_7>=1))||(u11.ready_6>=1))||(i7.u5.ready_8>=1))" U F"((((((((((u1.wait_3>=1)&&(u6.theProducts_1>=1))&&(i4.u9.theOptions_2>=1))||(((u6.theProducts_1>=1)&&(i7.u8.theOptions_1>=1))&&(u2.wait_4>=1)))||(((u2.wait_4>=1)&&(u6.theProducts_1>=1))&&(i4.u9.theOptions_2>=1)))||(((u1.wait_3>=1)&&(i7.u8.theOptions_1>=1))&&(u7.theProducts_2>=1)))||(((u1.wait_3>=1)&&(i7.u8.theOptions_1>=1))&&(u6.theProducts_1>=1)))||(((u2.wait_4>=1)&&(u7.theProducts_2>=1))&&(i7.u8.theOptions_1>=1)))||(((i4.u9.theOptions_2>=1)&&(u7.theProducts_2>=1))&&(u1.wait_3>=1)))||(((u7.theProducts_2>=1)&&(i4.u9.theOptions_2>=1))&&(u2.wait_4>=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.049085,18048,1,0,1479,59,749,1668,55,50,5143
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(X(("(((u7.theProducts_2>=1)&&(i4.u9.theOptions_2>=3))&&(i4.u4.wait_7>=1))")U(X("(((u3.wait_5>=1)&&(u6.theProducts_1>=1))&&(i7.u8.theOptions_1>=2))"))))))
Formula 8 simplified : !XX("(((u7.theProducts_2>=1)&&(i4.u9.theOptions_2>=3))&&(i4.u4.wait_7>=1))" U X"(((u3.wait_5>=1)&&(u6.theProducts_1>=1))&&(i7.u8.theOptions_1>=2))")
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.053326,18256,1,0,1807,59,766,2061,55,50,6200
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(("(((i4.u9.theOptions_2>=1)&&(u7.theProducts_2>=1))&&(u1.wait_3>=1))"))
Formula 9 simplified : !"(((i4.u9.theOptions_2>=1)&&(u7.theProducts_2>=1))&&(u1.wait_3>=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.053812,18256,1,0,1807,59,768,2061,55,50,6211
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(("(((i7.u8.theOptions_1>=2)&&(u7.theProducts_2>=1))&&(u11.wait_6>=1))"))
Formula 10 simplified : !"(((i7.u8.theOptions_1>=2)&&(u7.theProducts_2>=1))&&(u11.wait_6>=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.054127,18256,1,0,1807,59,770,2061,55,50,6218
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F(G((X("(i4.u9.optionSlots_2>=1)"))U(F("(((i4.u4.wait_7>=1)&&(u7.theProducts_2>=1))&&(i7.u8.theOptions_1>=3))"))))))
Formula 11 simplified : !FG(X"(i4.u9.optionSlots_2>=1)" U F"(((i4.u4.wait_7>=1)&&(u7.theProducts_2>=1))&&(i7.u8.theOptions_1>=3))")
3 unique states visited
3 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.055672,18492,1,0,1825,59,802,2092,55,50,6305
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G(X(X(("(((u6.theProducts_1>=1)&&(i7.u8.theOptions_1>=3))&&(i7.u5.wait_8>=1))")U("((((i4.u4.wait_7>=1)&&(i7.u8.theOptions_1>=2))&&(u6.theProducts_1>=1))&&(i4.u9.theOptions_2>=1))"))))))
Formula 12 simplified : !GXX("(((u6.theProducts_1>=1)&&(i7.u8.theOptions_1>=3))&&(i7.u5.wait_8>=1))" U "((((i4.u4.wait_7>=1)&&(i7.u8.theOptions_1>=2))&&(u6.theProducts_1>=1))&&(i4.u9.theOptions_2>=1))")
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 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.056977,18628,1,0,1825,59,831,2092,55,50,6329
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((G(("(i4.u9.optionSlots_2>=1)")U("((((i4.u9.theOptions_2>=1)&&(u7.theProducts_2>=1))&&(u11.wait_6>=1))&&(i7.u8.theOptions_1>=1))"))))
Formula 13 simplified : !G("(i4.u9.optionSlots_2>=1)" U "((((i4.u9.theOptions_2>=1)&&(u7.theProducts_2>=1))&&(u11.wait_6>=1))&&(i7.u8.theOptions_1>=1))")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.064564,19004,1,0,2886,59,867,3170,58,50,8938
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(((X(G(X("(((i4.u4.wait_7>=1)&&(u6.theProducts_1>=1))&&(i4.u9.theOptions_2>=3))"))))U(X("((((u7.theProducts_2>=1)&&(i7.u8.theOptions_1>=1))&&(u3.wait_5>=1))&&(i4.u9.theOptions_2>=1))"))))
Formula 14 simplified : !(XGX"(((i4.u4.wait_7>=1)&&(u6.theProducts_1>=1))&&(i4.u9.theOptions_2>=3))" U X"((((u7.theProducts_2>=1)&&(i7.u8.theOptions_1>=1))&&(u3.wait_5>=1))&&(i4.u9.theOptions_2>=1))")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.067175,19552,1,0,2952,59,901,3227,60,50,9346
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((G(X(G(("(((i4.u9.theOptions_2>=2)&&(u6.theProducts_1>=1))&&(u11.wait_6>=1))")U("((u0.wait_2>=1)&&(u7.theProducts_2>=1))"))))))
Formula 15 simplified : !GXG("(((i4.u9.theOptions_2>=2)&&(u6.theProducts_1>=1))&&(u11.wait_6>=1))" U "((u0.wait_2>=1)&&(u7.theProducts_2>=1))")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.080654,20240,1,0,4750,59,945,5281,60,50,13149
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1528012539521

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -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/ -louvain -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Jun 03, 2018 7:55:38 AM fr.lip6.move.gal.application.Application start
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/, -louvain, -smt]
Jun 03, 2018 7:55:38 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 03, 2018 7:55:38 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 51 ms
Jun 03, 2018 7:55:38 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 24 places.
Jun 03, 2018 7:55:38 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 72 transitions.
Jun 03, 2018 7:55:38 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 12 ms
Jun 03, 2018 7:55:38 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 03, 2018 7:55:38 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 41 ms
Jun 03, 2018 7:55:38 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 28 ms
Begin: Sun Jun 3 07:55:38 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Sun Jun 3 07:55:38 2018
network size: 24 nodes, 156 links, 144 weight
quality increased from -0.0613426 to 0.293981
end computation: Sun Jun 3 07:55:38 2018
level 1:
start computation: Sun Jun 3 07:55:38 2018
network size: 12 nodes, 78 links, 144 weight
quality increased from 0.293981 to 0.294496
end computation: Sun Jun 3 07:55:38 2018
level 2:
start computation: Sun Jun 3 07:55:38 2018
network size: 10 nodes, 60 links, 144 weight
quality increased from 0.294496 to 0.294496
end computation: Sun Jun 3 07:55:38 2018
End: Sun Jun 3 07:55:38 2018
Total duration: 0 sec
0.294496
Jun 03, 2018 7:55:38 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 03, 2018 7:55:38 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 23 ms
Jun 03, 2018 7:55:38 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 03, 2018 7:55:38 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 192 redundant transitions.
Jun 03, 2018 7:55:39 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
Jun 03, 2018 7:55:39 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 5 ms
Jun 03, 2018 7:55:39 AM fr.lip6.move.gal.semantics.CompositeNextBuilder getNextForLabel
INFO: Semantic construction discarded 20 identical transitions.
Jun 03, 2018 7:55:39 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 52 transitions.
Jun 03, 2018 7:55:39 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (define-fun trsrc12 ((src (Array Int Int))(dst (Array Int Int))) Bool (and (_enabledsrc__12 src) (= (store (store (store (store (store (store src 8 (- (select src 8) 1)) 9 (+ (select src 9) 1)) 17 (+ (select src 17) 1)) 16 (- (select src 16) 1)) 18 (- (select src 18) 3)) 19 (+ (select src 19) 3)) dst))) with error (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Skipping mayMatrices nes/nds Error when declaring system variables to SMT solver.(error "Error writing to Z3 solver: java.io.IOException: Stream closed")
java.lang.RuntimeException: Error when declaring system variables to SMT solver.(error "Error writing to Z3 solver: java.io.IOException: Stream closed")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.init(NextBMCSolver.java:93)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:59)
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:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
Jun 03, 2018 7:55:39 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 126ms conformant to PINS in folder :/home/mcc/execution

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="DrinkVendingMachine-PT-02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstoolsl"
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

tar xzf /home/mcc/BenchKit/INPUTS/DrinkVendingMachine-PT-02.tgz
mv DrinkVendingMachine-PT-02 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool itstoolsl"
echo " Input is DrinkVendingMachine-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 r237-blw3-152732477700106"
echo "====================================================================="
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
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 ;