About the Execution of ITS-Tools for DrinkVendingMachine-PT-02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15756.220 | 2710.00 | 4340.00 | 72.70 | TFTTFTTFFTFFFFFF | normal |
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 itstools
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 r236-blw3-152732477200106
=====================================================================
--------------------
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 1527972118813
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.201805151631/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.201805151631/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 : !(("((((((((((((((((((wait_5>=1)&&(theProducts_1>=1))&&(theOptions_1>=2))||(((theProducts_1>=1)&&(theOptions_1>=2))&&(wait_6>=1)))||(((wait_5>=1)&&(theProducts_1>=1))&&(theOptions_2>=2)))||((((theOptions_2>=1)&&(wait_5>=1))&&(theOptions_1>=1))&&(theProducts_1>=1)))||((((theOptions_1>=1)&&(wait_5>=1))&&(theOptions_2>=1))&&(theProducts_1>=1)))||((((theOptions_1>=1)&&(theProducts_2>=1))&&(theOptions_2>=1))&&(wait_5>=1)))||((((theProducts_2>=1)&&(theOptions_1>=1))&&(wait_5>=1))&&(theOptions_2>=1)))||(((theProducts_2>=1)&&(theOptions_2>=2))&&(wait_5>=1)))||(((theOptions_1>=2)&&(theProducts_2>=1))&&(wait_6>=1)))||((((wait_6>=1)&&(theProducts_1>=1))&&(theOptions_2>=1))&&(theOptions_1>=1)))||((((theOptions_2>=1)&&(theOptions_1>=1))&&(theProducts_1>=1))&&(wait_6>=1)))||(((theOptions_2>=2)&&(theProducts_1>=1))&&(wait_6>=1)))||(((theProducts_2>=1)&&(theOptions_1>=2))&&(wait_5>=1)))||((((theOptions_2>=1)&&(theProducts_2>=1))&&(wait_6>=1))&&(theOptions_1>=1)))||((((theOptions_1>=1)&&(theProducts_2>=1))&&(wait_6>=1))&&(theOptions_2>=1)))||(((wait_6>=1)&&(theProducts_2>=1))&&(theOptions_2>=2)))"))
Formula 0 simplified : !"((((((((((((((((((wait_5>=1)&&(theProducts_1>=1))&&(theOptions_1>=2))||(((theProducts_1>=1)&&(theOptions_1>=2))&&(wait_6>=1)))||(((wait_5>=1)&&(theProducts_1>=1))&&(theOptions_2>=2)))||((((theOptions_2>=1)&&(wait_5>=1))&&(theOptions_1>=1))&&(theProducts_1>=1)))||((((theOptions_1>=1)&&(wait_5>=1))&&(theOptions_2>=1))&&(theProducts_1>=1)))||((((theOptions_1>=1)&&(theProducts_2>=1))&&(theOptions_2>=1))&&(wait_5>=1)))||((((theProducts_2>=1)&&(theOptions_1>=1))&&(wait_5>=1))&&(theOptions_2>=1)))||(((theProducts_2>=1)&&(theOptions_2>=2))&&(wait_5>=1)))||(((theOptions_1>=2)&&(theProducts_2>=1))&&(wait_6>=1)))||((((wait_6>=1)&&(theProducts_1>=1))&&(theOptions_2>=1))&&(theOptions_1>=1)))||((((theOptions_2>=1)&&(theOptions_1>=1))&&(theProducts_1>=1))&&(wait_6>=1)))||(((theOptions_2>=2)&&(theProducts_1>=1))&&(wait_6>=1)))||(((theProducts_2>=1)&&(theOptions_1>=2))&&(wait_5>=1)))||((((theOptions_2>=1)&&(theProducts_2>=1))&&(wait_6>=1))&&(theOptions_1>=1)))||((((theOptions_1>=1)&&(theProducts_2>=1))&&(wait_6>=1))&&(theOptions_2>=1)))||(((wait_6>=1)&&(theProducts_2>=1))&&(theOptions_2>=2)))"
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.034594,16960,1,0,5,733,14,0,855,440,4
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !(("((((((((ready_3>=1)||(ready_2>=1))||(ready_5>=1))||(ready_4>=1))||(ready_1>=1))||(ready_7>=1))||(ready_6>=1))||(ready_8>=1))"))
Formula 1 simplified : !"((((((((ready_3>=1)||(ready_2>=1))||(ready_5>=1))||(ready_4>=1))||(ready_1>=1))||(ready_7>=1))||(ready_6>=1))||(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.039169,17288,1,0,6,1399,23,0,1029,856,19
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
Checking formula 2 : !(((G(F(G("((((((((((((((((((wait_5>=1)&&(theProducts_1>=1))&&(theOptions_1>=2))||(((theProducts_1>=1)&&(theOptions_1>=2))&&(wait_6>=1)))||(((wait_5>=1)&&(theProducts_1>=1))&&(theOptions_2>=2)))||((((theOptions_2>=1)&&(wait_5>=1))&&(theOptions_1>=1))&&(theProducts_1>=1)))||((((theOptions_1>=1)&&(wait_5>=1))&&(theOptions_2>=1))&&(theProducts_1>=1)))||((((theOptions_1>=1)&&(theProducts_2>=1))&&(theOptions_2>=1))&&(wait_5>=1)))||((((theProducts_2>=1)&&(theOptions_1>=1))&&(wait_5>=1))&&(theOptions_2>=1)))||(((theProducts_2>=1)&&(theOptions_2>=2))&&(wait_5>=1)))||(((theOptions_1>=2)&&(theProducts_2>=1))&&(wait_6>=1)))||((((wait_6>=1)&&(theProducts_1>=1))&&(theOptions_2>=1))&&(theOptions_1>=1)))||((((theOptions_2>=1)&&(theOptions_1>=1))&&(theProducts_1>=1))&&(wait_6>=1)))||(((theOptions_2>=2)&&(theProducts_1>=1))&&(wait_6>=1)))||(((theProducts_2>=1)&&(theOptions_1>=2))&&(wait_5>=1)))||((((theOptions_2>=1)&&(theProducts_2>=1))&&(wait_6>=1))&&(theOptions_1>=1)))||((((theOptions_1>=1)&&(theProducts_2>=1))&&(wait_6>=1))&&(theOptions_2>=1)))||(((wait_6>=1)&&(theProducts_2>=1))&&(theOptions_2>=2)))"))))U(F("((((((((ready_3>=1)||(ready_2>=1))||(ready_5>=1))||(ready_4>=1))||(ready_1>=1))||(ready_7>=1))||(ready_6>=1))||(ready_8>=1))"))))
Formula 2 simplified : !(GFG"((((((((((((((((((wait_5>=1)&&(theProducts_1>=1))&&(theOptions_1>=2))||(((theProducts_1>=1)&&(theOptions_1>=2))&&(wait_6>=1)))||(((wait_5>=1)&&(theProducts_1>=1))&&(theOptions_2>=2)))||((((theOptions_2>=1)&&(wait_5>=1))&&(theOptions_1>=1))&&(theProducts_1>=1)))||((((theOptions_1>=1)&&(wait_5>=1))&&(theOptions_2>=1))&&(theProducts_1>=1)))||((((theOptions_1>=1)&&(theProducts_2>=1))&&(theOptions_2>=1))&&(wait_5>=1)))||((((theProducts_2>=1)&&(theOptions_1>=1))&&(wait_5>=1))&&(theOptions_2>=1)))||(((theProducts_2>=1)&&(theOptions_2>=2))&&(wait_5>=1)))||(((theOptions_1>=2)&&(theProducts_2>=1))&&(wait_6>=1)))||((((wait_6>=1)&&(theProducts_1>=1))&&(theOptions_2>=1))&&(theOptions_1>=1)))||((((theOptions_2>=1)&&(theOptions_1>=1))&&(theProducts_1>=1))&&(wait_6>=1)))||(((theOptions_2>=2)&&(theProducts_1>=1))&&(wait_6>=1)))||(((theProducts_2>=1)&&(theOptions_1>=2))&&(wait_5>=1)))||((((theOptions_2>=1)&&(theProducts_2>=1))&&(wait_6>=1))&&(theOptions_1>=1)))||((((theOptions_1>=1)&&(theProducts_2>=1))&&(wait_6>=1))&&(theOptions_2>=1)))||(((wait_6>=1)&&(theProducts_2>=1))&&(theOptions_2>=2)))" U F"((((((((ready_3>=1)||(ready_2>=1))||(ready_5>=1))||(ready_4>=1))||(ready_1>=1))||(ready_7>=1))||(ready_6>=1))||(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.041077,17832,1,0,7,1415,29,2,1029,930,25
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((F("((productSlots_1>=1)||(productSlots_2>=1))")))
Formula 3 simplified : !F"((productSlots_1>=1)||(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.041441,17832,1,0,7,1417,38,2,1033,933,33
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((F(F(X(("((optionSlots_2>=1)||(optionSlots_1>=1))")U("((((((((((wait_3>=1)&&(theProducts_1>=1))&&(theOptions_2>=1))||(((theProducts_1>=1)&&(theOptions_1>=1))&&(wait_4>=1)))||(((wait_4>=1)&&(theProducts_1>=1))&&(theOptions_2>=1)))||(((wait_3>=1)&&(theOptions_1>=1))&&(theProducts_2>=1)))||(((wait_3>=1)&&(theOptions_1>=1))&&(theProducts_1>=1)))||(((wait_4>=1)&&(theProducts_2>=1))&&(theOptions_1>=1)))||(((theOptions_2>=1)&&(theProducts_2>=1))&&(wait_3>=1)))||(((theProducts_2>=1)&&(theOptions_2>=1))&&(wait_4>=1)))"))))))
Formula 4 simplified : !FX("((optionSlots_2>=1)||(optionSlots_1>=1))" U "((((((((((wait_3>=1)&&(theProducts_1>=1))&&(theOptions_2>=1))||(((theProducts_1>=1)&&(theOptions_1>=1))&&(wait_4>=1)))||(((wait_4>=1)&&(theProducts_1>=1))&&(theOptions_2>=1)))||(((wait_3>=1)&&(theOptions_1>=1))&&(theProducts_2>=1)))||(((wait_3>=1)&&(theOptions_1>=1))&&(theProducts_1>=1)))||(((wait_4>=1)&&(theProducts_2>=1))&&(theOptions_1>=1)))||(((theOptions_2>=1)&&(theProducts_2>=1))&&(wait_3>=1)))||(((theProducts_2>=1)&&(theOptions_2>=1))&&(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.054577,17832,1,0,28,3939,47,10,1061,4701,78
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
Checking formula 5 : !((F(X((G("((productSlots_1>=1)||(productSlots_2>=1))"))U(X("((((((((ready_3>=1)||(ready_2>=1))||(ready_5>=1))||(ready_4>=1))||(ready_1>=1))||(ready_7>=1))||(ready_6>=1))||(ready_8>=1))"))))))
Formula 5 simplified : !FX(G"((productSlots_1>=1)||(productSlots_2>=1))" U X"((((((((ready_3>=1)||(ready_2>=1))||(ready_5>=1))||(ready_4>=1))||(ready_1>=1))||(ready_7>=1))||(ready_6>=1))||(ready_8>=1))")
3 unique states visited
0 strongly connected components in search stack
2 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.061047,18044,1,0,39,5064,47,13,1061,6261,107
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((F(X((G("((((((((((wait_3>=1)&&(theProducts_1>=1))&&(theOptions_2>=1))||(((theProducts_1>=1)&&(theOptions_1>=1))&&(wait_4>=1)))||(((wait_4>=1)&&(theProducts_1>=1))&&(theOptions_2>=1)))||(((wait_3>=1)&&(theOptions_1>=1))&&(theProducts_2>=1)))||(((wait_3>=1)&&(theOptions_1>=1))&&(theProducts_1>=1)))||(((wait_4>=1)&&(theProducts_2>=1))&&(theOptions_1>=1)))||(((theOptions_2>=1)&&(theProducts_2>=1))&&(wait_3>=1)))||(((theProducts_2>=1)&&(theOptions_2>=1))&&(wait_4>=1)))"))U("(((((theProducts_2>=1)&&(wait_1>=1))||((wait_2>=1)&&(theProducts_1>=1)))||((wait_2>=1)&&(theProducts_2>=1)))||((theProducts_1>=1)&&(wait_1>=1)))")))))
Formula 6 simplified : !FX(G"((((((((((wait_3>=1)&&(theProducts_1>=1))&&(theOptions_2>=1))||(((theProducts_1>=1)&&(theOptions_1>=1))&&(wait_4>=1)))||(((wait_4>=1)&&(theProducts_1>=1))&&(theOptions_2>=1)))||(((wait_3>=1)&&(theOptions_1>=1))&&(theProducts_2>=1)))||(((wait_3>=1)&&(theOptions_1>=1))&&(theProducts_1>=1)))||(((wait_4>=1)&&(theProducts_2>=1))&&(theOptions_1>=1)))||(((theOptions_2>=1)&&(theProducts_2>=1))&&(wait_3>=1)))||(((theProducts_2>=1)&&(theOptions_2>=1))&&(wait_4>=1)))" U "(((((theProducts_2>=1)&&(wait_1>=1))||((wait_2>=1)&&(theProducts_1>=1)))||((wait_2>=1)&&(theProducts_2>=1)))||((theProducts_1>=1)&&(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.06215,18296,1,0,39,5074,56,13,1074,6271,111
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((F(X((X("((((((((ready_3>=1)||(ready_2>=1))||(ready_5>=1))||(ready_4>=1))||(ready_1>=1))||(ready_7>=1))||(ready_6>=1))||(ready_8>=1))"))U(F("((((((((((wait_3>=1)&&(theProducts_1>=1))&&(theOptions_2>=1))||(((theProducts_1>=1)&&(theOptions_1>=1))&&(wait_4>=1)))||(((wait_4>=1)&&(theProducts_1>=1))&&(theOptions_2>=1)))||(((wait_3>=1)&&(theOptions_1>=1))&&(theProducts_2>=1)))||(((wait_3>=1)&&(theOptions_1>=1))&&(theProducts_1>=1)))||(((wait_4>=1)&&(theProducts_2>=1))&&(theOptions_1>=1)))||(((theOptions_2>=1)&&(theProducts_2>=1))&&(wait_3>=1)))||(((theProducts_2>=1)&&(theOptions_2>=1))&&(wait_4>=1)))"))))))
Formula 7 simplified : !FX(X"((((((((ready_3>=1)||(ready_2>=1))||(ready_5>=1))||(ready_4>=1))||(ready_1>=1))||(ready_7>=1))||(ready_6>=1))||(ready_8>=1))" U F"((((((((((wait_3>=1)&&(theProducts_1>=1))&&(theOptions_2>=1))||(((theProducts_1>=1)&&(theOptions_1>=1))&&(wait_4>=1)))||(((wait_4>=1)&&(theProducts_1>=1))&&(theOptions_2>=1)))||(((wait_3>=1)&&(theOptions_1>=1))&&(theProducts_2>=1)))||(((wait_3>=1)&&(theOptions_1>=1))&&(theProducts_1>=1)))||(((wait_4>=1)&&(theProducts_2>=1))&&(theOptions_1>=1)))||(((theOptions_2>=1)&&(theProducts_2>=1))&&(wait_3>=1)))||(((theProducts_2>=1)&&(theOptions_2>=1))&&(wait_4>=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.064135,18296,1,0,39,5074,56,13,1074,6271,111
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
Checking formula 8 : !((X(X(("(((theProducts_2>=1)&&(theOptions_2>=3))&&(wait_7>=1))")U(X("(((wait_5>=1)&&(theProducts_1>=1))&&(theOptions_1>=2))"))))))
Formula 8 simplified : !XX("(((theProducts_2>=1)&&(theOptions_2>=3))&&(wait_7>=1))" U X"(((wait_5>=1)&&(theProducts_1>=1))&&(theOptions_1>=2))")
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.07039,18556,1,0,41,6075,63,13,1080,7301,125
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
Checking formula 9 : !(("(((theOptions_2>=1)&&(theProducts_2>=1))&&(wait_3>=1))"))
Formula 9 simplified : !"(((theOptions_2>=1)&&(theProducts_2>=1))&&(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.070801,18752,1,0,41,6075,66,13,1080,7301,127
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !(("(((theOptions_1>=2)&&(theProducts_2>=1))&&(wait_6>=1))"))
Formula 10 simplified : !"(((theOptions_1>=2)&&(theProducts_2>=1))&&(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.071144,18752,1,0,41,6075,69,13,1080,7301,129
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
Checking formula 11 : !((F(G((X("(optionSlots_2>=1)"))U(F("(((wait_7>=1)&&(theProducts_2>=1))&&(theOptions_1>=3))"))))))
Formula 11 simplified : !FG(X"(optionSlots_2>=1)" U F"(((wait_7>=1)&&(theProducts_2>=1))&&(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.072283,18952,1,0,41,6130,78,13,1084,7366,137
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
Checking formula 12 : !((G(X(X(("(((theProducts_1>=1)&&(theOptions_1>=3))&&(wait_8>=1))")U("((((wait_7>=1)&&(theOptions_1>=2))&&(theProducts_1>=1))&&(theOptions_2>=1))"))))))
Formula 12 simplified : !GXX("(((theProducts_1>=1)&&(theOptions_1>=3))&&(wait_8>=1))" U "((((wait_7>=1)&&(theOptions_1>=2))&&(theProducts_1>=1))&&(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.073546,19084,1,0,41,6130,88,13,1097,7368,141
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
Checking formula 13 : !((G(("(optionSlots_2>=1)")U("((((theOptions_2>=1)&&(theProducts_2>=1))&&(wait_6>=1))&&(theOptions_1>=1))"))))
Formula 13 simplified : !G("(optionSlots_2>=1)" U "((((theOptions_2>=1)&&(theProducts_2>=1))&&(wait_6>=1))&&(theOptions_1>=1))")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.101022,20044,1,0,78,11497,104,30,1109,13606,244
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
Checking formula 14 : !(((X(G(X("(((wait_7>=1)&&(theProducts_1>=1))&&(theOptions_2>=3))"))))U(X("((((theProducts_2>=1)&&(theOptions_1>=1))&&(wait_5>=1))&&(theOptions_2>=1))"))))
Formula 14 simplified : !(XGX"(((wait_7>=1)&&(theProducts_1>=1))&&(theOptions_2>=3))" U X"((((theProducts_2>=1)&&(theOptions_1>=1))&&(wait_5>=1))&&(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.104779,20392,1,0,80,11771,116,30,1122,13822,260
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
Checking formula 15 : !((G(X(G(("(((theOptions_2>=2)&&(theProducts_1>=1))&&(wait_6>=1))")U("((wait_2>=1)&&(theProducts_2>=1))"))))))
Formula 15 simplified : !GXG("(((theOptions_2>=2)&&(theProducts_1>=1))&&(wait_6>=1))" U "((wait_2>=1)&&(theProducts_2>=1))")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.137535,21544,1,0,116,17768,132,46,1131,21004,353
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
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 1527972121523
--------------------
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/ -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/ -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 02, 2018 8:42:00 PM 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/, -smt]
Jun 02, 2018 8:42:00 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2018 8:42:00 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 62 ms
Jun 02, 2018 8:42:00 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 24 places.
Jun 02, 2018 8:42:00 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 72 transitions.
Jun 02, 2018 8:42:00 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 10 ms
Jun 02, 2018 8:42:00 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 43 ms
Jun 02, 2018 8:42:00 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
Jun 02, 2018 8:42:00 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Jun 02, 2018 8:42:01 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 72 transitions.
Jun 02, 2018 8:42:01 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s () (Array Int (Array Int Int))) 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 02, 2018 8:42:01 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 209ms 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="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
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 itstools"
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 r236-blw3-152732477200106"
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 '
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 ;