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 316K
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 24K 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.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K 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 2.5K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 342 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 7.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 93K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is SafeBus-PT-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-smll-152732263400530
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527839321501

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 : !((G("((((((((((((Cpt2_1>=1)&&(AMC_1_1>=1))&&(FMCb>=1))&&(cable_free>=1))||((((Cpt2_1>=1)&&(AMC_2_1>=1))&&(FMCb>=1))&&(cable_free>=1)))||((((Cpt2_1>=1)&&(AMC_3_1>=1))&&(FMCb>=1))&&(cable_free>=1)))||((((Cpt2_2>=1)&&(AMC_1_2>=1))&&(FMCb>=1))&&(cable_free>=1)))||((((Cpt2_2>=1)&&(AMC_2_2>=1))&&(FMCb>=1))&&(cable_free>=1)))||((((Cpt2_2>=1)&&(AMC_3_2>=1))&&(FMCb>=1))&&(cable_free>=1)))||((((Cpt2_3>=1)&&(AMC_1_3>=1))&&(FMCb>=1))&&(cable_free>=1)))||((((Cpt2_3>=1)&&(AMC_2_3>=1))&&(FMCb>=1))&&(cable_free>=1)))||((((Cpt2_3>=1)&&(AMC_3_3>=1))&&(FMCb>=1))&&(cable_free>=1)))")))
Formula 0 simplified : !G"((((((((((((Cpt2_1>=1)&&(AMC_1_1>=1))&&(FMCb>=1))&&(cable_free>=1))||((((Cpt2_1>=1)&&(AMC_2_1>=1))&&(FMCb>=1))&&(cable_free>=1)))||((((Cpt2_1>=1)&&(AMC_3_1>=1))&&(FMCb>=1))&&(cable_free>=1)))||((((Cpt2_2>=1)&&(AMC_1_2>=1))&&(FMCb>=1))&&(cable_free>=1)))||((((Cpt2_2>=1)&&(AMC_2_2>=1))&&(FMCb>=1))&&(cable_free>=1)))||((((Cpt2_2>=1)&&(AMC_3_2>=1))&&(FMCb>=1))&&(cable_free>=1)))||((((Cpt2_3>=1)&&(AMC_1_3>=1))&&(FMCb>=1))&&(cable_free>=1)))||((((Cpt2_3>=1)&&(AMC_2_3>=1))&&(FMCb>=1))&&(cable_free>=1)))||((((Cpt2_3>=1)&&(AMC_3_3>=1))&&(FMCb>=1))&&(cable_free>=1)))"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 68
// Phase 1: matrix 68 rows 54 cols
invariant :AMC_1_1 + AMC_1_2 + AMC_1_3 + RMC_1 + PMC_1 + -1'wait_cable_1 = 0
invariant :wait_ack_1_2 + wait_ack_1_3 + listen_1 + wait_cable_1 + wait_msg_1 + loop_em_1 = 1
invariant :AMC_2_1 + AMC_2_2 + AMC_2_3 + RMC_2 + PMC_2 + -1'wait_cable_2 = 0
invariant :Cpt2_2 + -2'AMC_1_2 + -2'AMC_2_2 + -2'AMC_3_2 + -1'AMC_1_3 + -1'AMC_2_3 + -1'AMC_3_3 + -1'RMC_1 + -1'RMC_2 + -1'RMC_3 + -1'PMC_1 + -1'PMC_2 + -1'PMC_3 + wait_cable_1 + wait_cable_2 + wait_cable_3 + Cpt1_1 + Cpt1_3 = 1
invariant :-1'wait_ack_1_2 + -1'wait_ack_1_3 + cable_used_1 + -1'FMC_1 + -1'PMC_1 = 0
invariant :Cpt2_1 + AMC_1_2 + AMC_2_2 + AMC_3_2 + 2'AMC_1_3 + 2'AMC_2_3 + 2'AMC_3_3 + RMC_1 + RMC_2 + RMC_3 + PMC_1 + PMC_2 + PMC_3 + -1'wait_cable_1 + -1'wait_cable_2 + -1'wait_cable_3 + -1'Cpt1_1 = 0
invariant :AMC_3_1 + AMC_3_2 + AMC_3_3 + RMC_3 + PMC_3 + -1'wait_cable_3 = 0
invariant :ACK + T_out + -1'wait_ack_2_1 + -1'wait_ack_3_1 + -1'wait_ack_1_2 + -1'wait_ack_3_2 + -1'wait_ack_1_3 + -1'wait_ack_2_3 + MSG_1 + MSG_2 + MSG_3 = 0
invariant :Cpt1_1 + Cpt1_2 + Cpt1_3 = 1
invariant :R_tout + S_tout = 1
invariant :Cpt2_3 + AMC_1_2 + AMC_2_2 + AMC_3_2 + -1'AMC_1_3 + -1'AMC_2_3 + -1'AMC_3_3 + -1'Cpt1_3 = 0
invariant :-1'wait_ack_2_1 + -1'wait_ack_2_3 + cable_used_2 + -1'FMC_2 + -1'PMC_2 = 0
invariant :-1'wait_ack_3_1 + -1'wait_ack_3_2 + cable_used_3 + -1'FMC_3 + -1'PMC_3 = 0
invariant :wait_ack_3_1 + wait_ack_3_2 + listen_3 + wait_cable_3 + wait_msg_3 + loop_em_3 = 1
invariant :FMCb + FMC_1 + FMC_2 + FMC_3 = 1
invariant :wait_ack_2_1 + wait_ack_3_1 + wait_ack_1_2 + wait_ack_3_2 + wait_ack_1_3 + wait_ack_2_3 + FMC_1 + FMC_2 + FMC_3 + cable_free + PMC_1 + PMC_2 + PMC_3 = 1
invariant :wait_ack_2_1 + wait_ack_2_3 + listen_2 + wait_cable_2 + wait_msg_2 + loop_em_2 = 1
Reverse transition relation is NOT exact ! Due to transitions I_reemit_2_1, I_reemit_3_1, I_reemit_1_2, I_reemit_3_2, I_reemit_1_3, I_reemit_2_3, C_free_1_1, C_free_2_2, C_free_3_3, I_rec1_1_1, I_rec1_2_2, I_rec1_3_3, loss_m_1, loss_m_2, loss_m_3, I_rec2_1_1, I_rec2_2_2, I_rec2_3_3, I_ask2_1_1, I_ask2_2_1, I_ask2_3_1, I_ask2_1_2, I_ask2_2_2, I_ask2_3_2, I_ask2_1_3, I_ask2_2_3, I_ask2_3_3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :9/55/27/91
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
58 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.606982,30084,1,0,196,59067,202,82,2805,46422,197
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA SafeBus-PT-03-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G(G(X(X(F("((((cable_used_1>=1)&&(FMC_1>=1))||((cable_used_2>=1)&&(FMC_2>=1)))||((cable_used_3>=1)&&(FMC_3>=1)))")))))))
Formula 1 simplified : !GXXF"((((cable_used_1>=1)&&(FMC_1>=1))||((cable_used_2>=1)&&(FMC_2>=1)))||((cable_used_3>=1)&&(FMC_3>=1)))"
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
16 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.765471,34644,1,0,236,69035,211,83,2817,57305,303
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA SafeBus-PT-03-LTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((F("((((MSG_1>=1)&&(listen_1>=1))||((MSG_2>=1)&&(listen_2>=1)))||((MSG_3>=1)&&(listen_3>=1)))")))
Formula 2 simplified : !F"((((MSG_1>=1)&&(listen_1>=1))||((MSG_2>=1)&&(listen_2>=1)))||((MSG_3>=1)&&(listen_3>=1)))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
149 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,2.25886,68404,1,0,327,192229,220,115,2829,257552,471
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA SafeBus-PT-03-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((F(F(("((ACK>=1)&&(R_tout>=1))")U("((((((((ACK>=1)&&(wait_ack_2_1>=1))&&(FMCb>=1))||(((ACK>=1)&&(wait_ack_3_1>=1))&&(FMCb>=1)))||(((ACK>=1)&&(wait_ack_1_2>=1))&&(FMCb>=1)))||(((ACK>=1)&&(wait_ack_3_2>=1))&&(FMCb>=1)))||(((ACK>=1)&&(wait_ack_1_3>=1))&&(FMCb>=1)))||(((ACK>=1)&&(wait_ack_2_3>=1))&&(FMCb>=1)))")))))
Formula 3 simplified : !F("((ACK>=1)&&(R_tout>=1))" U "((((((((ACK>=1)&&(wait_ack_2_1>=1))&&(FMCb>=1))||(((ACK>=1)&&(wait_ack_3_1>=1))&&(FMCb>=1)))||(((ACK>=1)&&(wait_ack_1_2>=1))&&(FMCb>=1)))||(((ACK>=1)&&(wait_ack_3_2>=1))&&(FMCb>=1)))||(((ACK>=1)&&(wait_ack_1_3>=1))&&(FMCb>=1)))||(((ACK>=1)&&(wait_ack_2_3>=1))&&(FMCb>=1)))")
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
6 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,2.32343,71056,1,0,375,198451,229,125,2851,264857,583
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA SafeBus-PT-03-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(("((((cable_used_1>=1)&&(FMC_1>=1))||((cable_used_2>=1)&&(FMC_2>=1)))||((cable_used_3>=1)&&(FMC_3>=1)))"))
Formula 4 simplified : !"((((cable_used_1>=1)&&(FMC_1>=1))||((cable_used_2>=1)&&(FMC_2>=1)))||((cable_used_3>=1)&&(FMC_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,2.32445,71320,1,0,375,198451,229,125,2851,264862,585
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA SafeBus-PT-03-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((("((((cable_used_1>=1)&&(FMC_1>=1))||((cable_used_2>=1)&&(FMC_2>=1)))||((cable_used_3>=1)&&(FMC_3>=1)))")U(F("((ACK>=1)&&(R_tout>=1))"))))
Formula 5 simplified : !("((((cable_used_1>=1)&&(FMC_1>=1))||((cable_used_2>=1)&&(FMC_2>=1)))||((cable_used_3>=1)&&(FMC_3>=1)))" U F"((ACK>=1)&&(R_tout>=1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
48 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,2.79995,85040,1,0,443,247092,238,153,2853,349091,747
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA SafeBus-PT-03-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !(("((((cable_used_1>=1)&&(FMC_1>=1))||((cable_used_2>=1)&&(FMC_2>=1)))||((cable_used_3>=1)&&(FMC_3>=1)))"))
Formula 6 simplified : !"((((cable_used_1>=1)&&(FMC_1>=1))||((cable_used_2>=1)&&(FMC_2>=1)))||((cable_used_3>=1)&&(FMC_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,2.80086,85040,1,0,443,247092,238,153,2853,349091,747
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA SafeBus-PT-03-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((((F("((((MSG_1>=1)&&(wait_msg_1>=1))||((MSG_2>=1)&&(wait_msg_2>=1)))||((MSG_3>=1)&&(wait_msg_3>=1)))"))U(X("((((cable_used_1>=1)&&(FMC_1>=1))||((cable_used_2>=1)&&(FMC_2>=1)))||((cable_used_3>=1)&&(FMC_3>=1)))")))U((G("(((((((T_out>=1)&&(wait_ack_2_1>=1))||((T_out>=1)&&(wait_ack_3_1>=1)))||((T_out>=1)&&(wait_ack_1_2>=1)))||((T_out>=1)&&(wait_ack_3_2>=1)))||((T_out>=1)&&(wait_ack_1_3>=1)))||((T_out>=1)&&(wait_ack_2_3>=1)))"))U(F("((((S_tout>=1)&&(FMC_1>=1))||((S_tout>=1)&&(FMC_2>=1)))||((S_tout>=1)&&(FMC_3>=1)))")))))
Formula 7 simplified : !((F"((((MSG_1>=1)&&(wait_msg_1>=1))||((MSG_2>=1)&&(wait_msg_2>=1)))||((MSG_3>=1)&&(wait_msg_3>=1)))" U X"((((cable_used_1>=1)&&(FMC_1>=1))||((cable_used_2>=1)&&(FMC_2>=1)))||((cable_used_3>=1)&&(FMC_3>=1)))") U (G"(((((((T_out>=1)&&(wait_ack_2_1>=1))||((T_out>=1)&&(wait_ack_3_1>=1)))||((T_out>=1)&&(wait_ack_1_2>=1)))||((T_out>=1)&&(wait_ack_3_2>=1)))||((T_out>=1)&&(wait_ack_1_3>=1)))||((T_out>=1)&&(wait_ack_2_3>=1)))" U F"((((S_tout>=1)&&(FMC_1>=1))||((S_tout>=1)&&(FMC_2>=1)))||((S_tout>=1)&&(FMC_3>=1)))"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
17 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,2.96819,90844,1,0,503,264141,247,179,2859,385890,895
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA SafeBus-PT-03-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((X(G(G(F("((((Cpt2_2>=1)&&(AMC_2_2>=1))&&(FMCb>=1))&&(cable_free>=1))"))))))
Formula 8 simplified : !XGF"((((Cpt2_2>=1)&&(AMC_2_2>=1))&&(FMCb>=1))&&(cable_free>=1))"
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.99311,91892,1,0,522,266570,256,180,2859,388793,951
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA SafeBus-PT-03-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((X(X("((Cpt1_2>=1)&&(loop_em_2>=1))"))))
Formula 9 simplified : !XX"((Cpt1_2>=1)&&(loop_em_2>=1))"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
6 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,3.04982,93476,1,0,524,269549,259,180,2862,395424,961
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA SafeBus-PT-03-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !(("((((Cpt2_2>=1)&&(AMC_1_2>=1))&&(cable_used_3>=1))&&(FMCb>=1))"))
Formula 10 simplified : !"((((Cpt2_2>=1)&&(AMC_1_2>=1))&&(cable_used_3>=1))&&(FMCb>=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,3.05066,93740,1,0,524,269549,262,180,2864,395424,963
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA SafeBus-PT-03-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((((F("((((Cpt2_2>=1)&&(AMC_3_2>=1))&&(FMCb>=1))&&(cable_free>=1))"))U(G("(((ACK>=1)&&(wait_ack_2_3>=1))&&(FMCb>=1))")))U((G("((Cpt1_2>=1)&&(loop_em_2>=1))"))U(G("((RMC_3>=1)&&(wait_cable_3>=1))")))))
Formula 11 simplified : !((F"((((Cpt2_2>=1)&&(AMC_3_2>=1))&&(FMCb>=1))&&(cable_free>=1))" U G"(((ACK>=1)&&(wait_ack_2_3>=1))&&(FMCb>=1))") U (G"((Cpt1_2>=1)&&(loop_em_2>=1))" U G"((RMC_3>=1)&&(wait_cable_3>=1))"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,3.07013,94580,1,0,529,270621,279,181,2875,396748,988
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA SafeBus-PT-03-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((G(F(X("((((Cpt2_1>=1)&&(AMC_3_1>=1))&&(cable_used_3>=1))&&(FMCb>=1))")))))
Formula 12 simplified : !GFX"((((Cpt2_1>=1)&&(AMC_3_1>=1))&&(cable_used_3>=1))&&(FMCb>=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,3.07301,94580,1,0,529,270692,288,181,2877,396955,994
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA SafeBus-PT-03-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((G(G(G("((((Cpt2_1>=1)&&(AMC_1_1>=1))&&(cable_used_3>=1))&&(FMCb>=1))")))))
Formula 13 simplified : !G"((((Cpt2_1>=1)&&(AMC_1_1>=1))&&(cable_used_3>=1))&&(FMCb>=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,3.07407,94844,1,0,529,270692,294,181,2880,396955,999
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA SafeBus-PT-03-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((F((("((((Cpt2_2>=1)&&(AMC_1_2>=1))&&(cable_used_1>=1))&&(FMCb>=1))")U("((MSG_1>=1)&&(wait_msg_1>=1))"))U(X(G("((T_out>=1)&&(wait_ack_1_2>=1))"))))))
Formula 14 simplified : !F(("((((Cpt2_2>=1)&&(AMC_1_2>=1))&&(cable_used_1>=1))&&(FMCb>=1))" U "((MSG_1>=1)&&(wait_msg_1>=1))") U XG"((T_out>=1)&&(wait_ack_1_2>=1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
37 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,3.44321,101972,1,0,672,296759,307,237,2882,451103,1279
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA SafeBus-PT-03-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((F((F(G("((((Cpt2_3>=1)&&(AMC_2_3>=1))&&(FMCb>=1))&&(cable_free>=1))")))U("((T_out>=1)&&(wait_ack_1_3>=1))"))))
Formula 15 simplified : !F(FG"((((Cpt2_3>=1)&&(AMC_2_3>=1))&&(FMCb>=1))&&(cable_free>=1))" U "((T_out>=1)&&(wait_ack_1_3>=1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,3.56126,105404,1,0,738,309387,316,265,2883,474547,1437
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA SafeBus-PT-03-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 1527839330070

--------------------
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 7:48:44 AM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -smt]
Jun 01, 2018 7:48:44 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2018 7:48:44 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 77 ms
Jun 01, 2018 7:48:44 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 57 places.
Jun 01, 2018 7:48:44 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 91 transitions.
Jun 01, 2018 7:48:44 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 15 ms
Jun 01, 2018 7:48:44 AM fr.lip6.move.gal.instantiate.DomainAnalyzer computeVariableDomains
INFO: Found a total of 3 fixed domain variables (out of 57 variables) in GAL type SafeBus_PT_03
Jun 01, 2018 7:48:44 AM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: Found a total of 3 constant array cells/variables (out of 57 variables) in type SafeBus_PT_03
Jun 01, 2018 7:48:44 AM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: msgl_2,msgl_3,msgl_1,
Jun 01, 2018 7:48:44 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Removed 3 constant variables :msgl_2=1, msgl_3=1, msgl_1=1
Jun 01, 2018 7:48:44 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Simplified 6 expressions due to constant valuations.
Jun 01, 2018 7:48:44 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 78 ms
Jun 01, 2018 7:48:44 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
Jun 01, 2018 7:48:44 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Jun 01, 2018 7:48:45 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 91 transitions.
Jun 01, 2018 7:48:45 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 17 place invariants in 35 ms
Jun 01, 2018 7:48:45 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 54 variables to be positive in 274 ms
Jun 01, 2018 7:48:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 91 transitions.
Jun 01, 2018 7:48:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/91 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 01, 2018 7:48:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 01, 2018 7:48:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 91 transitions.
Jun 01, 2018 7:48:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 01, 2018 7:48:47 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 91 transitions.
Jun 01, 2018 7:48:48 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(10/91) took 607 ms. Total solver calls (SAT/UNSAT): 593(293/300)
Jun 01, 2018 7:48:48 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
Jun 01, 2018 7:48:48 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (= (+ (select s0 42) 0) (+ (select s0 16) (select s0 19) (select s0 22) (select s0 29) (select s0 36)))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (= (+ (select s0 42) 0) (+ (select s0 16) (select s0 19) (select s0 22) (select s0 29) (select s0 36)))")
[(declare-fun s0 () (Array Int Int)), (assert (= (+ (select s0 42) 0) (+ (select s0 16) (select s0 19) (select s0 22) (select s0 29) (select s0 36)))), (assert (= (+ (* 2 (select s0 19)) (* 2 (select s0 20)) (* 2 (select s0 21)) (select s0 22) (select s0 23) (select s0 24) (select s0 29) (select s0 30) (select s0 31) (select s0 36) (select s0 37) (select s0 38) 1) (+ (select s0 14) (select s0 42) (select s0 43) (select s0 44) (select s0 48) (select s0 50)))), (assert (= (+ (select s0 6) (select s0 8) (select s0 32) (select s0 36) 0) (select s0 25))), (assert (= (+ (select s0 42) (select s0 43) (select s0 44) (select s0 48) 0) (+ (select s0 13) (select s0 19) (select s0 20) (select s0 21) (* 2 (select s0 22)) (* 2 (select s0 23)) (* 2 (select s0 24)) (select s0 29) (select s0 30) (select s0 31) (select s0 36) (select s0 37) (select s0 38)))), (assert (= (+ (select s0 22) (select s0 23) (select s0 24) (select s0 50) 0) (+ (select s0 15) (select s0 19) (select s0 20) (select s0 21)))), (assert (= 1 (+ (select s0 28) (select s0 32) (select s0 33) (select s0 34)))), (assert (and (and (and (>= (select s0 14) 1) (>= (select s0 19) 1)) (>= (select s0 25) 1)) (>= (select s0 28) 1))), (assert (>= (select s0 6) 0)), (assert (>= (select s0 8) 0)), (assert (>= (select s0 13) 0)), (assert (>= (select s0 14) 0)), (assert (>= (select s0 15) 0)), (assert (>= (select s0 16) 0)), (assert (>= (select s0 19) 0)), (assert (>= (select s0 20) 0)), (assert (>= (select s0 21) 0)), (assert (>= (select s0 22) 0)), (assert (>= (select s0 23) 0)), (assert (>= (select s0 24) 0)), (assert (>= (select s0 25) 0)), (assert (>= (select s0 28) 0)), (assert (>= (select s0 29) 0)), (assert (>= (select s0 30) 0)), (assert (>= (select s0 31) 0)), (assert (>= (select s0 32) 0)), (assert (>= (select s0 33) 0)), (assert (>= (select s0 34) 0)), (assert (>= (select s0 36) 0)), (assert (>= (select s0 37) 0)), (assert (>= (select s0 38) 0)), (assert (>= (select s0 42) 0)), (assert (>= (select s0 43) 0)), (assert (>= (select s0 44) 0)), (assert (>= (select s0 48) 0)), (assert (>= (select s0 50) 0))]
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout when executing script :
org.smtlib.impl.Script@65c2b203
java.lang.RuntimeException: SMT solver raised an exception or timeout when executing script :
org.smtlib.impl.Script@65c2b203
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:448)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
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 7:48:48 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 3987ms 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="SafeBus-PT-03"
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/SafeBus-PT-03.tgz
mv SafeBus-PT-03 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 SafeBus-PT-03, 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-152732263400530"
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 ;