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 IBM703-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r040-blw7-149440486300077
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496259971834


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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((F(X(X("task_s00000722_output_s00000264>=1")))))
Formula 0 simplified : !FXX"task_s00000722_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
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
264 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.66741,118852,1,0,859,394719,594,761,6743,571118,1601
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLCardinality-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G((G("task_s00000746_input_s00000263<=task_s00000727_inputCriterion_s00000257_used"))U(G("task_s00000735_inputCriterion_s00000257_used<=task_s00000758_output_s00000264")))))
Formula 1 simplified : !G(G"task_s00000746_input_s00000263<=task_s00000727_inputCriterion_s00000257_used" U G"task_s00000735_inputCriterion_s00000257_used<=task_s00000758_output_s00000264")
1289 unique states visited
65 strongly connected components in search stack
1713 transitions explored
108 items max in DFS search stack
652 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,9.19585,340448,1,0,4235,1.19935e+06,625,5648,7256,2.31217e+06,16264
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLCardinality-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((F("task_s00000706_output_s00000264>=3")))
Formula 2 simplified : !F"task_s00000706_output_s00000264>=3"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
49 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,9.69432,361224,1,0,4583,1.29827e+06,634,6081,7258,2.47564e+06,17218
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLCardinality-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((X(F(G(X("task_s00000729_output_s00000264<=task_s00000747_inputCriterion_s00000257_used"))))))
Formula 3 simplified : !XFGX"task_s00000729_output_s00000264<=task_s00000747_inputCriterion_s00000257_used"
524 unique states visited
0 strongly connected components in search stack
627 transitions explored
109 items max in DFS search stack
51 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,10.1998,381828,1,0,4745,1.32627e+06,639,6547,7263,2.63461e+06,19269
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA IBM703-PT-none-LTLCardinality-3 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(((("decision_s00000803_activated>=2")U("task_s00000723_output_s00000264<=task_s00000754_inputCriterion_s00000257_used"))U("merge_s00000451_input_s00000285>=2")))
Formula 4 simplified : !(("decision_s00000803_activated>=2" U "task_s00000723_output_s00000264<=task_s00000754_inputCriterion_s00000257_used") U "merge_s00000451_input_s00000285>=2")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,10.5899,395836,1,0,4937,1.3804e+06,663,6895,7285,2.76821e+06,19858
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLCardinality-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((X("merge_s00000453_input_s00000263>=2")))
Formula 5 simplified : !X"merge_s00000453_input_s00000263>=2"
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,10.5997,396176,1,0,4937,1.38128e+06,666,6895,7287,2.76974e+06,19865
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLCardinality-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((F(F(G(X("task_s00000754_output_s00000264<=decision_s00000780_input_s00000263"))))))
Formula 6 simplified : !FGX"task_s00000754_output_s00000264<=decision_s00000780_input_s00000263"
111 unique states visited
110 strongly connected components in search stack
113 transitions explored
111 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,10.6758,399288,1,0,4978,1.38712e+06,671,7082,7291,2.78495e+06,20316
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLCardinality-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((X("task_s00000711_inputCriterion_s00000257_used<=callToProcess_s00000808_inputCriterion_s00000257_used")))
Formula 7 simplified : !X"task_s00000711_inputCriterion_s00000257_used<=callToProcess_s00000808_inputCriterion_s00000257_used"
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.6765,399288,1,0,4978,1.38712e+06,674,7082,7295,2.78495e+06,20318
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA IBM703-PT-none-LTLCardinality-7 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((X(X(F("merge_s00000456_input_s00000290>=1")))))
Formula 8 simplified : !XXF"merge_s00000456_input_s00000290>=1"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
41 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,11.0905,414040,1,0,5233,1.44629e+06,683,7341,7296,2.88696e+06,21123
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLCardinality-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((("merge_s00000319_input_s00000263<=task_s00000705_input_s00000263")U("decision_s00000772_activated>=2")))
Formula 9 simplified : !("merge_s00000319_input_s00000263<=task_s00000705_input_s00000263" U "decision_s00000772_activated>=2")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
75 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,11.8472,439220,1,0,5506,1.57204e+06,695,7649,7306,3.08888e+06,21693
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLCardinality-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !(((G(X("task_s00000704_output_s00000264>=1")))U("task_s00000756_input_s00000263>=2")))
Formula 10 simplified : !(GX"task_s00000704_output_s00000264>=1" U "task_s00000756_input_s00000263>=2")
108 unique states visited
108 strongly connected components in search stack
108 transitions explored
108 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,12.1874,451640,1,0,5519,1.59206e+06,705,7944,7309,3.17047e+06,22725
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !(("callToProcess_s00000807_input_s00000263>=1"))
Formula 11 simplified : !"callToProcess_s00000807_input_s00000263>=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,12.1891,451756,1,0,5519,1.59206e+06,708,7944,7310,3.17047e+06,22728
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !(("fork_s00000463_activated_s00000274<=task_s00000760_input_s00000263"))
Formula 12 simplified : !"fork_s00000463_activated_s00000274<=task_s00000760_input_s00000263"
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,12.1897,451756,1,0,5519,1.59206e+06,711,7944,7314,3.17047e+06,22730
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA IBM703-PT-none-LTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !(((G(X("task_s00000710_input_s00000263>=3")))U(F(X("task_s00000729_inputCriterion_s00000257_used>=3")))))
Formula 13 simplified : !(GX"task_s00000710_input_s00000263>=3" U FX"task_s00000729_inputCriterion_s00000257_used>=3")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,12.2561,454740,1,0,5519,1.59216e+06,720,7944,7316,3.17089e+06,23146
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((X(G(("decision_s00000787_input_s00000263>=2")U("decision_s00000784_input_s00000263<=task_s00000729_input_s00000263")))))
Formula 14 simplified : !XG("decision_s00000787_input_s00000263>=2" U "decision_s00000784_input_s00000263<=task_s00000729_input_s00000263")
110 unique states visited
39 strongly connected components in search stack
111 transitions explored
108 items max in DFS search stack
236 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,14.6147,483276,1,0,6110,1.71242e+06,736,8663,7330,3.39187e+06,24829
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !(("merge_s00000457_activated>=1"))
Formula 15 simplified : !"merge_s00000457_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,14.6152,483280,1,0,6110,1.71242e+06,739,8663,7331,3.39187e+06,24831
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Exit code :0

BK_STOP 1496259991786

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
May 31, 2017 7:46:13 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 31, 2017 7:46:13 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 79 ms
May 31, 2017 7:46:13 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 262 places.
May 31, 2017 7:46:13 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 284 transitions.
May 31, 2017 7:46:13 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 113 ms
May 31, 2017 7:46:13 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 18 ms
May 31, 2017 7:46:13 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
May 31, 2017 7:46:14 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 1 place invariants in 88 ms
May 31, 2017 7:46:15 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 262 variables to be positive in 1571 ms
May 31, 2017 7:46:15 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 284 transitions.
May 31, 2017 7:46:15 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/284 took 2 ms. Total solver calls (SAT/UNSAT): 2(1/1)
May 31, 2017 7:46:16 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 797 ms. Total solver calls (SAT/UNSAT): 664(354/310)
May 31, 2017 7:46:16 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 284 transitions.
May 31, 2017 7:46:17 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 624 ms. Total solver calls (SAT/UNSAT): 664(310/354)
May 31, 2017 7:46:17 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 284 transitions.
May 31, 2017 7:46:18 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(10/284) took 1090 ms. Total solver calls (SAT/UNSAT): 3069(554/2515)
May 31, 2017 7:46:19 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(18/284) took 2118 ms. Total solver calls (SAT/UNSAT): 5225(1249/3976)
May 31, 2017 7:46:20 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(29/284) took 3427 ms. Total solver calls (SAT/UNSAT): 8085(1985/6100)
May 31, 2017 7:46:21 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(41/284) took 4621 ms. Total solver calls (SAT/UNSAT): 11067(2702/8365)
May 31, 2017 7:46:22 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(53/284) took 5639 ms. Total solver calls (SAT/UNSAT): 13905(3375/10530)
May 31, 2017 7:46:23 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(60/284) took 6646 ms. Total solver calls (SAT/UNSAT): 15494(4126/11368)
May 31, 2017 7:46:24 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(75/284) took 7662 ms. Total solver calls (SAT/UNSAT): 18734(4753/13981)
May 31, 2017 7:46:25 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(89/284) took 8803 ms. Total solver calls (SAT/UNSAT): 21555(5495/16060)
May 31, 2017 7:46:27 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(108/284) took 9938 ms. Total solver calls (SAT/UNSAT): 25070(6202/18868)
May 31, 2017 7:46:28 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(121/284) took 10938 ms. Total solver calls (SAT/UNSAT): 27267(6932/20335)
May 31, 2017 7:46:29 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(181/284) took 11938 ms. Total solver calls (SAT/UNSAT): 35217(7172/28045)
May 31, 2017 7:46:30 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(283/284) took 12942 ms. Total solver calls (SAT/UNSAT): 40470(7609/32861)
May 31, 2017 7:46:30 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished enabling matrix. took 12942 ms. Total solver calls (SAT/UNSAT): 40470(7609/32861)
May 31, 2017 7:46:30 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 284 transitions.
May 31, 2017 7:46:31 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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.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="IBM703-PT-none"
export BK_EXAMINATION="LTLCardinality"
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/IBM703-PT-none.tgz
mv 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 IBM703-PT-none, 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 r040-blw7-149440486300077"
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 ;