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-3254
Executing tool itstools
Input is S_IBM319-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r120-blw7-149441651800069
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496413999701


Using solver YICES2 to compute partial order matrices.
Built C files in :
/home/mcc/execution
its-ltl command run as :

/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/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 : !((("callToProcess_s00002121_inputCriterion_s00001053_used>=1")U(X(X(X("fork_s00001403_activated_s00001075>=1"))))))
Formula 0 simplified : !("callToProcess_s00002121_inputCriterion_s00001053_used>=1" U XXX"fork_s00001403_activated_s00001075>=1")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 178 rows 253 cols
invariant : -1'callToTask_s00002965_input_s00001052 + 1'callToTask_s00002965_input_s00001066= 0
invariant : -1'callToTask_s00002932_output_s00001054 + 1'callToTask_s00002932_output_s00001077= 0
invariant : -1'callToTask_s00002930_output_s00001054 + 1'callToTask_s00002930_output_s00001077= 0
invariant : -1'callToTask_s00002954_output_s00001054 + 1'callToTask_s00002954_output_s00001077= 0
invariant : -1'callToTask_s00002966_output_s00001054 + 1'callToTask_s00002966_output_s00001077= 0
invariant : 1'alpha + 1'merge_s00002240_activated + 1'merge_s00001160_activated + 1'merge_s00001061_activated + 1'merge_s00002238_activated + 1'merge_s00002239_activated + 1'join_s00001164_input_s00001052 + 1'callToProcess_s00002882_inputCriterion_s00001053_used + 1'callToProcess_s00002944_inputCriterion_s00001053_used + 1'callToProcess_s00002943_inputCriterion_s00001053_used + 1'callToProcess_s00002038_inputCriterion_s00001053_used + 1'merge_s00002240_input_s00001052 + 1'merge_s00001160_input_s00001052 + 1'merge_s00001061_input_s00001052 + 1'merge_s00002240_input_s00001127 + 1'callToProcess_s00002802_inputCriterion_s00001053_used + 3'callToProcess_s00001108_inputCriterion_s00001053_used + 1'merge_s00001160_input_s00001129 + 1'callToProcess_s00002121_inputCriterion_s00001053_used + 1'merge_s00002238_input_s00001052 + 1'callToTask_s00002869_inputCriterion_s00001053_used + 1'callToTask_s00002896_inputCriterion_s00001053_used + 1'callToTask_s00002959_inputCriterion_s00001053_used + 1'callToTask_s00002949_inputCriterion_s00001053_used + 1'merge_s00002239_input_s00001128 + 1'merge_s00002239_input_s00001129 + 1'callToTask_s00002958_inputCriterion_s00001053_used + 1'callToTask_s00002957_inputCriterion_s00001053_used + 1'callToTask_s00002966_inputCriterion_s00001053_used + 1'decision_s00003020_activated + 1'decision_s00003021_activated + 3'decision_s00003022_activated + 1'decision_s00001123_activated + 1'decision_s00002056_activated + 1'decision_s00001840_activated + 1'decision_s00001157_activated + 1'decision_s00002760_activated + 1'decision_s00001158_activated + 1'decision_s00002761_activated + 1'decision_s00002762_activated + 1'decision_s00002948_activated + 1'join_s00001164_activated_s00001062 + 1'fork_s00001071_activated_s00001073 + 1'join_s00001163_activated_s00001065 + 1'fork_s00001298_activated_s00001078 + 1'decision_s00001123_input_s00001052 + 1'callToTask_s00002929_inputCriterion_s00001053_used + 1'callToTask_s00002956_inputCriterion_s00001053_used + 1'callToTask_s00002965_inputCriterion_s00001053_used + 1'callToTask_s00002667_inputCriterion_s00001053_used + 3'endNode_s00001401_input_default + 1'endNode_s00001057_input_default + 1'callToTask_s00002063_input_s00001052 + 1'callToTask_s00001406_input_s00001052 + 1'callToTask_s00002930_input_s00001052 + 1'callToTask_s00002950_input_s00001052 + 1'callToTask_s00002955_inputCriterion_s00001053_used + 1'callToTask_s00002954_inputCriterion_s00001053_used + 1'callToTask_s00001168_input_s00001052 + 1'callToTask_s00002951_input_s00001052 + 1'callToTask_s00002961_input_s00001052 + 1'callToTask_s00002952_input_s00001052 + 1'callToTask_s00002962_input_s00001052 + 1'callToTask_s00002953_input_s00001052 + 1'callToTask_s00002963_inputCriterion_s00001053_used + 1'callToTask_s00001168_input_s00001127 + 1'callToTask_s00002963_input_s00001052 + 1'callToTask_s00002960_input_s00001127 + 1'callToTask_s00002954_input_s00001052 + 1'callToTask_s00002953_inputCriterion_s00001053_used + 1'callToTask_s00002962_inputCriterion_s00001053_used + 1'callToTask_s00002952_inputCriterion_s00001053_used + 1'callToTask_s00002961_inputCriterion_s00001053_used + 1'callToTask_s00002667_input_s00001052 + 1'callToTask_s00002965_input_s00001052 + 1'callToTask_s00002870_inputCriterion_s00001053_used + 1'callToTask_s00002956_input_s00001052 + 1'callToTask_s00002951_inputCriterion_s00001053_used + 1'callToTask_s00002929_input_s00001052 + 1'callToTask_s00002966_input_s00001052 + 1'callToTask_s00002960_inputCriterion_s00001053_used + 1'callToTask_s00002957_input_s00001052 + 3'callToTask_s00001168_inputCriterion_s00001053_used + 1'callToTask_s00001168_input_s00001068 + 1'callToTask_s00001852_inputCriterion_s00001053_used + 1'callToTask_s00002950_inputCriterion_s00001053_used + 1'callToTask_s00002930_inputCriterion_s00001053_used + 1'callToTask_s00002959_input_s00001052 + 1'callToTask_s00002254_inputCriterion_s00001053_used + 1'callToTask_s00001406_inputCriterion_s00001053_used + 1'callToTask_s00002063_inputCriterion_s00001053_used + 1'callToTask_s00002044_inputCriterion_s00001053_used + 1'callToProcess_s00002499_output_s00001054 + 1'callToProcess_s00002882_output_s00001054 + 1'callToProcess_s00002944_output_s00001054 + 1'callToProcess_s00002038_output_s00001077 + 1'callToProcess_s00002943_output_s00001054 + 1'callToTask_s00002869_input_s00001066 + 1'callToTask_s00002063_output_s00001054 + 1'callToTask_s00001406_output_s00001054 + 1'callToTask_s00002254_output_s00001054 + 1'callToTask_s00002930_output_s00001054 + 1'callToTask_s00002044_output_s00001077 + 1'callToTask_s00002950_output_s00001054 + 1'callToProcess_s00002802_output_s00001054 + 1'callToTask_s00001852_output_s00001054 + 3'callToProcess_s00001108_output_s00001054 + 3'callToTask_s00001168_output_s00001054 + 1'callToTask_s00002960_output_s00001054 + 1'callToTask_s00002951_output_s00001054 + 1'callToTask_s00002870_output_s00001054 + 1'callToTask_s00002961_output_s00001054 + 1'callToTask_s00002952_output_s00001054 + 1'callToTask_s00002962_output_s00001054 + 1'callToProcess_s00002121_output_s00001054 + 1'callToTask_s00002963_output_s00001054 + 1'callToTask_s00002954_output_s00001054 + 1'callToProcess_s00002499_input_s00001052 + 1'callToTask_s00002955_output_s00001054 + 3'callToProcess_s00001108_input_s00001052 + 4'callToTask_s00002958_output_s00001077 + 1'callToTask_s00002667_output_s00001054 + 1'callToTask_s00002869_output_s00001054 + 1'callToTask_s00002965_output_s00001054 + 1'callToTask_s00002896_output_s00001054 + 1'callToTask_s00002956_output_s00001054 + 1'callToTask_s00002959_output_s00001054 + 1'callToTask_s00002929_output_s00001054 + 1'callToTask_s00002949_output_s00001054 + 1'callToTask_s00002966_output_s00001054 + 1'callToTask_s00002953_output_s00001077 + 1'callToTask_s00002957_output_s00001054 + -3'callToTask_s00002958_output_s00001054 + 1'callToProcess_s00002499_inputCriterion_s00001053_used= 1
invariant : 1'fork_s00001403_activated_s00001075 + 1'callToTask_s00002960_input_s00001052 + -1'callToTask_s00002960_input_s00001127 + 1'process_s00000343__s00003019_input_s00001109= 0
invariant : -1'callToTask_s00002958_output_s00001077 + 1'callToTask_s00002958_output_s00001054 + 1'process_s00000343__s00003019_outputCriterion_s00001055_omega= 0
invariant : -1'callToTask_s00001852_output_s00001054 + 1'callToTask_s00001852_output_s00001077= 0
invariant : -1'decision_s00002055_input_s00001052 + 1'decision_s00002055_input_s00001066= 0
invariant : -1'callToTask_s00002667_output_s00001054 + 1'callToTask_s00002667_output_s00001077= 0
invariant : -1'callToTask_s00002964_output_s00001054 + 1'callToTask_s00002964_output_s00001077= 0
invariant : -1'callToProcess_s00001108_output_s00001054 + -1'callToTask_s00002958_output_s00001077 + 1'callToTask_s00002958_output_s00001054 + 1'callToProcess_s00001108_output_s00001077= 0
invariant : -1'callToTask_s00002931_output_s00001054 + 1'callToTask_s00002931_output_s00001077= 0
invariant : -1'callToTask_s00002959_output_s00001054 + 1'callToTask_s00002959_output_s00001077= 0
invariant : -1'callToTask_s00002966_input_s00001052 + 1'callToTask_s00002966_input_s00001066= 0
invariant : -1'callToTask_s00002956_input_s00001052 + 1'callToTask_s00002956_input_s00001066= 0
invariant : -1'callToTask_s00002962_output_s00001054 + 1'callToTask_s00002962_output_s00001077= 0
invariant : -1'merge_s00001162_input_s00001052 + 1'merge_s00001162_input_s00001068= 0
invariant : -1'callToTask_s00002952_output_s00001054 + 1'callToTask_s00002952_output_s00001077= 0
invariant : -1'callToTask_s00002963_input_s00001052 + 1'callToTask_s00002963_input_s00001066= 0
invariant : -1'callToTask_s00002965_output_s00001054 + 1'callToTask_s00002965_output_s00001077= 0
invariant : -1'callToTask_s00002949_output_s00001054 + 1'callToTask_s00002949_output_s00001077= 0
invariant : -1'callToTask_s00002869_output_s00001054 + 1'callToTask_s00002869_output_s00001077= 0
invariant : -1'callToTask_s00002959_input_s00001052 + 1'callToTask_s00002959_input_s00001066= 0
invariant : -1'callToTask_s00002957_input_s00001052 + 1'callToTask_s00002957_input_s00001066= 0
invariant : -1'callToProcess_s00002944_output_s00001054 + 1'callToProcess_s00002944_output_s00001077= 0
invariant : -1'callToTask_s00002951_input_s00001052 + 1'callToTask_s00002951_input_s00001066= 0
invariant : -1'callToTask_s00002953_input_s00001052 + 1'callToTask_s00002953_input_s00001066= 0
invariant : -1'callToTask_s00002951_output_s00001054 + 1'callToTask_s00002951_output_s00001077= 0
invariant : -1'callToProcess_s00002802_output_s00001054 + 1'callToProcess_s00002802_output_s00001077= 0
invariant : -1'callToTask_s00002954_input_s00001052 + 1'callToTask_s00002954_input_s00001066= 0
invariant : -1'join_s00001164_input_s00001127 + 1'join_s00001164_input_s00001066= 0
invariant : 1'merge_s00001162_activated + 1'join_s00001163_input_s00001128 + 1'merge_s00001162_input_s00001052 + 1'decision_s00002055_activated + 1'join_s00001163_activated_s00001064 + -1'join_s00001163_activated_s00001065 + 1'fork_s00001298_activated_s00001075 + -1'fork_s00001298_activated_s00001078 + 1'decision_s00002055_input_s00001052 + -1'callToTask_s00002930_input_s00001052 + 1'callToTask_s00002932_input_s00001052 + -1'callToTask_s00002930_inputCriterion_s00001053_used + -1'callToTask_s00002930_output_s00001054 + 1'callToTask_s00002932_output_s00001054 + 1'callToTask_s00002932_inputCriterion_s00001053_used= 0
invariant : -1'callToTask_s00002950_output_s00001054 + 1'callToTask_s00002950_output_s00001077= 0
invariant : -1'callToTask_s00002929_output_s00001054 + 1'callToTask_s00002929_output_s00001077= 0
invariant : -1'merge_s00002240_input_s00001127 + 1'merge_s00002240_input_s00001066= 0
invariant : -1'callToTask_s00002955_output_s00001054 + 1'callToTask_s00002955_output_s00001077= 0
invariant : -1'callToTask_s00001406_input_s00001052 + 1'callToTask_s00001406_input_s00001066= 0
invariant : -1'callToProcess_s00002499_input_s00001052 + 1'callToProcess_s00002499_input_s00001066= 0
invariant : -1'callToTask_s00002950_input_s00001052 + 1'callToTask_s00002950_input_s00001066= 0
invariant : -1'merge_s00002241_input_s00001127 + 1'merge_s00002241_input_s00001066= 0
invariant : -1'decision_s00001841_input_s00001052 + 1'decision_s00001841_input_s00001066= 0
invariant : -1'callToTask_s00002957_output_s00001054 + 1'callToTask_s00002957_output_s00001077= 0
invariant : -1'callToProcess_s00002121_output_s00001054 + 1'callToProcess_s00002121_output_s00001077= 0
invariant : -1'callToTask_s00002963_output_s00001054 + 1'callToTask_s00002963_output_s00001077= 0
invariant : -1'callToTask_s00002960_input_s00001127 + 1'callToTask_s00002960_input_s00001128= 0
invariant : -1'callToTask_s00002667_input_s00001052 + 1'callToTask_s00002667_input_s00001066= 0
invariant : -1'callToProcess_s00002499_output_s00001054 + 1'callToProcess_s00002499_output_s00001083= 0
invariant : -1'join_s00001163_input_s00001052 + 1'join_s00001163_input_s00001127= 0
invariant : -1'callToTask_s00002961_output_s00001054 + 1'callToTask_s00002961_output_s00001077= 0
invariant : -1'callToTask_s00001406_output_s00001054 + 1'callToTask_s00001406_output_s00001077= 0
invariant : -1'callToTask_s00002962_input_s00001052 + 1'callToTask_s00002962_input_s00001066= 0
invariant : -1'merge_s00001160_input_s00001129 + 1'merge_s00001160_input_s00001068= 0
invariant : -1'callToTask_s00002964_input_s00001052 + 1'callToTask_s00002964_input_s00001066= 0
invariant : -1'join_s00001164_input_s00001052 + 1'join_s00001164_input_s00001068= 0
invariant : -1'callToTask_s00002960_input_s00001127 + 1'callToTask_s00002960_input_s00001066= 0
invariant : -1'join_s00001163_input_s00001128 + 1'join_s00001163_input_s00001066= 0
invariant : -1'decision_s00001126_input_s00001052 + 1'decision_s00001126_input_s00001066= 0
invariant : -1'merge_s00001160_input_s00001052 + 1'merge_s00001160_input_s00001127= 0
invariant : -1'callToTask_s00002063_input_s00001052 + 1'callToTask_s00002063_input_s00001066= 0
invariant : -1'endNode_s00001057_input_default + 1'callToTask_s00002958_output_s00001077 + -1'callToTask_s00002958_output_s00001054 + 1'process_s00000343__s00003019_output_s00001249= 0
invariant : -1'callToProcess_s00002882_output_s00001054 + 1'callToProcess_s00002882_output_s00001077= 0
invariant : -1'callToProcess_s00002943_output_s00001054 + 1'callToProcess_s00002943_output_s00001077= 0
invariant : 1'merge_s00001161_activated + 1'join_s00001163_input_s00001052 + 1'merge_s00001161_input_s00001052 + 1'decision_s00001841_activated + 1'join_s00001163_activated_s00001062 + -1'join_s00001163_activated_s00001065 + 1'fork_s00001298_activated_s00001073 + -1'fork_s00001298_activated_s00001078 + 1'decision_s00001841_input_s00001052 + -1'callToTask_s00002930_input_s00001052 + 1'callToTask_s00002931_input_s00001052 + -1'callToTask_s00002930_inputCriterion_s00001053_used + -1'callToTask_s00002930_output_s00001054 + 1'callToTask_s00002931_output_s00001054 + 1'callToTask_s00002931_inputCriterion_s00001053_used= 0
invariant : -1'merge_s00001061_input_s00001052 + 1'merge_s00001061_input_s00001068= 0
invariant : -1'callToTask_s00002930_input_s00001052 + 1'callToTask_s00002930_input_s00001066= 0
invariant : -1'callToTask_s00002929_input_s00001052 + 1'callToTask_s00002929_input_s00001066= 0
invariant : -1'callToTask_s00002961_input_s00001052 + 1'callToTask_s00002961_input_s00001066= 0
invariant : -1'callToTask_s00002931_input_s00001052 + 1'callToTask_s00002931_input_s00001066= 0
invariant : -1'merge_s00002238_input_s00001052 + 1'merge_s00002238_input_s00001068= 0
invariant : -1'merge_s00002240_activated + 1'merge_s00002241_activated + -1'join_s00001164_input_s00001052 + 1'join_s00001164_input_s00001127 + -1'merge_s00002240_input_s00001052 + 1'merge_s00002241_input_s00001052 + -1'merge_s00002240_input_s00001127 + 1'merge_s00002241_input_s00001127 + -1'decision_s00001123_activated + 1'decision_s00001126_activated + -1'decision_s00001158_activated + 1'decision_s00001159_activated + -1'join_s00001164_activated_s00001062 + -1'fork_s00001071_activated_s00001073 + 1'join_s00001164_activated_s00001064 + 1'fork_s00001071_activated_s00001075 + -1'decision_s00001123_input_s00001052 + 1'decision_s00001126_input_s00001052 + -1'callToTask_s00001406_input_s00001052 + -1'callToTask_s00001168_input_s00001052 + 1'callToTask_s00002964_input_s00001052 + 1'callToTask_s00001168_input_s00001066 + 1'callToTask_s00002824_inputCriterion_s00001053_used + -1'callToTask_s00001406_inputCriterion_s00001053_used + -1'callToTask_s00002044_inputCriterion_s00001053_used + -1'callToTask_s00001406_output_s00001054 + -1'callToTask_s00002044_output_s00001077 + 1'callToTask_s00002964_output_s00001054 + 1'callToTask_s00002824_output_s00001077 + 1'callToTask_s00002964_inputCriterion_s00001053_used= 0
invariant : -1'merge_s00001161_input_s00001052 + 1'merge_s00001161_input_s00001068= 0
invariant : -1'merge_s00002239_input_s00001129 + 1'merge_s00002239_input_s00001068= 0
invariant : -1'callToTask_s00002870_output_s00001054 + 1'callToTask_s00002870_output_s00001077= 0
invariant : -1'callToTask_s00002956_output_s00001054 + 1'callToTask_s00002956_output_s00001077= 0
invariant : -1'callToTask_s00002960_output_s00001054 + 1'callToTask_s00002960_output_s00001077= 0
invariant : -1'callToTask_s00002063_output_s00001054 + 1'callToTask_s00002063_output_s00001077= 0
invariant : -1'merge_s00002239_input_s00001128 + 1'merge_s00002239_input_s00001066= 0
invariant : -1'decision_s00001123_input_s00001052 + 1'decision_s00001123_input_s00001066= 0
invariant : -1'callToTask_s00002932_input_s00001052 + 1'callToTask_s00002932_input_s00001066= 0
invariant : -1'callToTask_s00002952_input_s00001052 + 1'callToTask_s00002952_input_s00001066= 0
invariant : -1'callToTask_s00002896_output_s00001054 + 1'callToTask_s00002896_output_s00001077= 0
invariant : -1'callToTask_s00002960_input_s00001127 + 1'callToTask_s00002960_input_s00001068= 0
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
166 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.68481,82796,1,0,427,209629,378,413,6647,231241,763
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA IBM319-PT-none-LTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((F(F((("callToTask_s00002869_output_s00001054>=1")&&("callToTask_s00002869_output_s00001077>=1"))U(F(("callToTask_s00002960_output_s00001054>=1")&&("callToTask_s00002960_output_s00001077>=1")))))))
Formula 1 simplified : !F(("callToTask_s00002869_output_s00001054>=1" & "callToTask_s00002869_output_s00001077>=1") U F("callToTask_s00002960_output_s00001054>=1" & "callToTask_s00002960_output_s00001077>=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,1.74561,83096,1,0,449,209801,392,430,6652,231843,821
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA IBM319-PT-none-LTLFireability-1 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((F(((("callToTask_s00002932_input_s00001052>=1")&&("callToTask_s00002932_input_s00001066>=1"))U("decision_s00001159_activated>=1"))U("callToTask_s00002063_inputCriterion_s00001053_used>=1"))))
Formula 2 simplified : !F((("callToTask_s00002932_input_s00001052>=1" & "callToTask_s00002932_input_s00001066>=1") U "decision_s00001159_activated>=1") U "callToTask_s00002063_inputCriterion_s00001053_used>=1")
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,1.78697,85384,1,0,500,217129,401,465,6653,243309,957
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA IBM319-PT-none-LTLFireability-2 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((F("callToTask_s00002254_inputCriterion_s00001053_used>=1")))
Formula 3 simplified : !F"callToTask_s00002254_inputCriterion_s00001053_used>=1"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
178 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.57254,141256,1,0,1062,476051,410,990,6654,608659,2094
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA IBM319-PT-none-LTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((G(G("decision_s00001126_activated>=1"))))
Formula 4 simplified : !G"decision_s00001126_activated>=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.57462,141564,1,0,1065,476065,416,996,6655,608714,2113
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA IBM319-PT-none-LTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((X((F(F(("callToTask_s00002667_input_s00001052>=1")&&("callToTask_s00002667_input_s00001066>=1"))))U(F(F("decision_s00003022_activated>=1"))))))
Formula 5 simplified : !X(F("callToTask_s00002667_input_s00001052>=1" & "callToTask_s00002667_input_s00001066>=1") U F"decision_s00003022_activated>=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,3.65588,144284,1,0,1170,479358,425,1286,6657,617248,2891
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA IBM319-PT-none-LTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((G((F(X("callToTask_s00002951_inputCriterion_s00001053_used>=1")))U(X("decision_s00001126_activated>=1")))))
Formula 6 simplified : !G(FX"callToTask_s00002951_inputCriterion_s00001053_used>=1" U X"decision_s00001126_activated>=1")
134 unique states visited
134 strongly connected components in search stack
135 transitions explored
134 items max in DFS search stack
26 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.92069,154576,1,0,1170,479358,437,1397,6660,738934,3289
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA IBM319-PT-none-LTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(("callToTask_s00002955_inputCriterion_s00001053_used>=1"))
Formula 7 simplified : !"callToTask_s00002955_inputCriterion_s00001053_used>=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.92118,154576,1,0,1170,479358,440,1397,6661,738934,3291
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA IBM319-PT-none-LTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !(((X(F(G("callToProcess_s00001108_inputCriterion_s00001053_used>=1"))))U(G(X(("decision_s00001123_input_s00001052>=1")&&("decision_s00001123_input_s00001066>=1"))))))
Formula 8 simplified : !(XFG"callToProcess_s00001108_inputCriterion_s00001053_used>=1" U GX("decision_s00001123_input_s00001052>=1" & "decision_s00001123_input_s00001066>=1"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.97784,158728,1,0,1173,481105,461,1403,6668,741648,3955
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA IBM319-PT-none-LTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((X(X(F(X(F("callToTask_s00002951_inputCriterion_s00001053_used>=1")))))))
Formula 9 simplified : !XXFXF"callToTask_s00002951_inputCriterion_s00001053_used>=1"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
81 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,4.78588,176248,1,0,1651,583907,461,1858,6668,854704,4928
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA IBM319-PT-none-LTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((G((G(X("fork_s00001298_activated_s00001078>=1")))U((("callToTask_s00002959_input_s00001052>=1")&&("callToTask_s00002959_input_s00001066>=1"))U("merge_s00002239_activated>=1")))))
Formula 10 simplified : !G(GX"fork_s00001298_activated_s00001078>=1" U (("callToTask_s00002959_input_s00001052>=1" & "callToTask_s00002959_input_s00001066>=1") U "merge_s00002239_activated>=1"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.83752,178964,1,0,1658,591936,481,1866,6680,865499,4953
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA IBM319-PT-none-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((F(F(G(G(("callToTask_s00002956_input_s00001052>=1")&&("callToTask_s00002956_input_s00001066>=1")))))))
Formula 11 simplified : !FG("callToTask_s00002956_input_s00001052>=1" & "callToTask_s00002956_input_s00001066>=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,5.32224,201276,1,0,2036,704615,501,2278,6686,1.04208e+06,6435
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA IBM319-PT-none-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((G(G(G((("callToTask_s00002931_output_s00001054>=1")&&("callToTask_s00002931_output_s00001077>=1"))U("decision_s00001126_activated>=1"))))))
Formula 12 simplified : !G(("callToTask_s00002931_output_s00001054>=1" & "callToTask_s00002931_output_s00001077>=1") U "decision_s00001126_activated>=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,5.324,201580,1,0,2036,704615,529,2278,6708,1.04208e+06,6442
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA IBM319-PT-none-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((G(G(("callToTask_s00002869_input_s00001052>=1")&&("callToTask_s00002869_input_s00001066>=1")))))
Formula 13 simplified : !G("callToTask_s00002869_input_s00001052>=1" & "callToTask_s00002869_input_s00001066>=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,5.32483,201604,1,0,2036,704615,542,2278,6714,1.04208e+06,6447
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA IBM319-PT-none-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((X(X(X(F(G("callToTask_s00001168_inputCriterion_s00001053_used>=1")))))))
Formula 14 simplified : !XXXFG"callToTask_s00001168_inputCriterion_s00001053_used>=1"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.37217,204044,1,0,2078,704762,555,2345,6716,1.04293e+06,7564
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA IBM319-PT-none-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !(((F(G(("callToTask_s00002949_output_s00001054>=1")&&("callToTask_s00002949_output_s00001077>=1"))))U(G(F(F("merge_s00001061_activated>=1"))))))
Formula 15 simplified : !(FG("callToTask_s00002949_output_s00001054>=1" & "callToTask_s00002949_output_s00001077>=1") U GF"merge_s00001061_activated>=1")
133 unique states visited
133 strongly connected components in search stack
134 transitions explored
133 items max in DFS search stack
10 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,5.46039,206864,1,0,2106,715964,564,2373,6717,1.05627e+06,7872
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA IBM319-PT-none-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Exit code :0

BK_STOP 1496414008766

--------------------
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 -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.201.v20161025-1711.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 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
Jun 02, 2017 2:33:21 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2017 2:33:21 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 59 ms
Jun 02, 2017 2:33:21 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 253 places.
Jun 02, 2017 2:33:21 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 178 transitions.
Jun 02, 2017 2:33:21 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 47 ms
Jun 02, 2017 2:33:21 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 12 ms
Jun 02, 2017 2:33:21 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Jun 02, 2017 2:33:21 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 84 place invariants in 55 ms
Jun 02, 2017 2:33:23 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 253 variables to be positive in 1755 ms
Jun 02, 2017 2:33:23 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 178 transitions.
Jun 02, 2017 2:33:23 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/178 took 1 ms. Total solver calls (SAT/UNSAT): 2(1/1)
Jun 02, 2017 2:33:23 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 193 ms. Total solver calls (SAT/UNSAT): 421(214/207)
Jun 02, 2017 2:33:23 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 178 transitions.
Jun 02, 2017 2:33:23 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 169 ms. Total solver calls (SAT/UNSAT): 421(183/238)
Jun 02, 2017 2:33:23 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 178 transitions.
Jun 02, 2017 2:33:25 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(40/178) took 1006 ms. Total solver calls (SAT/UNSAT): 6478(52/6426)
Jun 02, 2017 2:33:26 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(97/178) took 2018 ms. Total solver calls (SAT/UNSAT): 12691(339/12352)
Jun 02, 2017 2:33:26 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished enabling matrix. took 2635 ms. Total solver calls (SAT/UNSAT): 15931(597/15334)
Jun 02, 2017 2:33:26 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 178 transitions.
Jun 02, 2017 2:33:28 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/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]
Reverse transition relation is NOT exact ! Due to transitions merge_s00001061_activate_s00001062, merge_s00001061_activate_s00001064, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :8/168/2/178
Computing Next relation with stutter on 20 deadlock states
Computing Next relation with stutter on 20 deadlock states
Computing Next relation with stutter on 20 deadlock states
Computing Next relation with stutter on 20 deadlock states
Computing Next relation with stutter on 20 deadlock states
Computing Next relation with stutter on 20 deadlock states
Computing Next relation with stutter on 20 deadlock states
Computing Next relation with stutter on 20 deadlock states
Computing Next relation with stutter on 20 deadlock states
Computing Next relation with stutter on 20 deadlock states
Computing Next relation with stutter on 20 deadlock states
Computing Next relation with stutter on 20 deadlock states
Computing Next relation with stutter on 20 deadlock states
Computing Next relation with stutter on 20 deadlock states
Computing Next relation with stutter on 20 deadlock states
Computing Next relation with stutter on 20 deadlock states

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="S_IBM319-PT-none"
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/S_IBM319-PT-none.tgz
mv S_IBM319-PT-none execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool itstools"
echo " Input is S_IBM319-PT-none, 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 r120-blw7-149441651800069"
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 ;