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 236K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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 2.6K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.9K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.9K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K 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 108 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 346 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 69K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is NeoElection-COL-2, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-csrt-152732585800069
=====================================================================

--------------------
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 NeoElection-COL-2-LTLCardinality-00
FORMULA_NAME NeoElection-COL-2-LTLCardinality-01
FORMULA_NAME NeoElection-COL-2-LTLCardinality-02
FORMULA_NAME NeoElection-COL-2-LTLCardinality-03
FORMULA_NAME NeoElection-COL-2-LTLCardinality-04
FORMULA_NAME NeoElection-COL-2-LTLCardinality-05
FORMULA_NAME NeoElection-COL-2-LTLCardinality-06
FORMULA_NAME NeoElection-COL-2-LTLCardinality-07
FORMULA_NAME NeoElection-COL-2-LTLCardinality-08
FORMULA_NAME NeoElection-COL-2-LTLCardinality-09
FORMULA_NAME NeoElection-COL-2-LTLCardinality-10
FORMULA_NAME NeoElection-COL-2-LTLCardinality-11
FORMULA_NAME NeoElection-COL-2-LTLCardinality-12
FORMULA_NAME NeoElection-COL-2-LTLCardinality-13
FORMULA_NAME NeoElection-COL-2-LTLCardinality-14
FORMULA_NAME NeoElection-COL-2-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527500317492

09:38:40.417 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
09:38:40.419 [main] ERROR import - Grammar file errors have been raised, the validation can't be done, process will continue without Grammar validation
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !(("(((P_poll__waitingMessage_0+P_poll__waitingMessage_1)+P_poll__waitingMessage_2)<=(((((((((((((((((P_poll__networl_4+P_poll__networl_5)+P_poll__networl_22)+P_poll__networl_23)+P_poll__networl_40)+P_poll__networl_41)+P_poll__networl_58)+P_poll__networl_59)+P_poll__networl_76)+P_poll__networl_77)+P_poll__networl_94)+P_poll__networl_95)+P_poll__networl_112)+P_poll__networl_113)+P_poll__networl_130)+P_poll__networl_131)+P_poll__networl_148)+P_poll__networl_149))"))
Formula 0 simplified : !"(((P_poll__waitingMessage_0+P_poll__waitingMessage_1)+P_poll__waitingMessage_2)<=(((((((((((((((((P_poll__networl_4+P_poll__networl_5)+P_poll__networl_22)+P_poll__networl_23)+P_poll__networl_40)+P_poll__networl_41)+P_poll__networl_58)+P_poll__networl_59)+P_poll__networl_76)+P_poll__networl_77)+P_poll__networl_94)+P_poll__networl_95)+P_poll__networl_112)+P_poll__networl_113)+P_poll__networl_130)+P_poll__networl_131)+P_poll__networl_148)+P_poll__networl_149))"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 290
// Phase 1: matrix 290 rows 411 cols
invariant :P_poll__networl_86 = 0
invariant :P_network_35 = 0
invariant :P_network_109 = 0
invariant :P_network_139 = 0
invariant :P_poll__networl_122 = 0
invariant :P_poll__networl_28 = 0
invariant :P_poll__networl_60 = 0
invariant :P_poll__networl_48 = 0
invariant :P_poll__networl_80 = 0
invariant :P_poll__networl_92 = 0
invariant :P_poll__networl_16 = 0
invariant :P_network_43 = 0
invariant :P_network_161 = 0
invariant :P_network_20 = 0
invariant :P_negotiation_1 + P_negotiation_2 = 0
invariant :P_network_119 = 0
invariant :P_poll__networl_98 = 0
invariant :P_network_118 = 0
invariant :P_poll__networl_124 = 0
invariant :P_poll__networl_21 = 0
invariant :P_poll__networl_88 = 0
invariant :P_poll__waitingMessage_1 + P_stage_4 + P_stage_5 = 0
invariant :P_network_133 = 0
invariant :P_poll__networl_62 = 0
invariant :P_poll__networl_147 = 0
invariant :P_negotiation_21 + P_negotiation_22 + P_negotiation_23 = 1
invariant :P_poll__networl_81 = 0
invariant :P_network_104 = 0
invariant :P_poll__networl_155 = 0
invariant :P_poll__networl_161 = 0
invariant :P_electionInit_0 + P_startNeg__broadcasting_0 = 0
invariant :P_network_125 = 0
invariant :P_network_71 = 0
invariant :P_poll__networl_146 = 0
invariant :P_poll__networl_103 = 0
invariant :P_poll__networl_73 = 0
invariant :P_poll__networl_160 = 0
invariant :P_poll__networl_119 = 0
invariant :P_network_25 = 0
invariant :P_network_115 = 0
invariant :P_poll__waitingMessage_0 + P_stage_1 + P_stage_2 = 0
invariant :P_poll__networl_100 = 0
invariant :P_poll__waitingMessage_2 + P_stage_7 + P_stage_8 = 0
invariant :P_poll__networl_90 = 0
invariant :P_stage_0 + P_stage_1 + P_stage_2 = 0
invariant :P_electedSecondary_0 + P_poll__handlingMessage_0 + P_poll__pollEnd_0 + P_polling_0 + P_sendAnnPs__broadcasting_1 + -1'P_stage_2 + P_startNeg__broadcasting_1 = 0
invariant :P_poll__networl_12 = 0
invariant :P_poll__networl_32 = 0
invariant :P_network_137 = 0
invariant :P_poll__networl_121 = 0
invariant :P_network_82 = 0
invariant :P_poll__networl_139 = 0
invariant :P_poll__networl_96 = 0
invariant :P_network_121 = 0
invariant :P_network_98 = 0
invariant :P_network_65 = 0
invariant :P_poll__networl_66 = 0
invariant :P_poll__networl_72 = 0
invariant :P_network_29 = 0
invariant :P_poll__networl_110 = 0
invariant :P_negotiation_13 + P_negotiation_14 = 1
invariant :P_poll__networl_135 = 0
invariant :P_poll__networl_137 = 0
invariant :P_poll__networl_138 = 0
invariant :P_negotiation_0 = 0
invariant :P_network_152 = 0
invariant :P_poll__networl_89 = 0
invariant :P_poll__networl_117 = 0
invariant :P_poll__networl_69 = 0
invariant :P_poll__networl_114 = 0
invariant :P_poll__networl_156 = 0
invariant :P_network_100 = 0
invariant :P_network_2 = 0
invariant :P_network_97 = 0
invariant :P_poll__networl_97 = 0
invariant :P_poll__networl_87 = 0
invariant :P_poll__networl_84 = 0
invariant :P_network_56 = 0
invariant :P_poll__networl_129 = 0
invariant :P_poll__networl_14 = 0
invariant :P_network_73 = 0
invariant :P_network_32 = 0
invariant :P_electedPrimary_2 + P_electedSecondary_2 + P_negotiation_21 + P_poll__handlingMessage_2 + P_poll__pollEnd_2 + P_polling_2 + P_sendAnnPs__broadcasting_4 + P_sendAnnPs__broadcasting_5 + -1'P_stage_7 + -1'P_stage_8 + P_startNeg__broadcasting_5 = 1
invariant :P_poll__networl_101 = 0
invariant :P_poll__networl_85 = 0
invariant :P_network_158 = 0
invariant :P_negotiation_6 = 0
invariant :P_poll__networl_145 = 0
invariant :P_poll__networl_9 = 0
invariant :P_poll__networl_105 = 0
invariant :P_network_128 = 0
invariant :P_network_160 = 0
invariant :P_poll__networl_106 = 0
invariant :P_network_70 = 0
invariant :P_network_157 = 0
invariant :P_poll__networl_39 = 0
invariant :P_poll__networl_140 = 0
invariant :P_poll__networl_33 = 0
invariant :P_network_53 = 0
invariant :P_poll__networl_3 = 0
invariant :P_poll__networl_120 = 0
invariant :P_network_151 = 0
invariant :P_network_74 = 0
invariant :P_network_155 = 0
invariant :P_network_134 = 0
invariant :P_network_79 = 0
invariant :P_poll__networl_102 = 0
invariant :P_poll__networl_134 = 0
invariant :P_network_62 = 0
invariant :P_network_67 = 0
invariant :P_negotiation_3 = 0
invariant :P_negotiation_9 = 0
invariant :P_network_85 = 0
invariant :P_network_92 = 0
invariant :P_network_103 = 0
invariant :P_poll__networl_116 = 0
invariant :P_network_88 = 0
invariant :P_poll__networl_63 = 0
invariant :P_network_38 = 0
invariant :P_poll__networl_45 = 0
invariant :P_poll__networl_65 = 0
invariant :P_poll__networl_26 = 0
invariant :P_poll__networl_142 = 0
invariant :P_network_14 = 0
invariant :P_poll__networl_6 = 0
invariant :P_poll__networl_151 = 0
invariant :P_network_136 = 0
invariant :P_masterState_0 + P_masterState_1 + P_masterState_2 + P_masterState_3 + P_masterState_4 + P_masterState_5 = 0
invariant :P_poll__networl_74 = 0
invariant :P_network_28 = 0
invariant :P_network_31 = 0
invariant :P_network_49 = 0
invariant :P_poll__networl_144 = 0
invariant :P_poll__networl_67 = 0
invariant :P_negotiation_18 = 0
invariant :P_network_61 = 0
invariant :P_network_1 = 0
invariant :P_negotiation_10 + P_negotiation_11 = 0
invariant :P_poll__networl_125 = 0
invariant :P_poll__networl_61 = 0
invariant :P_poll__networl_68 = 0
invariant :P_negotiation_15 + P_negotiation_16 + P_negotiation_17 = 1
invariant :P_poll__networl_71 = 0
invariant :P_poll__networl_118 = 0
invariant :P_poll__networl_83 = 0
invariant :P_poll__networl_115 = 0
invariant :P_network_86 = 0
invariant :P_network_91 = 0
invariant :P_poll__networl_17 = 0
invariant :P_poll__networl_2 = 0
invariant :P_poll__networl_50 = 0
invariant :P_poll__networl_150 = 0
invariant :P_poll__networl_152 = 0
invariant :P_poll__networl_107 = 0
invariant :P_negotiation_12 = 0
invariant :P_network_110 = 0
invariant :P_network_16 = 0
invariant :P_poll__networl_126 = 0
invariant :P_poll__networl_8 = 0
invariant :P_network_26 = 0
invariant :P_network_116 = 0
invariant :P_poll__networl_128 = 0
invariant :P_network_7 = 0
invariant :P_poll__networl_57 = 0
invariant :P_network_44 = 0
invariant :P_network_47 = 0
invariant :P_network_89 = 0
invariant :P_poll__networl_49 = 0
invariant :P_network_13 = 0
invariant :P_poll__networl_42 = 0
invariant :P_poll__networl_43 = 0
invariant :P_masterState_6 + P_masterState_7 + P_masterState_8 + P_masterState_9 + P_masterState_10 + P_masterState_11 = 1
invariant :P_poll__networl_37 = 0
invariant :P_poll__networl_136 = 0
invariant :P_network_101 = 0
invariant :P_poll__networl_1 = 0
invariant :P_poll__networl_123 = 0
invariant :P_network_68 = 0
invariant :P_poll__networl_44 = 0
invariant :P_network_80 = 0
invariant :P_poll__networl_64 = 0
invariant :P_stage_6 + P_stage_7 + P_stage_8 = 1
invariant :P_network_11 = 0
invariant :P_electedPrimary_1 + P_electedSecondary_1 + P_negotiation_15 + P_poll__handlingMessage_1 + P_poll__pollEnd_1 + P_polling_1 + P_sendAnnPs__broadcasting_2 + P_sendAnnPs__broadcasting_3 + -1'P_stage_4 + -1'P_stage_5 + P_startNeg__broadcasting_3 = 1
invariant :P_poll__networl_38 = 0
invariant :P_poll__networl_0 = 0
invariant :P_poll__networl_18 = 0
invariant :P_poll__networl_108 = 0
invariant :P_network_145 = 0
invariant :P_poll__networl_153 = 0
invariant :P_poll__networl_7 = 0
invariant :P_network_52 = 0
invariant :P_poll__networl_35 = 0
invariant :P_poll__networl_24 = 0
invariant :P_network_19 = 0
invariant :P_network_50 = 0
invariant :P_negotiation_4 + P_negotiation_5 = 0
invariant :P_poll__networl_157 = 0
invariant :P_poll__networl_29 = 0
invariant :P_poll__networl_46 = 0
invariant :P_network_140 = 0
invariant :P_poll__networl_111 = 0
invariant :P_poll__networl_93 = 0
invariant :P_negotiation_7 + P_negotiation_8 = 0
invariant :P_poll__networl_36 = 0
invariant :P_poll__networl_20 = 0
invariant :P_poll__networl_47 = 0
invariant :P_poll__networl_91 = 0
invariant :P_network_10 = 0
invariant :P_poll__networl_54 = 0
invariant :P_poll__networl_10 = 0
invariant :P_network_46 = 0
invariant :P_poll__networl_27 = 0
invariant :P_poll__networl_75 = 0
invariant :P_negotiation_24 = 0
invariant :P_network_64 = 0
invariant :P_poll__networl_19 = 0
invariant :P_negotiation_19 + P_negotiation_20 = 0
invariant :P_network_154 = 0
invariant :P_network_127 = 0
invariant :P_poll__networl_55 = 0
invariant :P_network_124 = 0
invariant :P_network_8 = 0
invariant :P_poll__networl_158 = 0
invariant :P_poll__networl_104 = 0
invariant :P_network_106 = 0
invariant :P_network_107 = 0
invariant :P_poll__networl_34 = 0
invariant :P_poll__networl_99 = 0
invariant :P_electionInit_2 + -1'P_negotiation_21 + P_startNeg__broadcasting_4 = 0
invariant :P_stage_3 + P_stage_4 + P_stage_5 = 1
invariant :P_poll__networl_30 = 0
invariant :P_electionInit_1 + -1'P_negotiation_15 + P_startNeg__broadcasting_2 = 0
invariant :P_poll__networl_82 = 0
invariant :P_network_34 = 0
invariant :P_network_37 = 0
invariant :P_poll__networl_31 = 0
invariant :P_poll__networl_70 = 0
invariant :P_poll__networl_159 = 0
invariant :P_poll__networl_51 = 0
invariant :P_poll__networl_11 = 0
invariant :P_poll__networl_154 = 0
invariant :P_masterState_12 + P_masterState_13 + P_masterState_14 + P_masterState_15 + P_masterState_16 + P_masterState_17 = 1
invariant :P_network_142 = 0
invariant :P_negotiation_25 + P_negotiation_26 = 1
invariant :P_poll__networl_132 = 0
invariant :P_poll__networl_109 = 0
invariant :P_poll__networl_127 = 0
invariant :P_poll__networl_56 = 0
invariant :P_network_17 = 0
Reverse transition relation is NOT exact ! Due to transitions T_poll__end_1, T_poll__end_2, T_startNeg__end_1, T_startNeg__end_2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :237/15/4/256
invariant :P_poll__networl_141 = 0
invariant :P_poll__networl_25 = 0
invariant :P_poll__networl_78 = 0
invariant :P_network_146 = 0
invariant :P_network_143 = 0
invariant :P_poll__networl_15 = 0
invariant :P_network_83 = 0
invariant :P_poll__networl_13 = 0
invariant :P_poll__networl_133 = 0
invariant :P_network_55 = 0
invariant :P_poll__networl_53 = 0
invariant :P_poll__networl_79 = 0
invariant :P_network_122 = 0
invariant :P_poll__networl_52 = 0
invariant :P_electedPrimary_0 + P_sendAnnPs__broadcasting_0 + -1'P_stage_1 = 0
invariant :P_poll__networl_143 = 0
Computing Next relation with stutter on 1 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
62 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.67489,34272,1,0,52,34371,295,23,4760,22722,283
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F(("(((P_electedSecondary_0+P_electedSecondary_1)+P_electedSecondary_2)>=1)")U("(((P_electionInit_0+P_electionInit_1)+P_electionInit_2)>=1)")))))
Formula 1 simplified : !GF("(((P_electedSecondary_0+P_electedSecondary_1)+P_electedSecondary_2)>=1)" U "(((P_electionInit_0+P_electionInit_1)+P_electionInit_2)>=1)")
Computing Next relation with stutter on 1 deadlock states
35 unique states visited
35 strongly connected components in search stack
36 transitions explored
35 items max in DFS search stack
34 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,1.01428,45036,1,0,86,77498,308,92,5005,68522,561
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(("((((((((((((((((((P_poll__networl_4+P_poll__networl_5)+P_poll__networl_22)+P_poll__networl_23)+P_poll__networl_40)+P_poll__networl_41)+P_poll__networl_58)+P_poll__networl_59)+P_poll__networl_76)+P_poll__networl_77)+P_poll__networl_94)+P_poll__networl_95)+P_poll__networl_112)+P_poll__networl_113)+P_poll__networl_130)+P_poll__networl_131)+P_poll__networl_148)+P_poll__networl_149)>=0)"))
Formula 2 simplified : !"((((((((((((((((((P_poll__networl_4+P_poll__networl_5)+P_poll__networl_22)+P_poll__networl_23)+P_poll__networl_40)+P_poll__networl_41)+P_poll__networl_58)+P_poll__networl_59)+P_poll__networl_76)+P_poll__networl_77)+P_poll__networl_94)+P_poll__networl_95)+P_poll__networl_112)+P_poll__networl_113)+P_poll__networl_130)+P_poll__networl_131)+P_poll__networl_148)+P_poll__networl_149)>=0)"
Computing Next relation with stutter on 1 deadlock states
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,1.01581,45036,1,0,86,77498,311,92,5024,68522,563
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(F(G("((((((P_startNeg__broadcasting_0+P_startNeg__broadcasting_1)+P_startNeg__broadcasting_2)+P_startNeg__broadcasting_3)+P_startNeg__broadcasting_4)+P_startNeg__broadcasting_5)<=(((((((((((((((((P_poll__networl_4+P_poll__networl_5)+P_poll__networl_22)+P_poll__networl_23)+P_poll__networl_40)+P_poll__networl_41)+P_poll__networl_58)+P_poll__networl_59)+P_poll__networl_76)+P_poll__networl_77)+P_poll__networl_94)+P_poll__networl_95)+P_poll__networl_112)+P_poll__networl_113)+P_poll__networl_130)+P_poll__networl_131)+P_poll__networl_148)+P_poll__networl_149))")))))
Formula 3 simplified : !GFG"((((((P_startNeg__broadcasting_0+P_startNeg__broadcasting_1)+P_startNeg__broadcasting_2)+P_startNeg__broadcasting_3)+P_startNeg__broadcasting_4)+P_startNeg__broadcasting_5)<=(((((((((((((((((P_poll__networl_4+P_poll__networl_5)+P_poll__networl_22)+P_poll__networl_23)+P_poll__networl_40)+P_poll__networl_41)+P_poll__networl_58)+P_poll__networl_59)+P_poll__networl_76)+P_poll__networl_77)+P_poll__networl_94)+P_poll__networl_95)+P_poll__networl_112)+P_poll__networl_113)+P_poll__networl_130)+P_poll__networl_131)+P_poll__networl_148)+P_poll__networl_149))"
Computing Next relation with stutter on 1 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
64 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,1.66022,62356,1,0,216,170714,324,222,5113,195302,1008
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((G(X("(((P_electedPrimary_0+P_electedPrimary_1)+P_electedPrimary_2)>=2)")))U(G(G("(((P_electionInit_0+P_electionInit_1)+P_electionInit_2)>=0)")))))
Formula 4 simplified : !(GX"(((P_electedPrimary_0+P_electedPrimary_1)+P_electedPrimary_2)>=2)" U G"(((P_electionInit_0+P_electionInit_1)+P_electionInit_2)>=0)")
Computing Next relation with stutter on 1 deadlock states
96 unique states visited
0 strongly connected components in search stack
98 transitions explored
35 items max in DFS search stack
39 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.05999,74844,1,0,246,196070,346,315,5140,281645,1613
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(("(((P_poll__pollEnd_0+P_poll__pollEnd_1)+P_poll__pollEnd_2)<=((P_poll__waitingMessage_0+P_poll__waitingMessage_1)+P_poll__waitingMessage_2))"))
Formula 5 simplified : !"(((P_poll__pollEnd_0+P_poll__pollEnd_1)+P_poll__pollEnd_2)<=((P_poll__waitingMessage_0+P_poll__waitingMessage_1)+P_poll__waitingMessage_2))"
Computing Next relation with stutter on 1 deadlock states
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,2.06094,74844,1,0,246,196070,349,315,5148,281645,1615
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(("((((((P_startNeg__broadcasting_0+P_startNeg__broadcasting_1)+P_startNeg__broadcasting_2)+P_startNeg__broadcasting_3)+P_startNeg__broadcasting_4)+P_startNeg__broadcasting_5)<=0)"))
Formula 6 simplified : !"((((((P_startNeg__broadcasting_0+P_startNeg__broadcasting_1)+P_startNeg__broadcasting_2)+P_startNeg__broadcasting_3)+P_startNeg__broadcasting_4)+P_startNeg__broadcasting_5)<=0)"
Computing Next relation with stutter on 1 deadlock states
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,2.06223,75108,1,0,246,196070,352,315,5153,281645,1617
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(("(((P_electedSecondary_0+P_electedSecondary_1)+P_electedSecondary_2)>=2)")U(true))))
Formula 7 simplified : 0
Computing Next relation with stutter on 1 deadlock states
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,2.06235,75108,1,0,246,196070,352,315,5153,281645,1617
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G((G("(((P_electedPrimary_0+P_electedPrimary_1)+P_electedPrimary_2)>=3)"))U(F("(((P_electedSecondary_0+P_electedSecondary_1)+P_electedSecondary_2)>=2)")))))
Formula 8 simplified : !G(G"(((P_electedPrimary_0+P_electedPrimary_1)+P_electedPrimary_2)>=3)" U F"(((P_electedSecondary_0+P_electedSecondary_1)+P_electedSecondary_2)>=2)")
Computing Next relation with stutter on 1 deadlock states
35 unique states visited
35 strongly connected components in search stack
36 transitions explored
35 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,2.07607,75568,1,0,246,196070,361,315,5158,281646,1687
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(("((((((((((((((((((P_poll__networl_4+P_poll__networl_5)+P_poll__networl_22)+P_poll__networl_23)+P_poll__networl_40)+P_poll__networl_41)+P_poll__networl_58)+P_poll__networl_59)+P_poll__networl_76)+P_poll__networl_77)+P_poll__networl_94)+P_poll__networl_95)+P_poll__networl_112)+P_poll__networl_113)+P_poll__networl_130)+P_poll__networl_131)+P_poll__networl_148)+P_poll__networl_149)<=((P_electedPrimary_0+P_electedPrimary_1)+P_electedPrimary_2))"))
Formula 9 simplified : !"((((((((((((((((((P_poll__networl_4+P_poll__networl_5)+P_poll__networl_22)+P_poll__networl_23)+P_poll__networl_40)+P_poll__networl_41)+P_poll__networl_58)+P_poll__networl_59)+P_poll__networl_76)+P_poll__networl_77)+P_poll__networl_94)+P_poll__networl_95)+P_poll__networl_112)+P_poll__networl_113)+P_poll__networl_130)+P_poll__networl_131)+P_poll__networl_148)+P_poll__networl_149)<=((P_electedPrimary_0+P_electedPrimary_1)+P_electedPrimary_2))"
Computing Next relation with stutter on 1 deadlock states
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,2.07768,75832,1,0,246,196070,364,315,5181,281646,1689
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(G(X("((((((P_sendAnnPs__broadcasting_0+P_sendAnnPs__broadcasting_1)+P_sendAnnPs__broadcasting_2)+P_sendAnnPs__broadcasting_3)+P_sendAnnPs__broadcasting_4)+P_sendAnnPs__broadcasting_5)>=0)")))))
Formula 10 simplified : !XGX"((((((P_sendAnnPs__broadcasting_0+P_sendAnnPs__broadcasting_1)+P_sendAnnPs__broadcasting_2)+P_sendAnnPs__broadcasting_3)+P_sendAnnPs__broadcasting_4)+P_sendAnnPs__broadcasting_5)>=0)"
Computing Next relation with stutter on 1 deadlock states
33 unique states visited
0 strongly connected components in search stack
33 transitions explored
33 items max in DFS search stack
22 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.29092,80320,1,0,303,212274,370,375,5193,328238,1994
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F(F("((((((((((((((((((P_masterState_0+P_masterState_1)+P_masterState_2)+P_masterState_3)+P_masterState_4)+P_masterState_5)+P_masterState_6)+P_masterState_7)+P_masterState_8)+P_masterState_9)+P_masterState_10)+P_masterState_11)+P_masterState_12)+P_masterState_13)+P_masterState_14)+P_masterState_15)+P_masterState_16)+P_masterState_17)<=(((((P_sendAnnPs__broadcasting_0+P_sendAnnPs__broadcasting_1)+P_sendAnnPs__broadcasting_2)+P_sendAnnPs__broadcasting_3)+P_sendAnnPs__broadcasting_4)+P_sendAnnPs__broadcasting_5))"))))
Formula 11 simplified : !F"((((((((((((((((((P_masterState_0+P_masterState_1)+P_masterState_2)+P_masterState_3)+P_masterState_4)+P_masterState_5)+P_masterState_6)+P_masterState_7)+P_masterState_8)+P_masterState_9)+P_masterState_10)+P_masterState_11)+P_masterState_12)+P_masterState_13)+P_masterState_14)+P_masterState_15)+P_masterState_16)+P_masterState_17)<=(((((P_sendAnnPs__broadcasting_0+P_sendAnnPs__broadcasting_1)+P_sendAnnPs__broadcasting_2)+P_sendAnnPs__broadcasting_3)+P_sendAnnPs__broadcasting_4)+P_sendAnnPs__broadcasting_5))"
Computing Next relation with stutter on 1 deadlock states
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,2.32512,81640,1,0,303,212274,379,375,5222,328238,2130
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G("(((P_polling_0+P_polling_1)+P_polling_2)>=2)")))
Formula 12 simplified : !G"(((P_polling_0+P_polling_1)+P_polling_2)>=2)"
Computing Next relation with stutter on 1 deadlock states
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.33112,82168,1,0,303,212455,387,375,5229,328629,2140
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((G((X("((((((((((((((((((P_masterState_0+P_masterState_1)+P_masterState_2)+P_masterState_3)+P_masterState_4)+P_masterState_5)+P_masterState_6)+P_masterState_7)+P_masterState_8)+P_masterState_9)+P_masterState_10)+P_masterState_11)+P_masterState_12)+P_masterState_13)+P_masterState_14)+P_masterState_15)+P_masterState_16)+P_masterState_17)<=0)"))U(G("((((((P_sendAnnPs__broadcasting_0+P_sendAnnPs__broadcasting_1)+P_sendAnnPs__broadcasting_2)+P_sendAnnPs__broadcasting_3)+P_sendAnnPs__broadcasting_4)+P_sendAnnPs__broadcasting_5)>=1)")))))
Formula 13 simplified : !G(X"((((((((((((((((((P_masterState_0+P_masterState_1)+P_masterState_2)+P_masterState_3)+P_masterState_4)+P_masterState_5)+P_masterState_6)+P_masterState_7)+P_masterState_8)+P_masterState_9)+P_masterState_10)+P_masterState_11)+P_masterState_12)+P_masterState_13)+P_masterState_14)+P_masterState_15)+P_masterState_16)+P_masterState_17)<=0)" U G"((((((P_sendAnnPs__broadcasting_0+P_sendAnnPs__broadcasting_1)+P_sendAnnPs__broadcasting_2)+P_sendAnnPs__broadcasting_3)+P_sendAnnPs__broadcasting_4)+P_sendAnnPs__broadcasting_5)>=1)")
Computing Next relation with stutter on 1 deadlock states
33 unique states visited
33 strongly connected components in search stack
33 transitions explored
33 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.35555,83396,1,0,303,212455,393,375,5241,328629,2273
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((G(X(F(F("(((P_poll__waitingMessage_0+P_poll__waitingMessage_1)+P_poll__waitingMessage_2)>=1)"))))))
Formula 14 simplified : !GXF"(((P_poll__waitingMessage_0+P_poll__waitingMessage_1)+P_poll__waitingMessage_2)>=1)"
Computing Next relation with stutter on 1 deadlock states
35 unique states visited
35 strongly connected components in search stack
36 transitions explored
35 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.35675,83656,1,0,303,212456,402,375,5246,328630,2279
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(("((((((((((((((((((P_masterState_0+P_masterState_1)+P_masterState_2)+P_masterState_3)+P_masterState_4)+P_masterState_5)+P_masterState_6)+P_masterState_7)+P_masterState_8)+P_masterState_9)+P_masterState_10)+P_masterState_11)+P_masterState_12)+P_masterState_13)+P_masterState_14)+P_masterState_15)+P_masterState_16)+P_masterState_17)>=1)"))
Formula 15 simplified : !"((((((((((((((((((P_masterState_0+P_masterState_1)+P_masterState_2)+P_masterState_3)+P_masterState_4)+P_masterState_5)+P_masterState_6)+P_masterState_7)+P_masterState_8)+P_masterState_9)+P_masterState_10)+P_masterState_11)+P_masterState_12)+P_masterState_13)+P_masterState_14)+P_masterState_15)+P_masterState_16)+P_masterState_17)>=1)"
Computing Next relation with stutter on 1 deadlock states
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,2.35808,83920,1,0,303,212456,405,375,5265,328630,2281
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527500325542

--------------------
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 LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
May 28, 2018 9:38:39 AM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -louvain, -smt]
May 28, 2018 9:38:39 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 28, 2018 9:38:39 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
May 28, 2018 9:38:40 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 995 ms
May 28, 2018 9:38:40 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 18 places.
May 28, 2018 9:38:40 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
May 28, 2018 9:38:40 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :M * POS->P-sendAnnPs__broadcasting,P-startNeg__broadcasting,
M * STAGE->P-stage,
M * M * MT * M->P-network,P-poll__networl,
M * POS * M->P-masterList,
M * BOOL * M->P-masterState,
M->P-crashed,dead,P-electedPrimary,P-electedSecondary,P-electionFailed,P-electionInit,P-poll__handlingMessage,P-poll__pollEnd,P-poll__waitingMessage,P-polling,
M * M * NEGSTEP->P-negotiation,

May 28, 2018 9:38:40 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 22 transitions.
May 28, 2018 9:38:40 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
May 28, 2018 9:38:40 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 9 ms
May 28, 2018 9:38:41 AM fr.lip6.move.gal.instantiate.DomainAnalyzer computeVariableDomains
INFO: Found a total of 4 fixed domain variables (out of 438 variables) in GAL type NeoElection_COL_2
May 28, 2018 9:38:41 AM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: Found a total of 27 constant array cells/variables (out of 438 variables) in type NeoElection_COL_2
May 28, 2018 9:38:41 AM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: P_masterList[0-17], P_electionFailed[0-2], dead[0-2], P_crashed[0-2],
May 28, 2018 9:38:41 AM fr.lip6.move.gal.instantiate.Instantiator instantiateParameters
INFO: On-the-fly reduction of False transitions avoided exploring 221.0 instantiations of transitions. Total transitions/syncs built is 334
May 28, 2018 9:38:41 AM fr.lip6.move.gal.instantiate.Instantiator normalizeCalls
INFO: Calls to non existing labels (possibly due to false guards) leads to 6 abort statements.
May 28, 2018 9:38:41 AM fr.lip6.move.gal.instantiate.DomainAnalyzer computeVariableDomains
INFO: Found a total of 4 fixed domain variables (out of 438 variables) in GAL type NeoElection_COL_2
May 28, 2018 9:38:41 AM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: Found a total of 268 constant array cells/variables (out of 438 variables) in type NeoElection_COL_2
May 28, 2018 9:38:41 AM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: P_masterList[0-17], P_electionFailed[0-2], P_negotiation[0,3,6,9,12,18,24], dead[0-2], P_crashed[0-2], P_network[1-2,7-8,10-11,13-14,16-17,19-20,25-26,28-29,31-32,34-35,37-38,43-44,46-47,49-50,52-53,55-56,61-62,64-65,67-68,70-71,73-74,79-80,82-83,85-86,88-89,91-92,97-98,100-101,103-104,106-107,109-110,115-116,118-119,121-122,124-125,127-128,133-134,136-137,139-140,142-143,145-146,151-152,154-155,157-158,160-161], P_poll__networl[0-3,6-21,24-39,42-57,60-75,78-93,96-111,114-129,132-147,150-161],
May 28, 2018 9:38:41 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Removed constant array :P_masterList[]
May 28, 2018 9:38:41 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Removed constant array :P_electionFailed[]
May 28, 2018 9:38:41 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Removed constant array :dead[]
May 28, 2018 9:38:41 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Removed constant array :P_crashed[]
May 28, 2018 9:38:41 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Simplified 615 expressions due to constant valuations.
May 28, 2018 9:38:41 AM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: Found a total of 241 constant array cells/variables (out of 411 variables) in type NeoElection_COL_2
May 28, 2018 9:38:41 AM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: P_negotiation[0,3,6,9,12,18,24], P_network[1-2,7-8,10-11,13-14,16-17,19-20,25-26,28-29,31-32,34-35,37-38,43-44,46-47,49-50,52-53,55-56,61-62,64-65,67-68,70-71,73-74,79-80,82-83,85-86,88-89,91-92,97-98,100-101,103-104,106-107,109-110,115-116,118-119,121-122,124-125,127-128,133-134,136-137,139-140,142-143,145-146,151-152,154-155,157-158,160-161], P_poll__networl[0-3,6-21,24-39,42-57,60-75,78-93,96-111,114-129,132-147,150-161],
May 28, 2018 9:38:41 AM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: Found a total of 241 constant array cells/variables (out of 411 variables) in type NeoElection_COL_2
May 28, 2018 9:38:41 AM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: P_negotiation[0,3,6,9,12,18,24], P_network[1-2,7-8,10-11,13-14,16-17,19-20,25-26,28-29,31-32,34-35,37-38,43-44,46-47,49-50,52-53,55-56,61-62,64-65,67-68,70-71,73-74,79-80,82-83,85-86,88-89,91-92,97-98,100-101,103-104,106-107,109-110,115-116,118-119,121-122,124-125,127-128,133-134,136-137,139-140,142-143,145-146,151-152,154-155,157-158,160-161], P_poll__networl[0-3,6-21,24-39,42-57,60-75,78-93,96-111,114-129,132-147,150-161],
May 28, 2018 9:38:41 AM fr.lip6.move.gal.instantiate.Simplifier removeUncalledTransitions
INFO: Removed 3 uncalled transitions from type NeoElection_COL_2
May 28, 2018 9:38:41 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 375 ms
May 28, 2018 9:38:42 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 12 ms
May 28, 2018 9:38:42 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
May 28, 2018 9:38:42 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was not deterministic with 256 transitions. Expanding to a total of 414 deterministic transitions.
May 28, 2018 9:38:42 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Determinization took 6 ms.
May 28, 2018 9:38:42 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 266 place invariants in 196 ms
May 28, 2018 9:38:44 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 411 variables to be positive in 2098 ms
May 28, 2018 9:38:44 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 343 transitions.
May 28, 2018 9:38:44 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/343 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 9:38:44 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 46 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 9:38:44 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 343 transitions.
May 28, 2018 9:38:44 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:755)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
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)
May 28, 2018 9:38:45 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 2978ms 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="NeoElection-COL-2"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstoolsl"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-2.tgz
mv NeoElection-COL-2 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool itstoolsl"
echo " Input is NeoElection-COL-2, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r261-csrt-152732585800069"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;