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)
................
=====================================================================
Generated by BenchKit 2-2979
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 r109kn-smll-146373287500357
=====================================================================

--------------------
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-COL-000005-LTLFireability-0
FORMULA_NAME SharedMemory-COL-000005-LTLFireability-1
FORMULA_NAME SharedMemory-COL-000005-LTLFireability-10
FORMULA_NAME SharedMemory-COL-000005-LTLFireability-11
FORMULA_NAME SharedMemory-COL-000005-LTLFireability-12
FORMULA_NAME SharedMemory-COL-000005-LTLFireability-13
FORMULA_NAME SharedMemory-COL-000005-LTLFireability-14
FORMULA_NAME SharedMemory-COL-000005-LTLFireability-15
FORMULA_NAME SharedMemory-COL-000005-LTLFireability-2
FORMULA_NAME SharedMemory-COL-000005-LTLFireability-3
FORMULA_NAME SharedMemory-COL-000005-LTLFireability-4
FORMULA_NAME SharedMemory-COL-000005-LTLFireability-5
FORMULA_NAME SharedMemory-COL-000005-LTLFireability-6
FORMULA_NAME SharedMemory-COL-000005-LTLFireability-7
FORMULA_NAME SharedMemory-COL-000005-LTLFireability-8
FORMULA_NAME SharedMemory-COL-000005-LTLFireability-9

=== Now, execution of the tool begins

BK_START 1464037187890


its-ltl command run as :

/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201605191313/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((F(X(((((((((((((((((((("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")))))
Formula 0 simplified : !FX("Ext_Mem_Acc_1_2>=1" | "Ext_Mem_Acc_1_3>=1" | "Ext_Mem_Acc_1_4>=1" | "Ext_Mem_Acc_1_5>=1" | "Ext_Mem_Acc_2_1>=1" | "Ext_Mem_Acc_2_3>=1" | "Ext_Mem_Acc_2_4>=1" | "Ext_Mem_Acc_2_5>=1" | "Ext_Mem_Acc_3_1>=1" | "Ext_Mem_Acc_3_2>=1" | "Ext_Mem_Acc_3_4>=1" | "Ext_Mem_Acc_3_5>=1" | "Ext_Mem_Acc_4_1>=1" | "Ext_Mem_Acc_4_2>=1" | "Ext_Mem_Acc_4_3>=1" | "Ext_Mem_Acc_4_5>=1" | "Ext_Mem_Acc_5_1>=1" | "Ext_Mem_Acc_5_2>=1" | "Ext_Mem_Acc_5_3>=1" | "Ext_Mem_Acc_5_4>=1")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
9 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,20.4111,68320,1,0,15,14621,96,5,1211,8020,37
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA SharedMemory-COL-000005-LTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((F(((((("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 1 simplified : !F(("Memory_5>=1" & "OwnMemAcc_5>=1") | ("Memory_4>=1" & "OwnMemAcc_4>=1") | ("Memory_1>=1" & "OwnMemAcc_1>=1") | ("Memory_3>=1" & "OwnMemAcc_3>=1") | ("Memory_2>=1" & "OwnMemAcc_2>=1"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,20.4528,70136,1,0,28,20433,154,11,1257,15019,74
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA SharedMemory-COL-000005-LTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((X((((("Active_2>=1")||("Active_1>=1"))||("Active_5>=1"))||("Active_3>=1"))||("Active_4>=1"))))
Formula 2 simplified : !X("Active_1>=1" | "Active_2>=1" | "Active_3>=1" | "Active_4>=1" | "Active_5>=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,20.4539,70156,1,0,28,20433,173,11,1273,15019,76
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA SharedMemory-COL-000005-LTLFireability-2 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !(((((("Active_2>=1")||("Active_1>=1"))||("Active_5>=1"))||("Active_3>=1"))||("Active_4>=1")))
Formula 3 simplified : !("Active_1>=1" | "Active_2>=1" | "Active_3>=1" | "Active_4>=1" | "Active_5>=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,20.4545,70408,1,0,28,20433,173,11,1273,15019,78
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA SharedMemory-COL-000005-LTLFireability-3 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((G(X(X(F(((((((((((((((((((("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")))))))
Formula 4 simplified : !GXXF("Ext_Mem_Acc_1_2>=1" | "Ext_Mem_Acc_1_3>=1" | "Ext_Mem_Acc_1_4>=1" | "Ext_Mem_Acc_1_5>=1" | "Ext_Mem_Acc_2_1>=1" | "Ext_Mem_Acc_2_3>=1" | "Ext_Mem_Acc_2_4>=1" | "Ext_Mem_Acc_2_5>=1" | "Ext_Mem_Acc_3_1>=1" | "Ext_Mem_Acc_3_2>=1" | "Ext_Mem_Acc_3_4>=1" | "Ext_Mem_Acc_3_5>=1" | "Ext_Mem_Acc_4_1>=1" | "Ext_Mem_Acc_4_2>=1" | "Ext_Mem_Acc_4_3>=1" | "Ext_Mem_Acc_4_5>=1" | "Ext_Mem_Acc_5_1>=1" | "Ext_Mem_Acc_5_2>=1" | "Ext_Mem_Acc_5_3>=1" | "Ext_Mem_Acc_5_4>=1")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,86.8791,70956,1,0,28,20647,177,11,1320,15536,86
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA SharedMemory-COL-000005-LTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((F(X(X(((((((((((((((((((("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"))))))
Formula 5 simplified : !FXX("Ext_Mem_Acc_1_2>=1" | "Ext_Mem_Acc_1_3>=1" | "Ext_Mem_Acc_1_4>=1" | "Ext_Mem_Acc_1_5>=1" | "Ext_Mem_Acc_2_1>=1" | "Ext_Mem_Acc_2_3>=1" | "Ext_Mem_Acc_2_4>=1" | "Ext_Mem_Acc_2_5>=1" | "Ext_Mem_Acc_3_1>=1" | "Ext_Mem_Acc_3_2>=1" | "Ext_Mem_Acc_3_4>=1" | "Ext_Mem_Acc_3_5>=1" | "Ext_Mem_Acc_4_1>=1" | "Ext_Mem_Acc_4_2>=1" | "Ext_Mem_Acc_4_3>=1" | "Ext_Mem_Acc_4_5>=1" | "Ext_Mem_Acc_5_1>=1" | "Ext_Mem_Acc_5_2>=1" | "Ext_Mem_Acc_5_3>=1" | "Ext_Mem_Acc_5_4>=1")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,119.619,123456,1,0,30,20988,177,12,1320,16178,92
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA SharedMemory-COL-000005-LTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((G(G(G(G(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 6 simplified : !GF(("Ext_Bus>=1" & "Memory_2>=1" & "Queue_1>=1") | ("Ext_Bus>=1" & "Memory_2>=1" & "Queue_3>=1") | ("Ext_Bus>=1" & "Memory_2>=1" & "Queue_4>=1") | ("Ext_Bus>=1" & "Memory_2>=1" & "Queue_5>=1") | ("Ext_Bus>=1" & "Memory_1>=1" & "Queue_2>=1") | ("Ext_Bus>=1" & "Memory_1>=1" & "Queue_3>=1") | ("Ext_Bus>=1" & "Memory_1>=1" & "Queue_4>=1") | ("Ext_Bus>=1" & "Memory_1>=1" & "Queue_5>=1") | ("Ext_Bus>=1" & "Memory_4>=1" & "Queue_1>=1") | ("Ext_Bus>=1" & "Memory_4>=1" & "Queue_2>=1") | ("Ext_Bus>=1" & "Memory_4>=1" & "Queue_3>=1") | ("Ext_Bus>=1" & "Memory_4>=1" & "Queue_5>=1") | ("Ext_Bus>=1" & "Memory_3>=1" & "Queue_1>=1") | ("Ext_Bus>=1" & "Memory_3>=1" & "Queue_2>=1") | ("Ext_Bus>=1" & "Memory_3>=1" & "Queue_4>=1") | ("Ext_Bus>=1" & "Memory_3>=1" & "Queue_5>=1") | ("Ext_Bus>=1" & "Memory_5>=1" & "Queue_2>=1") | ("Ext_Bus>=1" & "Memory_5>=1" & "Queue_1>=1") | ("Ext_Bus>=1" & "Memory_5>=1" & "Queue_4>=1") | ("Ext_Bus>=1" & "Memory_5>=1" & "Queue_3>=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,119.731,123460,1,0,32,21413,285,12,1422,16751,103
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA SharedMemory-COL-000005-LTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(((G(X(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((((("Active_2>=1")||("Active_1>=1"))||("Active_4>=1"))||("Active_3>=1"))||("Active_5>=1"))))
Formula 7 simplified : !(GXX(("Ext_Bus>=1" & "Memory_2>=1" & "Queue_1>=1") | ("Ext_Bus>=1" & "Memory_2>=1" & "Queue_3>=1") | ("Ext_Bus>=1" & "Memory_2>=1" & "Queue_4>=1") | ("Ext_Bus>=1" & "Memory_2>=1" & "Queue_5>=1") | ("Ext_Bus>=1" & "Memory_1>=1" & "Queue_2>=1") | ("Ext_Bus>=1" & "Memory_1>=1" & "Queue_3>=1") | ("Ext_Bus>=1" & "Memory_1>=1" & "Queue_4>=1") | ("Ext_Bus>=1" & "Memory_1>=1" & "Queue_5>=1") | ("Ext_Bus>=1" & "Memory_4>=1" & "Queue_1>=1") | ("Ext_Bus>=1" & "Memory_4>=1" & "Queue_2>=1") | ("Ext_Bus>=1" & "Memory_4>=1" & "Queue_3>=1") | ("Ext_Bus>=1" & "Memory_4>=1" & "Queue_5>=1") | ("Ext_Bus>=1" & "Memory_3>=1" & "Queue_1>=1") | ("Ext_Bus>=1" & "Memory_3>=1" & "Queue_2>=1") | ("Ext_Bus>=1" & "Memory_3>=1" & "Queue_4>=1") | ("Ext_Bus>=1" & "Memory_3>=1" & "Queue_5>=1") | ("Ext_Bus>=1" & "Memory_5>=1" & "Queue_2>=1") | ("Ext_Bus>=1" & "Memory_5>=1" & "Queue_1>=1") | ("Ext_Bus>=1" & "Memory_5>=1" & "Queue_4>=1") | ("Ext_Bus>=1" & "Memory_5>=1" & "Queue_3>=1")) U ("Active_1>=1" | "Active_2>=1" | "Active_3>=1" | "Active_4>=1" | "Active_5>=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,121.435,123460,1,0,32,21413,294,12,1431,16751,105
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA SharedMemory-COL-000005-LTLFireability-7 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((X((G(((((((((((((((((((((("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(G((((("Active_2>=1")||("Active_1>=1"))||("Active_4>=1"))||("Active_3>=1"))||("Active_5>=1"))))))
Formula 8 simplified : !X(G(("Ext_Bus>=1" & "Memory_2>=1" & "Queue_1>=1") | ("Ext_Bus>=1" & "Memory_2>=1" & "Queue_3>=1") | ("Ext_Bus>=1" & "Memory_2>=1" & "Queue_4>=1") | ("Ext_Bus>=1" & "Memory_2>=1" & "Queue_5>=1") | ("Ext_Bus>=1" & "Memory_1>=1" & "Queue_2>=1") | ("Ext_Bus>=1" & "Memory_1>=1" & "Queue_3>=1") | ("Ext_Bus>=1" & "Memory_1>=1" & "Queue_4>=1") | ("Ext_Bus>=1" & "Memory_1>=1" & "Queue_5>=1") | ("Ext_Bus>=1" & "Memory_4>=1" & "Queue_1>=1") | ("Ext_Bus>=1" & "Memory_4>=1" & "Queue_2>=1") | ("Ext_Bus>=1" & "Memory_4>=1" & "Queue_3>=1") | ("Ext_Bus>=1" & "Memory_4>=1" & "Queue_5>=1") | ("Ext_Bus>=1" & "Memory_3>=1" & "Queue_1>=1") | ("Ext_Bus>=1" & "Memory_3>=1" & "Queue_2>=1") | ("Ext_Bus>=1" & "Memory_3>=1" & "Queue_4>=1") | ("Ext_Bus>=1" & "Memory_3>=1" & "Queue_5>=1") | ("Ext_Bus>=1" & "Memory_5>=1" & "Queue_2>=1") | ("Ext_Bus>=1" & "Memory_5>=1" & "Queue_1>=1") | ("Ext_Bus>=1" & "Memory_5>=1" & "Queue_4>=1") | ("Ext_Bus>=1" & "Memory_5>=1" & "Queue_3>=1")) U G("Active_1>=1" | "Active_2>=1" | "Active_3>=1" | "Active_4>=1" | "Active_5>=1"))
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
11 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,135.218,123524,1,0,61,30083,843,23,1992,29471,186
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA SharedMemory-COL-000005-LTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((G(F(F(G(X((((("Active_2>=1")||("Active_1>=1"))||("Active_5>=1"))||("Active_3>=1"))||("Active_4>=1"))))))))
Formula 9 simplified : !GFGX("Active_1>=1" | "Active_2>=1" | "Active_3>=1" | "Active_4>=1" | "Active_5>=1")
2 unique states visited
1 strongly connected components in search stack
3 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,135.224,123528,1,0,63,30309,845,25,1992,31716,195
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA SharedMemory-COL-000005-LTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((((((((((((((((((((("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")))
Formula 10 simplified : !("Ext_Mem_Acc_1_2>=1" | "Ext_Mem_Acc_1_3>=1" | "Ext_Mem_Acc_1_4>=1" | "Ext_Mem_Acc_1_5>=1" | "Ext_Mem_Acc_2_1>=1" | "Ext_Mem_Acc_2_3>=1" | "Ext_Mem_Acc_2_4>=1" | "Ext_Mem_Acc_2_5>=1" | "Ext_Mem_Acc_3_1>=1" | "Ext_Mem_Acc_3_2>=1" | "Ext_Mem_Acc_3_4>=1" | "Ext_Mem_Acc_3_5>=1" | "Ext_Mem_Acc_4_1>=1" | "Ext_Mem_Acc_4_2>=1" | "Ext_Mem_Acc_4_3>=1" | "Ext_Mem_Acc_4_5>=1" | "Ext_Mem_Acc_5_1>=1" | "Ext_Mem_Acc_5_2>=1" | "Ext_Mem_Acc_5_3>=1" | "Ext_Mem_Acc_5_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,153.493,126664,1,0,63,30310,845,25,1992,31718,199
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA SharedMemory-COL-000005-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((F(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 11 simplified : !F(("Ext_Bus>=1" & "Memory_2>=1" & "Queue_1>=1") | ("Ext_Bus>=1" & "Memory_2>=1" & "Queue_3>=1") | ("Ext_Bus>=1" & "Memory_2>=1" & "Queue_4>=1") | ("Ext_Bus>=1" & "Memory_2>=1" & "Queue_5>=1") | ("Ext_Bus>=1" & "Memory_1>=1" & "Queue_2>=1") | ("Ext_Bus>=1" & "Memory_1>=1" & "Queue_3>=1") | ("Ext_Bus>=1" & "Memory_1>=1" & "Queue_4>=1") | ("Ext_Bus>=1" & "Memory_1>=1" & "Queue_5>=1") | ("Ext_Bus>=1" & "Memory_4>=1" & "Queue_1>=1") | ("Ext_Bus>=1" & "Memory_4>=1" & "Queue_2>=1") | ("Ext_Bus>=1" & "Memory_4>=1" & "Queue_3>=1") | ("Ext_Bus>=1" & "Memory_4>=1" & "Queue_5>=1") | ("Ext_Bus>=1" & "Memory_3>=1" & "Queue_1>=1") | ("Ext_Bus>=1" & "Memory_3>=1" & "Queue_2>=1") | ("Ext_Bus>=1" & "Memory_3>=1" & "Queue_4>=1") | ("Ext_Bus>=1" & "Memory_3>=1" & "Queue_5>=1") | ("Ext_Bus>=1" & "Memory_5>=1" & "Queue_2>=1") | ("Ext_Bus>=1" & "Memory_5>=1" & "Queue_1>=1") | ("Ext_Bus>=1" & "Memory_5>=1" & "Queue_4>=1") | ("Ext_Bus>=1" & "Memory_5>=1" & "Queue_3>=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,153.516,126668,1,0,72,30771,845,29,1992,32734,231
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA SharedMemory-COL-000005-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((X(X(F((((((("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")))U(((((((((((((((((((("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")))))))
Formula 12 simplified : !XXF((("Memory_5>=1" & "OwnMemAcc_5>=1") | ("Memory_4>=1" & "OwnMemAcc_4>=1") | ("Memory_1>=1" & "OwnMemAcc_1>=1") | ("Memory_3>=1" & "OwnMemAcc_3>=1") | ("Memory_2>=1" & "OwnMemAcc_2>=1")) U ("Ext_Mem_Acc_1_2>=1" | "Ext_Mem_Acc_1_3>=1" | "Ext_Mem_Acc_1_4>=1" | "Ext_Mem_Acc_1_5>=1" | "Ext_Mem_Acc_2_1>=1" | "Ext_Mem_Acc_2_3>=1" | "Ext_Mem_Acc_2_4>=1" | "Ext_Mem_Acc_2_5>=1" | "Ext_Mem_Acc_3_1>=1" | "Ext_Mem_Acc_3_2>=1" | "Ext_Mem_Acc_3_4>=1" | "Ext_Mem_Acc_3_5>=1" | "Ext_Mem_Acc_4_1>=1" | "Ext_Mem_Acc_4_2>=1" | "Ext_Mem_Acc_4_3>=1" | "Ext_Mem_Acc_4_5>=1" | "Ext_Mem_Acc_5_1>=1" | "Ext_Mem_Acc_5_2>=1" | "Ext_Mem_Acc_5_3>=1" | "Ext_Mem_Acc_5_4>=1"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,184.395,126844,1,0,72,30771,845,29,1992,32734,231
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA SharedMemory-COL-000005-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((G(F((F(((((((((((((((((((("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(((((("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 13 simplified : !GF(F("Ext_Mem_Acc_1_2>=1" | "Ext_Mem_Acc_1_3>=1" | "Ext_Mem_Acc_1_4>=1" | "Ext_Mem_Acc_1_5>=1" | "Ext_Mem_Acc_2_1>=1" | "Ext_Mem_Acc_2_3>=1" | "Ext_Mem_Acc_2_4>=1" | "Ext_Mem_Acc_2_5>=1" | "Ext_Mem_Acc_3_1>=1" | "Ext_Mem_Acc_3_2>=1" | "Ext_Mem_Acc_3_4>=1" | "Ext_Mem_Acc_3_5>=1" | "Ext_Mem_Acc_4_1>=1" | "Ext_Mem_Acc_4_2>=1" | "Ext_Mem_Acc_4_3>=1" | "Ext_Mem_Acc_4_5>=1" | "Ext_Mem_Acc_5_1>=1" | "Ext_Mem_Acc_5_2>=1" | "Ext_Mem_Acc_5_3>=1" | "Ext_Mem_Acc_5_4>=1") U (("Memory_5>=1" & "OwnMemAcc_5>=1") | ("Memory_4>=1" & "OwnMemAcc_4>=1") | ("Memory_1>=1" & "OwnMemAcc_1>=1") | ("Memory_3>=1" & "OwnMemAcc_3>=1") | ("Memory_2>=1" & "OwnMemAcc_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,184.43,126844,1,0,72,30803,845,29,1992,32735,233
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA SharedMemory-COL-000005-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((((((((((((((((((((((("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 14 simplified : !(("Ext_Bus>=1" & "Memory_2>=1" & "Queue_1>=1") | ("Ext_Bus>=1" & "Memory_2>=1" & "Queue_3>=1") | ("Ext_Bus>=1" & "Memory_2>=1" & "Queue_4>=1") | ("Ext_Bus>=1" & "Memory_2>=1" & "Queue_5>=1") | ("Ext_Bus>=1" & "Memory_1>=1" & "Queue_2>=1") | ("Ext_Bus>=1" & "Memory_1>=1" & "Queue_3>=1") | ("Ext_Bus>=1" & "Memory_1>=1" & "Queue_4>=1") | ("Ext_Bus>=1" & "Memory_1>=1" & "Queue_5>=1") | ("Ext_Bus>=1" & "Memory_4>=1" & "Queue_1>=1") | ("Ext_Bus>=1" & "Memory_4>=1" & "Queue_2>=1") | ("Ext_Bus>=1" & "Memory_4>=1" & "Queue_3>=1") | ("Ext_Bus>=1" & "Memory_4>=1" & "Queue_5>=1") | ("Ext_Bus>=1" & "Memory_3>=1" & "Queue_1>=1") | ("Ext_Bus>=1" & "Memory_3>=1" & "Queue_2>=1") | ("Ext_Bus>=1" & "Memory_3>=1" & "Queue_4>=1") | ("Ext_Bus>=1" & "Memory_3>=1" & "Queue_5>=1") | ("Ext_Bus>=1" & "Memory_5>=1" & "Queue_2>=1") | ("Ext_Bus>=1" & "Memory_5>=1" & "Queue_1>=1") | ("Ext_Bus>=1" & "Memory_5>=1" & "Queue_4>=1") | ("Ext_Bus>=1" & "Memory_5>=1" & "Queue_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,184.451,126844,1,0,72,30803,845,29,1992,32735,233
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA SharedMemory-COL-000005-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((G(G(G(X(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"))))))))
Formula 15 simplified : !GXG("Ext_Mem_Acc_1_2>=1" | "Ext_Mem_Acc_1_3>=1" | "Ext_Mem_Acc_1_4>=1" | "Ext_Mem_Acc_1_5>=1" | "Ext_Mem_Acc_2_1>=1" | "Ext_Mem_Acc_2_3>=1" | "Ext_Mem_Acc_2_4>=1" | "Ext_Mem_Acc_2_5>=1" | "Ext_Mem_Acc_3_1>=1" | "Ext_Mem_Acc_3_2>=1" | "Ext_Mem_Acc_3_4>=1" | "Ext_Mem_Acc_3_5>=1" | "Ext_Mem_Acc_4_1>=1" | "Ext_Mem_Acc_4_2>=1" | "Ext_Mem_Acc_4_3>=1" | "Ext_Mem_Acc_4_5>=1" | "Ext_Mem_Acc_5_1>=1" | "Ext_Mem_Acc_5_2>=1" | "Ext_Mem_Acc_5_3>=1" | "Ext_Mem_Acc_5_4>=1")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,246.269,74100,1,0,72,30835,905,29,2049,32780,238
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA SharedMemory-COL-000005-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

BK_STOP 1464037439284

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -XX:MaxPermSize=512m -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar org.eclipse.equinox.launcher.Main -application fr.lip6.move.gal.application.pnmcc -data /home/mcc/BenchKit//workspace -os linux -ws gtk -arch x86_64 -nl en_US -consoleLog -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its
Java HotSpot(TM) 64-Bit Server VM warning: ignoring option MaxPermSize=512m; support was removed in 8.0
May 23, 2016 8:59:51 PM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 23, 2016 8:59:52 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 50 ms
May 23, 2016 8:59:52 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 41 places.
May 23, 2016 8:59:52 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 55 transitions.
May 23, 2016 8:59:52 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 73 ms
May 23, 2016 8:59:52 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.gal : 18 ms
May 23, 2016 8:59:52 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 6 ms

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="/root/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

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
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 r109kn-smll-146373287500357"
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 ;