About the Execution of ITS-Tools for SharedMemory-PT-000005
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15753.150 | 4919.00 | 7752.00 | 533.70 | FTTFFFFFFFFFFFFF | 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 380K
-rw-r--r-- 1 mcc users 8.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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.8K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 29K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.4K 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 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 82K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is SharedMemory-PT-000005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-smll-152732263400568
=====================================================================
--------------------
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 SharedMemory-PT-000005-LTLFireability-00
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-01
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-02
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-03
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-04
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-05
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-06
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-07
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-08
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-09
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-10
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-11
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-12
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-13
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-14
FORMULA_NAME SharedMemory-PT-000005-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1527861057421
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 : !(((("((((((((((((((((((((((Ext_Bus>=1)&&(Memory_2>=1))&&(Queue_1>=1))||(((Ext_Bus>=1)&&(Queue_3>=1))&&(Memory_2>=1)))||(((Ext_Bus>=1)&&(Queue_4>=1))&&(Memory_2>=1)))||(((Queue_5>=1)&&(Memory_2>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Queue_2>=1))&&(Memory_1>=1)))||(((Ext_Bus>=1)&&(Memory_1>=1))&&(Queue_3>=1)))||(((Ext_Bus>=1)&&(Memory_1>=1))&&(Queue_4>=1)))||(((Memory_1>=1)&&(Queue_5>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Memory_4>=1))&&(Queue_1>=1)))||(((Ext_Bus>=1)&&(Queue_2>=1))&&(Memory_4>=1)))||(((Queue_3>=1)&&(Memory_4>=1))&&(Ext_Bus>=1)))||(((Queue_5>=1)&&(Memory_4>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Queue_1>=1))&&(Memory_3>=1)))||(((Ext_Bus>=1)&&(Memory_3>=1))&&(Queue_2>=1)))||(((Ext_Bus>=1)&&(Memory_3>=1))&&(Queue_4>=1)))||(((Memory_3>=1)&&(Queue_5>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Memory_5>=1))&&(Queue_2>=1)))||(((Queue_1>=1)&&(Memory_5>=1))&&(Ext_Bus>=1)))||(((Memory_5>=1)&&(Queue_4>=1))&&(Ext_Bus>=1)))||(((Memory_5>=1)&&(Queue_3>=1))&&(Ext_Bus>=1)))")U(F("(((((Active_2>=1)||(Active_1>=1))||(Active_5>=1))||(Active_3>=1))||(Active_4>=1))")))U(X(("((((((((((((((((((((((Ext_Bus>=1)&&(Memory_2>=1))&&(Queue_1>=1))||(((Ext_Bus>=1)&&(Queue_3>=1))&&(Memory_2>=1)))||(((Ext_Bus>=1)&&(Queue_4>=1))&&(Memory_2>=1)))||(((Queue_5>=1)&&(Memory_2>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Queue_2>=1))&&(Memory_1>=1)))||(((Ext_Bus>=1)&&(Memory_1>=1))&&(Queue_3>=1)))||(((Ext_Bus>=1)&&(Memory_1>=1))&&(Queue_4>=1)))||(((Memory_1>=1)&&(Queue_5>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Memory_4>=1))&&(Queue_1>=1)))||(((Ext_Bus>=1)&&(Queue_2>=1))&&(Memory_4>=1)))||(((Queue_3>=1)&&(Memory_4>=1))&&(Ext_Bus>=1)))||(((Queue_5>=1)&&(Memory_4>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Queue_1>=1))&&(Memory_3>=1)))||(((Ext_Bus>=1)&&(Memory_3>=1))&&(Queue_2>=1)))||(((Ext_Bus>=1)&&(Memory_3>=1))&&(Queue_4>=1)))||(((Memory_3>=1)&&(Queue_5>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Memory_5>=1))&&(Queue_2>=1)))||(((Queue_1>=1)&&(Memory_5>=1))&&(Ext_Bus>=1)))||(((Memory_5>=1)&&(Queue_4>=1))&&(Ext_Bus>=1)))||(((Memory_5>=1)&&(Queue_3>=1))&&(Ext_Bus>=1)))")U("((((((OwnMemAcc_5>=1)&&(Memory_5>=1))||((OwnMemAcc_4>=1)&&(Memory_4>=1)))||((OwnMemAcc_1>=1)&&(Memory_1>=1)))||((OwnMemAcc_3>=1)&&(Memory_3>=1)))||((OwnMemAcc_2>=1)&&(Memory_2>=1)))")))))
Formula 0 simplified : !(("((((((((((((((((((((((Ext_Bus>=1)&&(Memory_2>=1))&&(Queue_1>=1))||(((Ext_Bus>=1)&&(Queue_3>=1))&&(Memory_2>=1)))||(((Ext_Bus>=1)&&(Queue_4>=1))&&(Memory_2>=1)))||(((Queue_5>=1)&&(Memory_2>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Queue_2>=1))&&(Memory_1>=1)))||(((Ext_Bus>=1)&&(Memory_1>=1))&&(Queue_3>=1)))||(((Ext_Bus>=1)&&(Memory_1>=1))&&(Queue_4>=1)))||(((Memory_1>=1)&&(Queue_5>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Memory_4>=1))&&(Queue_1>=1)))||(((Ext_Bus>=1)&&(Queue_2>=1))&&(Memory_4>=1)))||(((Queue_3>=1)&&(Memory_4>=1))&&(Ext_Bus>=1)))||(((Queue_5>=1)&&(Memory_4>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Queue_1>=1))&&(Memory_3>=1)))||(((Ext_Bus>=1)&&(Memory_3>=1))&&(Queue_2>=1)))||(((Ext_Bus>=1)&&(Memory_3>=1))&&(Queue_4>=1)))||(((Memory_3>=1)&&(Queue_5>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Memory_5>=1))&&(Queue_2>=1)))||(((Queue_1>=1)&&(Memory_5>=1))&&(Ext_Bus>=1)))||(((Memory_5>=1)&&(Queue_4>=1))&&(Ext_Bus>=1)))||(((Memory_5>=1)&&(Queue_3>=1))&&(Ext_Bus>=1)))" U F"(((((Active_2>=1)||(Active_1>=1))||(Active_5>=1))||(Active_3>=1))||(Active_4>=1))") U X("((((((((((((((((((((((Ext_Bus>=1)&&(Memory_2>=1))&&(Queue_1>=1))||(((Ext_Bus>=1)&&(Queue_3>=1))&&(Memory_2>=1)))||(((Ext_Bus>=1)&&(Queue_4>=1))&&(Memory_2>=1)))||(((Queue_5>=1)&&(Memory_2>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Queue_2>=1))&&(Memory_1>=1)))||(((Ext_Bus>=1)&&(Memory_1>=1))&&(Queue_3>=1)))||(((Ext_Bus>=1)&&(Memory_1>=1))&&(Queue_4>=1)))||(((Memory_1>=1)&&(Queue_5>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Memory_4>=1))&&(Queue_1>=1)))||(((Ext_Bus>=1)&&(Queue_2>=1))&&(Memory_4>=1)))||(((Queue_3>=1)&&(Memory_4>=1))&&(Ext_Bus>=1)))||(((Queue_5>=1)&&(Memory_4>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Queue_1>=1))&&(Memory_3>=1)))||(((Ext_Bus>=1)&&(Memory_3>=1))&&(Queue_2>=1)))||(((Ext_Bus>=1)&&(Memory_3>=1))&&(Queue_4>=1)))||(((Memory_3>=1)&&(Queue_5>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Memory_5>=1))&&(Queue_2>=1)))||(((Queue_1>=1)&&(Memory_5>=1))&&(Ext_Bus>=1)))||(((Memory_5>=1)&&(Queue_4>=1))&&(Ext_Bus>=1)))||(((Memory_5>=1)&&(Queue_3>=1))&&(Ext_Bus>=1)))" U "((((((OwnMemAcc_5>=1)&&(Memory_5>=1))||((OwnMemAcc_4>=1)&&(Memory_4>=1)))||((OwnMemAcc_1>=1)&&(Memory_1>=1)))||((OwnMemAcc_3>=1)&&(Memory_3>=1)))||((OwnMemAcc_2>=1)&&(Memory_2>=1)))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
2 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
12 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.147619,21248,1,0,23,19354,30,5,1252,12663,53
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((X(X(X("(((((Active_2>=1)||(Active_1>=1))||(Active_4>=1))||(Active_3>=1))||(Active_5>=1))")))))
Formula 1 simplified : !XXX"(((((Active_2>=1)||(Active_1>=1))||(Active_4>=1))||(Active_3>=1))||(Active_5>=1))"
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.159928,21652,1,0,25,19812,30,5,1252,13082,61
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA SharedMemory-PT-000005-LTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((X(F(G(F(F("(((((Active_2>=1)||(Active_1>=1))||(Active_5>=1))||(Active_3>=1))||(Active_4>=1))")))))))
Formula 2 simplified : !XFGF"(((((Active_2>=1)||(Active_1>=1))||(Active_5>=1))||(Active_3>=1))||(Active_4>=1))"
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 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.197548,22516,1,0,29,21705,37,6,1299,15700,83
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA SharedMemory-PT-000005-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((X(F((G("((((((((((((((((((((Ext_Mem_Acc_4_1>=1)||(Ext_Mem_Acc_5_1>=1))||(Ext_Mem_Acc_2_1>=1))||(Ext_Mem_Acc_3_1>=1))||(Ext_Mem_Acc_5_2>=1))||(Ext_Mem_Acc_4_2>=1))||(Ext_Mem_Acc_3_2>=1))||(Ext_Mem_Acc_1_2>=1))||(Ext_Mem_Acc_5_3>=1))||(Ext_Mem_Acc_4_3>=1))||(Ext_Mem_Acc_2_3>=1))||(Ext_Mem_Acc_1_3>=1))||(Ext_Mem_Acc_5_4>=1))||(Ext_Mem_Acc_3_4>=1))||(Ext_Mem_Acc_2_4>=1))||(Ext_Mem_Acc_1_4>=1))||(Ext_Mem_Acc_4_5>=1))||(Ext_Mem_Acc_3_5>=1))||(Ext_Mem_Acc_2_5>=1))||(Ext_Mem_Acc_1_5>=1))"))U(F("((((((((((((((((((((((Ext_Bus>=1)&&(Memory_2>=1))&&(Queue_1>=1))||(((Ext_Bus>=1)&&(Queue_3>=1))&&(Memory_2>=1)))||(((Ext_Bus>=1)&&(Queue_4>=1))&&(Memory_2>=1)))||(((Queue_5>=1)&&(Memory_2>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Queue_2>=1))&&(Memory_1>=1)))||(((Ext_Bus>=1)&&(Memory_1>=1))&&(Queue_3>=1)))||(((Ext_Bus>=1)&&(Memory_1>=1))&&(Queue_4>=1)))||(((Memory_1>=1)&&(Queue_5>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Memory_4>=1))&&(Queue_1>=1)))||(((Ext_Bus>=1)&&(Queue_2>=1))&&(Memory_4>=1)))||(((Queue_3>=1)&&(Memory_4>=1))&&(Ext_Bus>=1)))||(((Queue_5>=1)&&(Memory_4>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Queue_1>=1))&&(Memory_3>=1)))||(((Ext_Bus>=1)&&(Memory_3>=1))&&(Queue_2>=1)))||(((Ext_Bus>=1)&&(Memory_3>=1))&&(Queue_4>=1)))||(((Memory_3>=1)&&(Queue_5>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Memory_5>=1))&&(Queue_2>=1)))||(((Queue_1>=1)&&(Memory_5>=1))&&(Ext_Bus>=1)))||(((Memory_5>=1)&&(Queue_4>=1))&&(Ext_Bus>=1)))||(((Memory_5>=1)&&(Queue_3>=1))&&(Ext_Bus>=1)))"))))))
Formula 3 simplified : !XF(G"((((((((((((((((((((Ext_Mem_Acc_4_1>=1)||(Ext_Mem_Acc_5_1>=1))||(Ext_Mem_Acc_2_1>=1))||(Ext_Mem_Acc_3_1>=1))||(Ext_Mem_Acc_5_2>=1))||(Ext_Mem_Acc_4_2>=1))||(Ext_Mem_Acc_3_2>=1))||(Ext_Mem_Acc_1_2>=1))||(Ext_Mem_Acc_5_3>=1))||(Ext_Mem_Acc_4_3>=1))||(Ext_Mem_Acc_2_3>=1))||(Ext_Mem_Acc_1_3>=1))||(Ext_Mem_Acc_5_4>=1))||(Ext_Mem_Acc_3_4>=1))||(Ext_Mem_Acc_2_4>=1))||(Ext_Mem_Acc_1_4>=1))||(Ext_Mem_Acc_4_5>=1))||(Ext_Mem_Acc_3_5>=1))||(Ext_Mem_Acc_2_5>=1))||(Ext_Mem_Acc_1_5>=1))" U F"((((((((((((((((((((((Ext_Bus>=1)&&(Memory_2>=1))&&(Queue_1>=1))||(((Ext_Bus>=1)&&(Queue_3>=1))&&(Memory_2>=1)))||(((Ext_Bus>=1)&&(Queue_4>=1))&&(Memory_2>=1)))||(((Queue_5>=1)&&(Memory_2>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Queue_2>=1))&&(Memory_1>=1)))||(((Ext_Bus>=1)&&(Memory_1>=1))&&(Queue_3>=1)))||(((Ext_Bus>=1)&&(Memory_1>=1))&&(Queue_4>=1)))||(((Memory_1>=1)&&(Queue_5>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Memory_4>=1))&&(Queue_1>=1)))||(((Ext_Bus>=1)&&(Queue_2>=1))&&(Memory_4>=1)))||(((Queue_3>=1)&&(Memory_4>=1))&&(Ext_Bus>=1)))||(((Queue_5>=1)&&(Memory_4>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Queue_1>=1))&&(Memory_3>=1)))||(((Ext_Bus>=1)&&(Memory_3>=1))&&(Queue_2>=1)))||(((Ext_Bus>=1)&&(Memory_3>=1))&&(Queue_4>=1)))||(((Memory_3>=1)&&(Queue_5>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Memory_5>=1))&&(Queue_2>=1)))||(((Queue_1>=1)&&(Memory_5>=1))&&(Ext_Bus>=1)))||(((Memory_5>=1)&&(Queue_4>=1))&&(Ext_Bus>=1)))||(((Memory_5>=1)&&(Queue_3>=1))&&(Ext_Bus>=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.210203,22764,1,0,39,22365,44,10,1304,17015,113
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((F(X(G(X("(((((Active_2>=1)||(Active_1>=1))||(Active_4>=1))||(Active_3>=1))||(Active_5>=1))"))))))
Formula 4 simplified : !FXGX"(((((Active_2>=1)||(Active_1>=1))||(Active_4>=1))||(Active_3>=1))||(Active_5>=1))"
3 unique states visited
2 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.218334,22928,1,0,39,22834,44,11,1304,19493,116
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((X(X(F(("(((((Active_2>=1)||(Active_1>=1))||(Active_4>=1))||(Active_3>=1))||(Active_5>=1))")U("((((((((((((((((((((((Ext_Bus>=1)&&(Memory_2>=1))&&(Queue_1>=1))||(((Ext_Bus>=1)&&(Queue_3>=1))&&(Memory_2>=1)))||(((Ext_Bus>=1)&&(Queue_4>=1))&&(Memory_2>=1)))||(((Queue_5>=1)&&(Memory_2>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Queue_2>=1))&&(Memory_1>=1)))||(((Ext_Bus>=1)&&(Memory_1>=1))&&(Queue_3>=1)))||(((Ext_Bus>=1)&&(Memory_1>=1))&&(Queue_4>=1)))||(((Memory_1>=1)&&(Queue_5>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Memory_4>=1))&&(Queue_1>=1)))||(((Ext_Bus>=1)&&(Queue_2>=1))&&(Memory_4>=1)))||(((Queue_3>=1)&&(Memory_4>=1))&&(Ext_Bus>=1)))||(((Queue_5>=1)&&(Memory_4>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Queue_1>=1))&&(Memory_3>=1)))||(((Ext_Bus>=1)&&(Memory_3>=1))&&(Queue_2>=1)))||(((Ext_Bus>=1)&&(Memory_3>=1))&&(Queue_4>=1)))||(((Memory_3>=1)&&(Queue_5>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Memory_5>=1))&&(Queue_2>=1)))||(((Queue_1>=1)&&(Memory_5>=1))&&(Ext_Bus>=1)))||(((Memory_5>=1)&&(Queue_4>=1))&&(Ext_Bus>=1)))||(((Memory_5>=1)&&(Queue_3>=1))&&(Ext_Bus>=1)))"))))))
Formula 5 simplified : !XXF("(((((Active_2>=1)||(Active_1>=1))||(Active_4>=1))||(Active_3>=1))||(Active_5>=1))" U "((((((((((((((((((((((Ext_Bus>=1)&&(Memory_2>=1))&&(Queue_1>=1))||(((Ext_Bus>=1)&&(Queue_3>=1))&&(Memory_2>=1)))||(((Ext_Bus>=1)&&(Queue_4>=1))&&(Memory_2>=1)))||(((Queue_5>=1)&&(Memory_2>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Queue_2>=1))&&(Memory_1>=1)))||(((Ext_Bus>=1)&&(Memory_1>=1))&&(Queue_3>=1)))||(((Ext_Bus>=1)&&(Memory_1>=1))&&(Queue_4>=1)))||(((Memory_1>=1)&&(Queue_5>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Memory_4>=1))&&(Queue_1>=1)))||(((Ext_Bus>=1)&&(Queue_2>=1))&&(Memory_4>=1)))||(((Queue_3>=1)&&(Memory_4>=1))&&(Ext_Bus>=1)))||(((Queue_5>=1)&&(Memory_4>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Queue_1>=1))&&(Memory_3>=1)))||(((Ext_Bus>=1)&&(Memory_3>=1))&&(Queue_2>=1)))||(((Ext_Bus>=1)&&(Memory_3>=1))&&(Queue_4>=1)))||(((Memory_3>=1)&&(Queue_5>=1))&&(Ext_Bus>=1)))||(((Ext_Bus>=1)&&(Memory_5>=1))&&(Queue_2>=1)))||(((Queue_1>=1)&&(Memory_5>=1))&&(Ext_Bus>=1)))||(((Memory_5>=1)&&(Queue_4>=1))&&(Ext_Bus>=1)))||(((Memory_5>=1)&&(Queue_3>=1))&&(Ext_Bus>=1)))")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 55 rows 41 cols
invariant :Ext_Mem_Acc_2_1 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_5_1 + Memory_1 = 1
invariant :-1'Ext_Mem_Acc_3_1 + -1'Ext_Mem_Acc_4_1 + -1'Ext_Mem_Acc_5_1 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_2_5 + -1'Memory_1 + Active_2 + Queue_2 + OwnMemAcc_2 = 0
invariant :-1'Ext_Mem_Acc_3_2 + -1'Ext_Mem_Acc_4_2 + -1'Ext_Mem_Acc_5_2 + -1'Ext_Mem_Acc_2_3 + -1'Ext_Mem_Acc_4_3 + -1'Ext_Mem_Acc_5_3 + -1'Ext_Mem_Acc_3_4 + -1'Ext_Mem_Acc_2_4 + -1'Ext_Mem_Acc_5_4 + -1'Ext_Mem_Acc_3_5 + -1'Ext_Mem_Acc_2_5 + -1'Ext_Mem_Acc_4_5 + -1'Memory_2 + -1'Memory_4 + -1'Memory_3 + Active_1 + -1'Memory_5 + Queue_1 + OwnMemAcc_1 = -3
invariant :Ext_Mem_Acc_5_1 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_5_3 + Ext_Mem_Acc_5_4 + Active_5 + Queue_5 + OwnMemAcc_5 = 1
invariant :Ext_Mem_Acc_1_5 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_4_5 + Memory_5 = 1
invariant :Ext_Mem_Acc_1_3 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_5_3 + Memory_3 = 1
invariant :Ext_Mem_Acc_1_2 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_5_2 + Memory_2 = 1
invariant :Ext_Mem_Acc_1_4 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_5_4 + Memory_4 = 1
invariant :Ext_Bus + -1'Memory_2 + -1'Memory_1 + -1'Memory_4 + -1'Memory_3 + -1'Memory_5 = -4
invariant :Ext_Mem_Acc_4_1 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_4_5 + Active_4 + Queue_4 + OwnMemAcc_4 = 1
invariant :Ext_Mem_Acc_3_1 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_5 + Active_3 + Queue_3 + OwnMemAcc_3 = 1
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
5 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.268464,24248,1,0,51,25752,44,16,1304,26327,148
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !(("((((((OwnMemAcc_5>=1)&&(Memory_5>=1))||((OwnMemAcc_4>=1)&&(Memory_4>=1)))||((OwnMemAcc_1>=1)&&(Memory_1>=1)))||((OwnMemAcc_3>=1)&&(Memory_3>=1)))||((OwnMemAcc_2>=1)&&(Memory_2>=1)))"))
Formula 6 simplified : !"((((((OwnMemAcc_5>=1)&&(Memory_5>=1))||((OwnMemAcc_4>=1)&&(Memory_4>=1)))||((OwnMemAcc_1>=1)&&(Memory_1>=1)))||((OwnMemAcc_3>=1)&&(Memory_3>=1)))||((OwnMemAcc_2>=1)&&(Memory_2>=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.270102,24248,1,0,51,25752,46,16,1304,26327,152
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((F(F(G(("(((((Active_2>=1)||(Active_1>=1))||(Active_4>=1))||(Active_3>=1))||(Active_5>=1))")U("(((((Active_2>=1)||(Active_1>=1))||(Active_4>=1))||(Active_3>=1))||(Active_5>=1))"))))))
Formula 7 simplified : !FG"(((((Active_2>=1)||(Active_1>=1))||(Active_4>=1))||(Active_3>=1))||(Active_5>=1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
5 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.320449,25828,1,0,64,30535,56,29,1307,36519,214
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((G("(((Queue_5>=1)&&(Memory_4>=1))&&(Ext_Bus>=1))")))
Formula 8 simplified : !G"(((Queue_5>=1)&&(Memory_4>=1))&&(Ext_Bus>=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.321573,26088,1,0,64,30535,62,29,1308,36519,219
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !(((G(F(G("(Ext_Mem_Acc_4_2>=1)"))))U(X("(((Queue_5>=1)&&(Memory_4>=1))&&(Ext_Bus>=1))"))))
Formula 9 simplified : !(GFG"(Ext_Mem_Acc_4_2>=1)" U X"(((Queue_5>=1)&&(Memory_4>=1))&&(Ext_Bus>=1))")
4 unique states visited
4 strongly connected components in search stack
4 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.337435,26768,1,0,86,31999,75,39,1309,40440,277
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !(((X(X("(Ext_Mem_Acc_1_2>=1)")))U("(((Memory_5>=1)&&(Queue_4>=1))&&(Ext_Bus>=1))")))
Formula 10 simplified : !(XX"(Ext_Mem_Acc_1_2>=1)" U "(((Memory_5>=1)&&(Queue_4>=1))&&(Ext_Bus>=1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.343266,26768,1,0,98,32626,80,44,1309,41484,311
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((F("(((Memory_5>=1)&&(Queue_3>=1))&&(Ext_Bus>=1))")))
Formula 11 simplified : !F"(((Memory_5>=1)&&(Queue_3>=1))&&(Ext_Bus>=1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.352083,27284,1,0,109,33984,89,49,1309,43268,348
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !(("(((Queue_5>=1)&&(Memory_4>=1))&&(Ext_Bus>=1))"))
Formula 12 simplified : !"(((Queue_5>=1)&&(Memory_4>=1))&&(Ext_Bus>=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.352805,27284,1,0,109,33984,89,49,1309,43268,348
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((F(G((X("(Ext_Mem_Acc_3_4>=1)"))U(F("((OwnMemAcc_4>=1)&&(Memory_4>=1))"))))))
Formula 13 simplified : !FG(X"(Ext_Mem_Acc_3_4>=1)" U F"((OwnMemAcc_4>=1)&&(Memory_4>=1))")
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.354835,27536,1,0,110,34129,98,49,1309,43423,359
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !(("(Ext_Mem_Acc_5_3>=1)"))
Formula 14 simplified : !"(Ext_Mem_Acc_5_3>=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.355206,27536,1,0,110,34129,101,49,1310,43423,361
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((X(X(G(X(G("(Ext_Mem_Acc_3_2>=1)")))))))
Formula 15 simplified : !XXGXG"(Ext_Mem_Acc_3_2>=1)"
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.373048,27768,1,0,124,36127,107,54,1311,46452,394
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA SharedMemory-PT-000005-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 1527861062340
--------------------
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 01, 2018 1:50:59 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 01, 2018 1:50:59 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2018 1:51:00 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 65 ms
Jun 01, 2018 1:51:00 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 41 places.
Jun 01, 2018 1:51:00 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 55 transitions.
Jun 01, 2018 1:51:00 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 10 ms
Jun 01, 2018 1:51:00 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 42 ms
Jun 01, 2018 1:51:00 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 7 ms
Jun 01, 2018 1:51:00 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 4 ms
Jun 01, 2018 1:51:00 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 55 transitions.
Jun 01, 2018 1:51:00 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 11 place invariants in 17 ms
Jun 01, 2018 1:51:01 PM fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver checkSat
WARNING: SMT solver unexpectedly returned 'unknown' answer, retrying.
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout :(error "Failed to check-sat")
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:297)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:305)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:116)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
Jun 01, 2018 1:51:01 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 420ms 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="SharedMemory-PT-000005"
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/SharedMemory-PT-000005.tgz
mv SharedMemory-PT-000005 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 SharedMemory-PT-000005, 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 r212-smll-152732263400568"
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 ;