fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r120-blw7-149441651800078
Last Updated
June 27, 2017

About the Execution of ITS-Tools for S_IBM703-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
495.530 9655.00 22039.00 134.80 FFFFFFFFFFFTFFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
......
=====================================================================
Generated by BenchKit 2-3254
Executing tool itstools
Input is S_IBM703-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-149441651800078
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1496414138215


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 : !(((X(("task_s00000716_input_s00000263>=1")U("task_s00000725_input_s00000263>=1")))U(G(F(G("task_s00000739_output_s00000264>=1"))))))
Formula 0 simplified : !(X("task_s00000716_input_s00000263>=1" U "task_s00000725_input_s00000263>=1") U GFG"task_s00000739_output_s00000264>=1")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 284 rows 262 cols
invariant : 1'alpha + 1'merge_s00000320_activated + 1'merge_s00000341_activated + 1'merge_s00000450_activated + 1'merge_s00000451_activated + 1'merge_s00000461_activated + 1'merge_s00000452_activated + 1'merge_s00000462_activated + 1'merge_s00000453_activated + 1'merge_s00000454_activated + 1'merge_s00000445_activated + 1'merge_s00000319_activated + 1'merge_s00000283_activated + 1'merge_s00000806_activated + 1'merge_s00000455_activated + 1'merge_s00000446_activated + 1'merge_s00000456_activated + 1'merge_s00000457_activated + 1'merge_s00000458_activated + 1'merge_s00000449_activated + 1'merge_s00000288_activated + 1'task_s00000710_input_s00000263 + 1'task_s00000720_input_s00000263 + 1'task_s00000711_input_s00000263 + 1'task_s00000730_input_s00000263 + 1'task_s00000721_input_s00000263 + 1'task_s00000740_input_s00000263 + 1'task_s00000722_input_s00000263 + 1'task_s00000704_input_s00000263 + 1'task_s00000741_input_s00000263 + 1'task_s00000723_input_s00000263 + 1'task_s00000714_input_s00000263 + 1'task_s00000705_input_s00000263 + 1'task_s00000760_input_s00000263 + 1'task_s00000724_input_s00000263 + 1'task_s00000715_input_s00000263 + 1'task_s00000706_input_s00000263 + 1'fork_s00000464_input_s00000263 + 1'task_s00000761_input_s00000263 + 1'task_s00000725_input_s00000263 + 1'task_s00000716_input_s00000263 + 1'task_s00000707_input_s00000263 + 1'fork_s00000465_input_s00000263 + 1'task_s00000762_input_s00000263 + 1'task_s00000753_input_s00000263 + 1'task_s00000744_input_s00000263 + 1'task_s00000726_input_s00000263 + 1'task_s00000763_input_s00000263 + 1'task_s00000745_input_s00000263 + 1'task_s00000727_input_s00000263 + 1'task_s00000709_input_s00000263 + 1'task_s00000755_input_s00000263 + 1'task_s00000746_input_s00000263 + 1'task_s00000728_input_s00000263 + 1'task_s00000719_input_s00000263 + 1'task_s00000756_input_s00000263 + 1'task_s00000738_input_s00000263 + 1'task_s00000729_input_s00000263 + 1'task_s00000757_input_s00000263 + 1'task_s00000739_input_s00000263 + 1'merge_s00000320_input_s00000290 + 1'merge_s00000320_input_s00000263 + 1'merge_s00000341_input_s00000263 + 1'merge_s00000461_input_s00000263 + 1'merge_s00000453_input_s00000290 + 1'merge_s00000453_input_s00000263 + 1'merge_s00000341_input_s00000285 + 1'merge_s00000319_input_s00000290 + 1'merge_s00000319_input_s00000263 + 1'merge_s00000283_input_s00000263 + 1'merge_s00000455_input_s00000290 + 1'merge_s00000455_input_s00000263 + 1'merge_s00000451_input_s00000285 + 1'merge_s00000446_input_s00000290 + 1'merge_s00000446_input_s00000263 + 1'merge_s00000456_input_s00000290 + 1'merge_s00000456_input_s00000263 + 1'merge_s00000452_input_s00000285 + 1'merge_s00000462_input_s00000285 + 1'merge_s00000458_input_s00000263 + 1'merge_s00000446_input_s00000447 + 1'merge_s00000446_input_s00000285 + 1'merge_s00000457_input_s00000285 + 1'merge_s00000458_input_s00000285 + 1'merge_s00000449_input_s00000285 + 1'task_s00000710_output_s00000264 + 1'task_s00000720_output_s00000264 + 1'task_s00000711_output_s00000264 + 1'task_s00000730_output_s00000264 + 1'task_s00000721_output_s00000264 + 1'task_s00000712_output_s00000264 + 1'task_s00000740_output_s00000264 + 1'task_s00000731_output_s00000264 + 1'task_s00000722_output_s00000264 + 1'task_s00000704_output_s00000264 + 1'task_s00000741_output_s00000264 + 1'task_s00000723_output_s00000264 + 1'task_s00000714_output_s00000264 + 1'task_s00000705_output_s00000264 + 1'task_s00000760_output_s00000264 + 1'task_s00000742_output_s00000264 + 1'task_s00000724_output_s00000264 + 1'task_s00000715_output_s00000264 + 1'task_s00000706_output_s00000264 + 1'task_s00000761_output_s00000264 + 1'task_s00000752_output_s00000264 + 1'task_s00000743_output_s00000264 + 1'task_s00000725_output_s00000264 + 1'task_s00000716_output_s00000264 + 1'task_s00000707_output_s00000264 + 1'task_s00000762_output_s00000264 + 1'task_s00000753_output_s00000264 + 1'task_s00000744_output_s00000264 + 1'task_s00000726_output_s00000264 + 1'task_s00000717_output_s00000264 + 1'task_s00000708_output_s00000264 + 1'task_s00000763_output_s00000264 + 1'task_s00000745_output_s00000264 + 1'task_s00000727_output_s00000264 + 1'task_s00000718_output_s00000264 + 1'task_s00000709_output_s00000264 + 1'task_s00000755_output_s00000264 + 1'task_s00000746_output_s00000264 + 1'task_s00000737_output_s00000264 + 1'task_s00000728_output_s00000264 + 1'task_s00000719_output_s00000264 + 1'task_s00000756_output_s00000264 + 1'task_s00000738_output_s00000264 + 1'task_s00000729_output_s00000264 + 1'task_s00000757_output_s00000264 + 1'task_s00000739_output_s00000264 + 1'task_s00000758_output_s00000264 + 1'task_s00000759_output_s00000264 + 1'decision_s00000801_activated + 1'decision_s00000802_activated + 1'decision_s00000803_activated + 1'decision_s00000804_activated + 1'decision_s00000805_activated + 1'decision_s00000780_activated + 1'decision_s00000772_activated + 1'decision_s00000773_activated + 1'decision_s00000764_activated + 1'decision_s00000792_activated + 1'decision_s00000783_activated + 1'decision_s00000774_activated + 1'decision_s00000793_activated + 1'decision_s00000784_activated + 1'decision_s00000775_activated + 1'decision_s00000776_activated + 1'decision_s00000777_activated + 1'decision_s00000768_activated + 1'decision_s00000796_activated + 1'decision_s00000787_activated + 1'decision_s00000778_activated + 1'decision_s00000788_activated + 1'decision_s00000789_activated + 1'decision_s00000799_activated + 1'fork_s00000464_activated_s00000272 + 1'fork_s00000465_activated_s00000272 + 1'fork_s00000463_activated_s00000274 + 1'fork_s00000466_activated_s00000272 + 1'decision_s00000802_input_s00000263 + 1'decision_s00000780_input_s00000263 + 1'decision_s00000773_input_s00000263 + 1'decision_s00000764_input_s00000263 + 1'decision_s00000783_input_s00000263 + 1'decision_s00000793_input_s00000263 + 1'decision_s00000784_input_s00000263 + 1'decision_s00000775_input_s00000263 + 1'decision_s00000796_input_s00000263 + 1'decision_s00000787_input_s00000263 + 1'stopNode_s00000597_input_default + 1'process_s00000030__s00000703_input_s00000263 + 1'callToProcess_s00000807_input_s00000263 + 1'callToProcess_s00000807_output_s00000264 + 1'callToProcess_s00000348_output_s00000264 + 1'callToProcess_s00000808_output_s00000264 + 1'callToProcess_s00000596_output_s00000264 + 1'task_s00000710_inputCriterion_s00000257_used + 1'task_s00000720_inputCriterion_s00000257_used + 1'task_s00000711_inputCriterion_s00000257_used + 1'task_s00000730_inputCriterion_s00000257_used + 1'task_s00000721_inputCriterion_s00000257_used + 1'task_s00000712_inputCriterion_s00000257_used + 1'task_s00000740_inputCriterion_s00000257_used + 1'task_s00000731_inputCriterion_s00000257_used + 1'task_s00000722_inputCriterion_s00000257_used + 1'task_s00000704_inputCriterion_s00000257_used + 1'task_s00000741_inputCriterion_s00000257_used + 1'task_s00000723_inputCriterion_s00000257_used + 1'task_s00000714_inputCriterion_s00000257_used + 1'task_s00000705_inputCriterion_s00000257_used + 1'task_s00000760_inputCriterion_s00000257_used + 1'task_s00000742_inputCriterion_s00000257_used + 1'task_s00000724_inputCriterion_s00000257_used + 1'task_s00000715_inputCriterion_s00000257_used + 1'task_s00000706_inputCriterion_s00000257_used + 1'task_s00000761_inputCriterion_s00000257_used + 1'task_s00000752_inputCriterion_s00000257_used + 1'task_s00000743_inputCriterion_s00000257_used + 1'task_s00000725_inputCriterion_s00000257_used + 1'task_s00000716_inputCriterion_s00000257_used + 1'task_s00000707_inputCriterion_s00000257_used + 1'task_s00000762_inputCriterion_s00000257_used + 1'task_s00000753_inputCriterion_s00000257_used + 1'task_s00000744_inputCriterion_s00000257_used + 1'task_s00000726_inputCriterion_s00000257_used + 1'task_s00000717_inputCriterion_s00000257_used + 1'task_s00000708_inputCriterion_s00000257_used + 1'task_s00000763_inputCriterion_s00000257_used + 1'task_s00000745_inputCriterion_s00000257_used + 1'task_s00000727_inputCriterion_s00000257_used + 1'task_s00000718_inputCriterion_s00000257_used + 1'task_s00000709_inputCriterion_s00000257_used + 1'task_s00000755_inputCriterion_s00000257_used + 1'task_s00000746_inputCriterion_s00000257_used + 1'task_s00000737_inputCriterion_s00000257_used + 1'task_s00000728_inputCriterion_s00000257_used + 1'task_s00000719_inputCriterion_s00000257_used + 1'task_s00000756_inputCriterion_s00000257_used + 1'task_s00000738_inputCriterion_s00000257_used + 1'task_s00000729_inputCriterion_s00000257_used + 1'task_s00000757_inputCriterion_s00000257_used + 1'task_s00000739_inputCriterion_s00000257_used + 1'task_s00000758_inputCriterion_s00000257_used + 1'task_s00000759_inputCriterion_s00000257_used + 1'callToProcess_s00000807_inputCriterion_s00000257_used + 1'callToProcess_s00000348_inputCriterion_s00000257_used + 1'callToProcess_s00000808_inputCriterion_s00000257_used + 1'callToProcess_s00000596_inputCriterion_s00000257_used= 1
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
307 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.10971,123900,1,0,919,409372,598,899,6743,615098,2162
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !(("merge_s00000462_activated>=1"))
Formula 1 simplified : !"merge_s00000462_activated>=1"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
8 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.18282,125948,1,0,952,414786,607,977,7241,627256,2294
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((F(F(("task_s00000754_input_s00000263>=1")U(X("merge_s00000446_input_s00000285>=1"))))))
Formula 2 simplified : !F("task_s00000754_input_s00000263>=1" U X"merge_s00000446_input_s00000285>=1")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
76 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.95016,147352,1,0,1253,501832,616,1312,7242,786104,3136
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((G(G(X(F(F("task_s00000710_output_s00000264>=1")))))))
Formula 3 simplified : !GXF"task_s00000710_output_s00000264>=1"
110 unique states visited
110 strongly connected components in search stack
111 transitions explored
110 items max in DFS search stack
65 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.59855,155936,1,0,1253,502758,625,1415,7243,875561,3465
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(("merge_s00000453_input_s00000290>=1"))
Formula 4 simplified : !"merge_s00000453_input_s00000290>=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,4.5992,155936,1,0,1253,502758,628,1415,7244,875562,3467
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((("task_s00000761_inputCriterion_s00000257_used>=1")U(X(F(X("decision_s00000768_activated>=1"))))))
Formula 5 simplified : !("task_s00000761_inputCriterion_s00000257_used>=1" U XFX"decision_s00000768_activated>=1")
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.60589,156312,1,0,1254,502891,637,1421,7245,877247,3488
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA IBM703-PT-none-LTLFireability-5 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((G(F("decision_s00000793_input_s00000263>=1"))))
Formula 6 simplified : !GF"decision_s00000793_input_s00000263>=1"
110 unique states visited
110 strongly connected components in search stack
111 transitions explored
110 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,4.65407,158280,1,0,1360,509245,646,1496,7246,884033,3825
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((X(G(G(F(G("task_s00000745_inputCriterion_s00000257_used>=1")))))))
Formula 7 simplified : !XGFG"task_s00000745_inputCriterion_s00000257_used>=1"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
118 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.82624,200972,1,0,1838,700766,659,2045,7247,1.23286e+06,5304
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((G(F(X(F(X("merge_s00000341_input_s00000285>=1")))))))
Formula 8 simplified : !GFXFX"merge_s00000341_input_s00000285>=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,5.88595,203688,1,0,1848,702653,668,2056,7248,1.23522e+06,5552
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((X(X((G("decision_s00000778_activated>=1"))U(G("decision_s00000792_activated>=1"))))))
Formula 9 simplified : !XX(G"decision_s00000778_activated>=1" U G"decision_s00000792_activated>=1")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,5.89845,204608,1,0,1848,703649,686,2056,7258,1.23689e+06,5564
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !(("merge_s00000462_input_s00000285>=1"))
Formula 10 simplified : !"merge_s00000462_input_s00000285>=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.89897,204608,1,0,1848,703649,689,2056,7259,1.2369e+06,5566
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((G((G(G("task_s00000742_inputCriterion_s00000257_used>=1")))U("task_s00000756_output_s00000264>=1"))))
Formula 11 simplified : !G(G"task_s00000742_inputCriterion_s00000257_used>=1" U "task_s00000756_output_s00000264>=1")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.90073,205112,1,0,1848,703649,705,2056,7268,1.2369e+06,5573
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !(((F(("decision_s00000768_activated>=1")U("task_s00000739_output_s00000264>=1")))U((F("decision_s00000787_input_s00000263>=1"))U(G("fork_s00000466_activated_s00000274>=1")))))
Formula 12 simplified : !(F("decision_s00000768_activated>=1" U "task_s00000739_output_s00000264>=1") U (F"decision_s00000787_input_s00000263>=1" U G"fork_s00000466_activated_s00000274>=1"))
45 unique states visited
45 strongly connected components in search stack
45 transitions explored
45 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,5.99498,208952,1,0,2053,717692,718,2263,7274,1.26811e+06,6268
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((G(("task_s00000744_output_s00000264>=1")U(F("decision_s00000799_activated>=1")))))
Formula 13 simplified : !G("task_s00000744_output_s00000264>=1" U F"decision_s00000799_activated>=1")
110 unique states visited
110 strongly connected components in search stack
111 transitions explored
110 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,6.06645,211308,1,0,2215,733131,727,2379,7275,1.28504e+06,6683
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !(("merge_s00000319_input_s00000290>=1"))
Formula 14 simplified : !"merge_s00000319_input_s00000290>=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,6.06703,211308,1,0,2215,733131,730,2379,7276,1.28504e+06,6685
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((X(G("merge_s00000455_input_s00000263>=1"))))
Formula 15 simplified : !XG"merge_s00000455_input_s00000263>=1"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.07738,211608,1,0,2215,734041,736,2379,7277,1.28658e+06,6693
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Exit code :0

BK_STOP 1496414147870

--------------------
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:35:39 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2017 2:35:39 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 102 ms
Jun 02, 2017 2:35:39 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 262 places.
Jun 02, 2017 2:35:39 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 284 transitions.
Jun 02, 2017 2:35:40 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 49 ms
Jun 02, 2017 2:35:40 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:35:40 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 0 ms
Jun 02, 2017 2:35:40 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 1 place invariants in 95 ms
Jun 02, 2017 2:35:42 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 262 variables to be positive in 1815 ms
Jun 02, 2017 2:35:42 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 284 transitions.
Jun 02, 2017 2:35:42 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/284 took 1 ms. Total solver calls (SAT/UNSAT): 2(1/1)
Jun 02, 2017 2:35:43 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 844 ms. Total solver calls (SAT/UNSAT): 664(354/310)
Jun 02, 2017 2:35:43 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 284 transitions.
Jun 02, 2017 2:35:43 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 680 ms. Total solver calls (SAT/UNSAT): 664(310/354)
Jun 02, 2017 2:35:43 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 284 transitions.
Jun 02, 2017 2:35:44 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(11/284) took 1004 ms. Total solver calls (SAT/UNSAT): 3342(581/2761)
Jun 02, 2017 2:35:45 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(19/284) took 2032 ms. Total solver calls (SAT/UNSAT): 5490(1274/4216)
Jun 02, 2017 2:35:46 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(29/284) took 3101 ms. Total solver calls (SAT/UNSAT): 8085(1985/6100)
Jun 02, 2017 2:35:47 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_s00000320_activate_s00000284, merge_s00000320_activate_s00000286, merge_s00000451_activate_s00000284, merge_s00000341_activate_s00000286, merge_s00000451_activate_s00000286, merge_s00000319_activate_s00000284, merge_s00000455_activate_s00000284, merge_s00000453_activate_s00000286, merge_s00000446_activate_s00000284, merge_s00000454_activate_s00000286, merge_s00000319_activate_s00000448, merge_s00000319_activate_s00000286, merge_s00000461_activate_s00000289, merge_s00000455_activate_s00000286, merge_s00000446_activate_s00000286, merge_s00000319_activate_s00000289, merge_s00000455_activate_s00000289, merge_s00000449_activate_s00000286, merge_s00000446_activate_s00000289, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/265/19/284
Computing Next relation with stutter on 9 deadlock states
Computing Next relation with stutter on 9 deadlock states
Computing Next relation with stutter on 9 deadlock states
Computing Next relation with stutter on 9 deadlock states
Computing Next relation with stutter on 9 deadlock states
Computing Next relation with stutter on 9 deadlock states
Computing Next relation with stutter on 9 deadlock states
Computing Next relation with stutter on 9 deadlock states
Computing Next relation with stutter on 9 deadlock states
Computing Next relation with stutter on 9 deadlock states
Computing Next relation with stutter on 9 deadlock states
Computing Next relation with stutter on 9 deadlock states
Computing Next relation with stutter on 9 deadlock states
Computing Next relation with stutter on 9 deadlock states
Computing Next relation with stutter on 9 deadlock states
Computing Next relation with stutter on 9 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_IBM703-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_IBM703-PT-none.tgz
mv S_IBM703-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_IBM703-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-149441651800078"
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 ;